A method for finding a path in a network is disclosed. The network includes a plurality of nodes and a plurality of links and each one of the plurality of nodes is coupled to at least one other of the plurality of nodes by at least one of the plurality of links. Such a method generates at least one path cost data set and accessing the path cost data set to provide the requisite path information. The path cost data set represents a path cost between a root node of the nodes and destination node of the nodes. The path begins at the root node and ends at the destination node. The generation and accessing operations are performed in such a manner that a minimum-hop path and a minimum-cost path can be determined from the at least one path cost data set. The minimum-hop path represents a path between the root node and the destination node having a minimum number of hops. The minimum-cost path represents a path between the root node and the destination node having a minimum cost.

 
Web www.patentalert.com

< Semiconductor device incorporating internal power supply for compensating for deviation in operating condition and fabrication process conditions

< Asynchronous pseudo SRAM and access method therefor

> Method and system for monitoring a selected region of an airspace associated with local area networks of computing devices

> Apparatus and methods for identifying a mailpiece using an identification code
~ 00241