Abstract
In this paper, PCE-based inter-domain path computation has been discussed. Interworking of multiple PCEs with the BRPC procedure enables not only end-to-end shortest path computation but also end-to-end diverse path computation over multiple networks. We have analyzed various PCE-based inter-domain path computation strategies using BRPC, in terms of the path computation complexity. To reduce path computation time, a simplified path computation strategy was proposed and evaluated experimentally with our prototyped PCE system. Our experimental results show good correspondence with analytical ones. The proposed strategy drastically reduced path computation time down to one-seventh in comparison with the conventional strategy.
Sign-in/Register to access full text options 
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.
