Connection caching: Model and algorithms.

DOI10.1016/S0022-0000(03)00041-2MaRDI QIDQ1401982zbMATH OpenFDO

Authors Edith Cohen, Haim Kaplan, Uri Zwick

Publication date 19 August 2003

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

Online algorithmsCompetitive analysisCache replacementConnection cachingMarking algorithms

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12)

Recommendations

• Connection caching
• On generalized connection caching
• A study of integrated document and connection caching in the WWW
• scientific article; zbMATH DE number 2038745
• scientific article; zbMATH DE number 1445331

Cites work

• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 1303544 (Why is no real title available?)
• scientific article; zbMATH DE number 1305498 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1559590 (Why is no real title available?)
• A strongly competitive randomized paging algorithm
• Competitive analysis of randomized paging algorithms
• Competitive paging algorithms
• Competitive snoopy caching
• Connection caching
• New Ressults on Server Problems

Cited in

(6)

• On generalized connection caching
• Connection caching to reduce signaling loads with applications to softswitch telephony.
• scientific article; zbMATH DE number 2038745 (Why is no real title available?)
• A study of integrated document and connection caching in the WWW
• Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost
• Connection caching

This page was built for publication: Connection caching: Model and algorithms.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401982)