Sciweavers

34 search results - page 1 / 7
» Max-Min Fair Bandwidth Allocation Algorithms for Packet Swit...
Sort
View
IPPS
2007
IEEE
13 years 10 months ago
Max-Min Fair Bandwidth Allocation Algorithms for Packet Switches
With the rapid development of broadband applications, the capability of networks to provide quality of service (QoS) has become an important issue. Fair scheduling algorithms are ...
Deng Pan, Yuanyuan Yang
TPDS
2008
92views more  TPDS 2008»
13 years 4 months ago
Max-Min Fair Scheduling in Input-Queued Switches
Fairness in traffic management can improve the isolation between traffic streams, offer a more predictable performance, eliminate transient bottlenecks, mitigate the effect of cer...
Madhusudan Hosaagrahara, Harish Sethu
NETWORKING
2007
13 years 6 months ago
Improving XCP to Achieve Max-Min Fair Bandwidth Allocation
TCP is shown to be inefficient and instable in high speed and long latency networks. The eXplicit Control Protocol (XCP) is a new and promising protocol that outperforms TCP in ter...
Lei Zan, Xiaowei Yang
INFOCOM
2007
IEEE
13 years 10 months ago
Adaptive Max-Min Fair Scheduling in Buffered Crossbar Switches Without Speedup
— A good crossbar switch scheduler should be able to achieve 100% throughput and maintain fairness among competing flows. A pure input-queued (IQ) non-buffered switch requires a...
Xiao Zhang, Satya Ranjan Mohanty, Laxmi N. Bhuyan
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