Delay bounds for approximate maximum weight matching algorithms for input queued switches

Proceedings - IEEE INFOCOM

Volumn 2, Issue , 2002, Pages 1024-1031

  Shah, Devavrat ^a   Kopikare, Milind ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DELAY BOUNDS; INPUT QUEUED SWITCHES; MAXIMUM WEIGHT MATCHING ALGORITHM;

ALGORITHMS; GRAPH THEORY; HEURISTIC METHODS; LYAPUNOV METHODS; PACKET SWITCHING; RESOURCE ALLOCATION; TELECOMMUNICATION TRAFFIC;

SWITCHING NETWORKS;

EID: 0036349140     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2002.1019350     Document Type: Conference Paper

References (15)

1. Input versus output queuing on a space division switch
2. Achieving 100% throughput in an input-queued switch
3. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
4. The throughput of data switches with and without speedup
5. Bounds on average delays and queue size averages and variances in input-queued cell-based switches
6. iSLIP: A scheduling algorithm for input-queued switches
7. Scheduling algorithms for input-queued cell switches
8. RPA: A flexible scheduling algorithm for input buffered switches
9. A high performance OC12/OC48 queue design prototype for input buffered ATM switches
10. Linear complexity algorithms for maximum throughput in radio networks and input queued switches
11. An efficient randomized algorithm for input-queued switch scheduling
12. Stable algorithms for input queued switches
13. Load balancing Birkhoff-von Neumann switches Part I: One stage buffering
14. Hitting and occupation time bounds implied by drift analysis with applications