Inter-Domain Path Computation using Improved Crankback Signaling in Label Switched Networks

—For label switched networks, such as MPLS and GMPLS, most existing traffic engineering (TE) solutions work in a single routing domain. These solutions do not work when a route from the ingress node to the egress node leaves the routing area or the autonomous system (AS) of the ingress node. In such cases, the path computation problem becomes complicated because of the unavailability of the complete routing information throughout the network. We present CWS (computation while switching), a new inter-domain path computation scheme which tries to compute a near-optimal path without assuming the availability of complete topology information. We provide a detailed comparison of the CWS scheme with another per-domain path computation scheme given in [1]. Unlike the standard per-domain path computation scheme [1], the CWS scheme continues the quest for a better path instead of terminating the search at the first available path, resulting a significant improvement in terms of path optima...

• Type: Conference
• Year: 2007
• Where: ICC
• Authors: Faisal Aslam, Zartash Afzal Uzmi, Adrian Farrel, Michal Pióro
• Keywords: Communications, CWS Scheme, ICC 2007, Path Computation, Path Computation Scheme