Improved virtual queueing and dynamic EPD techniques for TCP over ATM

It is known that TCP throughput can degrade significantly over UBR service in a congested ATM network, and the early packet discard (EPD) technique has been proposed to improve the performance. However, recent studies show that EPD cannot ensure fairness among competing VCs in a congested network, but the degree of fairness can be improved using various forms of fair buffer allocation techniques. Based upon the work by H.Y. Tzeng and K.Y. Siu (1996), we propose an improved scheme that utilizes only a single shared FIFO queue for all VCs and admits simple implementation for high speed ATM networks. Our scheme achieves nearly perfect fairness of throughput among multiple TCP connections, comparable to the expensive per-VC queuing technique. Analytical and simulation results are presented to show the validity of this new scheme and significant improvement in performance as compared with existing fair buffer allocation techniques for TCP over ATM.

[1]  George Varghese,et al.  Efficient fair queueing using deficit round-robin , 1996, TNET.

[2]  Chinatsu Ikeda,et al.  A Simulation Study of TCP Performance over ABR and UBR Services in ATM LANs , 1996 .

[3]  Kai-Yeung Siu,et al.  Performance of TCP over UBR in ATM with EPD and virtual queuing techniques , 1998, Comput. Commun..

[4]  Van Jacobson,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[5]  K.M. Adams,et al.  Packet reassembly during cell loss , 1993, IEEE Network.

[6]  Hui Zhang,et al.  Service disciplines for guaranteed performance service in packet-switching networks , 1995, Proc. IEEE.

[7]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[8]  Sally Floyd,et al.  Dynamics of TCP traffic over ATM networks , 1994 .

[9]  Chien Fang,et al.  A simulation study of TCP performance in ATM networks , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[10]  Hiroshi Suzuki,et al.  On TCP performance in ATM networks with per-VC early packet discard mechanisms , 1996, Comput. Commun..

[11]  Albert G. Greenberg,et al.  How fair is fair queuing , 1992, JACM.

[12]  S. Jamaloddin Golestani,et al.  Network Delay Analysis of a Class of Fair Queueing Algorithms , 1995, IEEE J. Sel. Areas Commun..

[13]  Lixia Zhang VirtualClock: A New Traffic Control Algorithm for Packet-Switched Networks , 1991, ACM Trans. Comput. Syst..

[14]  R. Shreedhar,et al.  Efficient Fair Queuing Using Deficit Round - , 1997 .

[15]  G. Varghese Eecient Fair Queuing Using Deecit round Robin , 1995 .

[16]  NetworksAllyn Romanow,et al.  Dynamics of Tcp Traac over Atm Networks , 1994 .

[17]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[18]  Fabio M. Chiussi,et al.  Virtual queueing techniques for ABR service: improving ABR/VBR interaction , 1997, Proceedings of INFOCOM '97.

[19]  Lixia Zhang,et al.  VirtualClock: a new traffic control algorithm for packet-switched networks , 1991, TOCS.