The cache location problem

By P. Krishnan, Danny Raz, Yuval Shavitt. TNET, 2000

408 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/fb7025246924e3006bc5e89d35e5c81476318a91

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Mostafa H. Ammar
2. James W. Roberts
3. George Pavlou
4. Jussi Kangasharju
5. Keith W. Ross
6. Diliang He
7. Ioannis Psaras
8. Wei Koong Chai

Citations in the corpus

• Constrained mirror placement on the Internet (2001, neutral): “00 ©2001 IEEE Algorithm 2 ( Ž -Greedy [9]) 1.”
• Probabilistic in-network caching for information-centric networks (2012, background): “Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.”
• Cache "less for more" in information-centric networks (extended version) (2012, background): “While it was shown in [10] that, in its general formulation, this class of cache location problem is intractable, we have shown in our previous work in [11] that the critical point is to cache content closer to the users regardless of their relative locations in the topology.”
• Algorithms for Assigning Substrate Network Resources to Virtual Network Components (2006, background): “The node selection and placement problem has also been studied in the context of web server replication and access network design [10]–[12].”
• Object replication strategies in content distribution networks (2002, background): “In [9] the authors consider the placement of intercepting proxies inside the network to reduce the download time.”