An Optimal Randomized Online Algorithm for QoS Buffer Management

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.

[1]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[2]  Matthias Englert,et al.  Considering Suppressed Packets Improves Buffer Management in Quality of Service Switches , 2012, SIAM J. Comput..

[3]  Zongpeng Li,et al.  Optimal Posted Prices for Online Cloud Resource Allocation , 2017, SIGMETRICS 2017.

[4]  P. Freeman.  The Secretary Problem and its Extensions: A Review , 1983 .

[5]  Ran El-Yaniv,et al.  Competitive analysis of financial games , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[6]  Nir Andelman,et al.  Randomized qeue management for DiffServ , 2005, SPAA '05.

[7]  Yishay Mansour,et al.  Competitive queueing policies for QoS switches , 2003, SODA '03.

[8]  Yishay Mansour,et al.  Competitive Management of Non-preemptive Queues with Multiple Values , 2003, DISC.

[9]  Nicole Immorlica,et al.  A Knapsack Secretary Problem with Applications , 2007, APPROX-RANDOM.

[10]  Esther Mohr,et al.  Online algorithms for conversion problems: A survey , 2014 .

[11]  Michael H. Goldwasser.  A survey of buffer management policies for packet switches , 2010, SIGA.

[12]  Minghua Chen,et al.  Hour-Ahead Offering Strategies in Electricity Market for Power Producers with Storage and Intermittent Supply , 2017, SIGMETRICS.

[13]  Boaz Patt-Shamir,et al.  Optimal smoothing schedules for real-time streams , 2004, PODC '00.

[14]  Zongpeng Li,et al.  An online auction framework for dynamic resource provisioning in cloud computing , 2014, SIGMETRICS '14.

[15]  Kirill Kogan,et al.  Priority queueing with multiple packet characteristics , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[16]  Ran El-Yaniv,et al.  Optimal Search and One-Way Trading Online Algorithms , 2001, Algorithmica.

[17]  Sharayu Moharir,et al.  Online Load Balancing Under Graph Constraints , 2016, IEEE/ACM Transactions on Networking.

[18]  Deeparnab Chakrabarty,et al.  Budget constrained bidding in keyword auctions and online knapsack problems , 2008, WINE.

[19]  Yossi Azar,et al.  Management of Multi-Queue Switches in QoS Networks , 2003, STOC '03.

[20]  Boaz Patt-Shamir,et al.  Nearly optimal FIFO buffer management for DiffServ , 2002, PODC '02.

[21]  An Zhu,et al.  Analysis of queueing policies in QoS switches , 2004, J. Algorithms.

[22]  Amos Fiat,et al.  Competitive queue management for latency sensitive packets , 2008, SODA '08.

[23]  Dennis Komm,et al.  The online knapsack problem: Advice and randomization , 2014, Theor. Comput. Sci..

[24]  Yasuo Okabe,et al.  Competitive buffer management for multi-queue switches in qos networks using packet buffering algorithms , 2009, SPAA '09.

[25]  Yishay Mansour,et al.  Competitive queue policies for differentiated services , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[26]  Moran Feldman,et al.  Non-preemptive buffer management for latency sensitive packets , 2010, 2010 Proceedings IEEE INFOCOM.

[27]  Imtiaz Ahmad,et al.  Cloud Computing Pricing Models: A Survey , 2013 .

[28]  Nimrod Megiddo,et al.  Improved algorithms and analysis for secretary problems and generalizations , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[29]  Yishay Mansour,et al.  Loss-bounded analysis for differentiated services , 2001, SODA '01.

[30]  Matthias Englert,et al.  Lower and Upper Bounds on FIFO Buffer Management in QoS Switches , 2006, Algorithmica.

[31]  Konstantinos Panagiotou,et al.  Optimal Algorithms for k-Search with Application in Option Pricing , 2007, Algorithmica.

[32]  Boaz Patt-Shamir,et al.  Buffer overflow management in QoS switches , 2001, STOC '01.