Contact The DL Team Contact Us | Switch to tabbed view

top of pageABSTRACT

Consider a hierarchical network in which each node periodically issues a request for an object drawn from a fixed set of unit-size objects. Suppose further that the following conditions are satisfied: the frequency with which each node accesses each object is known; each node has a cache of known capacity; any cache can be accessed by any node; and any request is satisfied by the closest node with a copy of the desired object, at a cost proportional to the distance between the accessing node and the closest copy. In such an environment, it is desirable to fill the available cache space with copies of objects in such a way that the average access cost is minimized. We provide both exact and approximate polynomial-time algorithms for this hierarchical placement problem. Our exact algorithm is based on a reduction to min-cost flow, and does not appear to be practical for large problem sizes. Thus we are motivated to search for a faster approximation algorithm. Our main result is a simple constant-factor approximation algorithm for the hierarchical placement problem that admits an efficient distributed implementation.
Advertisements



top of pageAUTHORS



Author image not provided  Madhukar R Korupolu

No contact information provided yet.

Bibliometrics: publication history
Publication years1997-2016
Publication count25
Citation Count355
Available for download8
Downloads (6 Weeks)198
Downloads (12 Months)2,177
Downloads (cumulative)8,895
Average downloads per article1,111.88
Average citations per article14.20
View colleagues of Madhukar R Korupolu


Author image not provided  C.Greg Plaxton

No contact information provided yet.

Bibliometrics: publication history
Publication years1987-2011
Publication count69
Citation Count1,023
Available for download21
Downloads (6 Weeks)31
Downloads (12 Months)326
Downloads (cumulative)10,904
Average downloads per article519.24
Average citations per article14.83
View colleagues of C.Greg Plaxton


Author image not provided  Rajmohan Rajaraman

No contact information provided yet.

Bibliometrics: publication history
Publication years1993-2016
Publication count66
Citation Count1,081
Available for download30
Downloads (6 Weeks)75
Downloads (12 Months)504
Downloads (cumulative)23,550
Average downloads per article785.00
Average citations per article16.38
View colleagues of Rajmohan Rajaraman

top of pageREFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
RF1
T.E. Anderson, M.D. Dahlin, J.N. Neefe, D.A. Patterson, D.S. Rosselli, R.Y. Wang, Serverless network file systems, 1995.
 
RF2
B. Awerbuch, Y. Bartal, A. Fiat, Competitive distributed file allocation, May 1993.
 
RF3
B. Awerbuch, Y. Bartal, A. Fiat, Distributed paging for general networks, J. Algor., 28 (1998) 67-104.
 
RF4
B. Awerbuch, D. Peleg, Online tracking of mobile users, J. ACM, 37 (1995) 1021-1058.
 
RF5
Y. Bartal, On approximating arbitrary metrics by tree metrics, October 1996.
 
RF6
Y. Bartal, Probabilistic approximation of metric spaces and its algorithmic applications, May 1998.
 
RF7
Y. Bartal, A. Fiat, Y. Rabani, Competitive algorithms for distributed data management, J. Comput. Systems Sci., 51 (1995) 341-358.
 
RF8
M. A. Blaze, Caching in Large-Scale Distributed File Systems, Technical Report, TR-397-92, Department of Computer Science, Princeton University, January 1993, (Ph.D. thesis).
 
RF9
C.M. Bowman, P.B. Danzig, D.R. Hardy, U. Manber, M.F. Schwartz, The Harvest information discovery and access system, October 1994.
 
RF10
P. Cao, S. Irani, Cost-aware WWW proxy caching algorithms, December 1997.
 
RF11
A. Chankhunthod, P. Danzig, C. Neerdaels, M. Schwartz, K. Worrell, A hierarchical Internet object cache, January 1996.
 
RF12
M. Charikar, C. Chekuri, A. Goel, S. Guha, Rounding via trees: Deterministic approximation algorithms for group Steiner trees and k-median, May 1998.
 
RF13
G. Cornuéjols, G.L. Nemhauser, L.A. Wolsey, The uncapacitated facility location problem, in: Discrete Location Theory, Wiley, New York, 1990, pp. 119-171.
 
RF14
M.D. Dahlin, R.Y. Wang, T.E. Anderson, D.A. Patterson, Cooperative caching: Using remote client memory to improve file system performance, November 1994.
 
RF15
D. Dowdy, D. Foster, Comparative models of the file assignment problem, ACM Compu. Surv., 14 (1982) 287-313.
 
RF16
L. Fan, P. Cao, J. Almeida, A.Z. Broder, Summary cache: A scalable wide-area Web cache sharing protocol, August 1998.
 
RF17
J.S. Gwertzman, M. Seltzer, The case for geographical push-caching, May 1995.
 
RF18
A. Heddaya, S. Mirdad, WebWave: Globally load balanced fully distributed caching of hot published documents, May 1997.
 
RF19
S. Irani, Page replacement with multi-size pages and applications to Web caching, May 1997.
 
RF20
D. Karger, E. Lehman, F.T. Leighton, M. Levine, D. Lewin, R. Panigrahy, Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web, May 1997.
 
RF21
M. Korupolu, M. Dahlin, Coordinated placement and replacement for large-scale distributed caches, July 1999.
 
RF22
A. Leff, J.L. Wolf, P.S. Yu, Replication algorithms in a remote caching architecture, IEEE Trans. Parallel Distributed Systems, 4 (1993) 1185-1204.
 
RF23
C. Lund, N. Reingold, J. Westbrook, D. Yan, On-line distributed data management, in: Lecture Notes in Computer Science, 855, Springer-Verlag, New York, 1994, pp. 202-214.
 
RF24
B.M. Maggs, F. Meyer auf der Heide, B. Vöcking, M. Westermann, Exploiting locality for data management in systems of limited bandwidth, October 1997.
 
RF25
C.G. Plaxton, R. Rajaraman, A.W. Richa, Accessing nearby copies of replicated objects in a distributed environment, Theory of Comput. Systems, 32 (1999) 241-280.
 
RF26
M. Rabinovich, I. Rabinovich, R. Rajaraman, A. Aggarwal, A dynamic object replication and migration protocol for an Internet hosting service, May 1999.
 
RF27
D.B. Shmoys, É. Tardos, K. Aardal, Approximation algorithms for facility location problems, May 1997.
 
RF28
R. Tewari, M. Dahlin, H.M. Vin, J.S. Kay, Design considerations for distributed caching on the Internet, May 1999.
 
RF29
M. van Steen, F.J. Hauck, A.S. Tanenbaum, A model for worldwide tracking of distributed objects, September 1996.
 
RF30
D. Wessels, Squid Internet object cache, available at URL, http://squid.nlanr.net/Squid, January 1998.
 
RF31
D. Wessels, and, K. Claffy, Internet Cache Protocol (ICP), version 2, request for comments rfc¿2187, available at URL, http://ds.internic.net/rfc/rfc2186.txt, September 1997.
 
RF32
O. Wolfson, S. Jajodia, Y. Huang, An adaptive data replication algorithm, ACM Trans. Database Systems, 22 (1997) 255-314.
 
RF33
N.E. Young, On-line file caching, January 1998.

top of pageCITED BY

9 Citations

 
 
 
 
 
 
 

top of pageINDEX TERMS

The ACM Computing Classification System (CCS rev.2012)

Note: Larger/Darker text within each node indicates a higher relevance of the materials to the taxonomic classification.

top of pagePUBLICATION

Title Journal of Algorithms table of contents archive
Volume 38 Issue 1, Jan. 2001
Editors Zvi Galil Columbia Univ., New York, NY
David S. Johnson AT&T Lab—Research, Florham Park, NJ
Donald E. Knuth Stanford Univ., Stanford, CA
Pages 260-302
Publication Date2001-01-01 (yyyy-mm-dd)
PublisherAcademic Press, Inc. Duluth, MN, USA
ISSN: 0196-6774 doi>10.1006/jagm.2000.1129

top of pageREVIEWS


Reviews are not available for this item
Computing Reviews logo

top of pageCOMMENTS

Be the first to comment To Post a comment please sign in or create a free Web account

top of pageTable of Contents

Journal of Algorithms

Volume 38 Issue 1, Jan. 2001

Table of Contents
Foreword
Bernard M.E. Moret
Pages: 1
doi>10.1006/jagm.2000.1139
Eliminating Migration in Multi-processor Scheduling
Bala Kalyanasundaram, Kirk R Pruhs
Pages: 2-24
doi>10.1006/jagm.2000.1128

We investigate the power of migration in real-time multi-processor scheduling with preemption. We show that every collection of jobs that can be completed by some schedule S on m processors can also be completed by a nonmigratory schedule S¿ on 6m¿5 ...
expand
Wavelength Conversion in Optical Networks
Jon Kleinberg, Amit Kumar
Pages: 25-50
doi>10.1006/jagm.2000.1137

In many models of optical routing, we are given a set of communication paths in a network, and we must assign a wavelength to each path so that paths sharing an edge receive different wavelengths. The goal is to assign as few wavelengths as possible ...
expand
Cut Tree Algorithms
Andrew V Goldberg, Kostas Tsioutsiouliklis
Pages: 51-83
doi>10.1006/jagm.2000.1136

This is an experimental study of algorithms for the cut tree problem. We study the Gomory¿Hu and Gusfield algorithms as well as heuristics aimed to make the former algorithm faster. We develop an efficient implementation of the Gomory¿Hu algorithm. We ...
expand
A Small Approximately Min-Wise Independent Family of Hash Functions
Piotr Indyk
Pages: 84-90
doi>10.1006/jagm.2000.1131

In this paper we give a construction of a small approximately min-wise independent family of hash functions, i.e., a family of hash functions such that for any set of arguments X and x¿X, the probability that the value of a random function from that ...
expand
Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
Gill Barequet, Sariel Har-Peled
Pages: 91-109
doi>10.1006/jagm.2000.1127

We present an efficient O(n+1/¿4.5-time algorithm for computing a (1+¿)-approximation of the minimum-volume bounding box of n points in R3. We also present a simpler algorithm whose running time is O(nlogn+n/¿3). We give some experimental results with ...
expand
Efficient Algorithms for Petersen's Matching Theorem
Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw
Pages: 110-134
doi>10.1006/jagm.2000.1132

Petersen's theorem is a classic result in matching theory from 1891, stating that every 3-regular bridgeless graph has a perfect matching. Our work explores efficient algorithms for finding perfect matchings in such graphs. Previously, the only relevant ...
expand
Combinatorial Approximation Algorithms for Generalized Flow Problems
Jeffrey D Oldham
Pages: 135-169
doi>10.1006/jagm.2000.1130

Generalized network flow problems generalize normal network flow problems by specifying a flow multiplier ¿((v,w)) for each arc (v,w). For every unit of flow entering the arc, ¿((v,w)) units of flow exit. We present a strongly polynomial algorithm for ...
expand
Compact Routing with Minimum Stretch
Lenore J Cowen
Pages: 170-183
doi>10.1006/jagm.2000.1134

We present the first universal compact routing algorithm with maximum stretch bounded by 3 that uses sublinear space at every vertex. The algorithm uses local routing tables of size O(n2/3log4/3n) and achieves paths that are most 3 times the length of ...
expand
Median Bounds and Their Application
Alan Siegel
Pages: 184-236
doi>10.1006/jagm.2000.1138

Basic methods are given to evaluate or estimate the median for various probability distributions. These methods are then applied to determine the precise median of several nontrivial distributions, including weighted selection and the sum of heterogeneous ...
expand
Constructing Optimal Trees from Quartets
David Bryant, Mike Steel
Pages: 237-259
doi>10.1006/jagm.2000.1133

We present fast new algorithms for constructing phylogenetic trees from quartets (resolved trees on four leaves). The problem is central to divide-and-conquer approaches to phylogenetic analysis and has been receiving considerable attention from the ...
expand
Placement Algorithms for Hierarchical Cooperative Caching
Madhukar R Korupolu, C.Greg Plaxton, Rajmohan Rajaraman
Pages: 260-302
doi>10.1006/jagm.2000.1129

Consider a hierarchical network in which each node periodically issues a request for an object drawn from a fixed set of unit-size objects. Suppose further that the following conditions are satisfied: the frequency with which each node accesses each ...
expand
Balanced Aspect Ratio Trees
Christian A. Duncan, Michael T. Goodrich, Stephen Kobourov
Pages: 303-333
doi>10.1006/jagm.2000.1135

Given a set S of n points on Rd, we show, for fixed d, how to construct in O(nlogn) time a data structure we call the balanced aspect ratio (BAR) tree. A BAR tree is a binary space partition tree on S that has O(logn) depth in which every region is convex ...
expand
Papers to Appear in Forthcoming Issues
Pages: 334
doi>10.1006/jagm.2000.1156

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2016 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Reader    QuickTime    Windows Media Player    Real Player
Did you know the ACM DL App is now available?
Did you know your Organization can subscribe to the ACM Digital Library?
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder