Frontiers of Computer Science

, Volume 7, Issue 4, pp 571–582 | Cite as

Modelling priority queuing systems with varying service capacity

  • Mei Chen
  • Xiaolong JinEmail author
  • Yuanzhuo Wang
  • Xueqi Cheng
  • Geyong Min
Review Article


Many studies have been conducted to investigate the performance of priority queuing (PQ) systems with constant service capacity. However, due to the time-varying nature of wireless channels in wireless communication networks, the service capacity of queuing systemsmay vary over time. Therefore, it is necessary to investigate the performance of PQ systems in the presence of varying service capacity. In addition, self-similar traffic has been discovered to be a ubiquitous phenomenon in various communication networks, which poses great challenges to performance modelling of scheduling systems due to its fractal-like nature. Therefore, this paper develops a flow-decomposition based approach to performance modelling of PQ systems subject to self-similar traffic and varying service capacity. It specifically proposes an analytical model to investigate queue length distributions of individual traffic flows. The validity and accuracy of the model is demonstrated via extensive simulation experiments.


priority queuing analytical modelling variable service capacity self-similar traffic 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Jiang T, Wang H, Vasilakos A V. QoE-driven channel allocation schemes for multimedia transmission of priority-based secondary users over cognitive radio networks. IEEE Journal on Selected Areas in Communications, 2012, 30(7): 1215–1224CrossRefGoogle Scholar
  2. 2.
    Li C P, Neely M J. Delay and rate-optimal control in a multi-class priority queue with adjustable service rates. In: Proceedings of the 31st Annual IEEE International Conference on Computer Communications (INFOCOM’12). 2012, 2976–2980Google Scholar
  3. 3.
    Mandjes M, Mannersalo P, Norros I. Priority queues with Gaussian input: a path-space approach to loss and delay asymptotics. In: Proceedings of the 19th International Teletraffic Congress (ITC-19). 2005, 1135–1144Google Scholar
  4. 4.
    Zhong H, Tang J, Zhang S, Chen M. An improved quality-guided phase-unwrapping algorithm based on priority queue. IEEE Geoscience and Remote Sensing Letters, 2011, 8(2): 364–368CrossRefGoogle Scholar
  5. 5.
    Ioannou A, Katevenis M G H. Pipelined heap (priority queue) management for advanced scheduling in high-speed networks. IEEE/ACM Transactions on Networking, 2007, 15(2): 450–461CrossRefGoogle Scholar
  6. 6.
    Karim L, Nasser N, Taleb T, Alqallaf A. An efficient priority packet scheduling algorithm for wireless sensor network. In: Proceedings of the 2012 IEEE International Conference on Communications (ICC’12). 2012, 334–338CrossRefGoogle Scholar
  7. 7.
    Shiang H P, van der Schaar M. Multi-user video streaming over multihop wireless networks: a distributed, cross-layer approach based on priority queuing. IEEE Journal on Selected Areas in Communications, 2007, 25(4): 770–785CrossRefGoogle Scholar
  8. 8.
    Ilyas M U, Radha H. Long-range dependence of IEEE 802.15.4 wireless channels. In: Proceedings of the IEEE International Conference on Communications (ICC’08). 2008, 4261–4265CrossRefGoogle Scholar
  9. 9.
    Ge X, Yang Y, Wang C X, Liu Y Z, Liu C, Xiang L. Characteristics analysis and modeling of frame traffic in 802.11 wireless networks. Wireless Communications and Mobile Computing, 2009Google Scholar
  10. 10.
    Liang Q. Ad hoc wireless network traffic-self-similarity and forecasting. IEEE Communications Letters, 2002, 6(7): 297–299CrossRefGoogle Scholar
  11. 11.
    Obele B O, Iftikhar M, Manipornsut S, Kang M. Analysis of the behavior of self-similar traffic in a QoS-aware architecture for integrating WiMAX and GEPON. Journal of Optical Communications and Networking, 2009, 1(4): 259–273CrossRefGoogle Scholar
  12. 12.
    Oliveira C, Kim J B, Suda T. Long-range dependence in IEEE 802. 11b wireless LAN traffic: an empirical study. In: Proceedings of the 2003 IEEE 18th Annual Workshop on Computer Communications (CCW’03). 2003, 17–23Google Scholar
  13. 13.
    Stoev S A, Michailidis G, Taqqu M S. Estimating heavy-tail exponents through max self-similarity. IEEE Transactions on Information Theory, 2011, 57(3): 1615–1636MathSciNetCrossRefGoogle Scholar
  14. 14.
    Liebeherr J, Burchard A, Ciucu F. Delay bounds in communication networks with heavy-tailed and self-similar traffic. IEEE Transactions on Information Theory, 2012, 58(2): 1010–1024MathSciNetCrossRefGoogle Scholar
  15. 15.
    Jin X, Min G. Modelling and analysis of priority queueing systems with multi-class self-similar network traffic: a novel and efficient queue-decomposition approach. IEEE Transactions on Communications, 2009, 57(5): 1444–1452CrossRefGoogle Scholar
  16. 16.
    Iacovoni G, Isopi M. Performance analysis of a priority system fed by self-similar Gaussian traffic., 2005Google Scholar
  17. 17.
    Ashour M, Le-Ngoc T. Priority queuing of long-range dependent traffic. Computer Communications, 2008, 31(17): 3954–3963CrossRefGoogle Scholar
  18. 18.
    Iftikhar M, Landfeldt B, Caglar M. Towards the formation of comprehensive SLAs between heterogeneous wireless DiffServ domains. Telecommunications Systems, 2009, 42(3–4): 179–199CrossRefGoogle Scholar
  19. 19.
    McKay M R, Smith P J, Suraweera H A, Collings I B. On the mutual information distribution of OFDM-based spatial multiplexing: exact variance and outage approximation. IEEE Transactions on Information Theory, 2008, 54(7): 3260–3278MathSciNetCrossRefGoogle Scholar
  20. 20.
    Musavian L, Aissa S. Capacity and power allocation for spectrumsharing communications in fading channels. IEEE Transactions on Wireless Communications, 2009, 8(1): 148–156CrossRefGoogle Scholar
  21. 21.
    Elbiaze H, Zhani M F, Cherkaoui O, Kamoun F. A new structure-preserving method of sampling for predicting self-similar traffic. Telecommunication Systems, 2010, 43(3–4): 265–277CrossRefGoogle Scholar
  22. 22.
    Jagannathan K, Markakis M, Modiano E, Tsitsiklis J. Queue-length asymptotics for generalized max-weight scheduling in the presence of heavy-tailed traffic. IEEE/ACM Transactions on Networking, 2012, 20(4): 1096–1111CrossRefGoogle Scholar
  23. 23.
    Mielniczuk J, Wojdyllo P. Decorrelation of wavelet coefficients for long-range dependent processes. IEEE Transactions on Information Theory, 2007, 53(5): 1879–1883MathSciNetCrossRefGoogle Scholar
  24. 24.
    Oguz B, Anantharam V. Long-range dependent markov chains with applications. In: Proceedings of the 2012 Information Theory and Applications Workshop (ITA’12). 2012, 274–280CrossRefGoogle Scholar
  25. 25.
    Yu J, Petropulu A P. Study of the effect of the wireless gateway on incoming self-similar traffic. IEEE Transactions on Signal Proceesing, 2006, 54(10): 3741–3758CrossRefGoogle Scholar
  26. 26.
    Norros I. A storage model with self-similar input. Queueing Systems, 1994, 16(3–4): 387–396MathSciNetzbMATHCrossRefGoogle Scholar
  27. 27.
    Willinger W, Taqqu M, Sherman R, Wilson D. Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source level. IEEE/ACM Transactions on Networking, 1997, 5(1): 71–86CrossRefGoogle Scholar
  28. 28.
    Millan G, Kaschel H, Lefranc G. A simple model for the generation of LRD self-similar traffic using piecewise affine chaotic onedimensional maps. Studies in Informatics and Control, 2010, 19(1): 67–78Google Scholar
  29. 29.
    Charalambous C D, Bultitude R J C, Li X, Zhan J. Modeling wireless fading channels via stochastic differential equations: identification and estimation based on noisy measurements. IEEE Transactions on Wireless Communications, 2008, 7(2): 434–439CrossRefGoogle Scholar
  30. 30.
    Hogstad B O, Patzold M, Youssef N, Kontorovitch V. Exact closedform expressions for the distribution, the level-crossing rate, and the average duration of fades of the capacity of OSTBC-MIMO channels. IEEE Transactions on Vehicular Technology, 2009, 58(2): 1011–1016CrossRefGoogle Scholar
  31. 31.
    Cheng Y, Zhuang W, Wang L. Calculation of loss probability in a finite size partitioned buffer for quantitative assured service. IEEE Transactions on Communications, 2007, 55(9): 1757–1771CrossRefGoogle Scholar
  32. 32.
    Mannersalo P, Norros I. A most probable path approach to queueing systems with general Gaussian input. Computer Networks, 2002, 40(3): 399–412CrossRefGoogle Scholar
  33. 33.
    Jin X, Min G, Velentzas S R. An analytical queuing model for longrange dependent arrivals and variable service capacity. In: Proceedings of the 2008 IEEE International Conference on Communications (ICC’08). 2008, 230–234CrossRefGoogle Scholar
  34. 34.
    Choi S, Kang S H, Kim B. Streaming video packet scheduling by Geoλ /G/∞ input process modeling. IEEE Communications Letters, 2005, 9(5): 474–476MathSciNetCrossRefGoogle Scholar
  35. 35.
    Mandjes M. Large deviations for complex buffer architectures: the short-range dependent case. Stochastic Models, 2006, 22(1): 99–128MathSciNetzbMATHCrossRefGoogle Scholar
  36. 36.
    Berger A W, Whitt W. Workload bounds in fluid models with priorities. Performance Evaluation, 2000, 41(4): 249–267zbMATHCrossRefGoogle Scholar
  37. 37.
    Norros I, Mannersalo P, Wang J L. Simulation of fractional Brownian motion with conditionalized random midpoint displacement. Advances in Performance Analysis, 1999, 2: 77–101Google Scholar

Copyright information

© Higher Education Press and Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Mei Chen
    • 1
    • 2
  • Xiaolong Jin
    • 3
    Email author
  • Yuanzhuo Wang
    • 3
  • Xueqi Cheng
    • 3
  • Geyong Min
    • 4
  1. 1.School of Electronic and Information EngineeringLanzhou Jiaotong UniversityLanzhouChina
  2. 2.School of Information Science and EngineeringLanzhou UniversityLanzhouChina
  3. 3.Institute of Computing TechnologyChinese Academy of SciencesBeijingChina
  4. 4.Department of Computing, School of InformaticsUniversity of BradfordBradfordUK

Personalised recommendations