Distributed Placement of Service Facilities in Large-Scale Networks
暂无分享,去创建一个
Azer Bestavros | Nikolaos Laoutaris | Ioannis Stavrakakis | Georgios Smaragdakis | Konstantinos Oikonomou | Azer Bestavros | Georgios Smaragdakis | Nikolaos Laoutaris | I. Stavrakakis | K. Oikonomou
[1] S. L. HAKIMIt. AN ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS. , 1979 .
[2] Kamesh Munagala,et al. Local search heuristic for k-median and facility location problems , 2001, STOC '01.
[3] Said Salhi,et al. Discrete Location Theory , 1991 .
[4] Amin Vahdat,et al. Bullet: high bandwidth data dissemination using an overlay mesh , 2003, SOSP '03.
[5] Mohammad Mahdian,et al. Universal Facility Location , 2003, ESA.
[6] Sudipto Guha,et al. A constant-factor approximation algorithm for the k-median problem (extended abstract) , 1999, STOC '99.
[7] Naveen Garg,et al. Improved approximation for universal facility location , 2005, SODA '05.
[8] Kamesh Munagala,et al. Local Search Heuristics for k-Median and Facility Location Problems , 2004, SIAM J. Comput..
[9] Azer Bestavros,et al. Small-world characteristics of Internet topologies and implications on multicast scaling , 2006, Comput. Networks.
[10] Randy H. Katz,et al. Characterizing the Internet hierarchy from multiple vantage points , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[11] Ikolaos,et al. Distributed Placement of Service Facilities in Large-Scale Networks N , 2022 .
[12] O. Kariv,et al. An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .
[13] Bhaba R. Sarker,et al. Discrete location theory , 1991 .
[14] Ibrahim Matta,et al. BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.
[15] Albert,et al. Emergence of scaling in random networks , 1999, Science.
[16] Jianping Pan,et al. An overview of DNS-based server selections in content distribution networks , 2003, Comput. Networks.
[17] I. Stavrakakis,et al. Scalable Service Migration : The Tree Topology Case , 2006 .
[18] Steven H. Low,et al. High-density model for server allocation and placement , 2002, SIGMETRICS '02.
[19] Azer Bestavros,et al. Small-World Internet Topologies: Possible Causes and Implications on Scalability of End-System Multicast , 2002 .
[20] Moni Naor,et al. Know Thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds , 2004, IPTPS.
[21] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[22] BERNARD M. WAXMAN,et al. Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..
[23] Christos Gkantsidis,et al. Planet scale software updates , 2006, SIGCOMM '06.
[24] Guy Leduc,et al. Autonomous Reflectors over Active Networks: Towards Seamless Group Communication , 2001 .
[25] Vijay V. Vazirani,et al. Primal-dual approximation algorithms for metric facility location and k-median problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[26] Bernhard Plattner,et al. Density-Based vs. Proximity-Based Anycast Routing for Mobile Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[27] Rajmohan Rajaraman,et al. Analysis of a local search heuristic for facility location problems , 2000, SODA '98.
[28] Sudipto Guha,et al. A constant-factor approximation algorithm for the k-median problem (extended abstract) , 1999, STOC '99.
[29] Roger Wattenhofer,et al. Facility location: distributed approximation , 2005, PODC '05.
[30] Amit Aggarwal,et al. RaDaR: A Scalable Architecture for a Global Web Hosting Service , 1999, Comput. Networks.