Sciweavers

10 search results - page 2 / 2
» On Guaranteed Smooth Scheduling For Input-Queued Switches
Sort
View
AICT
2005
IEEE
194views Communications» more  AICT 2005»
13 years 10 months ago
Approximations to Maximum Weight Matching Scheduling Algorithms of Low Complexity
The choice of the scheduling algorithm is a major design criteria of a switch. Whereas it is known that maximum weight matching algorithms guarantee the stability of an input queu...
Claus Bauer
INFOCOM
2003
IEEE
13 years 10 months ago
Local Scheduling Policies in Networks of Packet Switches with Input Queues
— A significant research effort has been devoted in recent years to the design of simple and efficient scheduling policies for Input Queued (IQ) and Combined Input Output Queue...
Marco Ajmone Marsan, Paolo Giaccone, Emilio Leonar...
INFOCOM
2005
IEEE
13 years 10 months ago
Practical algorithms for performance guarantees in buffered crossbars
— This paper is about high capacity switches and routers that give guaranteed throughput, rate and delay guarantees. Many routers are built using input queueing or combined input...
Shang-Tse Chuang, Sundar Iyer, Nick McKeown
TON
2008
107views more  TON 2008»
13 years 5 months ago
On guaranteed smooth switching for buffered crossbar switches
Scalability considerations drive the evolution of switch design from output queueing to input queueing and further to combined input and crosspoint queueing (CICQ). However, CICQ s...
Simin He, Shutao Sun, Hong-Tao Guan, Qiang Zheng, ...
SIGMETRICS
2005
ACM
163views Hardware» more  SIGMETRICS 2005»
13 years 10 months ago
Smooth switching problem in buffered crossbar switches
Scalability considerations drive the switch fabric design to evolve from output queueing to input queueing and further to combined input and crosspoint queueing (CICQ). However, f...
Simin He, Shutao Sun, Wei Zhao, Yanfeng Zheng, Wen...