Sciweavers

98 search results - page 2 / 20
» Fairness in MIMD congestion control algorithms
Sort
View
SODA
2004
ACM
94views Algorithms» more  SODA 2004»
13 years 6 months ago
Fair and efficient router congestion control
Xiaojie Gao, Kamal Jain, Leonard J. Schulman

Publication
767views
15 years 3 months ago
Analysis of the Increase/Decrease Algorithms for Congestion Avoidance in Computer Networks
Congestion avoidance mechanisms allow a network to operate in the optimal region of low delay and high throughput, thereby, preventing the network from becoming congested. This is ...
D. Chiu and R. Jain
CN
2008
140views more  CN 2008»
13 years 5 months ago
Congestion control in utility fair networks
This paper deals with a congestion control framework for elastic and real-time traffic, where the user's application is associated with a utility function. We allow users to ...
Tobias Harks, Tobias Poschwatta
ICUIMC
2011
ACM
12 years 8 months ago
A cross-layer design for resource allocation and congestion control in multichannel multi-hop cognitive radio networks
Efficient and fair resource allocation associated with congestion control in multi-hop cognitive radio networks (CRN) is a challenging problem. In this paper, we consider their mu...
Nguyen Van Mui, Choong Seon Hong
INFOCOM
2008
IEEE
13 years 11 months ago
Utility Max-Min Fair Congestion Control with Time-Varying Delays
Abstract—We present a framework for designing delayindependent end-to-end congestion control algorithms, where each end-user may have a different utility function. We only requir...
Konstantin Miller, Tobias Harks