skip to main content
10.1145/781027.781033acmconferencesArticle/Chapter ViewAbstractPublication PagesmetricsConference Proceedingsconference-collections
Article

An algorithm for computing the mean response time of a single server queue with generalized on/off traffic arrivals

Authors Info & Claims
Published:10 June 2003Publication History

ABSTRACT

In this paper, an exact solution for the response time distribution of a single server, infinite capacity, discrete-time queue is presented. This queue is fed by a flexible discrete-time arrival process, which follows an on/off evolution. A workload variable is associated with each arrival instant, which may correspond to the service demand generated by a single arrival, or represent the number of simultaneous arrivals (bulk arrivals). Accordingly, the analysis focuses on two types of queues: (On/Off)/G/1 and (Batch-On/Off)/D/1. For both cases, a decomposition approach is carried out, which divides the problem into two contributions: the response time experienced by single bursts in isolation, and the increase on the response time caused by the unfinished work that propagates from burst to burst. Particularly, the solution for the unfinished work is derived from a Wiener-Hopf factorization of random walks, which was already used in the analysis of discrete GI/G/1 queues. Compared to other related works, the procedure proposed in this paper is exact, valid for any traffic intensity and has no constraints on the distributions of the input random variables characterizing the process: duration of on and off periods, and workload. From the general solution, an efficient and robust iterative algorithm for computing the expected response time of both queues is developed, which can provide results at any desired precision. This algorithm is numerically evaluated for different types of input distributions and proved against simulation.

References

  1. Alfa, A. S., Neuts, M. F., Modelling vehicular traffic using the Discrete Time Markovian Arrival Process, Transportation Science, Vol. 29, No. 2, May 1995.Google ScholarGoogle Scholar
  2. Alfa, A., Breuer, L., An EM algorithm for Platoon Arrival Processes in discrete time, Research Report No. 02-07, Dept. of Mathematics and Computer Science, University of Trier, Germany.Google ScholarGoogle Scholar
  3. Blondia, C., A discrete-time batch Markovian arrival process as B-ISDN traffic model, Belgian Journal of Operations Research, Statistics and Computer Science, vol. 32 (3,4).Google ScholarGoogle Scholar
  4. Boettcher, A., Silbermann, B., On Large Truncated Toeplitz Matrices, Springer 1999.Google ScholarGoogle Scholar
  5. Bruneel, H., Queueing behavior of statistical multiplexers with correlated inputs, IEEE Trans. on Communications, 36, 1339--1341, 1988.Google ScholarGoogle ScholarCross RefCross Ref
  6. Bruneel, H., Kim, B. G., Discrete-Time Models for Communication Systems Including ATM, Kluwer Academic Publishers, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Disney, R. L., Kiessler, P. C., Traffic Processes in Queueing Networks. A Markov Renewal Approach, The Johns Hopkins University Press, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Frost, V. S., Melamed, B., Traffic modeling for telecommunications networks, IEEE Communications Magazine, March 1994.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Galmés, S., Puigjaner, R., Analysis of the (Batch-On/Off)/D/1 queue, Proc. of the Seventeenth International Teletraffic Congress, Salvador da Bahia, Brazil, 2001.Google ScholarGoogle ScholarCross RefCross Ref
  10. Grassmann, W. K., Jain, J. L., Numerical solutions of the waiting time distribution and idle time distribution of the arithmetic GI/G/1 queue, Operations Research, 37, 1, January-February 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Griewank, A., Evaluating Derivatives (Principles and Techniques of Algorithmic Differentiation), Society for Industrial and Applied Mathematics (SIAM), 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Heffes, H., Lucantoni, D. M., A Markov modulated characterization of packetized voice and data traffic and related statistical multiplexer performance, IEEE JSAC, SAC-4, No. 6, 1986.Google ScholarGoogle Scholar
  13. Johnson, Norman L., Kotz, S., Kemp Adrienne W., Univariate Discrete Distributions, Wiley 1993, Second Edition.Google ScholarGoogle Scholar
  14. Kuehn, P., Reminder on queueing theory for ATM networks, First ATM Traffic Expert Symposium, Basel, Switzerland, 1995.Google ScholarGoogle Scholar
  15. Li, S., Sheng, H., Discrete Queueing analysis of multi-media traffic with diversity of correlation and burstiness properties, Proc. of the IEEE INFOCOM'91.Google ScholarGoogle Scholar
  16. Neuts, M. F., Chakravarthy, S., A single server queue with platooned arrivals and phase-type services, European Journal of Operational Research, 8: 379--389, 1981.Google ScholarGoogle ScholarCross RefCross Ref
  17. Sohraby, K., On the theory of general on-off sources with applications in high-speed networks, Proc. of the IEEE INFOCOM'93.Google ScholarGoogle Scholar
  18. Sriram, K., Whitt, W., Characterizing superposition arrival processes in packet multiplexers for voice and data, IEEE Journal on Selected Areas in Communications, Vol. SAC-4, No. 6, September 1986.Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. An algorithm for computing the mean response time of a single server queue with generalized on/off traffic arrivals

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in
              • Published in

                cover image ACM Conferences
                SIGMETRICS '03: Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
                June 2003
                338 pages
                ISBN:1581136641
                DOI:10.1145/781027
                • cover image ACM SIGMETRICS Performance Evaluation Review
                  ACM SIGMETRICS Performance Evaluation Review  Volume 31, Issue 1
                  June 2003
                  325 pages
                  ISSN:0163-5999
                  DOI:10.1145/885651
                  Issue’s Table of Contents

                Copyright © 2003 ACM

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 10 June 2003

                Permissions

                Request permissions about this article.

                Request Permissions

                Check for updates

                Qualifiers

                • Article

                Acceptance Rates

                SIGMETRICS '03 Paper Acceptance Rate26of222submissions,12%Overall Acceptance Rate459of2,691submissions,17%

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader
              About Cookies On This Site

              We use cookies to ensure that we give you the best experience on our website.

              Learn more

              Got it!