skip to main content
10.1145/800200.806199acmconferencesArticle/Chapter ViewAbstractPublication PagesmetricsConference Proceedingsconference-collections
Article
Free Access

A study of queueing networks with deterministic service and applications to computer networks

Published:29 March 1976Publication History

ABSTRACT

We consider packet-switching network as a queueing system with constant service times: that means that the lengths of the packets are equal. We study such a network by isolating a particular path, that we consider as a tandem system of queueing. Two aspects of the question will be examined:

1 - The study of the response time of such a system

2 - The study of the throughput of such a system when introducing the notion of time-out for each packet.

The results we obtained show that when neglecting the interferences between paths the response time is independent of the order of the stations. The control policy we examined prove the necessity to have a limited memorisation capacity at each node of a packet-switching network. These results confirm the intuitive options taken in a network like CYCLADES.

References

  1. 1.AVI-ITZHAK B. - "A sequence of Service Station with Arbitrary Input and Regular Service times" Manag. Science - Vol. 11 - No. 5 - pp. 565-571-1965.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2.COHEN J.W. - "The Single Server Queue" - Amsterdam - North-Holland Publishing Company - 1969.Google ScholarGoogle Scholar
  3. 3.FRIEDMAN H.D. - "Reduction Methods for Tandem Queueing Systems" - Oper. Research - Vol. 13 - pp. 121-131 - 1965.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.GAVER and SHEDLER - "Processor Utilization in Multiprogramming Systems Via Diffusion Approximations" - Oper. Research 21 - pp. 569-576 - 1973.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.GELENBE E. - "Modèles de Systèmes Informatiques" Thèse Doctorat d'Etat ès Sciences Mathématiques Université Paris VI - 1973.Google ScholarGoogle Scholar
  6. 6.GELENBE E. - "A non-Markovian Diffusion and its Application to the Approximation of Queueing and Computer System Behavior" - Research Report 74-1 - Université de Liège - 1974.Google ScholarGoogle Scholar
  7. 7.GELENBE E. - "On approximate Computer System Models" - J.A.C.M. Vol. 22 No. 2 - April 1975. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.GELENBE E. - "Exact and approximate solution to probabilistic models of computer system behavior - Part I and II" - Proc. International School on Modelling and Measurement of Computer CNR and Universita di Bologna - Bologne - Février 1975.Google ScholarGoogle Scholar
  9. 9.JACKSON - "Jobshop-Like Queuing Systems" - Manag. Science 10 - 131-142 - 1963.Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10.KLEINROCK - "Communication Nets" - Mc Graw-Hill New-York - 1964.Google ScholarGoogle Scholar
  11. 11.KOBAYASHI H. - "Application of the Diffusion Approximation to Queueing Networks" Part I - J.A.C.M. 21, 2 - pp. 316-328 - 1974. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12.LITTLE J.D.C. - "A Proof for the Queueing Formula L&equil;&lgr;w" - Oper. Research - May 1961.Google ScholarGoogle Scholar
  13. 13.POUZIN L. et GRANGE J.L. - "Cigale la machine de commutation de paquets" - Congrès AFCET - Novembre 1973.Google ScholarGoogle Scholar
  14. 14.PRABHU N.V. - "Queues and Inventories" - New York - Wiley 1965.Google ScholarGoogle Scholar
  15. 15.REISER and KOBAYASI - "Accuracy of the Diffusion Approximation for Some Queueing Systems" IBM J. Res. Develop. 18, 2 - pp. 110-124 - March 1974.Google ScholarGoogle Scholar
  16. 16.RUBIN I. - "Path Delays in Communication Networks" - Appl. Math. Optimization - Vol. 1, No. 3 - 1974.Google ScholarGoogle Scholar
  17. 17.GELENBE E. and PUJOLLE G. - "Probabilistic models of computer systems" Part II - Proc. International Symposium on Computer Performance Modeling, Measurement and Evaluation - Cambridge Massachusetts - March 1976. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A study of queueing networks with deterministic service and applications to computer networks

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        SIGMETRICS '76: Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation
        March 1976
        326 pages

        Copyright © 1976 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 29 March 1976

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        Overall Acceptance Rate459of2,691submissions,17%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader