Abstract
The legacy networks do not open information about a management domain due to scalability, manageability and commercial reasons. Therefore, it is very hard to compute an optimal path to the destination. This study has aimed to investigate federation to build a united network led by the National Research Network for the independent management and sharing of network resources among countries. For this, ICE (Information Control Element) which manages information in each domain as a top-level PCE (Path Computation Element) which supports traffic engineering and the architecture of Global Federation Organizer which controls the ICE have been designed and applied to a multi-domain network.
This paper performs the selection of optimal path among multi-domains and optimization of end-to-end connection as well as the efficient use of resource.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bonerjee, A., Drake, J., Lang, J.P., Turner, B.: Generalized Multiprotocol Label Switching: an Overview of Routing and Management Enhancements. IEEE Commun. Magazine 39(1), 144–150 (2001)
Shaikh, A., Shin, K.: Destination-driven Routing for Low-cost Multicast. IEEE Journal on Selected Areas in Communications 15(3) (April 1997)
Cha, M., et al.: Path Protection Routing with SRLG Constraints to Support IPTV in WDM Mesh Networks. In: 25th IEEE International Conference on Computer Communications, INFOCOM 2006, pp. 1–5 (2006)
Vasseur, J., Ayyangar, A., Zhang, R.: A per-domain path computation method for establishing inter-domain traffic engineering (TE) label switched paths (LSPs). draft-ietf-ccamp-inter-domain-pd-path-comp-05 (work in progress) (2007)
Vasseur, J.P., et al.: A backward-recursive PCE-based computation (BRPC) procedure to compute shortest constrained inter-domain traffic engineering label switched paths. RFC 5441 (April)
López, V., et al.: Path computation element in telecom networks: Recent developments and standardization activities. In: Proc. of the 14th Conference on Optical Network Design and Modeling (ONDM), pp. 1–6 (2010)
Oki, E., Inoue, I., Shiomoto, K.: Path Computation Element (PCE)-based Traffic Engineering in MPLS and GMPLS networks. IEEE Communications Magazine (2008)
Ayyangar, A., Kompella, K., Vasseur, J.-P., Farrel, A.: Label Switched Path Stitching with Generalized MPLS Traffic Engineering. Internet draft (April 2007)
Seok, Y., Lee, Y., Choi, Y., Kim, C.: Explicit Multicast Routing Algorithms for Constrained Traffic Engineering. In: Proceedings of the 7th ISCC, pp. 455–461 (July 2002)
Aslam, F., Uzmi, Z.A., Farrel, A.: Interdomain Path Computation: Challenges and Solutions for Label Switched Networks. IEEE Communication Magazine (October 2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Park, J., Gil, JM., Kim, W., Park, J., Cho, H. (2015). Method of Path Computation Using National Research Network Federation. In: Park, J., Chao, HC., Arabnia, H., Yen, N. (eds) Advanced Multimedia and Ubiquitous Engineering. Lecture Notes in Electrical Engineering, vol 352. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47487-7_23
Download citation
DOI: https://doi.org/10.1007/978-3-662-47487-7_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-47486-0
Online ISBN: 978-3-662-47487-7
eBook Packages: EngineeringEngineering (R0)