Connection caching: Model and algorithms.

DOI10.1016/S0022-0000(03)00041-2zbMATH Open1055.68018MaRDI QIDQ1401982FDOQ1401982

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)

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

zbMATH Keywords

Online algorithmsCompetitive analysisCache replacementConnection cachingMarking algorithms

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Competitive snoopy caching
• Competitive paging algorithms
• Competitive analysis of randomized paging algorithms
• A strongly competitive randomized paging algorithm
• New Ressults on Server Problems
• Title not available (Why is that?)
• Connection caching
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• On generalized connection caching
• Connection caching to reduce signaling loads with applications to softswitch telephony.
• Title not available (Why is that?)
• 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)