Fair Preemption for Joint Delay Constrained and Best Effort Traffic Scheduling in Wireless Networks
- 1.1k Downloads
This paper proposes a preemptive scheduler that takes back resource previously allocated to best effort traffic users for minimizing the drop rate of delay constrained traffic users. An online implementation with low complexity is proposed, where the channel and QoS aware preemption metric takes into account the benefit for the drop rate of the delay constrained traffic and the cost on the fairness of the pre-allocated best effort traffic. By inverting the state of art order of the allocation of delay constrained and best effort traffic, we show that the fairness-throughput tradeoff curve of the best effort traffic is improved with no degradation on the drop rate of the delay constrained traffic. This scheduler is particularly relevant in cellular networks mixing safety-related and non-safety related (data) traffic, such as LTE for trains, tram, buses or cars.
KeywordsChannel State Information Intelligent Transportation System Drop Rate Delay Constraint Radio Resource Management
Unable to display preview. Download preview PDF.
- 3.Zaki, Y., Weerawardane, T., Gorg, C., Timm-Giel, A.: Multi-qos-aware fair scheduling for lte. In: 2011 IEEE 73rd Vehicular Technology Conference (VTC Spring), pp. 1–5 (May 2011)Google Scholar
- 4.Gresset, N., Letessier, J., Bonneville, H.: A qoS-based multi-user scheduler applied to railway radio-communications. In: Berbineau, M., Jonsson, M., Bonnin, J.-M., Cherkaoui, S., Aguado, M., Rico-Garcia, C., Ghannoum, H., Mehmood, R., Vinel, A. (eds.) Nets4Trains 2013 and Nets4Cars 2013. LNCS, vol. 7865, pp. 31–45. Springer, Heidelberg (2013)CrossRefGoogle Scholar
- 5.Schwarz, S., Mehlfuhrer, C., Rupp, M.: Throughput maximizing multiuser scheduling with adjustable fairness. In: 2011 IEEE International Conference on Communications (ICC), pp. 1–5 (June 2011)Google Scholar
- 6.Khattab, A.K.F., Elsayed, K.M.F.: Opportunistic scheduling of delay sensitive traffic in ofdma-based wireless networks. In: International Symposium on a World of Wireless, Mobile and Multimedia Networks, WoWMoM 2006, pp. 10–288 (2006)Google Scholar
- 7.Lan, T., Kao, D., Chiang, M., Sabharwal, A.: An axiomatic theory of fairness in network resource allocation. In: INFOCOM, 2010 Proceedings IEEE, pp. 1–9 (March 2010)Google Scholar
- 8.Svedman, P., Wilson, S.K., Ottersten, B.: A qos-aware proportional fair scheduler for opportunistic ofdm. In: 2004 IEEE 60th Vehicular Technology Conference, VTC2004-Fall, vol. 1, pp. 558–562 (September 2004)Google Scholar
- 9.Andrews, M., Qian, L., Stolyar, A.: Optimal utility based multi-user throughput allocation subject to throughput constraints. In: Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2005, vol. 4, pp. 2415–2424 (March 2005)Google Scholar
- 10.Monghal, G., Pedersen, K.I., Kovacs, I.Z., Mogensen, P.E.: Qos oriented time and frequency domain packet schedulers for the utran long term evolution. In: IEEE Vehicular Technology Conference, VTC Spring 2008, pp. 2532–2536 (May 2008)Google Scholar
- 11.3GPP, Further advancements for e-utra physical layer aspects, in TSG-RAN - E-UTRA, Tech. Rep. 36.814 (March 2010)Google Scholar