Lin Yang
Mohammad H. Hajiesmaili
ABSTRACT
The QoS 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, 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 proposes an optimal randomized online algorithm for this problem.
- W. Aiello, Y. Mansour, S. Rajagopolan, and A. Rosén. Competitive queue policies for differentiated services. In Proc. of IEEE INFOCOM, pages 431--440, 2000.Google Scholar
Cross Ref
- N. Andelman and Y. Mansour. Competitive management of non-preemptive queues with multiple values. In Proc. of DISC, pages 166--180, 2003.Google ScholarCross Ref
- A. Kesselman, Z. Lotker, Y. Mansour, B. Patt-Shamir, and B. Schieber. Buffer overflow management in QoS switches. SIAM Journal on Computing, 33(3), 2004. Google ScholarDigital Library
- E. Mohr, I. Ahmad, and G. Schmidt. Online algorithms for conversion problems: a survey. Surveys in Operations Research and Management Science, 19(2), 2014.Google Scholar
- L. Yang, M. H. Hajiesmaili, H. Yi, and M. Chen. Hour-ahead offering strategies in electricity market for power producers with storage and intermittent supply. In Proc. of ACM SIGMETRICS, 2017. Google ScholarDigital Library
- L. Yang, W. S. Wong, and M. H. Hajiesmaili. An optimal randomized online algorithm for qos buffer management. Proc. ACM Meas. Anal. Comput. Syst., 1(2):36:1--36:26, December 2017. Google ScholarDigital Library
- Z. Zhang, Z. Li, and C. Wu. Optimal posted prices for online cloud resource allocation. Proceedings of the ACM on Measurement and Analysis of Computing Systems, 1(1):23, 2017. Google ScholarDigital Library
Index Terms
- An Optimal Randomized Online Algorithm for QoS Buffer Management
Recommendations
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 ...
An Optimal Randomized Online Algorithm for QoS Buffer Management
SIGMETRICS '18The QoS 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, ...
Buffer Overflow Management in QoS Switches
We consider two types of buffering policies that are used in network switches supporting Quality of Service (QoS). In the FIFO type, packets must be transmitted in the order in which they arrive; the constraint in this case is the limited buffer ...
Comments