Measuring the problem-relevant information in input

We propose a new way of characterizing the complexity of online problems. Instead of measuring the degradation of the output quality caused by the ignorance of the future we choose to quantify the amount of additional global information needed for an online algorithm to solve the problem optimally. In our model, the algorithm cooperates with an oracle that can see the whole input. We define the advice complexity of the problem to be the minimal number of bits (normalized per input request, and minimized over all algorithm-oracle pairs) communicated by the algorithm to the oracle in order to solve the problem optimally. Hence, the advice complexity measures the amount of problem-relevant information contained in the input. We introduce two modes of communication between the algorithm and the oracle based on whether the oracle offers an advice spontaneously (helper) or on request (answerer). We analyze the Paging and DiffServ problems in terms of advice complexity and deliver upper and lower bounds in both communication modes; in the case of DiffServ problem in helper mode the bounds are tight.

[1]  Andrzej Pelc,et al.  Distributed computing with advice: information sensitivity of graph coloring , 2007, Distributed Computing.

[2]  Sandy Irani,et al.  Strongly competitive algorithms for paging with locality of reference , 1992, SODA '92.

[3]  Susanne Albers,et al.  On the Influence of Lookahead in Competitive Paging Algorithms , 1997, Algorithmica.

[4]  Susanne Albers,et al.  Online algorithms: a survey , 2003, Math. Program..

[5]  Neal E. Young,et al.  Thek-server dual and loose competitiveness for paging , 1994, Algorithmica.

[6]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[7]  Joan Boyar,et al.  Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem , 2006, WAOA.

[8]  Bala Kalyanasundaram,et al.  Speed is as powerful as clairvoyance , 2000, JACM.

[9]  Marek Chrobak,et al.  Competitive analysis of randomized paging algorithms , 2000, Theor. Comput. Sci..

[10]  Amos Fiat,et al.  Competitive Paging Algorithms , 1991, J. Algorithms.

[11]  Allan Borodin,et al.  Competitive paging with locality of reference , 1991, STOC '91.

[12]  Lyle A. McGeoch,et al.  Competitive algorithms for on-line problems , 1988, STOC '88.

[13]  Anna R. Karlin,et al.  Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[14]  Eric Torng.  A Unified Analysis of Paging and Caching , 1998, Algorithmica.

[15]  Una-May O'Reilly,et al.  The Expressiveness of Silence: Tight Bounds for Synchronous Communication of Information Using Bits and Silence , 1992, WG.

[16]  Joan Boyar,et al.  The Accommodating Function: A Generalization of the Competitive Ratio , 2001, SIAM J. Comput..

[17]  Cynthia A. Phillips,et al.  Optimal Time-Critical Scheduling via Resource Augmentation , 1997, STOC '97.

[18]  Allan Borodin,et al.  A new measure for the study of on-line algorithms , 2005, Algorithmica.

[19]  Andrzej Pelc,et al.  Tree Exploration with an Oracle , 2006, MFCS.

[20]  Christos H. Papadimitriou,et al.  Beyond competitive analysis [on-line algorithms] , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[21]  H. Robbins.  A Remark on Stirling’s Formula , 1955 .

[22]  Laszlo A. Belady,et al.  A Study of Replacement Algorithms for Virtual-Storage Computer , 1966, IBM Syst. J..

[23]  Prabhakar Raghavan,et al.  A Statistical Adversary for On-line Algorithms , 1991, On-Line Algorithms.

[24]  Cynthia A. Phillips,et al.  Optimal Time-Critical Scheduling via Resource Augmentation (Extended Abstract) , 1997, Symposium on the Theory of Computing.

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

[26]  Neal E. Young,et al.  On-Line Paging Against Adversarially Biased Random Inputs , 2000, J. Algorithms.

[27]  Joan Boyar,et al.  The relative worst order ratio for online algorithms , 2007, TALG.

[28]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[29]  Andrzej Pelc,et al.  Oracle size: a new measure of difficulty for communication tasks , 2006, PODC '06.