Sciweavers

66 search results - page 2 / 14
» Optimal Scheduling Algorithms for Input-Queued Switches
Sort
View
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...
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...
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...
ICN
2005
Springer
13 years 10 months ago
Scheduling Algorithms for Input Queued Switches Using Local Search Technique
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...
Yanfeng Zheng, Simin He, Shutao Sun, Wen Gao
ICC
2007
IEEE
102views Communications» more  ICC 2007»
13 years 11 months ago
Distributed Scheduling in Input Queued Switches
— Dealing with RTTs (Round Trip Time) in IQ switches has been recently recognized as a challenging problem, especially if considering distributed (multi-chip) scheduler implement...
Alessandra Scicchitano, Andrea Bianco, Paolo Giacc...