ACM Home Page
Please provide us with feedback. Feedback
Fair scheduling in wireless packet networks
Full text PdfPdf (2.17 MB)
Source Applications, Technologies, Architectures, and Protocols for Computer Communication archive
Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication table of contents
Cannes, France
Pages: 63 - 74  
Year of Publication: 1997
ISBN:0-89791-905-X
Also published in ...
Authors
Songwu Lu  Coordinated Sciences Laboratory, University of Illinois at Urbana-Champaign
Vaduvur Bharghavan  Coordinated Sciences Laboratory, University of Illinois at Urbana-Champaign
Rayadurgam Srikant  Coordinated Sciences Laboratory, University of Illinois at Urbana-Champaign
Sponsor
SIGCOMM: ACM Special Interest Group on Data Communication
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 53,   Citation Count: 46
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/263105.263141
What is a DOI?

ABSTRACT

Fair scheduling of delay and rate-sensitive packet flows over a wireless channel is not addressed effectively by most contemporary wireline fair scheduling algorithms because of two unique characteristics of wireless media: (a) bursty channel errors, and (b) location-dependent channel capacity and errors. Besides, in packet cellular networks, the base station typically performs the task of packet scheduling for both downlink and uplink flows in a cell; however a base station has only a limited knowledge of the arrival processes of uplink flows.In this paper, we propose a new model for wireless fair scheduling based on an adaptation of fluid fair queueing to handle location-dependent error bursts. We describe an ideal wireless fair scheduling algorithm which provides a packetized implementation of the fluid model while assuming full knowledge of the current channel conditions. For this algorithm, we derive the worst-case throughput and delay bounds. Finally, we describe a practical wireless scheduling algorithm which approximates the ideal algorithm. Through simulations, we show that the algorithm achieves the desirable properties identified in the wireless fluid fair queueing model.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
J,C.R. Bennett and H. Zhang, "WF2Q: Worst-case fair weighted fair queueing," Prac. IEEE INFOCOM'96, March 1996.
 
2
P. Bhagwat, P. Bhattacharya, A. Krishma and S. Tripathi, "Enhancing throughput over wireless LANs using channel state dependent packet scheduling," to ap. pear on Proc. of IEEE INFOCOM'97.
3
 
4
C. Chang, J. Chang, K. Chen and M. You, "Guaranteed quality-of-service wireless access to ATM," preprint, 1996.
5
 
6
 
7
S. Golestani, "A self-clocked fair queueing scheme for broadband applications," Proc. IEEE INFOCOM'9.{, June 1994.
8
 
9
 
10
A. Muir and 3. J. Garcia-Luna-Aceves, "Supporting real-time multimedia traffic in a wireless LAN,' Proc. $PIE Multimedia Computing and Networking 1097, February 1997.
 
11
A. Parekh. "A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks," PhD The. s/s, MIT LAboratory for Information and Decision Systems, Technical Report LIDS-TR-2089 1992.
 
12
13
 
14
H. Zhang, "Service disciplines for guaranteed performance service in packet-switching networks," Proc. o{ IEEE, 83(10), October 1995.

CITED BY  46

Collaborative Colleagues:
Songwu Lu: colleagues
Vaduvur Bharghavan: colleagues
Rayadurgam Srikant: colleagues