Sciweavers

5 search results - page 1 / 1
» Stability of Maximal Size Matching Scheduling in Input-Queue...
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...
INFOCOM
2003
IEEE
13 years 10 months ago
Input Queued Switches: Cell Switching vs. Packet Switching
— Input Queued(IQ) switches have been very well studied in the recent past. The main problem in the IQ switches concerns scheduling. The main focus of the research has been the ï...
Yashar Ganjali, Abtin Keshavarzian, Devavrat Shah
CCR
2006
122views more  CCR 2006»
13 years 5 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
TCOM
2008
74views more  TCOM 2008»
13 years 4 months ago
Stability of a frame-based oldest-cell-first maximal weight matching algorithm
Abstract-- Input-queued cell switches employing the oldestcell-first (OCF) policy have been shown to yield low mean delay characteristics. Moreover, it has been proven that OCF is ...
Xike Li, Itamar Elhanany
IEICET
2006
77views more  IEICET 2006»
13 years 5 months ago
Efficient Scheduling for SDMG CIOQ Switches
ng problem for the SDMG CIOQ switch is abstracted as a bipartite k-matching problem. Using fluid model techniques, we prove that any maximal size k-matching algorithm on an SDMG CI...
Mei Yang, Si-Qing Zheng