Abstract
We propose a domain-level-based routing (DLR) algorithm for a multidomain WDM network with confidentiality constraints of interdomain connectivity and wavelength availability. This algorithm classifies all domains in the network into different groups with incremental levels according to the metrics that they are relative to the source and destination domains. The path computation is implemented in the ascending or descending direction of domain levels for domains within the determined domain set. The resultant route is calculated via the growth and pruning of an interdomain routing tree (IDRT). Three modes of growth and five modes of pruning are proposed to support the IDRT evolution. The DLR algorithm can be accomplished in a hierarchical path computation element (PCE) routing architecture, with the domain set determined and the IDRT calculated by the parent PCE and intradomain path computed by child PCEs. Simulation results indicate that the proposed DLR algorithm performs better than previous schemes in terms of blocking probability and resource utilization ratio, with slight signaling overhead and computation complexity increase.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
