A SYSTEM FOR COMPUTING A TRAFFIC ENGINEERING(TE) LABEL SWITCHED PATH(LSP) THAT SPANS MULTIPLE DOMAINS OF A COMPUTER NETWORK

摘要

A method for computing a traffic engineering (TE) label switched path (LSP) that spans multiple domains of a computer network from a head-end node of a local domain, through one or more remote domains, to a tail-end node of a destination domain, characterized in requesting path segments from a path computation element (PCE) for each of the one or more remote domains and for the destination domain, the path segments representing possible paths within each remote domain between every entry border router within that domain that is in communication with an upstream domain and every exit border router within that domain that is in communication with a downstream domain and representing possible paths within the destination domain between every entry border router of the destination domain in communication with an upstream domain and the tail-end node, receiving, at one or more network interfaces of the head-end node, the path segments from the one or more PCEs, determining a local topology of the local domain combining the received path segments with the local topology to form an overall topology, and performing a path computation, by a processor of the head-end node to find the best path extending from the head-end node to the tail-end node based on the overall topology.