M.R. Korupolu, C.G. Plaxton, and R. Rajaraman, "Placement Algorithms for Hierarchical Cooperative Caching," Proc. 10th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA '99), pp. 586-595, Jan. 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
CDN: Content Distribution Network - Peng (2003) (1 citation) (Correct)
....been developed. These suboptimal algorithms take into account the existing information from CDN, such as the workload pattern and the network topology. They provide sucient solutions with less computation cost. Object replica placement has been well studied in Web caching system. Korupolu et al. KPR99, KD99] show that the cooperation between caching nodes can improve the overall performance signi cantly. For the object replica placement issue in CDN, Kangasharju et al. KRR01] discussed a simple cost model and evaluated some heuristic approaches, and proposed an improved heuristic exploiting ....
M. Korupolu, G. Plaxton, and R. Rajaraman. Placement algorithms for hierarchical cooperative caching. In Proceedings of 10th ACM-SIAM SODA, 1999.
Do We Need Replica Placement Algorithms in Content Delivery .. - Karlsson, Mahalingam (2002) (6 citations) (Correct)
....of hours or days and can thus be much more elaborate and even centralized. The replica placement problem is an instance of the classical file allocation problem (FAP) 5] in which only algorithms that allow replicas to be created are considered. There have been a plethora of proposed RPAs [6, 7, 8, 9, 11, 12, 13, 16, 17, 20] (see [10] for an extensive analysis) for possible use in CDNs, but no direct comparison between them or with caching has been performed. The questions we would like to answer is how do the various RPAs compare, and are they any better than simple caching In this paper, we quantitatively study ....
....consider any object accesses. maxdist max i2C;j2N dist ij y ijk [6, 7, 8] dist dist ij y ijk [6, 8] Group 2: Considers read accesses to objects. so readdist j2N reads ik dist ij y ijk [6, 8, 13, 16, 17] Multiple Objects mo readdist k2K reads ik dist ij y ijk [9, 11] Table 1: The problem definitions that have been proposed in the CDN literature and investigated in this paper. ing Dist [12] is the same as popularity except that it uses distance as the cost function. Hotspot [16] is a centralized ranking heuristic that only considers accesses from clients ....
M. Korupolu, G. Plaxton, and R. Rajaraman. Placement Algorithms for Hierarchical Cooperative Caching. Journal of Algorithms, 38(1):260--302, January 2001.
A Unified Framework for Evaluating Replica Placement.. - Karlsson, Karamanolis, .. (2002) (1 citation) (Correct)
....dist ij y ijk P [16, 18] Group 2: Considers only read accesses to objects. 3) reads ik dist ij y ijk P; LC;BW [16, 18, 27, 35, 38] 4) reads ik (hr ij dist ij (1 hr ij ) dist ij dist js ) P [24, 34] Multiple Objects (5) reads ik dist ij y ijk SC;OC [20, 21] (6) P (reads ik ) t dist ij y ijk SC;BW [25, 41] 7) reads ik dist ij size k y ijk SC [4] Single Object Storage Cost (8) sc jk x jk dist ij reads ik y ijk ) LC;BW [5, 8] Multiple Objects Storage Cost (9) sc jk x jk dist ij reads ik y ....
.... local one local reads ik 5 Hotspot [35] R(no) vicinity all all reads ik 3 Fan Out Based[18, 38] R(no) indep all indep fanout j 1,2,3 2 distance [7] I(2 dist) all all all 14 l Greedy [18] M(R(yes) I(m dist) all all indep 1,2 Ranking Dist [25] R(no) local one local dist ij 6 Hierarchical [21, 41] H M(R(no) I(2 dist) child child child dist ij = max i;j dist ij 5,6 RaDaR [36, 37] Place: T(reads ik = y ijk C) local two local Delete: T( y ijk 1) local one local Awerbuch FAP [3, 6] Reads: T(reads ik C) all all all reads ik 18 Writes: R(no) all all all Dist ....
G. Korupolu, M. ad Plaxton and R. Rajaraman. Placement Algorithms for Hierarchical Cooperative Caching. In SODA: ACM-SIAM Symposium on Discrete Algorithms, pages 586--595, January 1999.
A Ramsey-type Theorem for Metric Spaces and its.. - Bartal.. (2001) (1 citation) (Correct)
.... devising algorithm for MTS on any metric space to devising an algorithm for HSTs only [BBBT97, FM00] HSTs and their probabilistic approximation of metric spaces have found many other applications in online and approximation algorithms, for example [Bar96, AA97, CCG 98, CR98, GKR00, WLB 99, KPR99, KT99, KR00, CKNlZ01, BCR01] The rst step toward obtaining a lower bound for arbitrary metric space is showing that a lower bound for HSTs implies lower bounds for arbitrary metric spaces. Metric approximation results such as those in [Bar96, Bar98] are not useful for this purpose, since the ....
Madhukar R. Korupolu, C. Greg Plaxton, and Rajmohan Rajaraman, Placement algorithms for hierarchical cooperative caching, Proceedings of the 10th Annual ACMSIAM Symposium on Discrete Algorithms, 1999, pp. 586-595.
Unknown - Madhukar Korupolu Placement Self-citation (Korupolu Plaxton) (Correct)
No context found.
M. R. Korupolu, C. G. Plaxton, and R. Rajaraman. Placement algorithms for hierarchical cooperative caching. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 586--595, January 1999.
Online Hierarchical Cooperative Caching - Xiaozhou Li Greg Self-citation (Plaxton) (Correct)
No context found.
M. R. Korupolu, C. G. Plaxton, and R. Rajaraman. Placement algorithms for hierarchical cooperative caching. Journal of Algorithms, 38:260--302, 2001.
Approximation Algorithms for NP-Hard Clustering Problems - Mettu (2002) Self-citation (Plaxton) (Correct)
....in discrete location theory for several decades. For a survey of the area, we refer the reader to the texts by Mirchandani and Francis [38] and Love et al. 33] Problems in this area have also received attention recently due to their applicability to the problem of placing resources on a network [25, 26, 27]. As mentioned in Chapter 1, we focus on the metric versions of these problems; for recent work and pointers to the literature on the general (non metric) facility 12 location and k median problem, see [47] More generally, the text by Hochbaum [18] surveys the techniques used to obtain ....
M. R. Korupolu, C. G. Plaxton, and R. Rajaraman. Placement algorithms for hierarchical cooperative caching. Journal of Algorithms, 38:260--302, 2001.
The Online Median Problem - Mettu, Plaxton (1999) (20 citations) Self-citation (Plaxton) (Correct)
....applied to other problems. The work of Indyk [8] gives a technique to achieve sublinear time bounds for various location problems through random sampling of the distance function; we would like to see if application of these techniques to our algorithms yield sublinear time bounds. Korupolu et al. [12] give an algorithm and an efficient distributed implementation for hierarchical cooperative caching in which the distance function is an ultrametric. We would like to see if the hierarchical greedy strategy can be used or extended to solve the problem for an arbitrary metric space. It would also ....
M. R. Korupolu, C. G. Plaxton, and R. Rajaraman. Placement algorithms for hierarchical cooperative caching. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 586--595, January 1999.
Building a Large and Efficient Hybrid - Peer-To-Peer Internet Caching (Correct)
No context found.
M.R. Korupolu, C.G. Plaxton, and R. Rajaraman, "Placement Algorithms for Hierarchical Cooperative Caching," Proc. 10th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA '99), pp. 586-595, Jan. 1999.
On the Optimization of Storage Capacity Allocation .. - Laoutaris.. (2003) (Correct)
No context found.
Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Placement algorithms for hierarchical cooperative caching. In: Proceedings of the 10th Annual Symposium on Discrete Algorithms (ACM-SIAM SODA). (1999) 586 -- 595
Joint Object Placement and Node Dimensioning for Internet.. - Laoutaris (2004) (Correct)
No context found.
Madhukar R. Korupolu, C. Greg Plaxton, and Rajmohan Rajaraman. Placement algorithms for hierarchical cooperative caching. In Proceedings of the 10th Annual Sympo27 -2 sium on Discrete Algorithms (ACM-SIAM SODA), pages 586 -- 595, 1999.
Distributed Selfish Replication - Laoutaris, Telelis, Zissimopoulos.. (2005) (Correct)
No context found.
Madhukar R. Korupolu, C. Greg Plaxton, and Rajmohan Rajaraman, "Placement algorithms for hierarchical cooperative caching," in Proceedings of the 10th Annual Symposium on Discrete Algorithms (ACM-SIAM SODA), 1999, pp. 586 -- 595.
Joint Object Placement and Node Dimensioning for.. - Laoutaris.. (2004) (Correct)
No context found.
Madhukar R. Korupolu, C. Greg Plaxton, and Rajmohan Rajaraman. Placement algorithms for hierarchical cooperative caching. In Proceedings of the 10th Annual Symposium on Discrete Algorithms (ACM-SIAM SODA), pages 586 -- 595, 1999.
Bounds on the Replication Cost for QoS - Karlsson, Karamanolis (2003) (Correct)
No context found.
M. Korupolu, G. Plaxton, and R. Rajaraman. Placement Algorithms for Hierarchical Cooperative Caching. Journal of Algorithms, 38(1):260--302, January 2001.
Designing Overlay Multicast Networks for Streaming - Andreev, Maggs, Meyerson.. (2003) (Correct)
No context found.
M. Korupolu, G. Plaxton, and R. Rajaraman. Placement algorithms for hierarchical cooperative caching. Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, 1999.
Online Algorithms for Network Design - Meyerson (2003) (Correct)
No context found.
M. Korupolu, G. Plaxton, and R. Rajaraman. Placement algorithms for hierarchical cooperative caching. Proceedings of 10th ACM-SIAM SODA, 1999.
Joint Object Placement and Node Dimensioning for.. - Laoutaris.. (2004) (Correct)
No context found.
Madhukar R. Korupolu, C. Greg Plaxton, and Rajmohan Rajaraman. Placement algorithms for hierarchical cooperative caching. In Proceedings of the 10th Annual Symposium on Discrete Algorithms (ACM-SIAM SODA), pages 586 -- 595, 1999.
Choosing Replica Placement Heuristics for Wide-Area Systems - Karlsson, Karamanolis (Correct)
No context found.
M. Korupolu, G. Plaxton, and R. Rajaraman. Placement Algorithms for Hierarchical Cooperative Caching. Journal of Algorithms, 38(1):260--302, January 2001.
A Framework for Evaluating Replica Placement Algorithms - Karlsson, Karamanolis.. (2002) (4 citations) (Correct)
No context found.
M. Korupolu, G. Plaxton, and R. Rajaraman, "Placement Algorithms for Hierarchical Cooperative Caching," Journal of Algorithms, vol. 38, no. 1, pp. 260--302, January 2001.
A Tight Bound on Approximating Arbitrary Metrics by Tree.. - Fakcharoenphol, Rao.. (2003) (14 citations) (Correct)
No context found.
M. R. Korupolu, C. G. Plaxton, and R. Rajaraman. Placement algorithms for hierarchical cooperative caching. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms pp. 586--595, 1999.
Choosing Replica Placement Heuristics for Wide-Area Systems - Karlsson, Karamanolis (Correct)
No context found.
M. Korupolu, G. Plaxton, and R. Rajaraman. Placement Algorithms for Hierarchical Cooperative Caching. Journal of Algorithms, 38(1):260--302, January 2001.
Choosing Replica Placement Heuristics for Wide-Area Systems - Karlsson, Karamanolis (Correct)
No context found.
M. Korupolu, G. Plaxton, and R. Rajaraman. Placement Algorithms for Hierarchical Cooperative Caching. Journal of Algorithms, 38(1):260--302, January 2001.
Joint Object Placement and Node Dimensioning for Internet.. - Laoutaris (2004) (Correct)
No context found.
Madhukar R. Korupolu, C. Greg Plaxton, and Rajmohan Rajaraman. Placement algorithms for hierarchical cooperative caching. In Proceedings of the 10th Annual Sympo27 -2 sium on Discrete Algorithms (ACM-SIAM SODA), pages 586 -- 595, 1999.
On the Sensitivity of Cooperative Caching Performance to - User Access Patterns (Correct)
No context found.
M. R. Korupolu, C. G. Plaxton, and M. Dahlin, "Placement Algorithms for Hierarchical Cooperative Caching," in ACM-SIAM Symposium on Discrete Algorithms, January 1999.
Designing Overlay Multicast Networks for Streaming - Andreev, Maggs, Meyerson.. (2003) (Correct)
No context found.
M. Korupolu, G. Plaxton, and R. Rajaraman. Placement algorithms for hierarchical cooperative caching. Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, 1999.
First 50 documents
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC