Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2012 (2012), Article ID 425630, 20 pages
http://dx.doi.org/10.1155/2012/425630
Research Article

Queue Content Analysis in a 2-Class Discrete-Time Queueing System under the Slot-Bound Priority Service Rule

SMACS Research Group, Ghent University, Sint-Pietersnieuwstraat 4, 9000 Gent, Belgium

Received 10 April 2012; Accepted 2 September 2012

Academic Editor: Sri Sridharan

Copyright © 2012 Sofian De Clercq et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. D. Fiems, J. Walraevens, and H. Bruneel, “Performance of a partially shared priority buffer with correlated arrivals,” in Proceedings of the 20th International Teletraffic Congress (ITC '07), vol. 4516 of Lecture Notes in Computer Science, pp. 582–593, 2007.
  2. S. De Clercq, B. Steyaert, and H. Bruneel, “Analysis of a multi-class discrete-time queueing system under the slot-Bound priority rule,” in Proceedings of the 6th St. Petersburg Workshop on Simulation, pp. 827–832, 2009.
  3. H. Takagi, Analysis of Polling Systems, MIT Press, 1986.
  4. O. Boxma, J. Bruin, and B. Fralix, “Sojourn times in polling systems with various service disciplines,” Performance Evaluation, vol. 66, no. 11, pp. 621–639, 2009. View at Publisher · View at Google Scholar · View at Scopus
  5. S. W. Fuhrmann and R. B. Cooper, “Stochastic decompositions in the M/G/1 queue with generalized vacations,” Operations Research, vol. 33, no. 5, pp. 1117–1129, 1985. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  6. J. G. Shanthikumar, “On stochastic decomposition in M/G/1 type queues with generalized server vacations,” Operations Research, vol. 36, no. 4, pp. 566–569, 1988. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  7. F. Ishizaki, “Decomposition property in a discrete-time queue with multiple input streams and service interruptions,” Journal of Applied Probability, vol. 41, no. 2, pp. 524–534, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  8. I. Stavrakakis, “Delay bounds on a queueing system with consistent priorities,” IEEE Transactions on Communications, vol. 42, no. 2, pp. 615–624, 1994. View at Google Scholar · View at Scopus
  9. S. Ndreca and B. Scoppola, “Discrete time GI/Geom/1 queueing system with priority,” European Journal of Operational Research, vol. 189, no. 3, pp. 1403–1408, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  10. H. Bruneel, “Performance of discrete-time queueing systems,” Computers and Operations Research, vol. 20, no. 3, pp. 303–320, 1993. View at Google Scholar · View at Scopus
  11. J. Walraevens, B. Steyaert, and H. Bruneel, “Performance analysis of the system contents in a discrete-time non-preemptive priority queue with general service times,” Belgian Journal of Operations Research, Statistics and Computer Science, vol. 40, no. 1-2, pp. 91–103, 2000. View at Google Scholar · View at Zentralblatt MATH
  12. S. De Clercq, B. Steyaert, and H. Bruneel, “Delay analysis of a discrete-time multiclass slot-bound priority system,” A Quarterly Journal of Operations Research, vol. 10, no. 1, pp. 67–79, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  13. H. Masuyama and T. Takine, “Analysis and computation of the joint queue length distribution in a FIFO single-server queue with multiple batch Markovian arrival streams,” Stochastic Models, vol. 19, no. 3, pp. 349–381, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  14. T. Takine, “Queue length distribution in a FIFO single-server queue with multiple arrival streams having different service time distributions,” Queueing Systems. Theory and Applications, vol. 39, no. 4, pp. 349–375, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  15. Q.-M. He, “Queues with marked customers,” Advances in Applied Probability, vol. 28, no. 2, pp. 567–587, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  16. V. G. Kulkarni and K. D. Glazebrook, “Output analysis of a single-buffer multiclass queue: FCFS service,” Journal of Applied Probability, vol. 39, no. 2, pp. 341–358, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  17. F. Ishizaki, T. Takine, and T. Hasegawa, “Analysis of a discrete-time queue with gated priority,” Performance Evaluation, vol. 23, no. 2, pp. 121–143, 1995. View at Google Scholar · View at Scopus
  18. B. Van Houdt and C. Blondia, “The delay distribution of A type k customer in a first-come-first-served MMAP[K]/PH[K]/1 queue,” Journal of Applied Probability, vol. 39, no. 1, pp. 213–223, 2002. View at Publisher · View at Google Scholar · View at Scopus
  19. S. Halfin, “Batch delays versus customer delays,” The Bell System Technical Journal, vol. 62, no. 7, pp. 2011–2015, 1983. View at Google Scholar · View at Scopus
  20. L. Kleinrock, Queueing Systems, Volume I: Theory, Wiley, New York, NY, USA, 1975.
  21. P. Van Mieghem, “The asymptotic behavior of queueing systems: large deviations theory and dominant pole approximation,” Queueing Systems: Theory and Applications, vol. 23, no. 1–4, pp. 27–55, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  22. K. Ito, Encyclopedic Dictionary of Mathematics: the Mathematical Society of Japan (2 Vol. Set), MIT Press, 2000.
  23. B. Steyaert, Analysis of generic discrete-time buffer models with irregular packet arrival patterns [Ph.D. thesis], 2008.
  24. J. Walraevens, B. Steyaert, and H. Bruneel, “Performance analysis of a single-server ATM queue with a priority scheduling,” Computers and Operations Research, vol. 30, no. 12, pp. 1807–1829, 2003. View at Publisher · View at Google Scholar · View at Scopus