skip to main content
research-article
Public Access

A Whittle's Index Based Approach for QoE Optimization in Wireless Networks

Published:03 April 2018Publication History
Skip Abstract Section

Abstract

The design of schedulers to optimize heterogeneous users' Quality of Experience (QoE) remains a challenging and important problem for wireless systems. This paper explores three inter-related aspects of this problem: 1) non-linear relationships between a user's QoE and flow delays; 2) managing load dependent QoE trade-offs among heterogeneous application classes; and 3), striking a good balance between opportunistic scheduling and greedy QoE optimization. To that end we study downlink schedulers which minimize the expected cost modeled by convex functions of flow delays for users with heterogeneous channel rate variations. The essential features of this challenging problem are modeled as a Markov Decision Process to which we apply Whittle's relaxation, which in turn is shown to be indexable. Based on the Whittle's relaxation we develop a new scheduling policy, Opportunistic Delay Based Index Policy (ODIP). We then prove various structural properties for ODIP which result in closed form expressions for Whittle's indices under different scheduler scenarios. Using extensive simulations we show that ODIP scheduler provides a robust means to realize complex QoE trade-offs for a range of system loads.

References

  1. Samuli Aalto and Urtzi Ayesta. 2008. Optimal Scheduling of Jobs with a DHR Tail in the M/G/1 Queue Proc. Int. Conf. on Performance Evaluation Methodologies and Tools (ValueTools '08). Article 50, 8 pages. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Samuli Aalto, Urtzi Ayesta, and Rhonda Righter. 2009. On the Gittins index in the M/G/1 queue. Queueing Systems, Vol. 63, 1--4 (2009), 437--458. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Samuli Aalto and Pasi Lassila. 2007. Impact of Size-Based Scheduling on Flow Level Performance in Wireless Downlink Data Channels. Managing Traffic Performance in Converged Networks. Lecture Notes in Computer Science, Vol. Vol. 4516. Springer Berlin Heidelberg, 1096--1107. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Samuli Aalto, Pasi Lassila, and Prajwal Osti. 2015. Whittle Index Approach to Size-aware Scheduling with Time-varying Channels Proc. ACM SIGMETRICS Int. Conf. on Measurement and Modeling of Computer Systems (SIGMETRICS '15). ACM, 57--69. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Samuli Aalto, Aleksi Penttinen, Pasi Lassila, and Prajwal Osti. 2011. On the Optimal Trade-off Between SRPT and Opportunistic Scheduling Proc. ACM SIGMETRICS Joint Int. Conf. on Measurement and Modeling of Computer Systems (SIGMETRICS '11). 185--196. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Samuli Aalto, Aleksi Penttinen, Pasi Lassila, and Prajwal Osti. 2012. Optimal Size-Based Opportunistic Scheduler for Wireless Systems. Queueing Systems, Vol. 72, 1 (Oct.. 2012), 5--30. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Pablo Ameigeiras, Juan J. Ramos-Munoz, Jorge Navarro-Ortiz, Preben Mogensen, and Juan M. Lopez-Soler. 2010. QoE Oriented Cross-layer Design of a Resource Allocation Algorithm in Beyond 3G Systems. Comput. Commun., Vol. 33, 5 (Mar.. 2010), 571--582. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Arjun Anand and Gustavo de Veciana. 2017. Measurement-based Scheduler for Multi-class QoE Optimization in Wireless Networks Proc. INFOCOM. 1--9.Google ScholarGoogle Scholar
  9. P. S. Ansell, K. D. Glazebrook, J. Ni no-Mora, and M. O'Keeffe. 2003. Whittle's Index Policy for a Multi-Class Queueing System with Convex Holding Costs. Mathematical Methods of Operations Research, Vol. 57, 1 (01 Apr.. 2003), 21--39.Google ScholarGoogle Scholar
  10. Konstantin Avrachenkov, Urtzi Ayesta, Patrick Brown, and Eeva Nyberg. 2004. Differentiation Between Short and Long TCP flows: Predictability of the Response Time Proc. INFOCOM, Vol. Vol. 2. 762--773.Google ScholarGoogle Scholar
  11. Urtzi Ayesta, Martin Erausquin, and Peter Jacko. 2010. A Modeling Framework for Optimizing the Flow-level Scheduling with Time-varying Channels. Perform. Eval., Vol. 67, 11 (Nov. 2010), 1014--1029. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Urtzi Ayesta, Martin Erausquin, Matthieu Jonckheere, and Maaike Verloop. 2013. Scheduling in a Random Environment: Stability and Asymptotic Optimality. IEEE/ACM Transactions on Networking Vol. 21, 1 (Feb.. 2013), 258--271. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Dimitri P. Bertsekas. 2012. Dynamic Programming and Optimal Control (bibinfoedition4 ed.). Vol. Vol. 2. Athena Scientific.Google ScholarGoogle Scholar
  14. Carlos F. Bispo. 2011. Single Server Scheduling Problem: Optimal policy for Convex Costs Depends on Arrival Rates Proc. Multidisciplinary Int. Conf. on Scheduling : Theory and Applications (MISTA 2011). 275--296.Google ScholarGoogle Scholar
  15. Sem Borst. 2003. User-level Performance of Channel-Aware Scheduling Algorithms in Wireless Data Networks Proc. INFOCOM, Vol. Vol. 1. 321--331.Google ScholarGoogle Scholar
  16. Sem Borst and Matthieu Jonckheere. 2006. Flow-Level Stability of Channel-Aware Scheduling Algorithms Proc. 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks. 1--6.Google ScholarGoogle Scholar
  17. John C. Gittins, Kevin D. Glazebrook, and Richard Weber. 2011. Multi-armed Bandit Allocation Indices (2nd ed.). Qiley.Google ScholarGoogle Scholar
  18. Itay Gurvich and Ward Whitt. 2009. Scheduling Flexible Servers with Convex Delay Costs in Many-Server Service Systems. Manufacturing & Service Operations Management, Vol. 11, 2 (2009), 237--253. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Mor Harchol-Balter. 2013. Performance Modeling and Design of Computer Systems: Queueing Theory in Action. Cambridge University Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Tobias Hobfeld, Sebastian Biedermann, Raimund Schatz, Alexander Platzer, Sebastian Egger, and Markus Fiedler. 2011. The Memory Effect and its Implications on Web QoE modeling Proc. Int. Teletraffic Cong.(ITC). 103--110. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Peter Jacko. 2011. Value of Information in Optimal Flow-level Scheduling of Users with Markovian Time-varying Channels. Perform. Eval., Vol. 68, 11 (Nov.. 2011), 1022--1036. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Leonard Kleinrock. 1976. Queueing Systems. Vol. Vol. II: Computer Applications. Wiley Interscience.Google ScholarGoogle Scholar
  23. Chi-ping Li and Michael J. Neely. 2011. Delay and Power-Optimal Control in Multi-Class Queueing Systems. ArXiv e-prints (Jan.. 2011). showeprint{arxiv}math.OC/1101.2478Google ScholarGoogle Scholar
  24. Avishai Mandelbaum and Alexander L. Stolyar. 2004. Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized c|mu rule. Operations Research, Vol. 52, 6 (Dec. 2004). Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Ricky K. P. Mok, Edward W. W. Chan, and Rocky K. C. Chang. 2011. Measuring the Quality of Experience of HTTP Video Streaming Proc. IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops. 485--492.Google ScholarGoogle Scholar
  26. Shailesh Patil and Gustavo de Veciana. 2009. Measurement-based Opportunistic Scheduling for Heterogenous Wireless Systems. IEEE Trans. Commun., Vol. 57, 9 (Sep. 2009), 2745--2753. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Magnus Proebster. 2014. Improving the Quality of Experience with Size-Based and Opportunistic Scheduling Proc. International Symposium on Wireless Communications Systems (ISWCS). 443--448.Google ScholarGoogle Scholar
  28. Magnus Proebster, Matthias Kaschub, Thomas Werthmann, and Stefan Valentin. 2012. Context-Aware Resource Allocation for Cellular Wireless Networks. EURASIP Journal on Wireless Communications and Networking, Vol. 2012, 1 (Jul.. 2012), 1--19.Google ScholarGoogle ScholarCross RefCross Ref
  29. Rhonda Righter and Susan H. Xu. 1991. Scheduling Jobs on Non-Identical IFR Processors to Minimize General Cost Functions. Advances in Applied Probability Vol. 23, 4 (Dec.. 1991), 909--924.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. A Whittle's Index Based Approach for QoE Optimization in Wireless Networks

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader
          About Cookies On This Site

          We use cookies to ensure that we give you the best experience on our website.

          Learn more

          Got it!