Abstract

Recently, requirements for integration of various networks, such as optical fiber networks and IP networks, are becoming stricter. To achieve this integration, generalized multiprotocol label switching (GMPLS) is now receiving more attention. The main feature of a GMPLS network is its multilayered complexity, which sometimes places a large burden on source GMPLS routers to determine the optimal routes to destinations and causes label switching path (LSP)-setup delays. To reduce this source-router burden, we propose a hierarchically distributed path computation server (HDPCS) that reduces the setup delay and conducts flexible routing depending on each GMPLS domain's or each GMPLS layer's routing policy. Because each HDPCS is allocated to each domain, including interdomains, which have several domains under them, each domain's security is also assured depending on each domain's security policy. Forwarding adjacency (FA) is introduced as one of the countermeasures against GMPLS multilayered routing problems and the OSPF routing protocol is applied to determine the end-to-end routes. Therefore, we compare the performance of the HDPCS with OSPF-based routing and demonstrate its applicability

Full Text
Paper version not known

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 call

Disclaimer: 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.