Amortized efficiency of list update and paging rules
Communications of the ACM
A guided tour of Chernoff bounds
Information Processing Letters
On the power of randomization in online algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Journal of Algorithms
Competitive distributed file allocation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Randomized routing and sorting on fixed-connection networks
Journal of Algorithms
On the benefit of supporting virtual channels in wormhole routers
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Universal continuous routing strategies
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Universal algorithms for store-and-forward and wormhole routing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Universal O(congestion + dilation + log1+&egr;N) local control packet switching algorithms
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Distributed paging for general networks
Journal of Algorithms
Shortest-path routing in arbitrary networks
Journal of Algorithms
Caching in networks (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Exploiting Locality for Data Management in Systems of Limited Bandwidth
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Hi-index | 0.00 |
We consider distributed caching strategies for networks in a model that takes in addition to remote accesses also local accesses into account. The goal is to minimize the congestion while obeying memory capacity constraints in the network. The on-line strategies are evaluated in a competitive analysis in which their costs are compared with the cost of an optimal off-line strategy. Previous results either depend on the network size or assume that the on-line strategies have increased memory capacity constraints in comparison to an optimal off-line strategy.(MATH) Our main result is a strategy for complete networks. For each node v, we are given memory capacity m(v) and load d(v) for a remote access. The load for a local access is one. For each application concerning a set X of shared data objects, with |X| &xie; &Sgr;v m(v) / d(v), the strategy achieves a competitive ratio of[ Oleft(fracr_maxr_av cdot max_v(log(min(d(v),m(v))))right) enspace , ] w.h.p., with respect to the congestion at the nodes, where [ r_max = fracmax_v(m(v))min_v(d(v)) quad mathrmand quad r_av = fracsum_v m(v) / d(v)mathrmnumber of nodes enspace . ].Finally, an universal caching strategy for arbitrary networks is presented which is based on a simulation of the strategy for complete networks. We show that the competitive ratio of this strategy depends primary on the routing capacity and degree of the network. Examples of networks, including Cayley and edge symmetric networks, are given for which the universal caching strategy achieves efficient competitive ratios.