Journal of the ACM (JACM)
IEEE/ACM Transactions on Networking (TON)
Buffer size requirements under longest queue first
Performance Evaluation
The competitiveness of on-line assignments
Journal of Algorithms
An optimal service policy for buffer systems
Journal of the ACM (JACM)
Quality of service in IP networks: foundations for a multi-service Internet
Quality of service in IP networks: foundations for a multi-service Internet
Buffer overflow management in QoS switches
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Developments from a June 1996 seminar on Online algorithms: the state of the art
Pursuit-evasion with imprecise target location
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
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
Optimal buffer management via resource augmentation
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Distributed online and stochastic queuing on a multiple access channel
DISC'12 Proceedings of the 26th international conference on Distributed Computing
| Hi-index | 0.00 |
A switch, or server, serves n input queues, processing messages arriving at these queues to a single output channel. At each time slot the switch can process a single message from one of the queues. The goal of a switching policy is to minimize the size of the buffers at the input queues that maintain the messages that have not yet been processed. This is a typical on-line setting in which decisions are made based on the current state without knowledge of future events. This general scenario models multiplexing tasks in various systems such as communication networks, cable modem systems, and traffic control. Traditionally, researchers analyzed the performance of a given policy assuming some distribution on the arrival rates of messages at the input queues, or by assuming that the service rate is at least the aggregate of all the input rates. We use competitive analysis to analyze switching service policies, thus avoiding any prior assumptions on the input. Specifically, we show O(log n)-competitive switching policies for the problem and demonstrate matching lower bounds.