Sciweavers

2612 search results - page 3 / 523
» Switching Graphs and Their Complexity
Sort
View
CCR
2004
110views more  CCR 2004»
14 years 9 months ago
Distributed scheduling policies in networks of input-queued packet switches
Scheduling algorithms for input-queued packet switches have been widely researched. It has been shown that various classes of scheduling algorithms provide guarantees on stability ...
Claus Bauer
ICC
2007
IEEE
15 years 4 months ago
Power Managed Packet Switching
— High power dissipation in packet switches and routers is fast turning into a key problem, owing to increasing line speeds and decreasing chip sizes. To address this issue, we i...
Aditya Dua, Benjamin Yolken, Nicholas Bambos
FOCS
2003
IEEE
15 years 2 months ago
Switch Scheduling via Randomized Edge Coloring
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An ...
DSN
2003
IEEE
15 years 2 months ago
A Voltage Scheduling Heuristic for Real-Time Task Graphs
Energy constrained complex real-time systems are becoming increasingly important in defense, space, and consumer applications. In this paper, we present a sensible heuristic to ad...
Diganta Roychowdhury, Israel Koren, C. Mani Krishn...
AICT
2005
IEEE
194views Communications» more  AICT 2005»
15 years 3 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