Calculation of layered routes in a distributed manner
AssigneeSun Microsystems, Inc.
InventorsDah Ming Chiu, Miriam C. Kadansky, Radia J. Perlman, Murat Yuksel
Life of this patent
Estimating the term…
Loading patent…
AssigneeSun Microsystems, Inc.
InventorsDah Ming Chiu, Miriam C. Kadansky, Radia J. Perlman, Murat Yuksel
Estimating the term…
A distributed system and method generate “layered routes” that reflect a layered representation of a network, which representation provides deadlock-free routes. The layered representation consists of an ordered set of layers, where each layer is a deadlock-free sub-topology of the network. In determining routes, the links used in each route are constrained to be taken from layers of non-decreasing order as the route extends from source to destination. A device that determines a better or equal cost path to a destination node with respect to its current path to that node sends a route information message to its neighbor devices. The receiver of a route information message may then accept the message and begin using the new path described by the message, or reject the message without using the new path.
A method for generating routes in a communication network having a plurality of nodes connected by a plurality of links, comprising:
A system for generating routing information for devices in a communication network having a plurality of nodes connected by a plurality of links, comprising:
A system for generating routes in a communication network having a plurality of nodes connected by a plurality of links, comprising:
A computer program product including a computer readable medium, said computer readable medium having a computer program stored thereon, said computer program for generating routing information in a communication network having a plurality of nodes connected by a plurality of links, said computer program comprising:
Dependencies are inferred from the claim text.