
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
41st Annual Symposium on Foundations of Computer Science
Hierarchical placement and network design problems
Redondo Beach, California
November 12November 14
ISBN: 0769508502
ASCII Text  x  
S. Guha, A. Meyerson, K. Munagala, "Hierarchical placement and network design problems," 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 603, 41st Annual Symposium on Foundations of Computer Science, 2000.  
BibTex  x  
@article{ 10.1109/SFCS.2000.892328, author = {S. Guha and A. Meyerson and K. Munagala}, title = {Hierarchical placement and network design problems}, journal ={2013 IEEE 54th Annual Symposium on Foundations of Computer Science}, volume = {0}, year = {2000}, issn = {02725428}, pages = {603}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.2000.892328}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  CONF JO  2013 IEEE 54th Annual Symposium on Foundations of Computer Science TI  Hierarchical placement and network design problems SN  02725428 SP EP A1  S. Guha, A1  A. Meyerson, A1  K. Munagala, PY  2000 KW  facility location; resource allocation; approximation theory; hierarchical systems; network synthesis; subscriber loops; cache storage; file organisation; hierarchical placement; layered network design problems; constant approximations; hierarchical caching; bounded miss rates; minimum total cost; routing demand; layered caching scenarios; combinatorial approximation; multilevel facility location problem; loadbalanced facility location problem; open facilities; access network design problem VL  0 JA  2013 IEEE 54th Annual Symposium on Foundations of Computer Science ER   
Gives constant approximations for a number of layered network design problems. We begin by modeling hierarchical caching, where the caches are placed in layers and each layer satisfies a fixed percentage of the demand (bounded miss rates). We present a constant approximation to the minimum total cost of placing the caches and to the routing demand through the layers. We extend this model to cover more general layered caching scenarios, giving a constant combinatorial approximation to the wellstudied multilevel facility location problem. We consider a facility location variant, the loadbalanced facility location problem, in which every demand is served by a unique facility and each open facility must serve at least a certain amount of demand. By combining loadbalanced facility location with our results on hierarchical caching, we give a constant approximation for the access network design problem.
Index Terms:
facility location; resource allocation; approximation theory; hierarchical systems; network synthesis; subscriber loops; cache storage; file organisation; hierarchical placement; layered network design problems; constant approximations; hierarchical caching; bounded miss rates; minimum total cost; routing demand; layered caching scenarios; combinatorial approximation; multilevel facility location problem; loadbalanced facility location problem; open facilities; access network design problem
Citation:
S. Guha, A. Meyerson, K. Munagala, "Hierarchical placement and network design problems," focs, pp.603, 41st Annual Symposium on Foundations of Computer Science, 2000
Usage of this product signifies your acceptance of the Terms of Use.