Skip to main content

Advertisement

SpringerLink
Log in

Designing Connection Oriented Networks for Multi-Domain Path Resilience

  • Published:
Journal of Network and Systems Management Aims and scope Submit manuscript

Abstract

A challenge in network management and control is the ability to account for multi-domain requirements in the network planning process. Especially in Connection Oriented Networks where multi-domain path finding is a critical issue, networks need to be designed in such a manner as to restrict the possibility of erroneous inter-domain path selection. In this paper we propose per-domain topology design considerations that would leverage accurate disjoint path computations in a multi-domain environment, covering requirements of end-to-end path resiliency. In multi-domain environments state information between domains is heavily aggregated, hiding internal topology details dictated by scalability concerns, but also by restrictive domain administration policies for privacy, and security. Disjoint path finding is strongly affected by the aggregation techniques, since they do not provide information on path overlap. To handle this issue we introduce a metric, the Overlap Factor (OF), that quantifies path overlap in domains. The OF can be passed as an additional parameter of the inter-domain information exchange model to evaluate disjoint end-to-end paths. Alternatively, if domains were appropriately designed, this additional parameter might not be needed in evaluating resilient pairs of inter-domain paths. We based our recommended topology design algorithm on exploiting locally known OF values within the context of Genetic Algorithms. Extensive simulations confirm that domains designed using our proposed algorithm, result into accurate multi-domain disjoint path identification, with a high success ratio compared to networks that are designed without inter-domain considerations.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Notes

  1. Recall that backbone nodes are assumed to implement enhanced control plane functionality in terms of routing, signaling and path-finding, e.g. (G)MPLS enabled Label Switched Routers (LSRs) [2]. Our model is agnostic to data plane (transmission) technologies e.g. WDM, SDH, PBB; such considerations can be embedded within link weights, along with other network design constraints.

  2. The Barabasi-Albert’s method is a standard procedure to model intra-domain graphs, which follows the power-law [34]. We also performed a series of simulations on evaluating overlap factors towards identification of disjoint shortest paths. Apart from domain topologies generated via the power—law, we tried our algorithms on domains drawn from real ISPs topologies as reported in [35, 36]. Our experiments demonstrated that real ISP topologies lead to similar results (successful identification of inter-domain disjoint paths) as with topologies generated via the Barabasi–Albert algorithm.

References

  1. Perros, H.G.: Connection-Oriented Networks: SONET/SDH, ATM, MPLS and Optical Networks. Wiley, London (2005)

    Book  Google Scholar 

  2. Rosen, E., Viswanathan, A., Callon, R.: Multiprotocol label switching architecture. RFC 3031 (2001)

  3. Mannie E., et al.: Generalized multi-protocol label switching (GMPLS) architecture. RFC 3945 (2004)

  4. Rosen, E., Rekhter, Y.: BGP/MPLS VPNs. RFC 2547 (1999)

  5. Saltsidis, P., et al.: IEEE 802.1Qay—provider backbone bridge traffic engineering, draft 3.0, (2008) (July 18) (work in progress)

  6. Rajagopalan, B., Luciani, J., Awduche, D.: IP over optical networks: a framework. RFC 3717 (2004)

  7. Schneider, T.: ROADMs & control plane for research & educational networks, Presentation at the TERENA 2nd next generation network workshop. http://www.terena.org/activities/ngn-ws/ws2/schneider-roadm.pdf. (April 2008)

  8. Katz, D., Kompella, K., Yeung, D.: Traffic engineering (TE) extensions to OSPF version 2. RFC 3630 (2003)

  9. Awduche, D., Berger, L., Gan, D., Li, T., Srinivasan, V., Swallow, G.: RSVP-TE: extensions to RSVP for LSP tunnels. RFC 3209 (2001)

  10. Gondrand, M., Minoux, M.: Graphs and algorithms, Wiley, London (1984)

  11. Bhandari, R.: Survivable networks—algorithms for diverse routing. Kluwer, Dordrecht (1999)

    Google Scholar 

  12. Haider, A., Harris, R.: Recovery techniques in next generation networks. IEEE Commun. Surv. Tutor. 9(3), 2–17 (2007)

    Article  Google Scholar 

  13. Mohan, G., Murthy, C.S.R.: Lightpath restoration in WDM optical networks. IEEE Netw. 14(6), 24–32 (2000)

    Article  Google Scholar 

  14. Schupke, D.A., Jager, M., Hulsermann, R.: Comparison of resilience mechanisms for dynamic services in intelligent optical networks. In: Proceedings of Fourth International Workshop on Design of Reliable Communication Networks (DRCN 2003), pp. 106–113. (October 2003)

  15. Yannuzzi, M., Masip-Bruin, X., Sanchez, S., Domingo-Pascual, J., Orda, A., Sprintson, A.: On the challenges of establishing disjoint QoS IP/MPLS paths across multiple domains. IEEE Commun. Mag. 44(12), 60–66 (2006)

    Google Scholar 

  16. Lee, W.C.: Topology aggregation for hierarchical routing in ATM networks. ACM SIGCOMM Comput Commun Rev 25(2), 82–92 (1995)

    Article  Google Scholar 

  17. Tam, W., Lui, K., Uludag, S., Nahrstedt, K.: Quality-of-service routing with path information aggregation. Comp. Netw. 51(12), 3574–3594 (2007)

    Article  MATH  Google Scholar 

  18. Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addision-Wesley, Reading, MA (1989)

    MATH  Google Scholar 

  19. Holland, J.H.: Adaptation in Natural and Artificial Systems. MIT Press, Cambridge, MA (1975)

    Google Scholar 

  20. Routen, T.: Genetic algorithms and neural network approaches to local access network design. In: Proceedings of the Second International Workshop on Modeling, Analysis and Simulation on Computer and Telecommunication Systems, pp. 239–243 (1994)

  21. Sinclair, M.C.: The application of genetic algorithm to trunk network routing table optimization. In: Proceedings of 10th UK Teletraffic Symposium Performance Engineering Telecommunication Networks (1993)

  22. Potter, W.D., Pittes, R., Gillis, P., Young, J., Caramadre, J.: IDA- NET: an intelligent decision aid for battlefield communications network configuration. In: Proceedings of 8th Conference on Intelligence Applications, pp. 247–253 (1992)

  23. Uludag, S., Lui, K., Nahrstedt, K., Brewster, G.: Analysis of topology aggregation techniques for QoS routing. ACM Comput. Surv. 39(3), 7 (2007)

    Article  Google Scholar 

  24. Iwata, A., Suzuki, H., Izmailov, R., Sengupta, B.: QOS aggregation algorithms in hierarchical ATM networks. In: Proceedings of IEEE International Conference on Communications (ICC 98), vol. 1. pp. 243–248 (June 1998)

  25. Suurballe, J., Tarjan, R.: A quick method for finding shortest pairs of disjoint paths. Networks 14(2), 325–336 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  26. GÉANT2: One way delay weathermap, http://www.win-labor.dfn.de/cgi-bin/ipqos/map.pl?config=geant

  27. Li, C., McCormick, T.S., Simich-Levi, D.: The complexity of finding two disjoint paths with min-max objective function. Discrete Appl. Math. 26(1), 105–115 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  28. Buriol, L.S., Resende, M.G., Thorup, M.: Survivable IP network design with OSPF routing. ACM Netw. 49, 51–64 (2007)

    MATH  MathSciNet  Google Scholar 

  29. Ericsson, M., Resende, M.G.C., Pardalos, P.M.: A genetic algorithm for the weight setting problem in OSPF routing. J. Comb. Optim. 6, 299–333 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  30. Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J Comput 6(2), 154–160 (1994)

    MATH  Google Scholar 

  31. Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: Universal Topology Generation from a User’s Perspective. Boston University Technical Report (2001)

  32. Barábasi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)

    Google Scholar 

  33. Waxman, B.: Routing of multipoint connections. IEEE J. Sel. Areas Commun. 6(9), 1617–1622 (1988)

    Article  Google Scholar 

  34. Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the internet topology. In: Proceedings of the ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM ‘99), pp. 251–262 (September 1999)

  35. Spring, N., Mahajan, R., Wetherall, D., Anderson, T.: Measuring ISP topologies with rocketfuel. IEEE/ACM Trans. Netw. 12(1), 2–16 (February 2004)

  36. Rocketfuel maps and data. http://www.cs.washington/edu/research/networking/rocketfuel/

Download references

Acknowledgments

This work was partially supported by the Greek Research & Technology Network (GRNET) within the GN2 Project (GÉANT2) of the 6th Framework Program on Research & Technological Development, European Commission. The authors wish to express their gratitude to Afrodite Sevasti of GRNET and Dimitrios Kalogeras of NTUA for their insightful comments. Cees de Laat of the University of Amsterdam provided significant insight on network abstraction modeling.

Author information

Authors and Affiliations

  1. Network Management & Optimal Design Laboratory (NETMODE), School of Electrical & Computer Engineering, National Technical University of Athens (NTUA), Zografou, 157 73, Athens, Greece

    Angelos Lenis, Vasilis Merekoulias & Vasilis Maglaris

Authors
  1. Angelos Lenis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vasilis Merekoulias
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vasilis Maglaris
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Angelos Lenis.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lenis, A., Merekoulias, V. & Maglaris, V. Designing Connection Oriented Networks for Multi-Domain Path Resilience. J Netw Syst Manage 18, 374–394 (2010). https://doi.org/10.1007/s10922-009-9155-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10922-009-9155-z

Keywords

Search

Navigation