Constrained shortest path routing method

Details Constrained shortest path routing method Constrained shortest path routing method

H - Electricity

04

Q

H04Q 3/64 (2006.01) H04L 12/24 (2006.01) H04Q 11/04 (2006.01) H04L 12/56 (2006.01)

Patent

CA 2290026

A real-time method for routing subject to an acceptable delay constraint between nodes in high-speed data networks, such as PNNI protocol networks, uses an illustrative two-phase algorithm employing Dijkstra's algorithm at each phase. In an illustrative first phase, the Dijkstra SPF algorithm is used in seeking the shortest cumulative delay from the destination to the source, thereby generating cumulative delay labels from a node j to the destination node k. The delay results are then employed in the second phase, where the Dijkstra SPF algorithm is illustratively employed for determining administrative weight (AW) as the link metric subject to modification in accordance with results obtained in the first phase.

Affiliated with

Also associated with

Rating

Constrained shortest path routing method does not yet have a rating. At this time, there are no reviews or comments for this patent.

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

Rate now

Comments { 0 }

Profile ID: LFCA-PAI-O-1460945