Amortized efficiency of list update and paging rules
Communications of the ACM
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
New results on server problems
SIAM Journal on Discrete Mathematics
Journal of Algorithms
Competitive paging and dual-guided on-line weighted caching and watching algorithms
Competitive paging and dual-guided on-line weighted caching and watching algorithms
Computer Networks and ISDN Systems
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Page replacement with multi-size pages and applications to Web caching
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Network performance effects of HTTP/1.1, CSS1, and PNG
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Online computation and competitive analysis
Online computation and competitive analysis
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Managing TCP connection under persistent HTTP
WWW '99 Proceedings of the eighth international conference on World Wide Web
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
LP-based analysis of greedy-dual-size
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Connection caching under various models of communication
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Generalized connection caching
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Memory Versus Randomization in On-line Algorithms (Extended Abstract)
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Competive Analysis of Randomized Paging Algorithms
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
An empirical evaluation of virtual circuit holding time policies in IP-over-ATM networks
IEEE Journal on Selected Areas in Communications
Caching in Web memory hierarchies
Proceedings of the 2004 ACM symposium on Applied computing
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
| Hi-index | 0.00 |
We introduce a theoretical model for connection caching. In our model each host maintains (caches) a limited number of open connections to other hosts. A request may utilize an open connection in which case it is a hit, or it may require to open a new connection in which case it is a miss. Establishment of a new connection may force termination (eviction) of another connection at each of the endpoints. The goal is to serve the request sequence with minimum number of misses. This model differs from the standard caching model as it involves many caches which affect each other: a decision to terminate a connection by one node affects the cache of another node that is forced to accept the termination. Our motivation to study the problem stems from Web applications, namely the transmission of Hyper Text Transfer Protocol (HTTP) messages over persistent Transmission Control Protocol (TCP) connections. We consider both the off-line connection caching problem where the request sequence is given in advance, and the online connection caching problem, where the algorithm has to serve a request when it arrives without knowledge of future requests. In the off-line settings we show that finding the optimal strategy is NP-hard. We also derive natural algorithms from the optimal cache replacement algorithm for standard caching and prove that the miss rate of these algorithms is within a factor of 2 from optimal. In the online setting we study several families of distributed algorithms that can be implemented by running an independent process at each node. The algorithms differ by the amount of communication which they utilize between pairs of hosts engaged in an open connection. We show optimal k-competitive deterministic algorithms that utilize one communication bit per open connection, where k is the size of the largest cache in the network. On the other hand without such communication bit the best algorithms which we describe are only (2k - 1)-competitive. We also analyze what one can gain by using randomization at different levels of allowed communication.