Advertisement

Two identical communication channels in series with a finite intermediate buffer and overflow

  • O. J. Boxma
Queues And Networks 5
Part of the Lecture Notes in Control and Information Sciences book series (LNCIS, volume 60)

Abstract

The queueing analysis of store and forward data communication networks is complicated by the fact that messages preserve their length as they traverse the system: in the queueing model service times of a message at successive queues (channels) are dependent. The present study considers the case of two communication channels in series with identical capacities and with a finite intermediate buffer. That part of a message for which there is no room in the buffer is lost. The resulting queueing model of two queues in series with identical service requirements at both queues is extensively analysed. Results include the distribution of the response time in the second queue (time in buffer plus transmission time in second channel) and of the total amount of work in the second queue. A comparison is made with the analogous queueing model with independent service requirements.

Keywords

Communication network Message switching Queueing theory Independence Assumption Finite buffen Loss system Overflow probability Response time Workload 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Boxma, O.J. Analysis of Models for Tandem Queues (Ph.D. Thesis, University of Utrecht, Utrecht, 1977).Google Scholar
  2. 2.
    Boxma, O.J. On a tandem queueing model with identical service times at both counters I,II, Adv. Appl. Prob. 11 (1979) 616–644659.Google Scholar
  3. 3.
    Boxma, O.J. On the longest service time in a busy period of the M/G/1 queue, Stoch. Proc. Appl. 8 (1978) 93–100.Google Scholar
  4. 4.
    Boxma, O.J. The longest service time in a busy period, Zeitschr. für Op. Research 24 (1980) 235–242.Google Scholar
  5. 5.
    Boxma, O.J. & Konheim, A.G. Approximate analysis of exponential queueing systems with blocking, Acta Informatica 15 (1981) 19–66.Google Scholar
  6. 6.
    Bronshtein, O. & Gertsbakh, I. An open exponential queueing network with losses and limited waiting spaces: a method of approximate analysis, Rep. Ben Gurion Univ. of the Negev, 1981.Google Scholar
  7. 7.
    Calo, S.B. Message delays in repeated-service tandem connections, IEEE Trans. on Communications Vol. COM-29 (1981) 670–678.Google Scholar
  8. 8.
    Cohen, J.W. The Single Server Queue (2nd ed.; North-Holland Publ. Cy., Amsterdam, 1982).Google Scholar
  9. 9.
    Courant, R. & Hilbert, D. Methoden der Mathematischen Physik Bd. 2 (Springer, Berlin, 1937).Google Scholar
  10. 10.
    Jackson, J.R. Networks of waiting lines, Op. Research 5 (1957) 518–521.Google Scholar
  11. 11.
    Kelly, F.P. Reversibility and Stochastic Networks (Wiley, New York, 1979).Google Scholar
  12. 12.
    Kelly, F.P. The throughput of a series of buffers, Adv. Appl. Prob. 14 (1982) 633–653.Google Scholar
  13. 13.
    Kleinrock, L. Communication Nets; Stochastic Message Flow and Delay (Mc Graw Hill, New York, 1964).Google Scholar
  14. 14.
    Mitchell, C.R. Paulson, A.S. & Beswick, C.A. The effect of correlated exponential service times on single server tandem queues, Naval Res. Logist. Quart. 24 (1977) 95–112.Google Scholar

Copyright information

© Springer-Verlag 1984

Authors and Affiliations

  • O. J. Boxma
    • 1
  1. 1.Mathematical InstituteUniversity of UtrechtThe Netherlands

Personalised recommendations