Dynamic algorithms for shortest path tree computation

Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing – Alternate path routing

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

709240, 709242, G06F 15173

Patent

active

060981075

ABSTRACT:
Method for computing a shortest path tree structure for nodes in an interconnected network comprising the steps of maintaining a data structure T consisting of a set of edges e interconnecting the plurality of nodes in the network, each node having an associated parent node and distance value attributes; determining a weight change .DELTA. of an edge; obtaining a set of candidate nodes having associated parent and distance attributes that are affected by the weight change; selecting a node of the set of candidate nodes; identifying one or more descendents of the selected node and calculating a new distance attribute for each of the one or more descendents; searching for other nodes connected to the one or more identified descendent nodes and determining whether they should be included in the data structure T; and, repeating the selecting, identifying, calculating, searching and determining steps until all nodes of the set of candidate nodes are selected to update the data structure T.

REFERENCES:
patent: 4905233 (1990-02-01), Cain et al.
patent: 4987536 (1991-01-01), Humblet
patent: 5570466 (1996-10-01), Oechsle
patent: 5872773 (1999-02-01), Katzela et al.
patent: 5881243 (1999-03-01), Zaumen et al.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Dynamic algorithms for shortest path tree computation does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dynamic algorithms for shortest path tree computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic algorithms for shortest path tree computation will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-673748

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.