Method for path selection in a network
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Feb 21, 2006
Issued Date -
N/A
app pub date -
Jan 4, 2000
filing date -
Jan 15, 1999
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
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.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Advertisement
Advertisement
Advertisement
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully