Research Unit in Networking
	Abstract

Cycle-based TCP-Friendly Algorithm O. Ait-Hellal1 , L. Yamamoto1 and G. Leduc1 1 Research unit in Networking, EECS department, University of Liège, Belgium 2 Research unit in Networking, EECS department, University of Liège, Belgium 3 Research unit in Networking, EECS department, University of Liège, Belgium (1999) Abstract Several TCP-Friendly algorithms have been recently proposed to support multimedia applications. These algorithms try to mimic the congestion control behavior of TCP. However, the oscillatory (bursty) nature of TCP traffic is widely known to be unsuitable for most typical real-time applications. Adopting such behavior would result in annoying QoS oscillations for the users of such real-time applications. In the present paper we describe a new TCP-Friendly algorithm based on the TCP cycle estimation. We show through simulations that the proposed algorithm is able to smooth the oscillations while keeping fairness towards TCP. Keywords congestion control, Internet, real-time, TCP, TCP-Friendly

[ Home | People | Research Topics | Projects | Publications | IFIP WG 6.1 | Events and Conferences | CSS | How to Reach Us ]

Editor: - G. Leduc - Webmaster: - RUN Admin -

Still running IPv4 at: 3.135.204.121...

RUN | Montefiore | ULg © 2000-2025.