SIGACT news online algorithms column 4
ACM SIGACT News
Randomized qeue management for DiffServ
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Scheduling policies for CIOQ switches
Journal of Algorithms
An improved algorithm for CIOQ switches
ACM Transactions on Algorithms (TALG)
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
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)
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
Mixed Criteria Packet Scheduling
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Best Effort and Priority Queuing Policies for Buffered Crossbar Switches
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
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
A Tight Bound on Online Buffer Management for Two-Port Shared-Memory Switches
IEICE - Transactions on Information and Systems
Competitive FIFO Buffer Management for Weighted Packets
CNSR '09 Proceedings of the 2009 Seventh Annual Communication Networks and Services Research Conference
Competitive Buffer Management with Stochastic Packet Arrivals
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
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
Buffer management for aggregated streaming data with packet dependencies
INFOCOM'10 Proceedings of the 29th conference on Information communications
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)
A comprehensive study of an online packet scheduling algorithm
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
A near-optimal memoryless online algorithm for FIFO buffering two packet classes
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Prompt mechanism for ad placement over time
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Bid-Based approach for pricing web service
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I
Bounded delay packet scheduling in a bounded buffer
Operations Research Letters
Traffic management strategy for delay-tolerant networks
Journal of Network and Computer Applications
Online scheduling of packets with agreeable deadlines
ACM Transactions on Algorithms (TALG)
Providing performance guarantees in multipass network processors
IEEE/ACM Transactions on Networking (TON)
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
A comprehensive study of an online packet scheduling algorithm
Theoretical Computer Science
A near-optimal memoryless online algorithm for FIFO buffering two packet classes
Theoretical Computer Science
Hi-index | 0.00 |
We consider two types of buffering policies that are used in network switches supporting Quality of Service (QoS). In the FIFO type, packets must be transmitted in the order in which they arrive; the constraint 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 transmitted, or otherwise it is lost. We study the case of overloads resulting in packet loss. In our model, each packet has an intrinsic value, and the goal is to maximize the total value of transmitted packets.Our main contribution is a thorough investigation of some natural greedy algorithms in various models. For the FIFO model we prove tight bounds on the competitive ratio of the greedy algorithm that discards packets with the lowest value when an overflow occurs. 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 tail-drop greedy policy, which drops the latest lowest-value packets.In the bounded-delay model we show that the competitive ratio of any on-line 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.