Access the full text.
Sign up today, get DeepDyve free for 14 days.
J. Roux (2006)
Requirements for Path Computation Element (PCE) DiscoveryRFC, 4674
T. Saad, H. Mouftah (2004)
Inter-domain wavelength routing in optical WDM networks11th International Telecommunications Network Strategy and Planning Symposium. NETWORKS 2004,
R. Casellas, R. Martínez, R. Muñoz, S. Gunreben (2009)
Enhanced backwards recursive path computation for multi-area wavelength switched optical networks under wavelength continuity constraintJ. Opt. Commun. Netw., 1
J. Vasseur, Raymond Zhang, N. Bitar, J. Roux (2009)
A Backward-Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Constrained Inter-Domain Traffic Engineering Label Switched PathsRFC, 5441
J. Vasseur, Jean-Louis Roux (2009)
Path Computation Element (PCE) Communication Protocol (PCEP)RFC, 5440
Xin Wan, Yue Chen, Hanyi Zhang, Xiaoping Zheng (2009)
Dynamic domain-sequencing scheme for inter-domain path computation in WDM networks2009 Asia Communications and Photonics conference and Exhibition (ACP), 2009-Supplement
Richard Bradford, J. Vasseur, A. Farrel (2009)
Preserving Topology Confidentiality in Inter-Domain Path Computation Using a Path-Key-Based MechanismRFC, 5520
Qing Liu, Mehmet Kok, N. Ghani, V. Muthalaly, M. Wang (2006)
Hierarchical Inter-Domain Routing in Optical DWDM NetworksProceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications
R. Casellas, R. Martínez, R. Muñoz, S. Gunreben (2009)
Enhanced Backwards Recursive Path Computation for Multi-area Wavelength Switched Optical Networks Under Wavelength Continuity ConstraintIEEE/OSA Journal of Optical Communications and Networking, 1
(2009)
Preserving topology confidentiality in inter domain path computation using a key based mechanism, RFC 5520
Y. Rekhter, Tony Li (1994)
A Border Gateway Protocol 4 (BGP-4)RFC, 4271
(2005)
eds.): MPLS inter-autonomous system (AS) traffic engineering (TE) requirements, RFC 4216
Raymond Zhang, J. Vasseur (2005)
MPLS Inter-Autonomous System (AS) Traffic Engineering (TE) RequirementsRFC, 4216
(2010)
The application of the PCE architecture to the determination of a sequence of domains in MPLS & GMPLS, IETF draft draft-king-pce-hierarchy-fwk-04.txt
M. Chamania, Xiaomin Chen, A. Jukan, F. Rambach, M. Hoffmann (2009)
An adaptive inter-domain PCE framework to improve resource utilization and reduce inter-domain signalingOpt. Switch. Netw., 6
E. Mannie (2004)
Generalized Multi-Protocol Label Switching (GMPLS) ArchitectureRFC, 3945
A. Farrel, J. Vasseur, J. Ash (2006)
A Path Computation Element (PCE)-Based ArchitectureRFC, 4655
J. Roux, J. Vasseur, J. Boyle (2005)
Requirements for Inter-Area MPLS Traffic EngineeringRFC, 4105
Rick Murphy (2010)
Juniper Networks
The ability of computing optimal routes poses new challenges when extending it to larger multi-domain network scenarios, as the quality of these computed end-to-end inter-domain routes depends on the selection of the domain sequence to be traversed. In the scope of the Internet Engineering Task Force (IETF), the Path Computation Element (PCE) Working Group has not provided definitive solutions to address the domain sequence selection problem, being still a work in progress. To this goal, the Path Computation Flooding (PCF) approach appears as a possible extension to Backward Recursive PCE-based Computation (BRPC) to calculate optimal end-to-end inter-domain paths without requiring a pre-configured domain sequence. Nonetheless, PCF presents major scalability issues in terms of network control overhead and path computation complexity, thus pleading for more accurate domain sequence selection techniques. This paper describes two novel mechanisms to establish inter-domain paths calculating the sequence of domains to be crossed when it is not known in advance. Both procedures make a good trade-off between the control overhead introduced and the accuracy of the computed end-to-end route. The obtained simulation results show the benefits of the proposed contributions, drastically reducing the control overhead while keeping the connection blocking probability close to the optimal values.
Photonic Network Communications – Springer Journals
Published: Sep 9, 2010
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.