Sciweavers

98 search results - page 9 / 20
» Fairness in MIMD congestion control algorithms
Sort
View

Publication
130views
15 years 5 months ago
General Weighted Fairness and its Support in Explicit Rate Switch Algorithms
This paper gives a new definition of general weighted (GW) fairness and shows how this can achieve various fairness definitions, such as those mentioned in the ATM Forum TM 4.0 spe...
Bobby Vandalore, Sonia Fahmy, Raj Jain, Rohit Goya...
COMCOM
2006
86views more  COMCOM 2006»
13 years 7 months ago
Study on nominee selection for multicast congestion control
Nominee selection plays a key role in nominee-based congestion control, which is essential for multicast services to ensure fairness and congestion avoidance. Without valid design...
Feng Xie, Gang Feng, Chee Kheong Siew
TIT
2008
99views more  TIT 2008»
13 years 7 months ago
On the Connection-Level Stability of Congestion-Controlled Communication Networks
We are interested in the connection-level stability of a network employing congestion control. In particular, we study how the stability region of the network (i.e., the set of off...
Xiaojun Lin, Ness B. Shroff, R. Srikant
ICNP
2005
IEEE
14 years 29 days ago
Stability and Sensitivity for Congestion Control in Wireless Networks with Time Varying Link Capacities
While extensive efforts have been devoted to providing optimization based, distributed congestion control schemes for efficient bandwidth utilization and fair allocation in both ...
Guohua Zhang, Yiyu Wu, Yonghe Liu
CCR
2006
82views more  CCR 2006»
13 years 7 months ago
Why flow-completion time is the right metric for congestion control
Users typically want their flows to complete as quickly as possible: They want a web-page to download quickly, or a file transfer to complete as rapidly as possible. In other words...
Nandita Dukkipati, Nick McKeown