Two algorithms for maintaining order in a list
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
High-speed switch scheduling for local-area networks
ACM Transactions on Computer Systems (TOCS)
Online computation and competitive analysis
Online computation and competitive analysis
Bounds on delays and queue lengths in input-queued cell switches
Journal of the ACM (JACM)
Probabilistic computations: Toward a unified measure of complexity
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Achieving 100% throughput in an input-queued switch
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Designing packet buffers for router linecards
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 5.23 |
Queues that temporarily store fixed-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 efficiency. 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 picture of LQF's performance under heavy traffic than the usual (unparameterized) competitive ratio. We also discuss randomization, and we conclude with some intriguing open problems regarding a two-dimensional generalization of the problem.