Abstract
Large-scale shared service hosting environments, such as content delivery networks and cloud computing, have gained much popularity in recent years. A key challenge faced by service owners in these environments is to determine the locations where service instances (e.g. virtual machine instances) should be placed such that the hosting cost is minimized while key performance requirements (e.g. response time) are assured. Furthermore, the dynamic nature of service hosting environments favors a distributed and adaptive solution to this problem. In this paper, we present an efficient algorithm for this problem. Our algorithm not only provides a worst-case approximation guarantee, but can also adapt to changes in service demand and infrastructure evolution. The effectiveness of our algorithm is evaluated though realistic simulation studies.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Wang, L., Park, K., Pang, R., Pai, V., Peterson, L.: Reliability and security in codeen content distribution network. In: Proc. USENIX (2004)
Park, K., Pai, V.: Scale and performance in the coblitz large-file distribution service. In: Proc. of NSDI (2006)
Amazon elastic computing cloud (amazon ec2), http://aws.amazon.com/ec2/
Google app engine, http://code.google.com/appengine/
Azure services platform, http://www.microsoft.com/azure/default.mspx
Tang, X., Jianliang, X.: On replica placement for qos-aware content distribution. In: Proc. of IEEE INFOCOM (2004)
Tobias, F., et al.: The effect of latency and network limitations on mmorpgs: a field study of everquest 2. In: Proc. of ACM SIGCOMM Workshop NetGame (2005)
Church, K., Greenberg, A., Hamilton, J.: On delivering embarrassingly distributed cloud services. In: ACM HotNets (2008)
Valancius, V., Laoutaris, N., Massoulie, L., Diot, C., Rodriguez, P.: Greening the internet with nano data centers. In: ACM CoNext (2009)
Laoutaris, N., et al.: Distributed placement of service facilities in large-scale networks. In: Proc. of IEEE INFOCOM (2007)
Vicari, C., Petrioli, C., Presti, F.: Dynamic replica placement and traffic redirection in content delivery networks. In: Proc. of MASCOTS (2007)
Pathan, A.-M., Buyya, R.: A taxonomy and survey of content delivery networks. Technical Report, University of Melbourne, Australia (2006)
Jelasity, M., Montresor, A., Babaoglu, O.: Gossip-based aggregation in large dynamic networks. ACM Trans. on Computer Systems 23
Bodik, P., et al.: Statistical machine learning makes automatic control practical for internet datacenters. In: Proc. of USENIX HotCloud (2009)
Pal, M., Tardos, T., Wexler, T.: Facility location with nonuniform hard capacities. In: Proceedings of FOCS (2001)
Zhang, J., Chen, B., Ye, Y.: Multi-exchange local search algorithm for capacitated facility location problem. In: Math. of Oper. Research (2004)
Frank, C., Romer, K.: Distributed facility location algorithms for flexible configuration of wireless sensor networks. In: DCOSS (2007)
Moscibroda, T., Wattenhofer, R.: Facility location: Distributed approximation. In: ACM PODC (2005)
Dabek, F., Cox, R., Kaashoek, F., Morris, R.: Vivaldi: A decentralized network coordinate system. In: ACM SIGCOMM 2004 (2004)
Francis, P., et al.: An architecture for a global internet host distance estimation service. In: IEEE INFOCOM (1999)
Gortz, S., Klose, A.: Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem. Journal of Heuristics (2007)
Gtitm homepage, http://www.cc.gatech.edu/projects/gtitm/
Ratnasamy, S., Handley, M., Karp, R., Scott, S.: Topologically-aware overlay construction and server selection. In: IEEE INFOCOM (2002)
Qiu, L., Padmandabhan, V., Geoffrey, V.: On the placement of web server replicas. In: IEEE INFOCOM (2001)
Spring, N., Mahajan, R., Wetherall, D., Anderson, T.: Measuring isp topologies with rocketfuel. IEEE/ACM Transactions on Networking, TON (2009)
Openheimer, D., Chun, B., Patterson, D., Snoeren, A., Vahdat, A.: Service placement in a shared wide-area platform. In: Proc. of USENIX (2006)
Zhu, Y., Mostafa, A.: Overlay network assignment in planetlab with netfinder. Technical Report (2006)
Szymaniak, M., Pierre, G., van Steen, M.: Latency-driven replica placement. In: Proc. of Symoposum on Applications and Internet (2005)
Karlsson, M., Karamanolis, C.: Choosing replica placement heuristics for wide-area systems. In: International Conference on Distributed Computing Systems, ICDCS (2004)
Presti, F., Bartolini, N., Petrioli, C.: Dynamic replica placement and user request redirection in content delivery networks. In: IEEE International Conference on Communications, ICC (2005)
Carrera, D., Steinder, M., Torres, J.: Utility-based placement of dynamic web application with fairness goals. In: IEEE/IFIP Network Operations and Management Symposium, NOMS (2008)
Tang, S.M., Chunqiang, Spreitzer, M., Pacifici, G.: A scalable application placement controller for enterprise data centers. In: International World Wide Web Conference (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, Q., Xiao, J., Gürses, E., Karsten, M., Boutaba, R. (2010). Dynamic Service Placement in Shared Service Hosting Infrastructures. In: Crovella, M., Feeney, L.M., Rubenstein, D., Raghavan, S.V. (eds) NETWORKING 2010. NETWORKING 2010. Lecture Notes in Computer Science, vol 6091. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12963-6_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-12963-6_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12962-9
Online ISBN: 978-3-642-12963-6
eBook Packages: Computer ScienceComputer Science (R0)