[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Log in

Modelling priority queuing systems with varying service capacity

  • Review Article
  • Published:
Frontiers of Computer Science Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Similar content being viewed by others

References

  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–1224

    Article  Google Scholar 

  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–2980

    Google Scholar 

  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–1144

    Google Scholar 

  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–368

    Article  Google Scholar 

  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–461

    Article  Google Scholar 

  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–338

    Chapter  Google Scholar 

  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–785

    Article  Google Scholar 

  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–4265

    Chapter  Google Scholar 

  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, 2009

    Google Scholar 

  10. Liang Q. Ad hoc wireless network traffic-self-similarity and forecasting. IEEE Communications Letters, 2002, 6(7): 297–299

    Article  Google Scholar 

  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–273

    Article  Google Scholar 

  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–23

    Google Scholar 

  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–1636

    Article  MathSciNet  Google Scholar 

  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–1024

    Article  MathSciNet  Google Scholar 

  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–1452

    Article  Google Scholar 

  16. Iacovoni G, Isopi M. Performance analysis of a priority system fed by self-similar Gaussian traffic. http://www.coritel.it/coritel/people/iacovoni.htm, 2005

    Google Scholar 

  17. Ashour M, Le-Ngoc T. Priority queuing of long-range dependent traffic. Computer Communications, 2008, 31(17): 3954–3963

    Article  Google Scholar 

  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–199

    Article  Google Scholar 

  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–3278

    Article  MathSciNet  Google Scholar 

  20. Musavian L, Aissa S. Capacity and power allocation for spectrumsharing communications in fading channels. IEEE Transactions on Wireless Communications, 2009, 8(1): 148–156

    Article  Google Scholar 

  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–277

    Article  Google Scholar 

  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–1111

    Article  Google Scholar 

  23. Mielniczuk J, Wojdyllo P. Decorrelation of wavelet coefficients for long-range dependent processes. IEEE Transactions on Information Theory, 2007, 53(5): 1879–1883

    Article  MathSciNet  Google Scholar 

  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–280

    Chapter  Google Scholar 

  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–3758

    Article  Google Scholar 

  26. Norros I. A storage model with self-similar input. Queueing Systems, 1994, 16(3–4): 387–396

    Article  MathSciNet  MATH  Google Scholar 

  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–86

    Article  Google Scholar 

  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–78

    Google Scholar 

  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–439

    Article  Google Scholar 

  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–1016

    Article  Google Scholar 

  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–1771

    Article  Google Scholar 

  32. Mannersalo P, Norros I. A most probable path approach to queueing systems with general Gaussian input. Computer Networks, 2002, 40(3): 399–412

    Article  Google Scholar 

  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–234

    Chapter  Google Scholar 

  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–476

    Article  MathSciNet  Google Scholar 

  35. Mandjes M. Large deviations for complex buffer architectures: the short-range dependent case. Stochastic Models, 2006, 22(1): 99–128

    Article  MathSciNet  MATH  Google Scholar 

  36. Berger A W, Whitt W. Workload bounds in fluid models with priorities. Performance Evaluation, 2000, 41(4): 249–267

    Article  MATH  Google Scholar 

  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–101

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiaolong Jin.

Additional information

Mei Chen received her MS from the School of Electronic and Information Engineering, Lanzhou Jiaotong University in 2004. She is now a PhD candidate majoring in computer application technology of Lanzhou University since 2012. She is also a lecturer in the School of Electronic and Information Engineering, Lanzhou Jiaotong University. Her research interests include artificial intelligence and data mining.

Xiaolong Jin is an associate professor at the Institute of Computing Technology, the Chinese Academy of Sciences. He obtained his PhD in computer science from Hong Kong Baptist University in 2005. His research interests include social computing, performance modelling and evaluation, and multiagent systems. He has published over 85 papers in international journals, including IEEE Trans. Commun., IEEE Trans. Wireless Commun., IEEE Trans. Parallel Distrib. Syst., and conferences, including GLOBECOM, ICC, AINA, and WI. He has co-authored two monographs published by Springer and Tsinghua University Press in 2004 and 2003, respectively.

Yuanzhuo Wang is an associate professor at the Institute of Computing Technology, Chinese Academy of Sciences. His current research interests include network and information security analysis, web behavior analysis, stochastic petri nets, and stochastic game nets. He has published over 90 publications in journals and international conferences. He is a senior member of China Computer Federation, CCF Petri Net Technical Committee, and IEEE Communications and Information Security Technical Committee.

Xueqi Cheng is a professor at the Institute of Computing Technology, Chinese Academy of Sciences (ICT-CAS), and the director of the Research Center of Web Data Science & Engineering (WDSE) in ICT-CAS. His main research interests include network science, web search and data mining, P2P and distributed system, information security. He has published over 100 publications in prestigious journals and international conferences, including New Journal of Physics, Journal of Statistics Mechanics: Theory and Experiment, IEEE Trans. on Information Theory, SIGIR, www, CIKM, WSDM, AAAI, IJCAI and so on. He is currently serving on the editorial board of Journal of Computer Science and Technology, Journal of Computer Research and Development, and Journal of Computer.

Geyong Min is a professor of Computer Science in the Department of Computing at the University of Bradford, United Kingdom. His research interests include next generation Internet, wireless communications, multimedia systems, information security, ubiquitous computing, modelling, and performance engineering. His recent research has been supported by UK EPSRC, Royal Society, Nuffield Foundation, and European FP. He has published over 200 research papers in prestigious international journals, including IEEE Trans. Commu., IEEE Trans. Computers, IEEE Trans. Multimedia, IEEE Network, and IEEE Commu. Lett., and in reputable international conferences, such as ICDCS, GLOBECOM, ICC, and IPDPS. He was the recipient of the Best Paper Awards from IEEE AINA’2007, ICAC’2008, IEEE CSE’2009, and TrustCom’2010.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, M., Jin, X., Wang, Y. et al. Modelling priority queuing systems with varying service capacity. Front. Comput. Sci. 7, 571–582 (2013). https://doi.org/10.1007/s11704-013-2365-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-013-2365-2

Keywords

Navigation