Analysis of the Discrete-time Multi-queue System with a Cycle-based Scheduler
DOI:
https://doi.org/10.26636/jtit.2021.152121Keywords:
discrete-time queueing system with vacations, system state distribution, packet sojourn time distribution, virtualized systemAbstract
This paper presents an analysis of a discrete-time multi-queue system handling a number of packet streams. The analysis focuses on calculating system state distribution and packet sojourn time distribution. The method relied upon for determining system state distribution is based on creating a number of equations that are solved numerically. Next, based on the distribution calculated in such a manner, we derive relations for packet sojourn time distribution. The models studied may be useful for instance in a system supporting a number of virtual links (each of a constant bitrate) that share a common physical link. Isolation of performance of those virtual links needs to be assured. Finally, we present some exemplary numerical results showing the usefulness of the proposed analysis for supporting the system dimensioning process.
Downloads
References
[1] W. Burakowski, “Virtualized network infrastructure supporting co-existence of parallel Internets”, in Proc. 13th ACIS Int. Conf. on Software Engin., Artif. Intell., Network. and Parall./Distrib. Comput. SNPD 2012, Kyoto, Japan, 2012.
View in Google Scholar
[2] B. Vinck and H. Bruneel, “Relationships between delay and buffer contents in ATM queues”, Electron. Lett., vol. 31, no. 12, 1995.
View in Google Scholar
[3] N. P. Dellaert, Production to Order. Models and Rules for Production Planning. Berlin, Heidelberg: Springer, 1988 (ISBN: 9783540513094).
View in Google Scholar
[4] M. J. A. Eenige, Queueing Systems with Periodic Service. TU Eindhoven, Netherlands, 1996 (ISBN: 9038603487).
View in Google Scholar
[5] H. Takagi, Queueing Analysis: Vacation and Priority Systems, pt. 1. Amsterdam: North-Holland, 1991 (ISBN: 9780444817709).
View in Google Scholar
[6] N. Tian and Z. G. Zhang, Vacation Queueing Models – Theory and Applications. New York: Springer, 2006 (ISBN: 9780387337210).
View in Google Scholar
[7] B. T. Doshi, “Queueing systems with vacation: A survey”, Queueing Systems, vol. 1, pp. 29–66, 1986.
View in Google Scholar
[8] J. C. Ke, C. H. Wu, and Z. G. Zhang, “Recent developments in vacations queueing models: A short survey”, Int. J. of Oper. Res., vol. 7, no. 4, pp. 3–8, 2010 [Online]. Available: http://www.orstw.org.tw/ijor/vol7no4/2-Vol.%207,%20No.4%20pp._3-8.pdf.
View in Google Scholar
[9] D. R. McNeil, “A solution to the fixed-cycle traffic light problem for compound Poisson arrivals”, J. of Appl. Probab., vol. 5, no. 3, 1968, pp. 624–635.
View in Google Scholar
[10] A. Chydziński and B. Adamczyk, “Analysis of scheduler for virtualization of links with performance isolation”, Appl. Mathem. & Inform. Sci., vol. 8, no. 6, pp. 2653–2666, 2014.
View in Google Scholar
[11] M. Sosnowski and W. Burakowski, “Analysis of the system with vacations under Poissonian input stream and constant service times”, J. of Telecommun. and Inform. Technol., no. 3, 2013 [Online]. Available: https://www.il-pib.pl/czasopisma/JTIT/2013/3/3.pdf.
View in Google Scholar
[12] W. Burakowski and M. Sosnowski, “On cycle-based schedulers with time alternating priorities”, in Proc. of 27th Int. Telecommun. Netw. and Appl. Conf. ITNAC 2017, Melbourne, Australia, 2017, pp. 1–6.
View in Google Scholar
Downloads
Submitted
Published
Issue
Section
License
Copyright (c) 2021 Journal of Telecommunications and Information Technology
This work is licensed under a Creative Commons Attribution 4.0 International License.
