Generalized processor sharing (GPS) and earliest-due-date (EDD) algorithms are two work conserving service disciplines to provide bounded delay and fair queuing for packet data network. Unfortunately, these algorithms can not apply to wireless network directly due to the location-dependent errors in mobile environment. A number of studies enhanced GPS-like algorithms to facilitate wireless environment, but the studies of EDD scheduling algorithms on wireless network are almost ignored. Unlike GPS-like algorithms which guarantee a delay bound based on the weight that is tightly coupled to a reserved service rate, EDD and its extensions such as Delay-EDD and Jitter-EDD policies allow the separation of delay, delay-jitters and throughput guarantees for a particular data flow. In this paper, we explore EDD and Delay-EDD policies, and present their extensions. Simulation results show that our proposed algorithms can achieve short term, long term fairness, and QoS guarantees on wireless networks.
|Number of pages||6|
|Journal||IEEE Vehicular Technology Conference|
|Issue number||52 ND|
|State||Published - 1 Dec 2000|
|Event||52nd Vehicular Technology Conference (IEEE VTS Fall VTC2000) - Boston, MA, USA|
Duration: 24 Sep 2000 → 28 Sep 2000