Routing in a private network with compression
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Jun 21, 2005
Grant Date -
N/A
app pub date -
Jul 30, 1999
filing date -
Aug 6, 1998
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
The invention concerns a method of routing between a source node and a destination node in a network having nodes connected by links, compression being used on at least one of said links, the method comprising at least two routing calculation steps for a given number of compressions, i.e. in a plane P(v). A routing calculation step for a given number of compressions uses information obtained during a routing calculation step for a number of compressions less than said given number. In this way a cost function can be minimized whilst assuring that in the route obtained the total number of compressions remains less than a maximum value. The route can be calculated for a given number of compressions using the Dijkstra algorithm and verifying the number of compressions when adding a node to the route. In this case, on reaching a link for which the given number of compressions is exceeded, the distance to the source node is saved for a subsequent calculation step.
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