Sciweavers

10 search results - page 1 / 2
» On Guaranteed Smooth Scheduling For Input-Queued Switches
Sort
View
INFOCOM
2003
IEEE
13 years 10 months ago
On Guaranteed Smooth Scheduling For Input-Queued Switches
— Input-queued switches are used extensively in the design of high-speed routers. As switch speeds and sizes increase, the design of the switch scheduler becomes a primary challe...
Isaac Keslassy, Murali S. Kodialam, T. V. Lakshman...
SJ
2010
133views more  SJ 2010»
13 years 3 months ago
Dichotomy Slot Allocation: A QoS Guaranteed Scheduling Algorithm for Input-Queued Switches
—With the rapid increase of real-time applications, jitter, delay, and throughput have become the three important QoS criteria in the scheduling of input-queued (IQ) switches wit...
Jingjing Zhang, Nirwan Ansari, Yaohui Jin, Weishen...
CCR
2006
122views more  CCR 2006»
13 years 4 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer
ICC
2000
IEEE
137views Communications» more  ICC 2000»
13 years 9 months ago
Stability of Maximal Size Matching Scheduling in Input-Queued Cell Switches
— We consider cell-based switch architectures in which the speedup of the internal switching fabric is not large enough to avoid input buffering. These architectures require a sc...
Emilio Leonardi, Marco Mellia, Marco Ajmone Marsan...
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