Connection caching: model and algorithms
- 31 August 2003
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 67 (1) , 92-126
- https://doi.org/10.1016/s0022-0000(03)00041-2
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Connection caching under various models of communicationPublished by Association for Computing Machinery (ACM) ,2000
- Review of Online Computation and Competitive Analysis by Allan Borodin and Ran EI-YanivACM SIGACT News, 1999
- Competitive analysis of randomized paging algorithmsPublished by Springer Nature ,1996
- Improving HTTP latencyComputer Networks and ISDN Systems, 1995
- An empirical evaluation of virtual circuit holding time policies in IP-over-ATM networksIEEE Journal on Selected Areas in Communications, 1995
- Thek-server dual and loose competitiveness for pagingAlgorithmica, 1994
- A strongly competitive randomized paging algorithmAlgorithmica, 1991
- New Ressults on Server ProblemsSIAM Journal on Discrete Mathematics, 1991
- Memory versus randomization in on-line algorithmsPublished by Springer Nature ,1989
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985