Scheduling to Meet Mixed Quality of Service Requirements in Wireless Networks
We propose a framework and a scheduling algorithm to manage Quality of Service (QoS) in mixed traffic wireless networks. In addition to performing channel allocation for different types of delay sensitive calls (such as voice, video and multimedia), this algorithm, the Mixed Quality of Service Algorithm (MQSA), does data packet scheduling. Calls from delay sensitive traffic sources (DSTS) are assigned channels by the channel assignment algorithm (CAA), which initiates the minimum number of call rearrangements such that at any instant the maximum number of calls can be accommodated, given blocked calls are lost, and fixed channel partitioning among the DSTS types is used. The assumed QoS for the DSTS traffic, call blocking probability, is derived from a Markov chain model. This QoS can be adjusted by changing the bandwidth partitioning in an off-line manner. Data delay cost is minimized given that DSTS calls have preemptive priority. This is done by an algorithm adapted from our earlier work for data only networks . A feedback mechanism for selectively blocking DSTS calls, when queues are large, is also suggested.
KeywordsData Packet Transmission Range Continuous Time Markov Chain Resource Unit Packet Request
Unable to display preview. Download preview PDF.
- 1.L.R. Ford and D.R. Fulkerson, Flows in Networks, Princeton University Press (1962).Google Scholar
- 3.Bruce Hajek, Balanced scheduling in packet synchronized spread spectrum networks, IEEE INFOCOM pp. 56–65 (1983).Google Scholar
- 4.Bruce Hajek, Performance of global load balancing by local adjustment. IEEE Trans. Info. Theory 36: 1398 (1990).Google Scholar
- 5.John M. Harris and Srikanta Kumar, An algorithm for dynamically minimizing the queueing delay of packets in cellular data networks, IEEE Vehicular Tech. Conf, 2: 751 (1996).Google Scholar
- 6.John M. Harris and Srikanta Kumar, Packet scheduling in wireless data networks, Thirty Third Annual Allerton Conference on Communication Computation Control 33: 945 (1995).Google Scholar
- 7.J.E. Hoperoft and R.M. Karp, A n512 algorithm for maximum matchings in bipartite graphs,“ SIAM Journal Computing 2: 225 (1973).Google Scholar
- 9.S. Micali and V.V. Vazirani, An O(IVI“21EI) algorithm for finding maximum matching in general graphs, IEEE Symposium on Foundations of Computer Science 21: 17 (1980).Google Scholar
- 10.John M. Harris and Srikanta Kumar, Technical Report: Scheduling to Meet Mixed Quality of Service Requirements in Wireless Networks, Northwestern University, (1997).Google Scholar
- 11.Jean Walrand, Introduction to Queueing Networks,Prentice Hall (1988).Google Scholar