Paper Info
Title
Binomial Congestion Control Algorithms
Abstract
This paper introduces and analyzes a class of nonlinear congestion control algorithms called binomial algorithms, motivated in part by the needs of streaming audio and video applications for which a drastic reduction in transmission rate upon each congestion indication (or ions) is problematic. Binomial algorithms generalize TCP-style additive-increase by increasing inversely proportional to a power k of the current window (for TCP, k = 0) they generalize TCP-style multiplicative-decrease by decreasing proportional to a power l of We current window (for TCP, l = 1). We show that there are an infinite number of deployable TCP-compatible binomial algorithms, Wore which satisfy k + l = 1, and that all binomial algorithms converge to fairness under a synchronized-feedback assumption provided k + l > 0; k, l greater than or equal to 0. Our simulation results show that binomial algorithms Interact well with TCP across a RED gateway We focus on two particular algorithms, IIAD (k = 1, l = 0) and SQRT (k = l = 0.5), showing that they are well-suited to applications W at do not react well to large TCP-style window reductions.
Year
DOI
Venue
2001
10.1109/INFCOM.2001.916251
IEEE INFOCOM 2001: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: TWENTY YEARS INTO THE COMMUNICATIONS ODYSSEY
Keywords
Field
DocType
congestion control, TCP-friendliness, TCP-compatibility, nonlinear algorithms, transport protocols, TCP, streaming media, Internet
Random early detection,Synchronization,Nonlinear system,Algorithm design,Multiplicative function,Computer science,Computer network,Bandwidth (signal processing),Throughput,Additive increase/multiplicative decrease
Conference
ISSN
Citations 
PageRank 
0743-166X
143
13.01
References 
Authors
21
2
Search Limit
100143
Name
Order
Citations
PageRank
Deepak Bansal136030.17
Hari Balakrishnan2316653441.21