Queueing Network Modeling of Computer Communication Networks

The application of queueing network models to the performance analysis of messageswitched (or packet-switched) commumcatmn networks m surveyed. The main topics covered are the analysis of end-to-end delay and the analysis of buffer management schemes. A brief discussmn on flow control is also included. A queueing network model is developed for a simple user-resource network. The mean response time of a host computer m this network is illustrated by a numerical example.

[1]  Stephen R. Kimbleton,et al.  Computer Communication Networks: Approaches, Objectives, and Performance Considerations , 1975, CSUR.

[2]  J.K. Wolf,et al.  Computer-communication network design and analysis , 1979, Proceedings of the IEEE.

[3]  Leonard Kleinrock,et al.  On measured behavior of the ARPA network , 1899, AFIPS '74.

[4]  Johnny W. Wong,et al.  Analysis of Flow Control in Switched Data Networks , 1977, IFIP Congress.

[5]  Donald Watts Davies,et al.  Communication Networks for Computers , 1973 .

[6]  Carl A. Sunshine,et al.  Interconnection of Computer Networks , 1977, Comput. Networks.

[7]  Marek Irwin Irland.  Analysis and simulation of congestion in packet-switched networks. , 1977 .

[8]  Simon S. Lam,et al.  Store-and-Forward Buffer Requirements in a Packet Switching Network , 1976, IEEE Trans. Commun..

[9]  William R. Crowther,et al.  Improvements in the design and performance of the ARPA network , 1972, AFIPS '72 (Fall, part II).

[10]  David A. Twyver,et al.  Datapac Subscriber Interfaces , 1976, International Conference on Innovative Computing and Cloud Computing.

[11]  D. W. Davies,et al.  The control of congestion in packet switching networks , 1971, Symposium on Problems in the Optimizations of Data Communications Systems.

[12]  Robert Metcalfe,et al.  Function-oriented protocols for the ARPA computer network , 1899, AFIPS '72 (Spring).

[13]  M. Schwartz,et al.  Congestion Control in Store and Forward Tandem Links , 1975, IEEE Trans. Commun..

[14]  Mischa Schwartz,et al.  Computer-communication network design and analysis , 1977 .

[15]  Pramode K. Verma,et al.  Analysis of a Packet-Switched Network with End-to-End Congestion Control and Random Routing , 1977, ICCC.

[16]  S. Lam,et al.  Congestion Control of Store-and-Forward Networks by Input Buffer Limits - An Analysis , 1979, IEEE Transactions on Communications.

[17]  William R. Crowther,et al.  The terminal IMP for the ARPA computer network , 1899, AFIPS '72 (Spring).

[18]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[19]  D. Cox.  A use of complex probabilities in the theory of stochastic processes , 1955, Mathematical Proceedings of the Cambridge Philosophical Society.

[20]  D. W. Davies,et al.  The Control of Congestion in Packet-Switching Networks , 1972, IEEE Trans. Commun..

[21]  Leonard Kleinrock,et al.  Communication Nets: Stochastic Message Flow and Delay , 1964 .

[22]  Peter J. Denning,et al.  The Operational Analysis of Queueing Network Models , 1978, CSUR.

[23]  Robert E. Kahn,et al.  Computer communication network design: experience with theory and practice , 1899, AFIPS '72 (Spring).

[24]  J. W. Wong,et al.  Distribution of End-to-End Delay in Message-Switched Networks , 1978, Comput. Networks.

[25]  Guy Pujolle,et al.  A study of queueing networks with deterministic service and applications to computer networks , 1976, SIGMETRICS '76.

[26]  Louis Pouzin,et al.  Presentation and major design aspects of the CYCLADES computer network , 1973, DATACOMM '73.

[27]  Hisashi Kobayashi,et al.  Queueing Models for Computer Communications System Analysis , 1977, IEEE Trans. Commun..