Amortized efficiency of list update and paging rules
Communications of the ACM
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
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
Differentiated Services for the Internet
Differentiated Services for the Internet
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
Buffer overflow management in QoS switches
STOC '01 Proceedings of the thirty-third 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
Rate vs. buffer size: greedy information gathering on the line
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
Competitive queue management for latency sensitive packets
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Mixed Criteria Packet Scheduling
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Competitive buffer management for shared-memory switches
ACM Transactions on Algorithms (TALG)
A Tight Bound on Online Buffer Management for Two-Port Shared-Memory Switches
IEICE - Transactions on Information and Systems
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
A survey of buffer management policies for packet switches
ACM SIGACT News
Competitive weighted throughput analysis of greedy protocols on DAGs
ACM Transactions on Algorithms (TALG)
Scheduling packets with values and deadlines in size-bounded buffers
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Rate vs. buffer size--greedy information gathering on the line
ACM Transactions on Algorithms (TALG)
An optimal lower bound for buffer management in multi-queue switches
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
FIFO queueing policies for packets with heterogeneous processing
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
A φ-competitive algorithm for collecting items with increasing weights from a dynamic queue
Theoretical Computer Science
Scheduling Packets with Values and Deadlines in Size-Bounded Buffers
Journal of Combinatorial Optimization
The loss of serving in the dark
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We consider the setting of a network providing differentiated services. As is often the case in differentiated services, we assume that the packets are tagged as either being a high priority packet or a low priority packet. Outgoing links in the network are serviced by a single FIFO queue.Our model gives a benefit of α ≥ 1 to each high priority packet and a benefit of 1 to each low priority packet. A queue policy controls which of the arriving packets are dropped and which enter the queue. Once a packet enters the queue it is eventually sent. The aim of a queue policy is to maximize the sum of the benefits of all the packets it sends.We analyze and compare different queue policies for this problem using the competitive analysis approach, where the benefit of the online policy is compared to the benefit of an optimal offline policy. We derive both upper and lower bounds for the policies we consider. We believe that competitive analysis gives important insight to the performance of these queuing policies.