Imbedded Markov Chains

The M/G/1 Queue
  • Jeremiah F. Hayes
Part of the Applications of Communications Theory book series (ACTH)


The queueing model considered to this point is predicated on exponentially distributed service times. This is appropriate to voice communications where the holding time of a call is exponentially distributed. However, as we have seen in Chapter 2, in computer communications a frequently used technique is packet switching, in which data messages are broken up into fixed-size blocks each of which are addressed, thereby forming a packet. Packets are routed through the network as separate entities by means of the addresses. Packet switching allows facilities to be shared among many bursty data sources; each source is given full access to transmission facilities according to immediate need.


Service Time Busy Period Probability Generate Function Distribute Service Time Packet Switching 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    D. G. Kendall, “Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain,” Annals of Mathematical Statistics, 24, 338–354 (1953).MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    G. Fayolle, E. Gelembe, and G. Pujolle, “An Analytic Evaluation of the Performance of the ‘Send and Wait’ Protocol,” IEEE Transactions on Communications, Com-26(3), 313–320, March (1978).CrossRefGoogle Scholar
  3. 3.
    P. D. Welch, “On a Generalized M/G/l Queueing Process in Which the First Customer in a Busy Period Receives Exceptional Service,” Operations Research, 12, 736–752 (1964).MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    E. J. Jury, Theory and Application of the Z-Transform Method, John Wiley, New York (1964).Google Scholar
  5. 5.
    W. Kaplan, Operational Methods for Linear Systems, Addison-Wesley, Reading, Massachusetts (1962).MATHGoogle Scholar
  6. 6.
    R. V. Churchill, Modern Operational Mathematics in Engineering, McGraw-Hill, New York (1944).MATHGoogle Scholar
  7. 7.
    E. O. Brigham, The Fast Fourier Transform, Prentice-Hall, Englewood Cliffs, New Jersey (1974).MATHGoogle Scholar
  8. 8.
    D. R. Cox and W. L. Smith, Queues, Methuen, London (1961).Google Scholar
  9. 9.
    L. Kleinrock, Queueing Systems, Vol. 1, Theory, John Wiley, New York (1975).Google Scholar

Copyright information

© Plenum Press, New York 1984

Authors and Affiliations

  • Jeremiah F. Hayes
    • 1
  1. 1.Concordia UniversityMontrealCanada

Personalised recommendations