Performance evaluation of data communication systems

This paper is a tutorial and a survey of analytical methods in the evaluation of data communication networks. The major mathematical methods are Markov chains applied to discrete time systems and queueing theory. Emphasis is placed on the applications of the mathematical tools. The discussion follows the framework of the layered architecture. In the section on data link control, rigorous as well as "engineering" approaches are highlighted. In this area, models of great accuracy have been developed. In the path-control or routing layer, the major model is provided by Kleinrock's delay analysis of packet networks. Finite buffer pools still pose many problems. The method of the homogeneous network is introduced, a method which reduces complexity originating from the network topology in favor of more realistic protocol features. This thought is expanded into the layer of end-to-end protocols where the tandem-queue model is introduced and its application to the flow-control problem discussed.

[1]  M. Reiser,et al.  A Queueing Network Analysis of Computer Communication Networks with Window Flow Control , 1979, IEEE Trans. Commun..

[2]  Bernd Meister,et al.  Waiting Lines and Times in a System with Polling , 1974, JACM.

[3]  Leonard Kleinrock,et al.  Power and deterministic rules of thumb for probabilistic problems in computer communications , 1979 .

[4]  P. Kuehn,et al.  Approximate Analysis of General Queuing Networks by Decomposition , 1979, IEEE Trans. Commun..

[5]  E. Reich.  Waiting Times When Queues are in Tandem , 1957 .

[6]  Simon S. Lam,et al.  Packet switching in a slotted satellite channel , 1899 .

[7]  M. Schwartz,et al.  Buffer Sharing in Computer-Communication Network Nodes , 1977, IEEE Trans. Commun..

[8]  Howard Frank,et al.  Simulation of Centralized Computer Communications Systems , 1975, IEEE Trans. Commun..

[9]  Simon S. Lam,et al.  Queuing Networks with Population Size Constraints , 1977, IBM J. Res. Dev..

[10]  M. Easton.  Batch Throughput Efficiency of ADCCP/HDLC/SDLC Selective Reject Protocols , 1980, IEEE Trans. Commun..

[11]  Alan G. Konheim.  Chaining in a Loop System , 1976, IEEE Trans. Commun..

[12]  J. Little.  A Proof for the Queuing Formula: L = λW , 1961 .

[13]  P.A.W. Lewis,et al.  Statistical Analysis of Series of Events in Computer Systems , 1972, Statistical Computer Performance Evaluation.

[14]  F.A. Tobagi,et al.  Modeling and measurement techniques in packet communication networks , 1978, Proceedings of the IEEE.

[15]  Leonard Kleinrock,et al.  Packet Switching in a Multiaccess Broadcast Channel: Performance Evaluation , 1975, IEEE Trans. Commun..

[16]  Simon S. Lam,et al.  Modeling and analysis of flow controlled packet switching networks , 1981, SIGCOMM 1981.

[17]  P. K. Verma,et al.  Local congestion control in computer-communication networks with random routing , 1977 .

[18]  Guy Pujolle,et al.  Comparison of two packet-retransmission techniques (Corresp.) , 1980, IEEE Trans. Inf. Theory.

[19]  Fouad A. Tobagi,et al.  Performance Analysis of Carrier Sense Multiple Access with Collision Detection , 1980, Comput. Networks.

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

[21]  R. A. Donnan,et al.  Synchronous Data Link Control: A Perspective , 1974, IBM Syst. J..

[22]  Hisashi Kobayashi,et al.  Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms , 1975, IBM J. Res. Dev..

[23]  G. Pujolle,et al.  Throughput Capacity of a Sequence of Queues with Blocking Due to Finite Waiting Room , 1979, IEEE Transactions on Software Engineering.

[24]  W. J. Gordon,et al.  Closed Queuing Systems with Exponential Servers , 1967, Oper. Res..

[25]  Izhak Rubin.  Communication networks: Message path delays , 1974, IEEE Trans. Inf. Theory.

[26]  L. Kleinrock,et al.  Packet Switching in Radio Channels: Part IV - Stability Considerations and Dynamic Control in Carrier Sense Multiple Access , 1977, IEEE Transactions on Communications.

[27]  Simon S. Lam,et al.  A Carrier Sense Multiple Access Protocol for Local Networks , 1979, Comput. Networks.

[28]  Paul J. Kühn.  Performance of ARQ-protocols for HDX-transmission in hierarchical polling systems , 1981, Perform. Evaluation.

[29]  A. Rybczynski,et al.  X.25 Interface and End-to-End Virtual Circuit Service Characteristics , 1980, IEEE Trans. Commun..

[30]  Jeffrey P. Buzen,et al.  Computational algorithms for closed queueing networks with exponential servers , 1973, Commun. ACM.

[31]  Otto Spaniol,et al.  Modelling of Local Computer Networks , 1979, Comput. Networks.

[32]  Bernd Meister,et al.  Service in a Loop System , 1972, JACM.

[33]  Luke Y.-C. Lien,et al.  A tree convolution algorithm for the solution of queueing networks , 1983, CACM.

[34]  K. Mani Chandy,et al.  Approximate Analysis of General Queuing Networks , 1975, IBM J. Res. Dev..

[35]  Erol Gelenbe,et al.  On Approximate Computer System Models , 1975, JACM.

[36]  R. Boorstyn,et al.  Large-Scale Network Topological Optimization , 1977, IEEE Trans. Commun..

[37]  Leonard Kleinrock,et al.  Packet Switching in a Multiaccess Broadcast Channel: Dynamic Control Procedures , 1975, IEEE Trans. Commun..

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

[39]  K. Mani Chandy,et al.  Distributed Simulation of Networks , 1979, Comput. Networks.

[40]  Yoshifumi Masunaga.  A Probabilistic Automaton Model of the NRM, HDX HDLC Procedure , 1978, Comput. Networks.

[41]  Alan G. Konheim,et al.  A Queueing Analysis of Two ARQ Protocols , 1980, IEEE Trans. Commun..

[42]  Hisashi Kobayashi,et al.  Accuracy of the diffusion approximation for some queuing systems , 1974 .

[43]  Izhak Rubin.  An Approximate Time-Delay Analysis for Packet-Switching Communication Networks , 1976, IEEE Trans. Commun..

[44]  Stephen S. Lavenberg,et al.  Mean-Value Analysis of Closed Multichain Queuing Networks , 1980, JACM.

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

[46]  L. Kleinrock,et al.  Packet Switching in Radio Channels: Part I - Carrier Sense Multiple-Access Modes and Their Throughput-Delay Characteristics , 1975, IEEE Transactions on Communications.

[47]  G. Pujolle,et al.  Comparison of some end-to-end flow control policies in a packet-switching network , 1899, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[48]  Paul J. Schweitzer,et al.  Buffer Overflow in a Store-and-Forward Network Node , 1976, IBM J. Res. Dev..

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

[50]  Farouk Kamoun,et al.  Analysis of Shared Finite Storage in a Computer Network Node Environment Under General Traffic Conditions , 1980, IEEE Trans. Commun..

[51]  Victor L. Wallace,et al.  Algebraic Techniques for Numerical Solution of Queueing Networks , 1974 .

[52]  Vijay Ahuja,et al.  Routing and Flow Control in Systems Network Architecture , 1979, IBM Syst. J..

[53]  Alfred Giessler,et al.  Free Buffer Allocation - An Investigation by Simulation , 1978, Comput. Networks.

[54]  Bernd Meister,et al.  Two-way traffic in loop service systems , 1971, Networks.

[55]  Robert Metcalfe,et al.  Ethernet: distributed packet switching for local computer networks , 1976, CACM.

[56]  Mischa Schwartz.  Performance analysis of the SNA virtual route pacing control , 1981, Perform. Evaluation.

[57]  P. E. Jackson,et al.  Estimates of distributions of random variables for certain computer communications traffic models , 1969, Symposium on Problems in the Optimization of Data Communications Systems.

[58]  M. Neuts.  Two queues in series with a finite, intermediate waitingroom , 1968, Journal of Applied Probability.

[59]  H. Folts.  X.25 transaction-oriented features - datagram and fast select , 1980, IEEE Trans. Commun..

[60]  Charles D. Pack,et al.  The Output of an M/D/1 Queue , 1975, Oper. Res..

[61]  W. Bux.  Local-Area Subnetworks: A Performance Comparison , 1981, IEEE Trans. Commun..

[62]  Hong Linh Truong,et al.  Balanced HDLC Procedures: A Performance Analysis , 1980, IEEE Trans. Commun..

[63]  P. Burke.  The Output of a Queuing System , 1956 .

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

[65]  Stephen S. Lavenberg,et al.  Stationary state probabilities at arrival instants for closed queueing networks with multiple types of customers , 1980, Journal of Applied Probability.

[66]  J. Atkins.  Path Control: The Transport Network of SNA , 1980, IEEE Trans. Commun..

[67]  Erol Gelenbe,et al.  An Analytic Evaluation of the Performance of the "Send and Wait" Protocol , 1978, IEEE Trans. Commun..

[68]  G. Michael Schneider.  A Modular Approach to Computer Network Simulation , 1976, Comput. Networks.

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

[70]  Martin Reiser,et al.  Mean-value analysis and convolution method for queue-dependent servers in closed queueing networks , 1981, Perform. Evaluation.

[71]  P. J. Kuehn,et al.  Multiqueue systems with nonexhaustive cyclic service , 1979, The Bell System Technical Journal.

[72]  Hisashi Kobayashi,et al.  Application of the Diffusion Approximation to Queueing Networks I: Equilibrium Queue Distributions , 1974, JACM.

[73]  G. Pujolle,et al.  The Influence of Protocols on the Stability Conditions in Packet-Switching Networks , 1979, IEEE Trans. Commun..

[74]  K. Mani Chandy,et al.  Fast accurate heuristic algorithms for queueing network models of computing systems , 1981, Perform. Evaluation.

[75]  Pierre-Jacques Courtois,et al.  Decomposability, instabilities, and saturation in multiprogramming systems , 1975, CACM.

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

[77]  C. H. West,et al.  Executable Description and Validation of SNA , 1980, IEEE Trans. Commun..

[78]  Izhak Rubin.  Message Path Delays in Packet-Switching Communication Networks , 1975, IEEE Trans. Commun..

[79]  Alan G. Konheim,et al.  A Queueing Model with Finite Waiting Room and Blocking , 1976, JACM.

[80]  Bernd Meister,et al.  Distributions of Queue Lengths and Waiting Times in a Loop with Two-Way Traffic , 1973, J. Comput. Syst. Sci..

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

[82]  M. Irland,et al.  Buffer Management in a Packet Switch , 1978, IEEE Trans. Commun..

[83]  Guy Pujolle,et al.  Isolation Method in a Network of Queues , 1980, IEEE Transactions on Software Engineering.

[84]  Louis Pouzin,et al.  Virtual circuits vs. datagrams: technical and political problems , 1976, AFIPS '76.

[85]  D. Carlson.  Bit-Oriented Data Link Control Procedures , 1980, IEEE Trans. Commun..

[86]  LEONARD KLEINROCK,et al.  Static Flow Control in Store-And-Forward Computer Networks , 1980, IEEE Trans. Commun..

[87]  Isi Mitrani,et al.  The Distribution of Queuing Network States at Input and Output Instants , 1979, JACM.

[88]  Simon S. Lam,et al.  Queuing network models of packet switching networks part 1: Open networks , 1982, Perform. Evaluation.

[89]  Wyn L. Price,et al.  Data Network Simulation; Experiments at the National Physical Laboratory 1968-76 , 1977, Comput. Networks.

[90]  Erol Gelenbe,et al.  Stability and Optimal Control of the Packet Switching Broadcast Channel , 1977, JACM.

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

[92]  Daniel Brand,et al.  Towards Analyzing and Synthesizing Protocols , 1980, IEEE Trans. Commun..

[93]  Nicolas D. Georganas.  Modeling and Analysis of Message Switched Computer-Communication Networks with Multilevel Flow Control , 1980, Comput. Networks.

[94]  C. H. West,et al.  General technique for communications protocol validation , 1978 .