Songwu Lu
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.
- 1 J,C.R. Bennett and H. Zhang, "WF2Q: Worst-case fair weighted fair queueing," Prac. IEEE INFOCOM'96, March 1996. Google Scholar
Digital Library
- 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. Google ScholarDigital Library
- 3 V. Bharghavan, A. Demers, S. Shenker and L. Zhang, "MACAW: A Medium Access Protocol for indoor Wireless LANs," Pro~. A CM $IGCOMM'9~. Google ScholarDigital Library
- 4 C. Chang, J. Chang, K. Chen and M. You, "Guaranteed quality-of-service wireless access to ATM," preprint, 1996.Google Scholar
- 5 A. Demers, S. Keshav and S. Shenker, "Analysis and simulation of a fair queueing algorithm," Proc. A CM SIGCOMM'89. Google ScholarDigital Library
- 6 M. Gerla and J. T. Tsai. "Multicluster Mobile Multimedia Network," A CM Baltzer Journal of Wireless Networks, August 1995. Google ScholarDigital Library
- 7 S. Golestani, "A self-clocked fair queueing scheme for broadband applications," Proc. IEEE INFOCOM'9.{, June 1994.Google Scholar
- 8 P. Goyal, H. Via, and H. Cheng, "Start-time fair queuing: a scheduling algorithm for integrated services packet switching networks," Proc. of SIGCOMM'96, August 1996. Google ScholarDigital Library
- 9 M.J. Karol, Z. Liu, and K.Y. Eng. "An efficient demand-assignment multiple access protocol for wireless packet (ATM) networks," A CM Journal on Wire. less Networking, December 1995. Google ScholarDigital Library
- 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.Google Scholar
- 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.Google Scholar
- 12 A. K. Parekh and R. G. Gallager, "A generalized processor sharing approach to flow control in integrated services networks: the single-node case," iEEE/ACM 2~ansactions on Networking, 1(3), pp. 344-357, june 1993. Google ScholarDigital Library
- 13 L. Zhang, "Virtual Clock: a new traffic control algorithm for packet switching networks," ACM Trans. Comput. $yst., vol. 9, pp. 101-124, May 1991. Google ScholarDigital Library
- 14 H. Zhang, "Service disciplines for guaranteed performance service in packet-switching networks," Proc. o{ IEEE, 83(10), October 1995.Google Scholar
Index Terms
- Fair scheduling in wireless packet networks
Recommendations
Fair scheduling in wireless packet networks
SIGCOMM '97: Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communicationFair 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, ...
Fair TDMA scheduling in wireless multihop networks
In wireless multihop networks, communication between two end-nodes is carried out by hopping over multiple wireless links. However, the fact that each node has to transmit not only its own traffic, but also traffic on behalf of other nodes, leads to ...
Fair packet scheduling in Wireless Mesh Networks
In this paper we study the interactions of TCP and IEEE 802.11 MAC in Wireless Mesh Networks (WMNs). We use a Markov chain to capture the behavior of TCP sessions, particularly the impact on network throughput due to the effect of queue utilization and ...
Comments