Connection caching

Edith Cohen; Haim Kaplan; Uri Zwick

doi:10.1145/301250.301416

Connection caching

Edith Cohen^*, Haim Kaplan, Uri Zwick

^*Corresponding author for this work

AT&T

Research output: Contribution to journal › Conference article › peer-review

10 Scopus citations

Abstract

A theoretical model for connection caching was proposed to study this kind of connection management. While the ordinary off-line caching problem is easily solved in polynomial time, the off-line connection caching problem is NP-complete, and in fact also APX-complete, that is, it is even hard to approximate. This result was complemented by showing that a distributed version of Belady's algorithm, which is optimal for a single cache, is a 2-approximation algorithm for off-line connection-caching. Examples that show that the analysis of this algorithm is tight are provided.

Original language	English
Pages (from-to)	612-621
Number of pages	10
Journal	Conference Proceedings of the Annual ACM Symposium on Theory of Computing
DOIs	https://doi.org/10.1145/301250.301416
State	Published - 1999
Externally published	Yes
Event	Proceedings of the 1999 31st Annual ACM Symposium on Theory of Computing - FCRC '99 - Atlanta, GA, USA Duration: 1 May 1999 → 4 May 1999

Access to Document

10.1145/301250.301416

Cite this

@article{ae9e1c6f547f4a67bcfb94ce6aa8cdc4,

title = "Connection caching",

abstract = "A theoretical model for connection caching was proposed to study this kind of connection management. While the ordinary off-line caching problem is easily solved in polynomial time, the off-line connection caching problem is NP-complete, and in fact also APX-complete, that is, it is even hard to approximate. This result was complemented by showing that a distributed version of Belady's algorithm, which is optimal for a single cache, is a 2-approximation algorithm for off-line connection-caching. Examples that show that the analysis of this algorithm is tight are provided.",

author = "Edith Cohen and Haim Kaplan and Uri Zwick",

year = "1999",

doi = "10.1145/301250.301416",

language = "אנגלית",

pages = "612--621",

journal = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",

issn = "0734-9025",

publisher = "Association for Computing Machinery (ACM)",

note = "Proceedings of the 1999 31st Annual ACM Symposium on Theory of Computing - FCRC '99 ; Conference date: 01-05-1999 Through 04-05-1999",

}

TY - JOUR

T1 - Connection caching

AU - Cohen, Edith

AU - Kaplan, Haim

AU - Zwick, Uri

PY - 1999

Y1 - 1999

N2 - A theoretical model for connection caching was proposed to study this kind of connection management. While the ordinary off-line caching problem is easily solved in polynomial time, the off-line connection caching problem is NP-complete, and in fact also APX-complete, that is, it is even hard to approximate. This result was complemented by showing that a distributed version of Belady's algorithm, which is optimal for a single cache, is a 2-approximation algorithm for off-line connection-caching. Examples that show that the analysis of this algorithm is tight are provided.

AB - A theoretical model for connection caching was proposed to study this kind of connection management. While the ordinary off-line caching problem is easily solved in polynomial time, the off-line connection caching problem is NP-complete, and in fact also APX-complete, that is, it is even hard to approximate. This result was complemented by showing that a distributed version of Belady's algorithm, which is optimal for a single cache, is a 2-approximation algorithm for off-line connection-caching. Examples that show that the analysis of this algorithm is tight are provided.

UR - http://www.scopus.com/inward/record.url?scp=0032662987&partnerID=8YFLogxK

U2 - 10.1145/301250.301416

DO - 10.1145/301250.301416

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:0032662987

SN - 0734-9025

SP - 612

EP - 621

JO - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

JF - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

T2 - Proceedings of the 1999 31st Annual ACM Symposium on Theory of Computing - FCRC '99

Y2 - 1 May 1999 through 4 May 1999

ER -

Connection caching

Abstract

Access to Document

Other files and links

Fingerprint

Cite this