AbstracI-We consider the prohleni nf applying aggregate eongestion contrnl to a class of distributed niultimedia applications known as Clnster-to-Cluster (C-Io-C) applications. Flows in such an application share a coninion intermediary path that is the primary source of netwurk delay and packet loss. Using tlie Coordidion Protocol (CP) architecture, we show how aggregate congestion control can be achieved with the folhwing properties: . Almost any rate-hased, single-flow congestion control algorithm may he applied to make aggregate C-to-C traffic congestion responsive. C-til-C applications may use multiple flow bandwidth shares and still eshihit correct aggregate mngestion responsiveness. . C-tn-C applications may implement cumples, applicationspecific adaptation schemes in which the hehavior of individual Rows is deeoupled from tlie behavior crfthe congestion responsive aggregate Row. technique for making single-flow loss detection algorithms work when aggregate traffic uses niultiple flowshares. The approach B evaluated using hoth ns2 simulation and a n experinlentdl implementation in FreeBSD and Linux. Results demonstrate its success for n wide range of network conditions. into multiple streams with specific temporal or spatial relationships. Furthermore. these relationships may be complex and dynamic. Transport-lewl helet-ogeneie. UDPor RTP-based protocols, for example. might be used for streaming media while TCP is used to reliably transmit application control data.
REF presents work on CP's aggregate congestion control mechanisms, including bandwidth filtered loss detection.
Aggregate congestion control for distributed multimedia applications
IEEE INFOCOM 2004
IEEE INFOCOM 2004
Computer Science