Performance Analysis of Transport Protocols over Congestive Channels

Abstract We analyze a Markov model of the performance of transport protocols over congestive channels, which are channels whose delay and loss characteristics depend significantly upon the number of messages in transit. Such channels are typical of most store-and-forward networks, including the Internet. We present a general state transition framework for modeling various protocol policies and congestive channels, and for representing performance measures. Using this framework, we obtain a continuous-time Markov chain model of a protocol with simple policies. The Markov chain is solved numerically to obtain performance measures of interest to the user (response time, throughput, etc.), and of interest to the protocol designer (congestion in the channels, space available in the windows, etc.). The numerical solution technique yields not only the averages of these measures, but also their probability distributions.

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

[2]  Guy Pujolle,et al.  Performance Evaluation of the HDLC Protocol , 1978, Comput. Networks.

[3]  David L. Mills,et al.  The NSFNET backbone network , 1987, Computer Communication Review.

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

[5]  Gautam H. Thaker,et al.  Interactions Between Routing and Flow Control Algorithms , 1986, IEEE Trans. Commun..

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

[7]  Gene H. Golub,et al.  Matrix computations , 1983 .

[8]  A. U. Shankar A verified sliding window protocol with variable flow control , 1986, SIGCOMM '86.

[9]  B. D. Plateau A Method for Handling Complex Markov Models of Distributed Algorithms. , 1986 .

[10]  M. Schwartz Performance Analysis of the SNA Virtual Route Pacing Control , 1982, IEEE Trans. Commun..

[11]  Mario Gerla,et al.  Optimal routing in closed queueing networks , 1983, SIGCOMM 1983.

[12]  David R. Cheriton,et al.  VMTP: a transport protocol for the next generation of communication systems , 1986, SIGCOMM '86.

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

[14]  F. Kamoun A Drop and Throttle Flow Control Policy for Computer Networks , 1981, IEEE Trans. Commun..

[15]  Simon S. Lam,et al.  Queueing network models of packet switching networks part 2: Networks with population size constraints , 1982, Perform. Evaluation.

[16]  Lixia Zhang,et al.  NETBLT: a high throughput transport protocol , 1987, Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication.

[17]  Richard W. Watson,et al.  Gaining efficiency in transport services by appropriate design and implementation choices , 1987, TOCS.

[18]  C. Sunshine Efficiency of Interprocess Communication Protocols for Computer Networks , 1977, IEEE Trans. Commun..

[19]  John F. Shoch Packet Fragmentation in Inter-Network Protokols , 1979, Comput. Networks.

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

[21]  A. Udaya Shankar,et al.  Verified data transfer protocols with variable flow control , 1989, TOCS.

[22]  Mario Gerla,et al.  Optimal routing in closed queuing networks , 1983, TOCS.

[23]  Lillian N. Cassel,et al.  Some observations on the performance of a 56 Kbit internet link , 1987, CCRV.

[24]  David D. Clark,et al.  Window and Acknowledgement Strategy in TCP , 1982, RFC.

[25]  Miltiades E. Anagnostou,et al.  Performance Analysis of the Selective Repeat ARQ Protocol , 1986, IEEE Trans. Commun..

[26]  Vinod Kumar Modeling delay in selective retransmission protocol by a FIFO Queue , 1984, CCRV.

[27]  M. Easton Design Choices for Selective-Repeat Retransmission Protocols , 1981, IEEE Trans. Commun..

[28]  Satish K. Tripathi,et al.  Performance Analysis of Synchronization for Two Communicating Processes , 1988, Perform. Evaluation.

[29]  Gerold K. Wieber,et al.  Performance Analysis of a Virtual Circuit Protocol with Local Control , 1986, Perform. Evaluation.

[30]  Jean-Michel Fourneau,et al.  PEPS: A Package for Solving Complex Markov Models of Parallel Systems , 1989 .

[31]  John Nagle,et al.  Congestion control in IP/TCP internetworks , 1984, CCRV.

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

[33]  David A. Mosher,et al.  User-Process Communication Performance in Networks of Computers , 1988, IEEE Trans. Software Eng..

[34]  Lixia Zhang,et al.  Why TCP timers don't work well , 1986, SIGCOMM '86.