Skip to main content
SpringerLink
Log in

Some Distributed Approaches to the Service Facility Location Problem in Dynamic and Complex Networks

  • Chapter
  • First Online:
Handbook of Optimization in Complex Networks

Part of the book series: Springer Optimization and Its Applications ((SOIA,volume 57))

  • 2343 Accesses

Abstract

The need to efficiently accommodate over the Internet the ever exploding (user-generated) content and services, calls for the development of service placement schemes that are distributed and of low complexity. As the derivation of the optimal placement in such environments is prohibitive due to the global topology and demand requirement and the large scale and dynamicity of the environment, feasible and efficient solutions of low complexity are necessary even at the expense of non-guaranteed optimality. This chapter presents three such approaches that migrate the service along cost-reducing paths by utilizing topology and demand information that is strictly local or confined to a small neighborhood: the neighbor hopping migration requires strictly local information and guarantees optimality for topologies of unique shortest path tree; the r-hop neighborhood migration appears to be more effective for general topologies and can also address jointly the derivation of both the number and locations of services to be deployed; the generalized neighborhood migration approach opens up new possibilities in defining localities, other than topological ones, that contain the most relevant candidates for the optimal placement, by exploiting emerging metrics and structures associated with complex and social networks. The underlying assumptions, strengths, efficiency and applicability of each of these approaches are discussed and some indicative results are shown.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. P.B. Mirchandani and R.L. Francis, “Discrete Location Theory,” John Wiley and Sons, (1990).

    Google Scholar 

  2. O. Kariv, and S.L. Hakimi, “An algorithmic approach to network location problems, II: The p-medians,” SIAM Journal on Applied Mathematics, 37, 3, 539–560, (1979).

    Article  MathSciNet  MATH  Google Scholar 

  3. A. Tamir, “An O(pn) algorithm for p-median and related problems on tree graphs,” Operations Research Letters, 19:59–64, (1996).

    Article  MathSciNet  MATH  Google Scholar 

  4. D. S. Hochbaum, “Heuristics for the fixed cost median problem,” Mathematica Programming, 22:148–162, 1982.

    Article  MathSciNet  MATH  Google Scholar 

  5. S. Guha, and S. Khuller, “Greedy strikes back: improved facility location algorithms,” J. Algorithms 31 (1999) 228–248.

    Article  MathSciNet  MATH  Google Scholar 

  6. K. Jain, M. Mahdian, and A. Saberi, “A new greedy approach for facility location problems,” In Proc. ACM Symposium on the Theory of Computing (STOC’02), 2002.

    Google Scholar 

  7. K. Jain, M. Mahdian, E. Markakis, A. Saberi, and V. V. Vazirani, “Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP,” Journal of the ACM, 2003.

    Google Scholar 

  8. D. B. Shmoys, E. Tardos,, and K. Aardal, “Approximation algorithms for facility location problems,” In Proceedings of the 29th ACM Symposium on Theory of Computing, pages 265–274, 1997.

    Google Scholar 

  9. F. Chudak and D. Shmoys. Improved approximation algorithms for capacitated facility location problem. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 875–876, 1999.

    Google Scholar 

  10. M. Sviridenko, “An improved approximation algorithm for the metric uncapacitated facility location problem,” In W.J. Cook and A.S. Schulz, editors, Integer Programming and Combinatorial Optimization, Volume 2337 of Lecture Notes in Computer Science, pages 240–257, Springer, Berlin, 2002.

    Chapter  Google Scholar 

  11. K. Jain and V. V. Vazirani, “Primal-dual approximation algorithms for metric facility location and k-median problems,” in Proc of IEEE FOCS 99, New York City, NY, USA, 1999.

    Google Scholar 

  12. K. Jain and V. Vazirani, “Approximation algorithms for metric facility location and kmedian problems using the primal-dual schema and Lagrangian relaxation,” Journal of ACM, 48(2):274–296, 2001.

    Article  MathSciNet  MATH  Google Scholar 

  13. M. R. Korupolu, C. G. Plaxton, and R. Rajaraman, “Analysis of a local search heuristic for facility location problems,” Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 1–10, 1998.

    Google Scholar 

  14. V. Arya, N. Garg, R. Khandekar, K. Munagala, A. Meyerson, and V. Pandit, “Local search heuristic for k-median and facility location problems,” In Proceedings of the 33rd Annual Symposium on Theory of Computing (ACM STOC), pages 21–29. ACM Press, 2001.

    Google Scholar 

  15. J.-H. Lin, and J.S. Vitter, “Approximation Algorithms for Geometric Median Problems,” Information Processing Letters, 44:245–249, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  16. M. Charikar, S. Guha, D. B. Shmoys, and E. Tardos, “A constant factor approximation algorithm for the k-median problem,” in Proc. of ACM STOC 99, Atlanta, GA, USA, 1999, pp. 110.

    Google Scholar 

  17. I.D. Baev, and R. Rajaraman, “Approximation algorithms for data placement in arbitrary networks,” In Proceedings of the 12th Annual Symposium on Discrete Algorithms (ACM-SIAM SODA), pages 661–670, January 2001.

    Google Scholar 

  18. M. Mahdian, Y. Ye, and J. Zhang, “Improved Approximation Algorithms for Metric Facility Location Problems,” 5th International Workshop on Approximation Algorithms for Combinatorial Optimization, 2002.

    Google Scholar 

  19. M. Mahdian and M. Pal, “Universal facility location,” in Proc. of ESA 03, Budapest, Hungary, 2003, pp. 409–421.

    Google Scholar 

  20. N. Garg, R. Khandekar, and V. Pandit, “Improved approximation for universal facility location,” in Proc of ACM-SIAM SODA 05, 2005, pp. 959–960.

    Google Scholar 

  21. Thomas Moscibroda and Roger Wattenhofer, “Facility Location: Distributed Approximation,” 24th ACM Symposium on the Principles of Distributed Computing (PODC), Las Vegas, Nevada, USA, 2005.

    Google Scholar 

  22. S. Pandit and S. Pemmaraju, “Return of the primal-dual: distributed metric facility location,” 28th ACM Symposium on the Principles of Distributed Computing (PODC), Calgary, Alberta, Canada, 2009.

    Google Scholar 

  23. Lidia Yamamoto and Guy Leduc, “Autonomous Reflectors Over Active Networks: Towards Seamless Group Communication,” AISB, vol. 1, no. 1, pp. 125–146, 2001.

    Google Scholar 

  24. Michael Rabinovich and Amit Aggarwal, “RaDaR: A Scalable Architecture for a Global Web Hosting Service,” in Proc. of WWW ’99, Toronto, Canada, 1999.

    Google Scholar 

  25. Chris Chambers and Wu-chi Feng and Wu-chang Feng and Debanjan Saha, “A Geographic Redirection Service for On-line Games,” in Proc. of ACM MULTIMEDIA ’03, Berkeley, CA, USA, 2003.

    Google Scholar 

  26. Cronin, Eric and Jamin, Sugih and Jin, Cheng and Kurc, Anthony R. and Raz, Danny and Shavitt, Yuval, “Constraint Mirror Placement on the Internet,” IEEE Journal on Selected Areas in Communications, vol. 20, no. 7, 2002.

    Google Scholar 

  27. Krishnan, P. and Raz, Danny and Shavit, Yuval, “The Cache Location Problem,” IEEE/ACM Transactions on Networking, vol. 8, no. 5, pp. 568–581, 2002.

    Article  Google Scholar 

  28. David Oppenheimer and Brent Chun and David Patterson and Alex C. Snoeren and Amin Vahdat, “Service Placement in a Shared Wide-area Platform,” in Proc. of USENIX ’06, Boston, MA, 2006.

    Google Scholar 

  29. Loukopoulos, Thanasis and Lampsas, Petros and Ahmad, Ishfaq, “Continuous Replica Placement Schemes in Distributed Systems,” in Proc. of ACM ICS ’05, Boston, MA, 2005.

    Google Scholar 

  30. C. Gkantsidis, T. Karagiannis, P. Rodriguez, and M. Vojnovic, “Planet Scale Software Updates,” in Proc. of ACM SIGCOMM 06, Pisa, Italy, 2006.

    Google Scholar 

  31. D. Kostić, A. Rodriguez, J. Albrecht, and A. Vahdat, “Bullet: High Bandwidth Data Dissemination Using an Overlay Mesh,” in Proc. of SOSP 03, Bolton Landing, NY, USA, 2003.

    Google Scholar 

  32. K. Oikonomou and I. Stavrakakis, “Scalable service migration in autonomic network environments,”IEEE J.Sel. A. Commun., vol. 28, no. 1, pp. 84–94, 2010.

    Article  Google Scholar 

  33. G. Smaragdakis, N. Laoutaris, K. Oikonomou, I.Stavrakakis and A. Bestavros, “Distributed Server Migration for Scalable Internet Service Deployment,” IEEE/ACM Transactions on Networking, (to appear), 2011.

    Google Scholar 

  34. P. Pantazopoulos, M. Karaliopoulos, and I. Stavrakakis, in Scalable distributed service migration via complex networks analysis, Technical Report NKUA. (Available online), http://cgi.di.uoa.gr/~istavrak/publications.html.Cited10Mar2011

  35. D. Bertsekas, and R. Gallager, “Data networks,” 2nd edition, Prentice-Hall, Inc., 1992.

    Google Scholar 

  36. K. Oikonomou and I. Stavrakakis, “Scalable Service Migration: The Tree Topology Case,” The Fifth IFIP Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net 2006), Sicily, Italy, June 14–17, 2006.

    Google Scholar 

  37. G. Wittenburg, and J. Schiller, “A Survey of Current Directions in Service Placement in Mobile Ad-hoc Networks,” Proceedings of the Sixth Annual IEEE International Conference on Pervasive Computing and Communications (PerCom ’08), Hong Kong, 17–21 March 2008.

    Google Scholar 

  38. M. Penrose, “Random geometric graphs,” Oxford Univarsity Press Inc., 2003.

    Google Scholar 

  39. Paul Erdös and Alfred Rényi, On random graphs I, Publ. Math. Debrecen, vol. 6, pp. 290–297, 1959.

    Google Scholar 

  40. R. Albert and A. Barabási, “Statistical mechanics of complex networks,” Rev. Mod. Phys., 2002.

    Google Scholar 

  41. L. Subramanian, S. Agarwal, J. Rexford, and R. H. Katz, Characterizing the Internet Hierarchy from Multiple Vantage Points, in Proc. of IEEE INFOCOM 02, New York City, NY, 2002.

    Google Scholar 

  42. M. Naor and U. Wieder, Know Thy Neighbors Neighbor: Better Routing for Skip-Graphs and Small Worlds, in Proc. of IPTPS, 2004.

    Google Scholar 

  43. A. Medina, A. Lakhina, I. Matta, and J. Byers, BRITE: An Approach to Universal Topology Generation, in Proc. of MASCOTS 01, Cincinnati, OH, 2001.

    Google Scholar 

  44. B. M. Waxman, Routing of multipoint connections, IEEE Journal on Selected Areas in Communications, vol. 6, no. 9, pp. 16171622, 1988.

    Google Scholar 

  45. N. Faber and R. Sundaram, MOVARTO: Server Migration across Networks using Route Triangulation and DNS, in Proc. of VMworld07, San Francisco, CA, 2007.

    Google Scholar 

  46. L. C. Freeman, “A set of measures of centrality based on betweenness,” Sociometry, vol. 40, no. 1, pp. 3541, 1977.

    Google Scholar 

  47. L. C. Freeman, “Centrality in social networks: Conceptual clarification,” Social Networks, vol. 1, no. 3, pp. 215239.

    Google Scholar 

  48. P. Pantazopoulos, I. Stavrakakis, A. Passarella, and M. Conti, “Efficient social-aware content placement for opportunistic networks,” in IFIP/IEEE WONS, Kranjska Gora, Slovenia, February, 3–5 2010.

    Google Scholar 

  49. J.-J. Pansiot, P. Mrindol, B. Donnet, and O. Bonaventure, “Extracting intra-domain topology from mrinfo probing,” in Proc. Passive and Active Measurement Conference (PAM), April 2010.

    Google Scholar 

Download references

Acknowledgements

This work has been supported in part by the IST-FET project SOCIALNETS (FP7-IST-217141) and the IST-FET project RECOGNITION (FP7-IST-257756).

Author information

Authors and Affiliations

  1. Department of Informatics and Telecommunications, National & Kapodistrian University of Athens, Ilissia, 157 84, Athens, Greece

    Ioannis Stavrakakis

Authors
  1. Ioannis Stavrakakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ioannis Stavrakakis .

Editor information

Editors and Affiliations

  1. Science and Engineering, Department of Computer and Information, University of Florida, Gainesville, 3260, Florida, USA

    My T. Thai

  2. , Department of Industrial & Systems Engin, University of Florida, Weil Hall 401, Gainesville, 32611-6595, Florida, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Stavrakakis, I. (2012). Some Distributed Approaches to the Service Facility Location Problem in Dynamic and Complex Networks. In: Thai, M., Pardalos, P. (eds) Handbook of Optimization in Complex Networks. Springer Optimization and Its Applications(), vol 57. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-0754-6_14

Download citation

Publish with us

Policies and ethics

Search

Navigation