Planning routes and allocating identifiers to routes in a managed frame-forwarding network
AssigneeNortel Networks Limited
InventorsNigel Bragg, Paul Bottorff, David Allan, Robert Friskney, Simon Parry
Life of this patent
Estimating the term…
Loading patent…
AssigneeNortel Networks Limited
InventorsNigel Bragg, Paul Bottorff, David Allan, Robert Friskney, Simon Parry
Estimating the term…
A method is provided of planning routes and allocating route identifiers in a managed frame-forwarding network. The network comprises a plurality of nodes interconnected by links, with each node being arranged to forward data frames according to a combination of an identifier and a network address carried by a received data frame and forwarding instructions stored at the node. A first step of the method identifies a sub-set of nodes which are core nodes of the network. The remaining nodes are termed outlying nodes. A spanning tree is then built off each of the identified core nodes, with the spanning tree stopping one link short of any other core node. Each spanning tree defines a loop-free path between a core node at the root of the spanning tree and a set of outlying nodes. Connections are planned between roots of the spanning trees and a different identifier is allocated to each planned connection between a pair of spanning trees.
A method of planning routes and allocating route identifiers in a managed frame-forwarding network, the network comprising a set of nodes interconnected by links, with each node being arranged to forward data frames according to a combination of a route identifier and a network address carried by a received data frame and forwarding instructions stored at the node, the method comprising:
A method according to claim 10 wherein if a first spanning tree rooted on an ingress core node has a set of outlying nodes which are distinct from the set of outlying nodes of a second spanning tree rooted on a second ingress core node, a common route identifier can be allocated to routes from those ingress core nodes to any egress core node.
A machine-readable medium carrying instructions for causing a processor to perform a method of planning routes and allocating route identifiers in a managed frame-forwarding network, the network comprising a plurality of nodes interconnected by links, with each node being arranged to forward data frames according to a combination of a route identifier and a network address carried by a received data frame and forwarding instructions stored at the node, the method comprising:
A managed frame-forwarding network comprising:
Dependencies are inferred from the claim text.