Nir Andelman
ABSTRACT
We focus on the online problem of queue management in networks providing differentiated services. As in DiffServ, packets are divided into two priority groups. Low priority packets are assigned the value of 1 and high priority packets are assigned the value of α > 1. The goal is to maximize the total value of packets that are sent. Restricted to FIFO queues, the packets must be sent by the order of their arrival, however we are allowed to preempt packets from the queue.Several deterministic online algorithms for this model have been presented in previous papers. Currently, the best online algorithm known for this problem has a competitive ratio of 1.304 for the worst case α [17]. In this work we consider randomized online algorithms. Our main result is an online policy that outperforms any deterministic policy and achieves a competitive ratio of 1.25, by using a single random bit. This result is lower than the deterministic lower bound of 1.281 [19]. We then derive a general lower bound for randomized algorithms of 1.197.A natural extension of this model is to assign arbitrary packet values to the input packets. Currently, the best competitive ratio achieved for a deterministic policy is 1.75 [7]. We present a randomized comparison based online policy with the same competitive ratio. Since no deterministic comparison based policy is known to have a competitive ratio better than 2, we believe that this result demonstrates the potential of using randomization to outperform deterministic policies, as in the two value model.
- W. Aiello, Y. Mansour, S. Rajagopolan, and A. Rosén. Competitive queue policies for differentiated services. In INFOCOM, pages 431--440, 2000.]]Google Scholar
Cross Ref
- N. Andelman and Y. Mansour. Competitive management of non-preemptive queues with multiple values. In DISC, pages 166--180, 2003.]]Google ScholarCross Ref
- N. Andelman, Y. Mansour, and A. Zhu. Competitive queueing policies for qos switches. In SODA, pages 761--770, 2003.]] Google ScholarDigital Library
- Y. Azar and Y. Richter. Management of multi-queue switches in qos networks. In STOC, pages 82--89, 2003.]] Google ScholarDigital Library
- Y. Azar and Y. Richter. An improved algorithm for cioq switches. In ESA, pages 65--76, 2004.]]Google ScholarCross Ref
- Y. Azar and Y. Richter. The zero-one principle for switching networks. In STOC, pages 64--71, 2004.]] Google ScholarDigital Library
- N. Bansal, L. Fleischer, T. Kimbrel, M. Mahdian, B. Schieber, and M. Sviridenko. Further improvements in competitive guarantees for qos buffering. In ICALP, pages 196--207, 2004.]]Google ScholarCross Ref
- S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss. An architecture for differentiated services. RFC 2475, IETF, December 1998.]] Google ScholarDigital Library
- A. Borodin and R. El-Yaniv. Online computation and competitive analysis. Cambridge University Press, 1998. Borodin.]] Google ScholarDigital Library
- D. Clark and J. Wroclawski. An approach to service allocation in the internet. Internet-Draft Version 00, IETF, July 1997.]]Google Scholar
- E. L. Hahne, A. Kesselman, and Y. Mansour. Competitve buffer management for shared-memory switches. In SPAA, pages 53--58, 2001.]] Google ScholarDigital Library
- A. Kesselman, Z. Lotker, Y. Mansour, and B. Patt-Shamir. Buffer overflows of merging streams. In ESA, pages 349--360, 2003.]]Google ScholarDigital Library
- A. Kesselman, Z. Lotker, Y. Mansour, B. Patt-Shamir, B. Schieber, and M. Sviridenko. Buffer overflow management in qos switches. SIAM J. Comput., 33(3):563--583, 2004.]] Google ScholarDigital Library
- A. Kesselman and Y. Mansour. Loss-bounded analysis for differentiated services. In SODA, pages 591--600, 2001.]] Google ScholarDigital Library
- A. Kesselman and Y. Mansour. Harmonic buffer management policy for shared memory switches. In INFOCOM, 2002.]]Google ScholarCross Ref
- A. Kesselman, Y. Mansour, and R. van Stee. Improved competitive guarantees for qos buffering. In ESA, pages 361--372, 2003.]]Google ScholarCross Ref
- Z. Lotker and B. Patt-Shamir. Nearly optimal fifo buffer management for diffserv. In PODC, pages 134--142, 2002.]] Google ScholarDigital Library
- M. Schmidt. Packet buffering: Randomization beats deterministic algorithms. In STACS, pages 293--304, 2005.]] Google ScholarDigital Library
- M. Sviridenko. A lower bound for on-line algorithms in the fifo model. Unpublished Manuscript, 2001.]]Google Scholar
Index Terms
- Randomized qeue management for DiffServ
Recommendations
Online Randomized Multiprocessor Scheduling
The use of randomization in online multiprocessor scheduling is studied. The problem of scheduling independent jobs on m machines online originates with Graham [16]. While the deterministic case of this problem has been studied extensively, little work ...
A Randomized $$\mathrm {O}(\log n)$$O(logn)-Competitive Algorithm for the Online Connected Facility Location Problem
The Connected Facility Location (CFL) is a network design problem that arises from a combination of the Uncapacitated Facility Location (FL) and the Steiner Tree (ST) problems. The Online Connected Facility Location problem (OCFL) is an online version ...
A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems
A lower bound of $\Omega(\sqrt{\log k / \log \log k})$ is proved for the competitive ratio of randomized algorithms for the k-server problem against an oblivious adversary. The bound holds for arbitrary metric spaces (having at least k+1 points) and ...
Comments