Skip to main content

Topological Design of Survivable IP Networks Using Metaheuristic Approaches

  • Conference paper
Quality of Service in Multiservice IP Networks (QoS-IP 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3375))

Abstract

The topological design of distributed packet switched networks consists of finding a topology that minimizes the communication costs by taking into account a certain number of constraints such as the end-to-end quality of service (e2e QoS) and the reliability. Our approach is based on the exploration of the solution space using metaheuristic algorithms (GA and TS), where candidate solutions are evaluated by solving CFA problems. We propose a new CFA algorithm, called GWFD, that is capable of assign flow and capacities under e2e QoS constraints. Our proposed approach maps the end-user performance constrains into transport-layer performance constraints first, and then into network-layer performance constraints. A realistic representation of traffic patterns at the network layer is considered as well to design the IP network. Examples of application of the proposed design methodology show the effectiveness of our approach.

This work was supported by the Italian Ministry for Education, University and Research under project TANGO. The first author was supported by a CAPES Foundation scholarship from the Ministry of Education of Brazil.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Claffy, K., Miller, G., Thompson, K.: The nature of the beast: Recent traffic measurements from an Internet backbone. In: Proceedings of INET 1998 (July 1998)

    Google Scholar 

  2. Mellia, M., Carpani, A., Lo Cigno, R.: Measuring IP and TCP behavior on Edge Nodes. In: IEEE Globecom 2002, Taipei, TW (November 2002)

    Google Scholar 

  3. Wille, E.: Design and Planning of IP Networks Under End-to-End QoS Constraints, PhD dissertation, Politecnico di Torino, Available at http://www.tlc-networks.polito.it/mellia/papers/willephd.pdf

  4. Wille, E., Garetto, M., Mellia, M., Leonardi, E., Ajmone Marsan, M.: Considering End-to-End QoS in IP Network Design. In: NETWORKS 2004, Vienna, June 13-16 (2004)

    Google Scholar 

  5. Paxson, V., Floyd, S.: Wide-Area Traffic: The Failure of Poisson Modeling. IEEE/ACM Transactions on Networking 3(3), 226–244 (1995)

    Article  Google Scholar 

  6. Gavish, B., Neuman, I.: A system for routing and capacity assignment in computer communication networks. IEEE Transactions on Communications 37(4), 360–366 (1989)

    Article  Google Scholar 

  7. Kamimura, K., Nishino, H.: An efficient method for determining economical configurations of elementary packet-switched networks. IEEE Transactions on Communications 39(2), 278–288 (1991)

    Article  Google Scholar 

  8. Cheng, K.T., Lin, F.Y.S.: Minimax End-to-End Delay Routing and Capacity Assignment for Virtual Circuit Networks. In: Proc. IEEE Globecom, pp. 2134–2138 (1995)

    Google Scholar 

  9. Garetto, M., Towsley, D.: Modeling, Simulation and Measurements of Queuing Delay under Long-tail Internet Traffic. In: ACM SIGMETRICS 2003, San Diego, CA (June 2003)

    Google Scholar 

  10. Goldberg, D.E.: Genetic Algorithm in Search, Optimization, and Machine Learning. Addison Wesley Publishing Company, Reading (1989)

    Google Scholar 

  11. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)

    MATH  Google Scholar 

  12. Gavish, B.: Topological design of computer communication networks – the overall design problem. European Journal of Operational Research 58, 149–172 (1992)

    Article  MATH  Google Scholar 

  13. Mai Hoang, T.T., Zorn, W.: Genetic Algorithms for Capacity Planning of IP-Based Networks. In: Proceedings of the 2001 Congress on Evolutionary Computation CEC 2001, pp. 1309–1315 (2001)

    Google Scholar 

  14. Gerla, M., Kleinrock, L.: On the Topological Design of Distributed Computer Networks. IEEE Transactions on Communications 25, 48–60 (1977)

    Article  MathSciNet  Google Scholar 

  15. Wright, M.: Interior methods for constrained optimization. Acta Numerica 1, 341–407 (1992)

    Article  Google Scholar 

  16. Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: Boston university representative internet topology generator, Boston University (April 2001), http://cswww.bu.edu/brite

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wille, E.C.G., Mellia, M., Leonardi, E., Ajmone Marsan, M. (2005). Topological Design of Survivable IP Networks Using Metaheuristic Approaches. In: Ajmone Marsan, M., Bianchi, G., Listanti, M., Meo, M. (eds) Quality of Service in Multiservice IP Networks. QoS-IP 2004. Lecture Notes in Computer Science, vol 3375. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30573-6_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30573-6_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24557-5

  • Online ISBN: 978-3-540-30573-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy