Amortized efficiency of list update and paging rules
Communications of the ACM
Online computation and competitive analysis
Online computation and competitive analysis
Competitive non-preemptive call control
SODA '94 Proceedings of the fifth 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
Competitve buffer management for shared-memory switches
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Buffer overflow management in QoS switches
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
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
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
Buffer Overflow Management in QoS Switches
SIAM Journal on Computing
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
Optimal smoothing schedules for real-time streams
Distributed Computing
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
Three dozen papers on online algorithms
ACM SIGACT News
An optimal online algorithm for packet scheduling with agreeable deadlines
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
Randomized qeue management for DiffServ
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Competitive queue policies for differentiated services
Journal of Algorithms
On the Performance of Greedy Algorithms in Packet Buffering
SIAM Journal on Computing
Scheduling policies for CIOQ switches
Journal of Algorithms
An improved algorithm for CIOQ switches
ACM Transactions on Algorithms (TALG)
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Rate vs. buffer size: greedy information gathering on the line
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
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
Lower and upper bounds on FIFO buffer management in QoS switches
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Better online buffer management
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Considering suppressed packets improves buffer management in QoS switches
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Improved online algorithms for buffer management in QoS switches
ACM Transactions on Algorithms (TALG)
Maximizing throughput in multi-queue switches
Algorithmica
Competitive queue management for latency sensitive packets
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Competitive buffer management for shared-memory switches
ACM Transactions on Algorithms (TALG)
Collecting weighted items from a dynamic queue
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Buffer management for colored packets with deadlines
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Approximation algorithms for time-constrained scheduling on line networks
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Competitive buffer management with packet dependencies
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
An experimental study of new and known online packet buffering algorithms
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Geometric aspects of online packet buffering: an optimal randomized algorithm for two buffers
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Multiplexing packets with arbitrary deadlines in bounded buffers
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
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
SIGACT news online algorithms column 17
ACM SIGACT News
Improved online scheduling in maximizing throughput of equal length jobs
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
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
An optimal lower bound for buffer management in multi-queue switches
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
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 scheduling of packets with agreeable deadlines
ACM Transactions on Algorithms (TALG)
Buffer overflow management with class segregation
Information Processing Letters
FIFO queueing policies for packets with heterogeneous processing
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
Over the past decade, there has been great interest in the study of buffer management policies in the context of packet transmission for network switches. In a typical model, a switch receives packets on one or more input ports, with each packet having a designated output port through which it should be transmitted. An online policy must consider bandwidth limits on the rate of transmission, memory constraints impacting the buffering of packets within a switch, and variations in packet properties used to differentiate quality of service. With so many constraints, a switch may not be able to deliver all packets, in which case some will be dropped In the online algorithms community, researchers have used competitive analysis to evaluate the quality of an online policy in maximizing the value of those packets it is able to transmit. In this article, we provide a detailed survey of the field, describing various models of the problem that have been studied, and summarizing the known results.