Reference : Cycle-based TCP-Friendly Algorithm
Scientific congresses and symposiums : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/2268/32863
Cycle-based TCP-Friendly Algorithm
English
Ait-Hellal, Omar [Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Réseaux informatiques > > > >]
Yamamoto, Lidia [Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Réseaux informatiques > > > >]
Leduc, Guy mailto [Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Réseaux informatiques >]
Dec-1999
Proceedings of IEEE Globecom'99
IEEE Press
776-780
Yes
No
International
USA
IEEE Globecom'99
5-9 Dec. 1999
Rio de Janeiro
Brazil
[en] congestion control ; Internet ; TCP
[en] 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.
Researchers
http://hdl.handle.net/2268/32863

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
RUN-PP99-06.pdfPublisher postprint1.45 MBView/Open

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.