Optimal time-critical scheduling via resource augmentation (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Applying extra-resource analysis to load balancing
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
Performance guarantee for online deadline scheduling in the presence of overload
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
Competitive on-line switching policies
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Extra processors versus future information in optimal deadline scheduling
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Nearly optimal FIFO buffer management for DiffServ
Proceedings of the twenty-first annual symposium on Principles of distributed computing
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
Analysis of queueing policies in QoS switches
Journal of Algorithms
Increasing Machine Speed in On-Line Scheduling of Weighted Unit-Length Jobs in Slotted Time
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
A survey of buffer management policies for packet switches
ACM SIGACT News
| Hi-index | 0.00 |
We study a buffer management problem in network switches supporting QoS(Quality of Service) Each input or output port has a buffer of limited capacity which can store up to B packets Packets arrive online and a buffer management policy determines which packets are transmitted through the buffer After admitted into the buffer by the policy, packets are transmitted in FIFO fashion, that is, in the order they arrive Each packet has a value and the goal of the policy is to maximize the total value of packets transmitted. The main contribution is to apply resource augmentation analysis to the problem, investigating the optimality of various online policies The online policy has more resources than the optimal offline policy, that is, additional buffer and a higher transmission rate For two types of models, nonpreemptive and preemptive, we derive optimal online policies with additional buffer or a higher transmission rate Also we prove lower bounds of the resources for any optimal online policy.