Summary
A E n¦ M ¦ 1 queue is defined as a single server queue with exponential service time and general cyclic arrival distributions of cycle length n. The waiting time distribution for such a queue is proved to be a sum of n exponential terms; this is a generalization of G ¦ M ¦ 1 queue results. Based on this a method for obtaining the steady-state waiting time distributions for E n¦ M ¦ 1 queues is introduced. An example is presented to show an application of E n¦ M ¦ 1 queues in deterministic routing.
Similar content being viewed by others
References
Agrawala, A.K., Tripathi, S.K.: Transient Solution of the Virtual Waiting Time of a Single Server Queue and its Applications. Informat. Sci. 21, 141–158 (1980)
Agrawala, A.K., Tripathi, S.K.: On the Optimality of Semidynamic Routing Schemes. Informat. Process. Lett., 1981
Cinlar, E.: Queues with Semi-Markovian Arrivals. J. Appl. Prob. 4, 365–379 (1967)
Carrier, G.F., Krook, M., Pearson, C.E.: Functions of a Complex Variable. New York: McGraw-Hill 1966
Cohen, J.W.: The Single Server Queue. Amsterdam: North-Holland 1969
Ephremides, A., Varaiya, P., Walrand, J.: A Simple Dynamic Routing Problem. University of California at Berkeley, College of Engineering Memo. No. UCB/ERL M 79/37, 1979
Kleinrock, L.: Queueing Systems: Vol. 1. New York: Wiely 1976
Lindley, D.V.: The Theory of Queues with a Single Server. Comb. Phil. Soc. 48, 227–289 (1952)
Neuts, M.F.: Markov Chain with Applications in Queueing Theory, which have a Matrix-Geometric Invariant Probability Vector. Adv. Appl. Prob. 10, 185–212 (1978)
Papoulis, A.: Probability, Random Variables, and Stochastic Processes. New York: McGraw-Hill 1965
Ramaswami, V.: The N/G/1 Queue and Its Detailed Analysis. Adv. Appl. Prob. 12, 222–261 (1980)
Takacs, L.: Introduction to the Theory of Queues. New York: Oxford University Press 1962
Yum, T.: The Design and Analysis of a Semidynamic Deterministic Routing Rule. IEEE Trans. of Comm. Vol. 29, 1981
Author information
Authors and Affiliations
Additional information
The work was supported in part by the U.S. Air Force Office of Scientific Research under grant AFOSR 78-3654 A to the Department of Computer Science
Rights and permissions
About this article
Cite this article
Agrawala, A.K., Tripathi, S.K. On an exponential server with general cyclic arrivals. Acta Informatica 18, 319–334 (1982). https://doi.org/10.1007/BF00263197
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00263197