On the Performance of Largest-Deficit-First for Scheduling Real-Time Traffic in Wireless Networks

IEEE/ACM Transactions on Networking

Volumn 24, Issue 1, 2016, Pages 72-84

  Kang, Xiaohan ^a   Wang, Weina ^a   Jaramillo, Juan Jose ^b   Ying, Lei ^a  

^a Arizona State University   (United States)

^b UNIVERSIDAD EAFIT   (Colombia)

Author keywords

Fluid limit; largest deficit first; local pooling factor; real time scheduling; stability

Indexed keywords

ELECTRIC NETWORK TOPOLOGY; GRAPHIC METHODS; SCHEDULING; TELECOMMUNICATION SERVICES; WIRELESS NETWORKS;

AD HOC WIRELESS NETWORKS; CONSENSUS ALGORITHMS; INTERFERENCE MODELING; NON-REAL-TIME TRAFFIC; REAL TIME TRAFFICS; SINGLE-HOP TRAFFIC; THROUGHPUT REGIONS; TRAFFIC DISTRIBUTIONS;

WIRELESS AD HOC NETWORKS;

EID: 84907890719     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2014.2360365     Document Type: Article

References (25)

1. I.-H. Hou, V. Borkar, and P. R. Kumar, "A theory of QoS for wireless," in Proc. IEEE INFOCOM, Rio de Janeiro, Brazil, 2009, pp. 486-494.
2. I.-H. Hou and P. R. Kumar, "Admission control and scheduling for QoS guarantees for variable-bit-rate applications on wireless channels," in Proc. ACM MobiHoc, New Orleans, LA, USA, 2009, pp. 175-184.
3. I.-H. Hou and P. R. Kumar, "Scheduling heterogeneous real-time traffic over fading wireless channels," in Proc. IEEE INFOCOM, San Diego, CA, USA, 2010, pp. 1-9.
4. I.-H. Hou and P. R. Kumar, "Utility-optimal scheduling in time-varying wireless networks with delay constraints," in Proc. ACM MobiHoc, Chicago, IL, USA, 2010, pp. 31-40.
5. J. J. Jaramillo and R. Srikant, "Optimal scheduling for fair resource allocation in ad hoc networks with elastic and inelastic traffic," IEEE/ACM Trans. Netw., vol. 19, no. 4, pp. 1125-1136, Aug. 2011.
6. J. J. Jaramillo, R. Srikant, and L. Ying, "Scheduling for optimal rate allocation in ad hoc networks with heterogeneous delay constraints," IEEE J. Sel. Areas Commun., vol. 29, no. 5, pp. 979-987, May 2011.
7. C. Joo, X. Lin, and N. B. Shroff, "Performance limits of greedy maximal matching in multi-hop wireless networks," in Proc. IEEE CDC, New Orleans, LA, USA, 2007, pp. 1128-1133.
8. A. A. Reddy, S. Sanghavi, and S. Shakkottai, "On the effect of channel fading on greedy scheduling," in Proc. IEEE INFOCOM, Orlando, FL, USA, 2012, pp. 406-414.
9. J. G. Dai, "On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models," Ann. Appl. Probab., vol. 5, no. 1, pp. 49-77, Feb. 1995.
10. P. Chaporkar, K. Kar, and S. Sarkar, "Throughput guarantees through maximal scheduling in wireless networks," in Proc. Annu. Allerton Conf. Commun., Control, Comput., Monticello, IL, USA, 2005, pp. 28-30.
11. A. Dimakis and J. Walrand, "Sufficient conditions for stability of longest queue first scheduling: Second-order properties using fluid limits," Adv. Appl. Probab., vol. 38, no. 2, pp. 505-521, Jun. 2006.
12. C. Joo, X. Lin, and N. B. Shroff, "Understanding the capacity region of the greedy maximal scheduling algorithm in multihop wireless networks," IEEE/ACM Trans. Netw., vol. 17, no. 4, pp. 1132-1145, Aug. 2009.
13. R. M. Loynes, "The stability of a queue with non-independent interarrival and service times," Math. Proc. Cambridge Philos. Soc., vol. 58, no. 3, pp. 497-520, Jul. 1962.
14. S. T. Maguluri, B. Hajek, and R. Srikant, "The stability of longestqueue-first scheduling with variable packet sizes," in Proc. IEEE CDC, Orlando, FL, USA, Dec. 2011, pp. 3770-3775.
15. R. Srikant and L. Ying, Communication Networks: An Optimization, Control and Stochastic Networks Perspective. New York, NY, USA: Cambridge Univ. Press, 2014.
16. B. Li, C. Boyaci, and Y. Xia, "A refined performance characterization of longest-queue-first policy in wireless networks," IEEE/ACM Trans. Netw., vol. 19, no. 5, pp. 1382-1395, Oct. 2011.
17. B. Li, C. Boyaci, and Y. Xia, "Performance guarantee under longestqueue-first schedule in wireless networks," IEEE Trans. Inf. Theory, vol. 58, no. 9, pp. 5878-5889, Sep. 2012.
18. S. Boyd and L. Vandenberghe, Convex optimization. New York, NY, USA: Cambridge Univ. Press, 2004.
19. M. Andrews et al., "Scheduling in a queuing system with asynchronously varying service rates," Prob. Eng. Inf. Sci., vol. 18, no. 2, pp. 191-217, Apr. 2004.
20. B. Ji, C. Joo, and N. Shroff, "Throughput-optimal scheduling in multihop wireless networks without per-flow information," IEEE/ACM Trans. Netw., vol. 21, no. 2, pp. 634-647, Apr. 2013.
21. K. Jain, J. Padhye, V. N. Padmanabhan, and L. Qiu, "Impact of interference on multi-hop wireless network performance," in Proc. ACM MobiCom, San Diego, CA, USA, 2003, pp. 66-80.
22. T. Weller and B. Hajek, "Scheduling nonuniform traffic in a packetswitching system with small propagation delay," IEEE/ACM Trans. Netw., vol. 5, no. 6, pp. 813-823, Dec. 1997.
23. J. G. Dai and B. Prabhakar, "The throughput of data switches with and without speedup," in Proc. IEEE INFOCOM, Tel Aviv, Israel, Mar. 2000, vol. 2, pp. 556-564.
24. X. Lin and N. B. Shroff, "The impact of imperfect scheduling on crosslayer rate control in wireless networks," in Proc. IEEE INFOCOM, Miami, FL, USA, 2005, vol. 3, pp. 1804-1814.
25. X. Wu and R. Srikant, "Regulated maximal matching: A distributed scheduling algorithm for multi-hop wireless networks with node-exclusive spectrum sharing," in Proc. IEEE CDC, Seville, Spain, 2005, pp. 5342-5347.