System and Method for Computing Inter-Domain Shortest Constrained Path in a Computer Network

摘要

System and method for computing inter-domain shortest constrained path or optimal path across unknown sequence of domains is described. The method comprises of sending a request by a path computation client (PCC) to a path computation element (PCE) serving an ingress domain; forwarding the request by the path computation element to each adjacent path computation elements (PCEs), each adjacent path computation element serving one or more domains, wherein said domains are non-traversed; forwarding the request by each adjacent path computation elements to next adjacent path computation element until a response is received from the path computation element of the domain having a destination node; computing the virtual shortest path tree path by each adjacent path computation element based on the response received; and selecting the optimal path from the virtual shortest path tree between the PCC and the destination node by the path computation element serving the ingress domain.