Sciweavers

64 search results - page 3 / 13
» Fair and efficient router congestion control
Sort
View
QOSIP
2005
Springer
13 years 11 months ago
Utility Proportional Fair Bandwidth Allocation: An Optimization Oriented Approach
In this paper, we present a novel approach to the congestion control and resource allocation problem of elastic and real-time traffic in telecommunication networks. With the concep...
Tobias Harks
INFOCOM
2000
IEEE
13 years 10 months ago
Rainbow Fair Queueing: Fair Bandwidth Sharing Without Per-Flow State
Abstract—Fair bandwidth sharing at routers has several advantages, including protection of well-behaved flows and possible simplification of endto-end congestion control mechan...
Zhiruo Cao, Zheng Wang, Ellen W. Zegura
GLOBECOM
2007
IEEE
14 years 3 days ago
Semi-Markov Modeling for Bandwidth Sharing of TCP Connections with Asymmetric AIMD Congestion Control
— This paper presents a semi-Markov model that evaluates the performance of TCP connections with asymmetric Additive Increase and Multiplicative Decrease (AIMD) congestion contro...
Cheng Peng Fu, Chuan Heng Foh, Chiew Tong Lau, Zhi...
SIGMETRICS
2010
ACM
150views Hardware» more  SIGMETRICS 2010»
13 years 10 months ago
Incentive compatibility and dynamics of congestion control
This paper studies under what conditions congestion control schemes can be both efficient, so that capacity is not wasted, and incentive compatible, so that each participant can m...
Brighten Godfrey, Michael Schapira, Aviv Zohar, Sc...
CN
2011
94views more  CN 2011»
13 years 23 days ago
Modeling the interactions of congestion control and switch scheduling
—In this paper, we study the interactions of user-based congestion control algorithms and router-based switch scheduling algorithms. We show that switch scheduling algorithms tha...
Alexander Shpiner, Isaac Keslassy