Sciweavers

5 search results - page 1 / 1
» Max-Min Fair Scheduling in Input-Queued Switches
Sort
View
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
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
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
ISPAN
2005
IEEE
13 years 10 months ago
A Fast Noniterative Scheduler for Input-Queued Switches with Unbuffered Crossbars
Most high-end switches use an input-queued or a combined input- and output-queued architecture. The switch fabrics of these architectures commonly use an iterative scheduling syst...
Kevin F. Chen, Edwin Hsing-Mean Sha, S. Q. Zheng
INFOCOM
2008
IEEE
13 years 11 months ago
Fair Scheduling through Packet Election
—In this paper, we consider the problem of designing scheduling algorithm for input queued switch that is both fair as well as throughput optimal. The significant body of litera...
Srikanth Jagabathula, Vishal Doshi, Devavrat Shah