Adaptive and cost-effective service placement

GLOBECOM - IEEE Global Telecommunications Conference

Volumn , Issue , 2011, Pages

  Tran, Khanh Toan ^a   Agoulmine, Nazim ^a  

^a UNIVERSITY OF EVRY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC SERVICES; FACILITY LOCATIONS; NETWORK ENVIRONMENTS; NETWORK INFRASTRUCTURE; NETWORK TOPOLOGY; OPTIMAL DYNAMICS; OPTIMAL SOLUTIONS; RESOURCE AVAILABILITY; SERVICE DEPLOYMENT;

COMMUNICATION; ELECTRIC NETWORK TOPOLOGY; LOCATION;

TELECOMMUNICATION SERVICES;

EID: 84857215957     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2011.6134019     Document Type: Conference Paper

References (20)

1. Jini. [online]. available: http://www.jini.org/.
2. Networkx library [online]. avaiable: http://networkx.lanl.gov/.
3. Salutation. [online]. available: http://www.salutation.org/.
4. Upnp. [online]. available: http://www.upnp.org/.
5. R. Bradford, E. Kotsovinos, A. Feldmann, and H. Schiöberg. Live wide-area migration of virtual machines including local persistent state. In Proceedings of the 3rd international conference on Virtual execution environments, pages 169-179. ACM, 2007.
6. S. Guha and S. Khuller. Greedy Strikes Back: Improved Facility Location Algorithms, Journal of Algorithms, 31(1):228-248, Apr. 1999. (Pubitemid 129609603)
7. D. S. Hochbaum. Heuristics for the fixed cost median problems. Mathematical Programming, 22:148-162, 1982.
8. K. Jain, M. Mahdian, and A. Saberi. A new greedy approach for facility location problems. Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, 2002.
9. M. Korupolu. Analysis of a Local Search Heuristic for Facility Location Problems. Journal of Algorithms, 37(1):146-188, Oct. 2000.
10. J. Lin and J. Vitter. Approximation algorithms for geometric median problems. Information Processing Letters, 44(5):245-249, 1992.
11. P. Louridas. Up in the Air: Moving Your Applications to the Cloud. Software, IEEE, 27(4):6, Mar. 2010.
12. M. Mahdian, E. Markakis, A. Saberi, and V. Vazirani. A greedy facility location algorithm analyzed using dual fitting. In 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation, 2001.
13. M. Mahdian, Y. Ye, and J. Zhang. Approximation Algorithms for Metric Facility Location Problems. SIAM Journal on Computing, 36(2):411, 2006.
14. G. Pallis. Cloud Computing: The New Frontier of Internet Computing. Internet Computing, IEEE, 14(5):70, Jan. 2010.
15. S. Pandit. Return of the primal-dual: distributed metric facilitylocation. In the 28th ACM symposium on Principles of distributed computing, 2009.
16. A. Pathan and R. Buyya. A taxonomy and survey of content delivery networks. Technical report. GRIDS Laboratory- University of Melbourne-Australia, 2006.
17. D. B. Shmoys, E. Tardos, and K. Aardal. Approximation algorithms for facility location problems. In Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97, pages 265-274, New York, New York, USA, 1997. ACM Press.
18. J. Veizades, E. Guttman, C. Perkins, and S. Kapman. Service location protocol. RFC2165, 1997.
19. Y. Wangli and W. Huiying. A Service Replic Distribution Scheme Based on Group Structure. In Proceedings of the 11th Joint Conference on Information Sciences (JCIS), pages 1-6. Atlantis Press, 2008.
20. Q. Zhang, J. Xiao, E. Gürses, M. Karsten, and R. Boutaba. Dynamic Service Placement in Shared Service Hosting Infrastructures. In 9th International IFIP TC 6 Networking Conference, NETWORKING'2010, number 1, pages 251-264. Springer, 2010.