Skip to main content
Have a personal or library account? Click to login
Anycasting in connection-oriented computer networks: Models, algorithms and results Cover

Anycasting in connection-oriented computer networks: Models, algorithms and results

International Journal of Applied Mathematics and Computer Science
Volume 20 (2010): Issue 1 (March 2010)
By:   
Open Access
|Mar 2010
References

References

  1. Awerbuch, B., Brinkmann, A. and Scheideler, C. (2003). Anycasting in adversarial systems: Routing and admission control,J.C.M. Baeten, J.K. Lenstra, J. Parrow and G.J. Woeginger (Eds),, Lecture Notes in Computer Science, Vol. 2719, Springer-Verlag, Berlin, pp. 1153-1168.
    Open DOISearch in Google Scholar
  2. Baentsch, M., Baum, L., Molter, G., Rothkugel, S. and Sturm, P. (1997). World wide web caching: The application-level view of the internet,(6): 170-178.
    Open DOISearch in Google Scholar
  3. Bagula, B., Botha, M. and Krzesinski, A. (2004). Online traffic engineering: The least interference optimization algorithm,, pp. 1232-1236.
    Search in Google Scholar
  4. Ballani, H. and Francis, P. (2005). Towards a global IP anycast service,, pp. 301-312.
    Search in Google Scholar
  5. Burns, J., Ott, T., Krzesinski, A. and Muller, K. (2003). Path selection and bandwidth allocation in MPLS networks,(2): 133-152.
    Open DOISearch in Google Scholar
  6. Byun, S. and Yoo, C. (2008). Minimum DVS gateway deployment in DVS-based overlay streaming,(3): 537-550.
    Open DOISearch in Google Scholar
  7. Doi, S., Ata, S., Kitamura, K. and Murata, M. (2004). IPv6 anycast for simple and effective service-oriented communications,(5): 166-171.
    Open DOISearch in Google Scholar
  8. Fratta, L., Gerla, M. and Kleinrock, L. (1973). The flow deviation method: An approach to store-and-forward communication network design,(2): 97-133.
    Open DOISearch in Google Scholar
  9. Gavish, B. and Huntler, S. (1983). An algorithm for optimal route selection in SNA networks,(10): 1154-1160.
    Open DOISearch in Google Scholar
  10. Grover, W. (2004)., Prentice-Hall PTR, Upper Saddle River, NJ.
    Search in Google Scholar
  11. Guha, S., Meyerson, A. and Munagala, K. (2001). Improved approximation algorithms for fault tolerant facility location,, pp. 636-641.
    Search in Google Scholar
  12. Hao, F., Zegura, E. and Ammar, M. (2002). QoS routing for anycast communications: Motivation and an architecture for DiffServ networks,(6): 48-56.
    Open DOISearch in Google Scholar
  13. Herzberg, M., Bye, S. and A. Utano (1995). The hop-limit approach for spare-capacity assignment in survivable networks,(6): 775-784.
    Open DOISearch in Google Scholar
  14. Hofmann, M. and Beaumont, L. (2005)., Morgan Kaufmann, San Francisco, CA.
    Search in Google Scholar
  15. Holmberg, K. (1995). Lagrangean heuristics for linear cost multicommodity network flow problems,, Department of Mathematics, Linköping Institute of Technology, Linköping.
    Search in Google Scholar
  16. Holmberg, K. and Yuan, D. (1998). A Lagrangean approach to network design problems,(6): 529-539.
    Open DOISearch in Google Scholar
  17. Holmberg, K. and Yuan, D. (2000). A Lagrangean heuristic based branch-and-bound approach for the capacitated network design problem,(3): 461-481.
    Open DOISearch in Google Scholar
  18. Hou, Y., Yi, S. and Sherali, H. (2006). Optimal base station selection for anycast routing in wireless sensor networks,(3): 813-821.
    Open DOISearch in Google Scholar
  19. Hyytia, E. (2004). Heuristic algorithms for the generalized routing and wavelength assignment problem,, pp. 373-386.
    Search in Google Scholar
  20. Jain, K., Mahdin, M. and Saberi, A. (2002). A new greedy approach for facility location problems,, pp. 731-740.
    Search in Google Scholar
  21. Kar, K., Kodialam, M. and Lakshman, T. (2000). Minimum interference routing of bandwidth guaranteed tunnels with mpls traffic engineering applications,(12): 2566-2579.
    Open DOISearch in Google Scholar
  22. Kasprzak, A. (2001)., Wrocław University of Technology Press, Wrocław.
    Search in Google Scholar
  23. Kleinrock, L. (1964)., McGraw-Hill, New York, NY.
    Search in Google Scholar
  24. Krishnan, P., Raz, D. and Shavitt, Y. (2000). The cache location problem,(5): 568-582.
    Open DOISearch in Google Scholar
  25. Leuf, B. (2002)., Addison Wesley, Boston, MA.
    Search in Google Scholar
  26. Li, B., Golin, M., B., Italiano, Deng, X. and Sohraby, K. (1999). On the optimal placement of web proxies in the internet,, pp. 1282-1290.
    Search in Google Scholar
  27. Markowski, M. and Kasprzak, A. (2005). An approximate algorithm for web replica allocation and topology assignment problem in WAN,
    Search in Google Scholar
  28. Murakami, K. and Kim, H. (1996). Virtual path routing for survivable ATM networks,(2): 22-39.
    Open DOISearch in Google Scholar
  29. Paxson, V. (2006). End-to-end routing behavior in the Internet,(5): 41-46.
    Open DOISearch in Google Scholar
  30. Peng, G. (2004). CDN: Content distribution network,, Computing Research Repository
    Search in Google Scholar
  31. Perros, H. (2005)., John Wiley and Sons, Ltd, Chichester.
    Open DOISearch in Google Scholar
  32. Piro, M. and Medhi, D. (2004)., Morgan Kaufman Publishers, San Francisco, CA.
    Open DOISearch in Google Scholar
  33. Qiu, L., Padmanabhan, V. and Voelker, G. (2001). On the placement of web server replicas,, pp. 1587-1596.
    Search in Google Scholar
  34. Rabinovich, M. (1998). Issues in web content replication,(4): 21-29.
    Search in Google Scholar
  35. Rexford, J., Wang, J., Xiao, Z. and Hang, Y. (2002). BGP routing stability of popular destinations,, pp. 197-202.
    Search in Google Scholar
  36. Rosen, E., Viswanathan, A. and Callon, R. (2001). Multiprotocol label switching architecture,, Internet Engineering Task Force
    Search in Google Scholar
  37. Ryba, P. and Kasprzak, A. (2006). The gateways location and capacity assignment problem in hierarchical WANs: An approximate algorithm and computational results,, pp. 46-51.
    Search in Google Scholar
  38. Steinmetz, R. and Wehrle, K. (2005)., Lecture Notes in Computer Science, Vol. 3485, Springer-Verlag, Berlin.
    Search in Google Scholar
  39. Szeto, W., Boutaba, R. and Iraqi, Y. (2002). Dynamic online routing algorithm for MPLS traffic engineering,E. Gregori, M. Conti, A.T. Cambell, G. Omidyar and M. Zukerman,, Lecture Notes in Computer Science, Vol. 2345, Springer-Verlag, Berlin, pp. 936-946.
    Open DOISearch in Google Scholar
  40. Tang, M., Jia, W., Wang, H. and Wang, J. (2003). Routing and wavelength assignment for anycast in WDM networks,, pp. 301-306.
    Search in Google Scholar
  41. Walkowiak, K. (2004). A new method of primary routes selection for local restoration,N. Mitrou, K. Kontovasilis, G. Rouskas, I. Iliadis and L. Merakos, (Eds),, Lecture Notes in Computer Science, Vol. 3042, Springer-Verlag, Berlin, pp. 1024-1035.
    Open DOISearch in Google Scholar
  42. Walkowiak, K. (2005). QoS dynamic routing in content delivery network,R. Boutaba, K. Almeroth, R. Puigjaner, S. Shen and J.P. Black (Eds),, Lecture Notes in Computer Science, Vol. 3462, Springer-Verlag, Berlin, pp. 1120-1132.
    Open DOISearch in Google Scholar
  43. Walkowiak, K. (2006). A new function for optimization of working paths in survivable MPLS networks,A. Levi, E. Savas, H. Yenign, S. Balcisoy and Y. Saygin (Eds),, Lecture Notes in Computer Science, Vol. 4263, Springer-Verlag, Berlin, pp. 424-433.
    Open DOISearch in Google Scholar
  44. Walkowiak, K. (2007a). Anycast communication—A new approach to survivability of connection-oriented networks,V. Gorodetsky, I. Kotenko and V. Skormin (Eds),, Communications in Computer and Information Science, Vol. 4236, Springer-Verlag, Berlin, pp. 378-389.
    Search in Google Scholar
  45. Walkowiak, K. (2007b). Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks,(2): 119-141.
    Open DOISearch in Google Scholar
  46. Walkowiak, K. (2007c). Survivable routing of unicast and anycast flows in MPLS networks,, pp. 72-79.
    Open DOISearch in Google Scholar
  47. Walkowiak, K. (2008). A flow deviation algorithm for joint optimization of unicast and anycast flows in connection-oriented networks,O. Gervasi, B. Murgante, A. Laganà, D. Taniar, Y. Mun and M. Gavrilova,, Lecture Notes in Computer Science, Vol. 5073, Springer-Verlag, Berlin, pp. 797-807.
    Open DOISearch in Google Scholar
  48. Woźniak, M., Kurzyński, M. and Puchała, E. (1999). Intelligent internet databases for family doctor practise,(2): 1410-1411.
    Search in Google Scholar
DOI: https://doi.org/10.2478/v10006-010-0015-5 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Journal RSS Feed
Language: English
Page range: 207 - 220
Published on: Mar 25, 2010
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
anycasting,
connection-oriented networks,
optimization,
MPLS,
survivability
Related subjects:
Mathematics,
Applied mathematics

© 2010 Krzysztof Walkowiak, published by University of Zielona Góra
This work is licensed under the Creative Commons License.

Volume 20 (2010): Issue 1 (March 2010)
Previous article