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.
- 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 Scholar
- 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 Scholar
- 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 Scholar
- Boettcher, A., Silbermann, B., On Large Truncated Toeplitz Matrices, Springer 1999.Google Scholar
- Bruneel, H., Queueing behavior of statistical multiplexers with correlated inputs, IEEE Trans. on Communications, 36, 1339--1341, 1988.Google Scholar
Cross Ref
- Bruneel, H., Kim, B. G., Discrete-Time Models for Communication Systems Including ATM, Kluwer Academic Publishers, 1993. Google Scholar
Digital Library
- Disney, R. L., Kiessler, P. C., Traffic Processes in Queueing Networks. A Markov Renewal Approach, The Johns Hopkins University Press, 1987. Google Scholar
Digital Library
- Frost, V. S., Melamed, B., Traffic modeling for telecommunications networks, IEEE Communications Magazine, March 1994.Google Scholar
Digital Library
- 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 Scholar
Cross Ref
- 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 Scholar
Digital Library
- Griewank, A., Evaluating Derivatives (Principles and Techniques of Algorithmic Differentiation), Society for Industrial and Applied Mathematics (SIAM), 2000. Google Scholar
Digital Library
- 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 Scholar
- Johnson, Norman L., Kotz, S., Kemp Adrienne W., Univariate Discrete Distributions, Wiley 1993, Second Edition.Google Scholar
- Kuehn, P., Reminder on queueing theory for ATM networks, First ATM Traffic Expert Symposium, Basel, Switzerland, 1995.Google Scholar
- 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 Scholar
- 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 Scholar
Cross Ref
- Sohraby, K., On the theory of general on-off sources with applications in high-speed networks, Proc. of the IEEE INFOCOM'93.Google Scholar
- 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 Scholar
Digital Library
Index Terms
An algorithm for computing the mean response time of a single server queue with generalized on/off traffic arrivals
Recommendations
An algorithm for computing the mean response time of a single server queue with generalized on/off traffic arrivals
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 ...
A single server feedback retrial queue with collisions
A Markovian single server feedback retrial queue with linear retrial rate and collisions of customers is studied. Using generating function technique, the joint distribution of the server state and the orbit length under steady-state is investigated. ...
Stabilizing performance in a single-server queue with time-varying arrival rate
We consider a class of general $$G_t/G_t/1$$Gt/Gt/1 single-server queues, including the $$M_t/M_t/1$$Mt/Mt/1 queue, with unlimited waiting space, service in order of arrival, and a time-varying arrival rate, where the service rate at each time is ...







Comments