Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Departure Process of the MAP/SM/1 Queue

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We study the departure process of a single server queue with Markovian arrival input and Markov renewal service time. We derive the joint transform of departure time and the number of departures and, based on this transform, we establish several expressions for burstiness (variance) and correlation (covariance sequence) of the departure process. These expressions reveal that burstiness and correlation of the arrival process have very little impact on the departure process when a queueing system is heavily loaded. In contrast, both burstiness and correlation of the service-time process greatly affect those of the departure process regardless of the load of the system. Finally, we show that, even when an arrival process is short-range dependent, the departure process could has long-range dependence if a service-time process is long-range dependent.

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

Access this article

Subscribe and save

Springer+ Basic
$34.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 excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. P.J. Burke, The output of a queueing system, Oper. Res. 26 (1956) 1059–1072.

    Google Scholar 

  2. R.L. Disney and P.C. Kiessler, Traffic Processes in Queueing Networks (Jons Hopkins Univ. Press, Baltimore, MD, 1987).

    Google Scholar 

  3. L. Kleinrock, Queueing Systems, Vol. I: Theory (Jones and Barlett, 1975).

  4. D.M. Lucantoni, K.S. Meier-Hellstern and M.F. Neuts, A single-server queue with server vacations and a class of non-renewal arrival processes, Adv. in Appl. Probab. 22 (1990) 676–705.

    Google Scholar 

  5. D.M. Lucantoni and M.F. Neuts, Some steady-state distributions for the MAP / SM / 1 queue, Comm. Statist. Stochastic Models 10 (1994) 575–598.

    Google Scholar 

  6. W.E. Leland, M.S. Taqqu, W. Willinger and D.V. Wilson, On the self-similar nature of Ethernet traffic, in: SIGCOMM' 93, 1993.

  7. F. Machihara, A BMAP / SM / 1 queue with service times depending on the arrival process, Queueing Systems 33 (1999) 277–291.

    Google Scholar 

  8. M. Neuts, Structured Stochastic Matrices of M / G / 1 Type and Their Applications (Marcel Dekker, New York, 1989).

    Google Scholar 

  9. H. Saito, The departure process of an N / G / 1 queue, Performance Evaluation 11 (1990) 241–251.

    Google Scholar 

  10. R. Serfozo, Introduction to Stochastic Networks (Springer, Berlin, 1999).

    Google Scholar 

  11. T. Takine, Y. Matsumoto, T. Suda and T. Hasegawa, Mean waiting times in nonpreemptive priority queues with Markovian arrival and i.i.d. service processes, Performance Evaluation 20 (1994) 131–149.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shioda, S. Departure Process of the MAP/SM/1 Queue. Queueing Systems 44, 31–50 (2003). https://doi.org/10.1023/A:1024090706623

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1024090706623