An Optimal Randomized Online Algorithm for QoS Buffer Management
Authors:
Open Access
- 19 December 2017
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Measurement and Analysis of Computing Systems
- Vol. 1 (2) , 1-26
Abstract
The QoS (Quality of Service) buffer management problem, with significant and diverse computer applications, e.g., in online cloud resource allocation problems, is a classic online admission control problem in the presence of resource constraints. In its basic setting, packets with different values according to their QoS requirements, arrive in online fashion to a switching node with limited buffer size. Then, the switch needs to make an immediate decision to either admit or reject the incoming packet based on the value of the packet and its buffer availability. The objective is to maximize the cumulative profit of the admitted packets, while respecting the buffer constraint. Even though the QoS buffer management problem was proposed more than a decade ago, no optimal online solution has been proposed in the literature. This paper contributes to this problem by proposing: 1) A fixed threshold-based online algorithm with smaller competitive ratio than the existing results; 2) an optimal deterministic online algorithm under fractional admission model in which a packet could be admitted partially; and 3) an optimal randomized online algorithm for the general problem. We consider the last result being the main contribution of this paper.Keywords
Funding Information
- Research Grants Council, University Grants Committee (14630915)
This publication has 24 references indexed in Scilit:
- Cloud Computing Pricing Models: A SurveyInternational Journal of Grid and Distributed Computing, 2013
- Considering Suppressed Packets Improves Buffer Management in Quality of Service SwitchesSIAM Journal on Computing, 2012
- A survey of buffer management policies for packet switchesACM SIGACT News, 2010
- Optimal Algorithms for k-Search with Application in Option PricingAlgorithmica, 2008
- A Knapsack Secretary Problem with Applications2007
- Management of Multi-Queue Switches in QoS NetworksAlgorithmica, 2005
- Analysis of queueing policies in QoS switchesJournal of Algorithms, 2004
- Buffer Overflow Management in QoS SwitchesSIAM Journal on Computing, 2004
- Optimal Search and One-Way Trading Online AlgorithmsAlgorithmica, 2001
- Improved Algorithms and Analysis for Secretary Problems and GeneralizationsSIAM Journal on Discrete Mathematics, 2001