Packet Scheduling with QoS and Fairness for Downlink Traffic in WiMAX Networks
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
The IEEE 802.16 standard is supposed to provide a wide-range broadband wireless service, but it leaves the implementation of the wireless resource scheduler as an open issue. We have studied the scheduling problem and propose a two level scheduling (TLS) scheme with support for quality of service and fairness guarantees for downlink traffic in a WiMAX network. A central controller Base Station has a number of users, and each mobile subscriber station has different channel conditions. The same mobile subscriber station may have different service requirements at different times in the WiMAX network. Based on OPNET simulation, the results show our scheduling algorithm can increase the network throughput, maintain relative fairness, and lower delay over the round robin and weighted round robin algorithms.
Abstract
The IEEE 802.16 standard is supposed to provide a wide-range broadband wireless service, but it leaves the implementation of the wireless resource scheduler as an open issue. We have studied the scheduling problem and propose a two level scheduling (TLS) scheme with support for quality of service and fairness guarantees for downlink traffic in a WiMAX network. A central controller Base Station has a number of users, and each mobile subscriber station has different channel conditions. The same mobile subscriber station may have different service requirements at different times in the WiMAX network. Based on OPNET simulation, the results show our scheduling algorithm can increase the network throughput, maintain relative fairness, and lower delay over the round robin and weighted round robin algorithms.
참고문헌 (12)
- "IEEE P802.16Rev2", D2, DRAFT Standard for Local and metropolitanarea networks, Part 16: Air Interface for Broadband Wireless Access Systems, 2007, pp.2094~
- "WiMAX System Evaluation Methodology V2.0", WiMAX Forum, pp.230~ (2007)
- So-In, C, "Scheduling in IEEE 802.16e Mobile WiMAX Networks:Key Issues and a Survey", IEEE Journal on Selected Areas in Communications (JSAC), 27(2), pp.156~171 (2009)
- Martello, S., "Exact solution of the two-dimensional finite bin packing problem", Manage. Sci, 44(3), pp.388~399 (1998)
- Wäscher Wäscher, G, "An improved typology of cutting and packing problems", Eur. J. Operat. Res, 183(3), pp.1109~1130 (2007)
- Korf., R. E, "Optimal rectangle packing: New results. In Shlomo Zilberstein, Jana Koehler, and Sven Koenig, editors, In ICAPS", pp.142~149 (2004), AAAI
- Moffitt, M. D., "Optimal rectangle packing: A meta-CSP approach, In ICAPS", pp.93~102 (2006), AAAI
- Garey, M-R, "Computers and Intractability: A Guide to the Theory of NPCompleteness", pp.340~ (1979), W. H. Freeman and co
- So-In, C., "Generalized Weighted Fairness and its support in Deficit Round Robin with Fragmentation in IEEE 802.16 WiMAX", The 2nd International Conference on computer and Automation Engineering (ICCAE), Singapore, pp.784~788 (2010)
- Katevenis, M, "Weighted Round-Robin Cell Multiplexing in a General-Purpose ATM Switch Chip", IEEE J. Selected Areas in Comm, 9(8), pp.1265~1279 (1991)
- Li, B, "A Survey on Mobile WiMAX", IEEE In Communications Magazine, 45(12), pp.70~75 (2007)