Amortized efficiency of list update and paging rules
Communications of the ACM
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
Dynamic queue length thresholds for shared-memory packet switches
IEEE/ACM Transactions on Networking (TON)
Online computation and competitive analysis
Online computation and competitive analysis
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
Buffer overflow management in QoS switches
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Buffer management for shared-memory ATM switches
IEEE Communications Surveys & Tutorials
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
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
Harmonic buffer management policy for shared memory switches
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
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
Scheduling policies for CIOQ switches
Journal of Algorithms
An improved algorithm for CIOQ switches
ACM Transactions on Algorithms (TALG)
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
Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Best Effort and Priority Queuing Policies for Buffered Crossbar Switches
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Improved Competitive Performance Bounds for CIOQ Switches
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A Tight Bound on Online Buffer Management for Two-Port Shared-Memory Switches
IEICE - Transactions on Information and Systems
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
A survey of buffer management policies for packet switches
ACM SIGACT News
Packet buffering: randomization beats deterministic algorithms
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Providing performance guarantees in multipass network processors
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
We consider buffer management policies for shared memory packet switches supporting Quality of Service (QoS). There are two interesting dimensions in which the setting may different. The first is the packet size, whether all the packets of the same fixed size or do packets have variable length. The second is the value of the packets, do all the packets have the same value or do different packets have different values.The goal of the buffer management policy is to maximize the total value of packets transmitted. Our main result is to show that the well-known Longest Queue Drop (LQD) policy in 2-competitive and at least √2-competitive for the case of fixed size and value packets. We also show a 4/3 general lower bound on the competitiveness in this case. We extend the results to the case of variable size fixed value packets, and derive a slightly worse bound. For the case of variable value we derive randomized policy whose competitive ratio in logarithmic on the ratio of the maximal to minimal value.