Qos-based shortest path routing for a hierarchical...

Details Qos-based shortest path routing for a hierarchical... Qos-based shortest path routing for a hierarchical...

H - Electricity

04

L

H04L 12/24 (2006.01) H04L 12/56 (2006.01)

Patent

CA 2344395

A router has a network topology table and a number of resource tables corresponding to network areas. In response to a user's request, one of entries of the topology table and one of the resource tables are referenced and a traversable area along the route to the destination and links of the area which satisfy a user-specified QoS value are selected. A calculation is performed on the selected links according to the Dijkstra algorithm to find a shortest path to the destination if the referenced entry indicates that the destination is in the local area of the muter. If the entry indicates otherwise, the calculation is continued until a shortest path tree is found for all area border routers of the traversable area or until the calculation terminates if that tree is not found for all such routers, and a route having an optimum QoS value is determined from the shortest path tree.

Affiliated with

Also associated with

Rating

Qos-based shortest path routing for a hierarchical... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Qos-based shortest path routing for a hierarchical..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Qos-based shortest path routing for a hierarchical... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFCA-PAI-O-1818429