See this document in CiteSeerX!

Packet-Mode Policies for Input-Queued Switches (2004)  (Make Corrections)  
Dan Guez, Alex Kesselman, Adi Rosen



  Home/Search   Context   Related

 
View or download:
cs.technion.ac.il/users/adiro/...GKR.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cs.technion.ac.il/users/ad...publ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: This paper considers the problem of packet-mode scheduling of input queued switches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives to the switch with a given deadline by which it must traverse the switch. A packet successfully passes the switch if the sequence of cells comprising it is contiguously transmitted out of the switch before the packet's deadline expires. A packet transmission may be preempted and restarted from the beginning later. The... (Update)

Active bibliography (related documents):   More   All
0.5:   Competitive Algorithms for High-Speed QoS Switches - Kesselman (2003)   (Correct)
0.3:   Non-Preemptive Real-Time Scheduling of Multimedia Tasks.. - Dolev, al. (1998)   (Correct)
0.3:   Maximum Size Matchings and Input Queued Switches - Iyer, McKeown (2002)   (Correct)

Similar documents based on text:   More   All
0.1:   Achieving Stability in Networks of Input-Queued Switches - Andrews, Zhang   (Correct)
0.1:   A Quantitative Comparison of Iterative Scheduling Algorithms .. - McKeown, Anderson (1998)   (Correct)
0.1:   Prioritized Arbitration For Input-Queued Switches With.. - Schoenen, Post, Sander (1999)   (Correct)

BibTeX entry:   (Update)

@misc{ guez-packetmode,
  author = "Dan Guez and Alex Kesselman and Adi Rosen",
  title = "Packet-Mode Policies for Input-Queued Switches",
  url = "citeseer.ist.psu.edu/guez04packetmode.html" }
Citations (may not include all citations):
4212   Computers and Intractability: A Guide to the Theory of NP Co.. (context) - Garey, Johnson - 1979
897   An Architecture for Differentiated Services (context) - Black, Blake et al. - 1998
488   Amortized Efficiency of List Update and Paging Rules (context) - Sleator, Tarjan - 1985
280   Online Computation and Competitive Analysis (context) - Borodin, El-Yaniv - 1998
180   High speed switch scheduling for local area networks - Anderson, Owicki et al. - 1993
73   Online Interval Scheduling - Lipton, Tomkins - 1994
56   Scheduling Algorithms for Input-Queued Cell Switches - McKeown - 1995
52   the Competitiveness of On-Line Real-Time Task Scheduling - Baruah, Koren et al. - 1992
31   Scheduling Cells in an Input-Queued Switch - McKeown, Varaiya et al. - 1993
17   A unified approach to approximating resource allocation and .. (context) - Bar-Noy, Bar-Yehuda et al. - 2001
16   Minimizing the Number of Switchings in a SS/TDMA System (context) - Gopal, Wong - 1985
15   and D. Shasha, "D over : An Optimal On-Line Scheduling Algor.. (context) - Koren - 1995
13   line Scheduling with Hard Deadlines - Goldman, Parwatikar et al. - 2000
9   Competitive Queueing Policies for QoS Switches - Andelman, Mansour et al. - 2003
9   Packet Scheduling in Input-Queued Cell-Based Switches - Marsan, Bianco et al. - 2001
9   RPA: A Flexible Scheduling Algorithm for Input Buffered Swit.. - Marsan, Bianco et al. - 1999
7   A Starvation Free Algorithm for Achieving 100% Throughput in.. (context) - Mckeown, Mekkittikul - 1996
3   Non-Preemptive Real-Time Scheduling of Multimedia Tasks - Dolev, Kesselman - 1999
3   Bounded Latency Scheduling Scheme for ATM Cells - Dolev, Kesselman - 2000
1   Heuristics for Scheduling I/O Operations (context) - Jain, Somalwar et al. - 1997
1   Input-Queued Switches : Cell Switching vs. Packet Switching - Ganjali, Keshavarzian et al. - 2003
1   Online Scheduling of Parallel Communications with Individual.. - Lee, Chwa - 1999
1   Buffer Overflow Management in QoS Switches (context) - Kesselmanm, Lotker et al. - 2001
1   Variable Length Packet Scheduling Algorithm for IP Traffic (context) - Moon, Sung - 2001
1   line Admission Control and Packet Scheduling with Interleavi.. - Garay, Naor et al. - 2002

Documents on the same site (http://www.cs.technion.ac.il/users/adiro/publ/publ.html):   More
Slide - The Key to Polynomial End-to-End Communication - Afek, Awerbuch, Gafni.. (1997)   (Correct)
Dynamic Routing on Networks with Fixed-Size Buffers - Aiello, Ostrovsky.. (2003)   (Correct)
On Delivery Times in Packet Networks under Adversarial Traffic - Rosen, Tsirkin (2004)   (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