DocumentCode
3260134
Title
Fair scheduling algorithm for wireless packet networks
Author
Jeon, M.R. ; Morikawa, Hiroyuki ; Aoyama, Tomonori
Author_Institution
Sch. of Eng., Tokyo Univ., Japan
fYear
1999
fDate
1999
Firstpage
280
Lastpage
285
Abstract
In wireless packet networks, fair scheduling algorithms originally devised for wireline networks should be adapted to deal with bursty and location-dependent wireless channel errors. We present WGPS (Wireless General Processor Sharing) as a wireless fair scheduling and PWGPS (Packetized Wireless General Processor Sharing) as a packet scheduling algorithm realizing WGPS. WGPS is an extension of GPS (Generalized Processor Sharing), the fair scheduling in wired networks, and operates differently from GPS only when there is any flow suffering channel errors. While a flow is in burst error state, the flow is excluded from scheduling and the other flows that have a good channel for transmission are scheduled according to their service shares. In return for the lost service, the flow having suffered burst error state is compensated by increasing its service share by a prescribed amount when its channel has recovered. PWGPS approximates WGPS by serving packets in the order of service finish times as determined by WGPS
Keywords
errors; packet switching; quality of service; scheduling; wireless LAN; Generalized Processor Sharing; PWGPS; Packetized Wireless General Processor Sharing; WGPS; Wireless General Processor Sharing; bursty errors; channel errors; fair scheduling algorithm; location-dependent wireless channel errors; packet scheduling algorithm; wireless packet networks; Scheduling algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing, 1999. Proceedings. 1999 International Workshops on
Conference_Location
Aizu-Wakamatsu
ISSN
1530-2016
Print_ISBN
0-7695-0353-5
Type
conf
DOI
10.1109/ICPPW.1999.800074
Filename
800074
Link To Document