Peter Damaschke, Zhen Zhou  Home/Search
Context
Related
| cs.chalmers.se/~ptr/queue.ps 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: cs.chalmers.se/~ptr/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Queues that temporarily store xed-length packets are ubiquitous in network switches. Scheduling algorithms that prevent packet-loss are always desirable. Longest-Queue-First (LQF) is an on-line greedy algorithm widely exploited because of its simplicity and eciency. In this paper, we give improved bounds on the competitive ratio of LQF in terms of the worst-case queuing length, parameterized with respect to the optimal queuing length of a clairvoyant adversary. This gives a better... (Update)
Active bibliography (related documents): More All
0.3: Management of Multi-Queue Switches in QoS Networks - Azar, Richter (2003) (Correct)
0.3: Balanced Scheduling toward Loss-Free Packet Queuing and Delay .. - Fleischer, Koga (2004) (Correct)
0.0: Integrated Scheduling of Unicast and Multicast Traffic.. - Andrews, Khanna, Kumaran (1999) (Correct)
Similar documents based on text: More All
0.4: Scheduling Search Procedures - Damaschke (2004) (Correct)
0.4: Threshold Group Testing - Damaschke (Correct)
0.3: Parameterized Enumeration, Transversals, and Imperfect Phylogeny .. - Damaschke (2004) (Correct)
BibTeX entry: (Update)
@misc{ damaschke-queuing,
author = "Peter Damaschke and Zhen Zhou",
title = "On Queuing Lengths in On-Line Switching",
url = "citeseer.ist.psu.edu/731545.html" }
Citations (may not include all citations):280 Online Computation and Competitive Analysis (context) - Borodin, El-Yaniv - 1998
182 Theory of Games and Economic Behavior (context) - von Neumann, Morgenstern - 1944
180 High-speed switch scheduling for local area networks - Anderson, Owicki et al. - 1993
116 Input versus output queueing on a space-division packet swit.. (context) - Karol, Hluchyj et al. - 1987
99 Two algorithms for maintaining order in a list (context) - Dietz, Sleator
63 Queueing in high-performance packet switching (context) - Hluchyj, Karol - 1988
45 throughput in an input-queued switch (context) - McKeown, Anantharam et al.
23 Probabilistic computations: Toward a uni ed measure of compl.. (context) - Yao
3 Competitive on-line switching policies (context) - Bar-Noy, Freund et al. - 2003
1 Balanced scheduling toward loss-free packet queuing and dela.. - Fleischer, Koga - 2004
1 Bounds on delays and queue lengths in input-queued cell swit.. (context) - Leonardi, Mellia et al. - 2003
1 Scheduling VOQ switches under nonuniform trac (context) - Mekkittikul, McKeown - 1997
Documents on the same site (http://www.cs.chalmers.se/~ptr/): More
Nearly Optimal Strategies for Special Cases of On-line Capital.. - Damaschke (Correct)
Randomized vs. Deterministic Distance Query Strategies for Point .. - Damaschke (2005) (Correct)
Scheduling Search Procedures - Damaschke (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