Method and system for improving the processing time of the path selection in a high speed packet switching network
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Feb 4, 1997
Grant Date -
N/A
app pub date -
Dec 12, 1994
filing date -
Dec 22, 1993
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
The routing paths between origin and destination nodes in a packet switching network are selected more efficiently by reducing the total number of links potentially visited by the routing algorithm. The path selection technique involves two phases, the first phase for principal links identification, and the second phase for selection of the best point-to-point path in the network. Principal paths are minimum hop count paths with a transmission delay less than a specified threshold. The algorithm limits the screening of the network links in the second phase to the principal links and excludes the secondary links. The exploration of a much smaller number of links has the advantage to considerably reduce the computation time required for the path selection. The fact the number of principal links is generally small compared with the total number of links potentially explored, allows to limit the additional processing time necessary in case of unsuccessful attempt.
First Claim
Family
International Classification(s)
- [Classification Symbol]
- [Patents Count]
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