Introduction to algorithms
On-line scheduling in the presence of overload
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
On-line load balancing with applications to machine scheduling and virtual circuit routing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
Dover: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
SIAM Journal on Computing
Approximating the throughput of multiple machines under real-time scheduling
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A unified approach to approximating resource allocation and scheduling
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Off-line admission control for general scheduling problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Optimal smoothing schedules for real-time streams (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Loss-bounded analysis for differentiated services
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Competitive queue policies for differentiated services
Journal of Algorithms
The drop from front strategy in TCP and in TCP over ATM
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Packet dropping policies for ATM and IP networks
IEEE Communications Surveys & Tutorials
Competitve buffer management for shared-memory switches
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
ACM SIGACT News
Competitive on-line switching policies
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Nearly optimal FIFO buffer management for DiffServ
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Competitive queueing policies for QoS switches
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic routing on networks with fixed-size buffers
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Loss-bounded analysis for differentiated services
Journal of Algorithms
Buffer overflows of merging streams
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Scheduling policies for CIOQ switches
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Management of multi-queue switches in QoS networks
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Nearly optimal FIFO buffer management for two packet classes
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the performance of greedy algorithms in packet buffering
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The zero-one principle for switching networks
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Packet-mode policies for input-queued switches
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Harmonic buffer management policy for shared memory switches
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Analysis of queueing policies in QoS switches
Journal of Algorithms
Online auctions with re-usable goods
Proceedings of the 6th ACM conference on Electronic commerce
An optimal online algorithm for packet scheduling with agreeable deadlines
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Online ascending auctions for gradually expiring items
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Competitive weighted throughput analysis of greedy protocols on DAGs
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Competitive queue policies for differentiated services
Journal of Algorithms
An improved approximation algorithm for combinatorial auctions with submodular bidders
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A tight bound on online buffer management for two-port shared-memory switches
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
The Journal of Machine Learning Research
Improved online algorithms for buffer management in QoS switches
ACM Transactions on Algorithms (TALG)
Prompt Mechanisms for Online Auctions
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Randomized Algorithms for Buffer Management with 2-Bounded Delay
Approximation and Online Algorithms
Increasing Machine Speed in On-Line Scheduling of Weighted Unit-Length Jobs in Slotted Time
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Resource Management in Large Networks
Algorithmics of Large and Complex Networks
A survey of buffer management policies for packet switches
ACM SIGACT News
An experimental study of new and known online packet buffering algorithms
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Competitive weighted throughput analysis of greedy protocols on DAGs
ACM Transactions on Algorithms (TALG)
One to rule them all: a general randomized algorithm for buffer management with bounded delay
ESA'11 Proceedings of the 19th European conference on Algorithms
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Multiplexing packets with arbitrary deadlines in bounded buffers
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
An optimal lower bound for buffer management in multi-queue switches
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Packet buffering: randomization beats deterministic algorithms
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Optimal buffer management via resource augmentation
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Competitive router scheduling with structured data
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Overflow management with multipart packets
Computer Networks: The International Journal of Computer and Telecommunications Networking
Online competitive algorithms for maximizing weighted throughput of unit jobs
Journal of Discrete Algorithms
Hi-index | 0.00 |
We consider two types of buffering policies that are used in network switches supporting QoS (Quality of Service). In the FIFO type, packets must be released in the order they arrive; the difficulty in this case is the limited buffer space. In the bounded-delay type, each packet has a maximum delay time by which it must be released, or otherwise it is lost. We study the cases where the incoming streams overload the buffers, resulting in packet loss. In our model, each packet has an intrinsic value; the goal is to maximize the total value of packets transmittedOur main contribution is a thorough investigation of the natural greedy algorithms in various models. For the FIFO model we prove tight bounds on the competitive ratio of the greedy algorithm that discards the packets with the lowest value. We also prove that the greedy algorithm that drops the earliest packets among all low-value packets is the best greedy algorithm. This algorithm can be as much as 1.5 times better than the standard tail-drop policy, that drops the latest packets.In the bounded delay model we show that the competitive ratio of any online algorithm for a uniform bounded delay buffer is bounded away from 1, independent of the delay size. We analyze the greedy algorithm in the general case and in three special cases: delay bound 2; link bandwidth 1; and only two possible packet values.Finally, we consider the off-line scenario. We give efficient optimal algorithms and study the relation between the bounded-delay and FIFO models in this case.