An optimal algorithm for on-line bipartite matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
An optimal service policy for buffer systems
Journal of the ACM (JACM)
Online computation and competitive analysis
Online computation and competitive analysis
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
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
Caching queues in memory buffers
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
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
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
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
Competitive Buffer Management with Stochastic Packet Arrivals
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
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
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
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
Online scheduling of packets with agreeable deadlines
ACM Transactions on Algorithms (TALG)
Buffer overflow management with class segregation
Information Processing Letters
| Hi-index | 0.00 |
The concept of Quality of Service (QoS) networks has gained growing attention recently, as the traffic volume in the Internet constantly increases, and QoS guarantees are essential to ensure proper operation of most communication based applications. A QoS switch serves m incoming queues by transmitting packets arriving at these queues through one output port, one packet per time unit. Each packet is marked with a value indicating its guaranteed quality of service. Since the queues have bounded capacity and the rate of arriving packets can be much higher than the transmission rate, packets can be lost due to insufficient queue space. The goal is to maximize the total value of transmitted packets. This problem encapsulates two dependent questions: admission control, namely which packets to discard in case of queue overflow, and scheduling, i.e. which queue to use for transmission in each time unit. We use competitive analysis to study online switch performance in QoS based networks. Specifically, we provide a novel generic technique that decouples the admission control and scheduling problems. Our technique transforms any single queue admission control strategy (preemptive or nonpreemptive) to a scheduling and admission control algorithm for our general m queues model, whose competitive ratio is at most twice the competitive ratio of the given admission control strategy. We use our technique to derive concrete algorithms for the general preemptive and nonpreemptive cases, as well as for the interesting special cases of the 2-value model and the unit value model. To the best of our knowledge this is the first result combining both scheduling and admission control decisions for arbitrary packets sequences in multi-queue switches. We also provide a 1.58-competitive randomized algorithm for the unit value case. This case is interesting by itself since most current networks (e.g. IP networks) only support a best-effort service in which all packets streams are treated equally.