Summary
We consider a 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 which we treat as tandem queueing system. Two aspects will be examined: the study of the response time of such a system, and the throughput of such a system when time-outs are used to destroy packets. The results we obtain show that when the interference between paths is neglected the response time is independent of the order of the stations. The control policy we examine proves the necessity to have a limitated memory capacity at each node of a packet-switching network. These results confirm the intuitive options taken in a network like CYCLADES.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Avi-Itzhak, B.: A sequence of service stations with arbitrary input and regular service times. Management Science 11, 565–571 (1965)
Cohen, J. W.: The single server queue. Amsterdam: North-Holland 1969
Friedman, H. D.: Reduction methods for tandem queueing systems. Operations Research 13, 121–131 (1965)
Gaver, D. P., Shedler, G. S.: Processor utilization in multiprogramming systems via diffusion approximations. Operations Research 21, 569–576 (1973)
Gelenbe, E.: Modèles de systèmes informatiques. Université Paris VI, Thèse Doctorat d'Etat ès Sciences Mathématiques, 1973
Gelenbe, E.: A non-Markovian diffusion and its application to the approximation of queueing and computer system behavior. Université de Liège, Research Report 74-1, 1974
Gelenbe, E.: On approximate computer system models. J. ACM 22, 261–269 (1975)
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 Systems, CNR and Università di Bologna, Bologna, February 1975
Jackson, R.: Jobshop-like queueing systems. Management Science 10, 131–142 (1963)
Kleinrock, L.: Communication nets. New-York: McGraw-Hill 1964
Kobayashi, H.: Application of the diffusion approximation to queueing networks—Part I. J. ACM, 21 316–328 (1974)
Little, J. D. C.: A proof for the queueing formula L=λw. Operations Research 9, 383–387 (1961)
Pouzin, L., Grange, L.: Cigale la machine de commutation de paquets. Congrès AFCET, Novembre 1973
Prabhu, N. V.: Queues and inventories. New-York: Wiley 1965
Reiser, M., Kobayashi, H.: Accuracy of the diffusion approximation for some queueing systems. IBM J. R and D 18, 110–124 (1974)
Rubin, I.: Path delays in communication networks. Appl. Math. Optimization 1, 193–221 (1974)
Gelenbe, E., Pujolle, G.: Approximation to the behaviour of a single queue in a network. Proc. International Symposium on Computer Performance Modeling, Measurement and Evaluation, Cambridge (Mass.), March 1976
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Labetoulle, J., Pujolle, G. A study of queueing networks with deterministic service and application to computer networks. Acta Informatica 7, 183–195 (1976). https://doi.org/10.1007/BF00265770
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00265770