I. Keslassy, Murali Kodialam, T. V. Lakshman, Dimitrios Stiliadis  Home/Search
Context Related
| ieeeinfocom.org/2003/paper...34_02.PDF Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ieeeinfocom.or...hnical_programs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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 challenge, because the time interval for the matching computations needed for determining switch configurations becomes very small. Possible alternatives in scheduler design include increasing the scheduling interval by using envelopes [1], and using a framebased scheduler that guarantees fixed rates between input-output pairs. ... (Update)
Cited by: More
Mailbox Switch: A Scalable Two-stage Switch Architecture for .. - Chang, Lee, Shih (2004) (Correct)
Active bibliography (related documents): More All
0.8: Media Access Protocols for WDM Networks with On-Line Scheduling - Sivalingam, Wang (1999) (Correct)
0.7: Guaranteed Scheduling for Switches with Configuration Overhead - Towles, Dally (2002) (Correct)
0.5: Reactive GRASP: An Application To A Matrix Decomposition.. - Prais, Ribeiro (1998) (Correct)
Similar documents based on text: More All
0.4: Faster Algorithms for Minimum-Energy Scheduling of.. - Keslassy, Kodialam.. (Correct)
0.4: Efficient Active Queue Management for Internet Routers - Suter, Lakshman.. (1998) (Correct)
0.4: Design Considerations for Supporting TCP with.. - Suter, Lakshman.. (1998) (Correct)
BibTeX entry: (Update)
I. Keslassy, M. Kodialam, T.V. Lakshman, D. Stiliadis, "On guaranteed smooth scheduling for input-queued switches," Proceedings of IEEE INFOCOM 2003. http://citeseer.ist.psu.edu/keslassy03guaranteed.html More
@misc{ keslassy03guaranteed,
author = "I. Keslassy and M. Kodialam and T. Lakshman and D. Stiliadis",
title = "On guaranteed smooth scheduling for input-queued switches",
text = "I. Keslassy, M. Kodialam, T.V. Lakshman, D. Stiliadis, On guaranteed smooth
scheduling for input-queued switches, Proceedings of IEEE INFOCOM 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/keslassy03guaranteed.html" }
Citations (may not include all citations):180 High speed switch scheduling for local area networks - Anderson, Owicki et al. - 1993
68 The Tiny Tera: A packet switch core - McKeown, Izzard et al. - 1996
45 An upper bound on delay for the virtual clock service discip.. - Figueria, Pasquale - 1995
36 Symmetric crossbar arbiters for VLSI communication switches (context) - Tamir, Chi - 1993
34 An Expedited Forwarding PHB (context) - Charny
28 Linear complexity algorithms for maximum throughput in radio.. (context) - Tassiulas - 1998
27 On service guarantees for input-buffered crossbar switches: .. - Chang, Chen et al. - 1999
26 Scheduling nonuniform traffic in a packetswitching system wi.. - Weller, Hajek - 1997
23 ATM input-buffered switches with guaranteed rate property - Hung, Kesidis et al. - 1998
19 Birkhoff-Von Neumann inputbuffered crossbar switches - Chang, Chen et al. - 2000
16 A conflict-free protocol for optical WDMA networks (context) - Chen - 1991
16 Minimizing the number of switchings in an SS/TDMA system (context) - Gopal, Wong - 1985
8 Delay bounds for approximate maximum weight matching algorit.. - Shah, Kopikare - 2002
8 A reservation protocol for broadcast WDM networks and stabil.. - Sivaraman, Rouskas - 2000
5 Demonstration of a 1.2 Tb/s optical packet switch fabric bas.. (context) - Gripp - 2001
5 Photonic packet switching: an overview - Tucker, Zhong - 1999
5 Reduced complexity input buffered switches - Kar, Lakshman et al. - 2000
5 Towards simple, highperformance schedulers for high-aggregat.. - Giaccone, Prabhakar et al. - 2002
4 Traffic assignment in communication satellites (context) - Balas, Landweer - 1983
4 the complexity of decomposing matrices arising in satellite .. (context) - Rendl - 1985
4 Efficient algorithms for SS/TDMA scheduling (context) - Ganz, Gao - 1992
4 The greedy algorithm is optimal for on-line edge coloring (context) - Bar-Noy, Motwani et al. - 1992
3 An optimal time slot assignment for an SS/TDMA system with v.. (context) - Bongiovanni, Coppersmith et al. - 1981
3 Scheduling of an input-queued switch to achieve maximal thro.. - Altman, Liu et al. - 2000
2 A note on efficient SS/TDMA assignment algorithms (context) - Pomalaza-Raez - 1988
1 Guaranteed scheduling for switches with configuration overhe.. - Towles, Dally - 2002
1 A new evaluation criterion for Closand Benes-type rearrangea.. (context) - Gragopoulos, Pavlidou - 1997
1 On reducing the degree of self-similarity in network traffic - Sikdar, Vastola et al. - 2002
1 A new matrix decomposition algorithm for rearrangeable Clos .. (context) - Lee, Hwang et al. - 1996
1 Enhanced Birkhoff-von Neumann Decomposition Algorithm for In.. (context) - Lin, Ansari - 2001
1 Local scheduling policies in networks of packet switches - Marsan, Giaccone et al. - 2002
1 IEEE Journal on Selected Topics in Quantum Electronics (context) - on, MEMS - 2002
1 Efficient time slot assignment algorithms for TDM hierarchic.. (context) - Yeung - 2001
Documents on the same site (http://www.ieee-infocom.org/2003/technical_programs.htm): More
Minimizing Request Blocking in All-Optical Rings - Nomikos, Pagourtzis, Zachos (2003) (Correct)
Scheduling Reserved Traffic in Input-Queued Switches: New.. - Andrews, Vojnovic (2003) (Correct)
YAPPERS: A Peer-to-Peer Lookup Service over Arbitrary.. - Ganesan, Sun, Garcia-Molina (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC