Sciweavers

95 search results - page 11 / 19
» Fairness of a Single-Rate Multicast Congestion Control Schem...
Sort
View
INFOCOM
1999
IEEE
14 years 6 days ago
Inference of Multicast Routing Trees and Bottleneck Bandwidths Using End-to-end Measurements
Abstract-- The efficacy of end-to-end multicast transport protocols depends critically upon their ability to scale efficiently to a large number of receivers. Several research mult...
Sylvia Ratnasamy, Steven McCanne
SCN
2011
Springer
348views Communications» more  SCN 2011»
13 years 2 months ago
MANET QoS support without reservations
An inelastic flow is a flow with inelastic rate: i.e., the rate is fixed, it cannot be dynamically adjusted to traffic and load condition as in elastic flows like TCP. Real ti...
Soon-Young Oh, Gustavo Marfia, Mario Gerla

Publication
182views
15 years 6 months ago
The ERICA Switch Algorithm for ABR Traffic Management in ATM Networks
We propose an explicit rate indication scheme for congestion avoidance in ATM networks. In this scheme, the network switches monitor their load on each link, determining a load fac...
Shivkumar Kalyanaraman, Raj Jain, Sonia Fahmy, Roh...
ICNP
2007
IEEE
14 years 2 months ago
Best Effort Session-Level Congestion Control
— Congestion caused by a large number of interacting TCP flows at a bottleneck network link is different from that caused by a lesser number of flows sending large amounts of d...
S. Ramesh, Sneha Kumar Kasera
IWQOS
2005
Springer
14 years 1 months ago
Processor Sharing Flows in the Internet
Most congestion control algorithms try to emulate processor sharing (PS) by giving each competing flow an equal share of a bottleneck link. This approach leads to fairness, and pr...
Nandita Dukkipati, Masayoshi Kobayashi, Rui Zhang-...