Methods, systems and computer program products for end-to-end route selection in compound wide/local area networks
First Claim
1. A method for establishing a communications path having a plurality of nodes between an origin node and a destination node in a communications network, the communications network having a first branch network and a first backbone network, said first branch network operationally connectable to the first backbone network, the first backbone network having a network node, and only one of the origin node or the destination node being in the first branch network, wherein each node has tail vectors associated therewith, said method comprising the steps of:
- establishing a route between the origin node and the destination node, said route calculated by the network nodewherein said establishing step comprises the steps of;
selecting a route between the first branch network and the one of the origin node or the destination node not in the first branch network; and
modifying said selected route to expand said selected route to the one of the origin node or the destination node in the first branch network, wherein a modified selected route between said origin node and said destination node is established; and
wherein said modifying step comprises the steps of;
modifying tail vectors of the one of said origin node or said destination node in the first branch network to represent tail vectors of an intermediate node in said first branch network;
passing the modified tail vectors of the one of said origin node or said destination node in the first branch network to the network node;
receiving a selected route between the first branch network and the one of the origin node or the destination node not in the first branch network; and
adding a link to the received selected route, said added link connecting the intermediate node in the first branch network and the one of said origin node or said destination node in the first branch network.
1 Assignment
0 Petitions
Accused Products
Abstract
A route selection system, method and computer program provides a complete end-to-end communications path between an origin node and a destination node in a relatively large communications network having a number of branch networks and at least one backbone network operationally connectable to the branch network. The origin node, the destination node, or both nodes, are located in branch networks and operationally connect to standard network nodes in the backbone network by way of a branch network node. The branch network nodes may be cascaded or in parallel. The branch network node modifies the communications path selected by the standard network node. The branch network node conceals the hop between the node in the branch and itself, identifies the direction of the hop as either an uplink or a downlink, identifies itself as the control point of the resource located in the corresponding node in the branch, and includes the concealed hop information in its own tail vectors which it adds to the route. In serving the origin node, the branch network node completes the route prior to sending the route to the origin node. In serving the destination end node, the branch network node completes the route during connection setup. Connection setup may take the form of either BIND or Route Setup.
29 Citations
40 Claims
-
1. A method for establishing a communications path having a plurality of nodes between an origin node and a destination node in a communications network, the communications network having a first branch network and a first backbone network, said first branch network operationally connectable to the first backbone network, the first backbone network having a network node, and only one of the origin node or the destination node being in the first branch network, wherein each node has tail vectors associated therewith, said method comprising the steps of:
-
establishing a route between the origin node and the destination node, said route calculated by the network node wherein said establishing step comprises the steps of; selecting a route between the first branch network and the one of the origin node or the destination node not in the first branch network; and modifying said selected route to expand said selected route to the one of the origin node or the destination node in the first branch network, wherein a modified selected route between said origin node and said destination node is established; and wherein said modifying step comprises the steps of; modifying tail vectors of the one of said origin node or said destination node in the first branch network to represent tail vectors of an intermediate node in said first branch network; passing the modified tail vectors of the one of said origin node or said destination node in the first branch network to the network node; receiving a selected route between the first branch network and the one of the origin node or the destination node not in the first branch network; and adding a link to the received selected route, said added link connecting the intermediate node in the first branch network and the one of said origin node or said destination node in the first branch network. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13)
-
-
14. A method for establishing a communications path having a plurality of nodes between an origin node and a destination node in a communications network, the communications network having a first branch network and a first backbone network, said first branch network operationally connectable to the first backbone network, the first backbone network having a network node, and only one of the origin node or the destination node being in the first branch network, wherein each of said nodes has at least one tail vector associated therewith, said method comprising the steps of:
-
establishing a route between the origin node and the destination node, said route calculated by the network node; and wherein said establishing step comprises the steps of; receiving a selected route from the network node, the selected route identifying a communications path between the first branch network and the one of the origin node and the destination node not in the first branch network; modifying said selected route to expand said received selected route to the one of the origin node or the destination node in the first branch network, wherein a modified selected route between said origin node and said destination node is established; and transmitting the expanded selected route to the origin node; and wherein said receiving step is preceded by the steps of; receiving a request at a branch network node in the first branch network from one of the origin node or the destination node in the first branch network to establish a communications path between the origin node and the destination node; modifying the at least one tail vector associated with the one of the origin node or the destination node in the first branch network to include the at least one tail vector associated with the branch network node, such that the modified tail vector hides the knowledge of the link between the branch network node and the origin node or the destination node in the first branch network from the network node; and transmitting the request to establish a communications path between the origin node and the destination node, and the modified tail vector, to the network node. - View Dependent Claims (15, 16, 17, 18, 19, 20, 21, 22, 23)
-
-
24. A system for establishing a communications path having a plurality of nodes between an origin node and a destination node in a communications network, the communications network having a first branch network and a first backbone network, said first branch network operationally connectable to the first backbone network, the first backbone network having a network node, and only one of the origin node or the destination node being in the first branch network, wherein each node has tail vectors associated therewith, said system comprising:
-
means for establishing a route between the origin node and the destination node, said route calculated by the network node wherein said means for establishing comprises; means for selecting a route between the first branch network and the one of the origin node or the destination node not in the first branch network; and means for modifying said selected route to expand said selected route to the one of the origin node or the destination node in the first branch network, wherein a modified selected route between said origin node and said destination node is established; and wherein said means for modifying comprises; means for modifying tail vectors of the one of said origin node or said destination node in the first branch network to represent tail vectors of an intermediate node in said first branch network; means for passing the modified tail vectors of the one of said origin node or said destination node in the first branch network to the network node; means for receiving a selected route between the first branch network and the one of the origin node or the destination node not in the first branch network; and means for adding a link to the received selected route, said added link connecting the intermediate node in the first branch network and the one of said origin node or said destination node in the first branch network.
-
-
25. A computer program product for establishing a communications path having a plurality of nodes between an origin node and a destination node in a communications network, the communications network having a first branch network and a first backbone network, said first branch network operationally connectable to the first backbone network, the first backbone network having network node, and only one of the origin node or the destination node being in the first branch network, wherein each node has tail vectors associated therewith, said computer program product comprising:
-
a computer readable storage medium having computer readable code means embodied in said medium, said computer readable code means comprising; computer instruction means for establishing a route between the origin node and the destination node, said route calculated by the network node wherein said computer instruction means for establishing comprises; computer instruction means for selecting a route between the first branch network and the one of the origin node or the destination node not in the first branch network; and computer instruction means for modifying said selected route to expand said selected route to the one of the origin node or the destination node in the first branch network, wherein a modified selected route between said origin node and said destination node is established; and wherein said computer instruction means for modifying comprises; computer instruction means for modifying tail vectors of the one of said origin node or said destination node in the first branch network to represent tail vectors of an intermediate node in said first branch network; computer instruction means for passing the modified tail vectors of the one of said origin node or said destination node in the first branch network to the network node; computer instruction means for receiving a selected route between the first branch network and the one of the origin node or the destination node not in the first branch network; and computer instruction means for adding a link to the received selected route, said added link connecting the intermediate node in the first branch network and the one of said origin node or said destination node in the first branch network.
-
-
26. A method of providing a connection path in a node where a first endpoint of the connection path is in a branch network which is hidden from a second endpoint of the connection path, the method comprising:
-
receiving at a branch network node associated with the branch network a connection communication from one of the first or the second endpoint; incorporating revised endpoint information in the received connection communication to provide branch network node information associated with a hop between the first endpoint and the branch network node so as to provide a modified communication containing information about the connection path within the branch network and outside the branch network; and forwarding the modified communication to a next node in the connection path. - View Dependent Claims (27, 28, 29, 30)
-
-
31. A system for providing a connection path in a node where a first endpoint of the connection path is in a branch network which is hidden from a second endpoint of the connection path, comprising:
-
means for receiving at a branch network node associated with the branch network a connection communication from one of the first or the second endpoint; means for incorporating revised endpoint information in the received connection communication to provide branch network node information associated with a hop between the first endpoint and the branch network node so as to provide a modified communication containing information about the connection path within the branch network and outside the branch network; and means for forwarding the modified communication to a next node in the connection path. - View Dependent Claims (32, 33, 34, 35)
-
-
36. A computer program product for providing a connection path in a node where a first endpoint of the connection path is in a branch network which is hidden from a second endpoint of the connection path, comprising:
-
a computer readable storage medium having computer readable program code means embodied in said medium, said computer readable program code means comprising; computer readable program code means for receiving at a branch network node associated with the branch network a connection communication from one of the first or the second endpoint; computer readable program code means for incorporating revised endpoint information in the received connection communication to provide branch network node information associated with a hop between the first endpoint and the branch network node so as to provide a modified communication containing information about the connection path within the branch network and outside the branch network; and computer readable program code means for forwarding the modified communication to a next node in the connection path. - View Dependent Claims (37, 38, 39, 40)
-
Specification