Abstract
Queues in which customers request service consisting of an integral number of segments and in which the server moves from service station to service station are of considerable interest to practitioners working on digital communications networks. In this paper, we present “insensitivity” theorems and thereby equilibrium distributions for two discrete time queueing models in which the server may change from one customer to another after completion of each segment of service. In the first model, exactly one segment of service is provided at each time point whether or not an arrival occurs, while in the second model, at most one arrival or service occurs at each time point. In each model, customers of typet request a service time which consists ofl segments in succession with probabilityb t(l). Examples are given which illustrate the application of the theorems to round robin queues, to queues with a persistent server, and to queues in which server transition probabilities do not depend on the server's previous position. In addition, for models in which the probability that the server moves from one position to another depends only on the distance between the positions, an amalgamation procedure is proposed which gives an insensitive model on a coarse state space even though a queue may not be insensitive on the original state space. A model of Daduna and Schassberger is discussed in this context.
Similar content being viewed by others
References
J.M. Chaiken and E. Ignall, An extension of Erlang's formulas which distinguishes individual servers, J. Appl. Prob. 9(1972)192–197.
H. Daduna and R. Schassberger, A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions, Acta Informatica 15(1981)251–263.
H. Daduna and R. Schassberger, Networks of queues in discrete time, Z. Oper. Res. 27(1983) 159–175.
W. Henderson, C.E.M. Pearce, P.G. Taylor and N.M. Van Dijk, Insensitivity in discrete time generalised semi-Markov processes, submitted.
W. Henderson and D. Lucic, Aggregation and disaggregation through insensitivity in stochastic Petri nets, submitted.
H. Jacobi, Eine Unempfindlichkeitseigenschaft für geordnete Bündel ungeordneter Teilbündel, Wiss. Z. Friedrich-Schiller-Universität Jena, Math.-Nat. Reihe 14(1965)251–260.
U. Jansen, Unempfindlichkeitseigenschaft für verschiedene Auswahlregeln ohne Vorliegen der Produktform der stationären Verteilung, Elekron. Informationsverarb Kybernetik 16(1980) 443–448.
F. Kelly,Reversibility and Stochastic Networks (Wiley, London, 1979).
D. König and U. Jansen, Stochastic processes and properties of invariance for queueing systems with speeds and temporary interruptions,Trans. 7th Prague Conf. on Information Theory, Stationary Decision Functions and Random Processes (1974), pp. 335–343.
R. Schassberger, Insensitivity of steady-state distributions of generalised semi-Markov processes with speeds, Adv. Appl. Prob. 10(1979)836–851.
R. Schassberger, On the response time distribution in a discrete round-robin queue, Acta Informatica 16(1981)57–62.
R. Schassberger, The doubly stochastic server: A time sharing model, Z. Oper. Res. 25(1981) 179–189.
P. Whittle, Partial balance and insensitivity, J. Appl. Prob. 22(1985)168–176.
R. Wolff and C. Wrightson, An extension of Erlang's loss formula, J. Appl. Prob. 13(1976) 628–632.
Author information
Authors and Affiliations
Additional information
This work was supported by the Australian Research Council.
Rights and permissions
About this article
Cite this article
Henderson, W., Taylor, P.G. Insensitivity in discrete time queues with a moving server. Queueing Syst 11, 273–297 (1992). https://doi.org/10.1007/BF01164006
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01164006