A Universal Online Caching Algorithm Based on Pattern Matching

Pandurangan, Gopal; Szpankowski, Wojciech

doi:10.1007/s00453-008-9196-9

Cited by 3 publications

(2 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Please note that [2], [20], [21], [24], [25], and [27] were published shortly after the commencement of the project before its number was changed, therefore acknowledge the funding under the original grant number FA8655-07-1-3071. Finally, [19], [22], and [26] are recent enhanced versions of publications using some results and approaches developed within the former Grant FA8655-04-1-3074, and therefore acknowledge the funding under that grant number.…”

Section: Summary Of Technical Resultsmentioning

confidence: 99%

Information Transfer Ion Wireless Networks

Konorski¹

2010

View full text Add to dashboard Cite

Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing the burden, to Department of Defense, Washington Headquarters Services, Directorate for Information Operations and Reports (0704-0188), 1215 Jefferson Davis Highway, Suite 1204, Arlington, VA 22202-4302. Respondents should be aware that notwithstanding any other provision of law, no person shall be subject to any penalty for failing to comply with a collection of information if it does not display a currently valid OMB control number. PLEASE DO NOT RETURN YOUR FORM TO THE ABOVE ADDRESS. REPORT DATE (DD-MM-YYYY)22-07-2010 REPORT TYPE Final Report DATES COVERED (From -To) PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES)Gdansk University of Technology ul. Narutowicza 11/12 Gdansk 80-952 Poland PERFORMING ORGANIZATION REPORT NUMBERN/A SPONSORING/MONITORING AGENCY NAME(S) AND ADDRESS(ES)EOARD Unit 4515 BOX 14 APO AE 09421 SPONSOR/MONITOR'S ACRONYM(S) SPONSOR/MONITOR'S REPORT NUMBER(S)Grant 08-3018 DISTRIBUTION/AVAILABILITY STATEMENTApproved for public release; distribution is unlimited. SUPPLEMENTARY NOTES ABSTRACTAd hoc, mesh, and other unstructured wireless networks are worth studying due to their potential of becoming an alternative, survivable communication infrastructure in case of a major disaster or security breach incapacitating the wired backbone. While the design of effective data transfer mechanisms in wireless networks is maturing, new challenges arise regarding information transfer. This is partly because wireless nodes' increased autonomy and anonymity lead to non-punishable node selfishness. Hence, relative to wired networks, it is no longer clear if a given piece of protocol data carries information -i.e., if it increases a selfish recipient's ability to achieve its objectives. Thus the distinction between data and information is linked to incentive compatibility and nodes' willingness to contribute to the network functionality. At the same time, measuring the amount of information in transferred data becomes vital. Accordingly, the project focused both on game-theoretic and information-theoretic aspects of wireless networks. SUBJECT TERMS

show abstract

Section: Summary Of Technical Resultsmentioning

confidence: 99%

Information Transfer Ion Wireless Networks

Konorski¹

2010

View full text Add to dashboard Cite

show abstract

“…Lund et al [1999] improve on the aforementioned result by proposing an efficient randomized four-competitive online caching algorithm that works for any distribution D, but needs to know for (each pair of) pages p and q the probability that p will next be requested before q. Using the randomized algorithm of Lund et al [1999], Pandurangan and Szpankowski [2005] give a universal online caching algorithm based on pattern matching that works on a large class of models (including Markov sources), but does not need any knowledge of the input model.…”

Section: Introductionmentioning

confidence: 99%

Entropy-based bounds for online algorithms

Pandurangan

Upfal

2007

ACM Trans. Algorithms

Self Cite

View full text Add to dashboard Cite

We focus in this work on an aspect of online computation that is not addressed by standard competitive analysis, namely, identifying request sequences for which nontrivial online algorithms are useful versus request sequences for which all algorithms perform equally poorly. The motivations for this work are advanced system and architecture designs which allow the operating system to dynamically allocate resources to online protocols such as prefetching and caching. To utilize these features, the operating system needs to identify data streams that can benefit from more resources.Our approach in this work is based on the relation between entropy, compression, and gambling, extensively studied in information theory. It has been shown that in some settings, entropy can either fully or at least partially characterize the expected outcome of an iterative gambling game. Our goal is to study the extent to which the entropy of the input characterizes the expected performance of online algorithms for problems that arise in computer applications. We study bounds based on entropy for three classical online problems-list accessing, prefetching, and caching. Our bounds relate the performance of the best online algorithm to the entropy, a parameter intrinsic to characteristics of the request sequence. This is in contrast to the competitive ratio parameter of competitive analysis, which quantifies the performance of the online algorithm with respect to an optimal offline algorithm. For the prefetching problem, we give explicit upper and lower bounds for the performance of the best prefetching algorithm in terms of the entropy of the request sequence. In contrast, we show that the entropy of the request sequence alone does not fully capture the performance of online list accessing and caching algorithms.

show abstract

Universal Caching

Joshi

Sinha

2022

2022 IEEE Information Theory Workshop (ITW)

View full text Add to dashboard Cite

A Universal Online Caching Algorithm Based on Pattern Matching

Cited by 3 publications

References 24 publications

Information Transfer Ion Wireless Networks

Information Transfer Ion Wireless Networks

Entropy-based bounds for online algorithms

Universal Caching

Contact Info

Product

Resources

About