US4823111A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Landmark hierarchy method for routing signals in a communications network
Assignee: Mitre Corp
•
Filing: 1988-02-22
•
Granted: 1989-04-18
•
Expires: 2008-02-22
Abstract
Abstract A hierarchy of landmarks is established for the nodes in the network. Each node is assigned at least one hierarchy level designation and has a corresponding radius. An address is assigned to each of the nodes, the address including components representing landmarks wherein each landmark represented by the address component is within the radius of the landmark represented by the next lower address component. Each node maintains a routing table for routing entries to landmarks within the radii of which a node resides. A source node chooses a path toward the highest level landmark represented by the address components of a destination node until the path reaches a node within the radius of the landmark represented by the next lower level address component. This procedure is repeated for the remaining address components.
Inventors
- 👤 Paul F. Tsuchiya
- 👤 W. Worth Kirkman
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 22:19
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/02; H04L45/04; H04L45/46
Claims Analysis
Total Claims: 5
Claim 1
Independent Claim
155 words
Method for routing signals in a communications network having plural nodes comprising: establishing a hierarchy of landmarks among the nodes, each node having at least one hierarchy level designation and corresponding radius; assigning one or more addresses to each of the nodes, the address comprising address components representing landmarks; wherein each landmark represented by the address component is within the radius of the landmark represented by the next lower address component; establishing a routing table for each node in the network, each node's routing table including routing entries to landmarks within the radii of which a node resides; using the routing table to route signals by choosing a path toward the highest level visible landmark represented by the address components until the path reaches a node within the radius of the landmark represented by the next lower level address component; and repeating this procedure for the remaining address components until the signal reaches its destination.
Claim 2
Dependent Claim
155 words
Method for routing signals in a communications network having plural nodes comprising: establishing a hierarchy of landmarks among the nodes, each node having at least one hierarchy level designation and corresponding radius; assigning one or more addresses to each of the nodes, the address comprising address components representing landmarks; wherein each landmark represented by the address component is within the radius of the landmark represented by the next lower address component; establishing a routing table for each node in the network, each node's routing table including routing entries to landmarks within the radii of which a node resides; using the routing table to route signals by choosing a path toward the highest level visible landmark represented by the address components until the path reaches a node within the radius of the landmark represented by the next lower level address component; and repeating this procedure for the remaining address components until the signal reaches its destination.
Claim 3
Dependent Claim
25 words
The method of claim 1 further including re-establishing the hierarchy of landmarks, the addresses, and the routing tables as a result of node connectivity changes.
Claim 4
Dependent Claim
146 words
Communications network comprising: a plurality of nodes, each node having at least one hierarchy level designation and corresponding radius, each node further including at least one address, the address comprising address components representing landmarks wherein each landmark represented by the address component is within the radius of the landmark represented by the next lower address component; apparatus for establishing and storing a routing table for each node in the network, each node's routing table including routing entries to landmarks within the radii of which a node resides; computing apparatus utilizing the routing table to route signals by choosing a path toward the highest level visible landmark represented by the address components until the path reaches a node within the radius of the landmark represented by the next lower level address component and repeating this procedure for the remaining address components until the signal reaches its destination.
Claim 5
Dependent Claim
146 words
Communications network comprising: a plurality of nodes, each node having at least one hierarchy level designation and corresponding radius, each node further including at least one address, the address comprising address components representing landmarks wherein each landmark represented by the address component is within the radius of the landmark represented by the next lower address component; apparatus for establishing and storing a routing table for each node in the network, each node's routing table including routing entries to landmarks within the radii of which a node resides; computing apparatus utilizing the routing table to route signals by choosing a path toward the highest level visible landmark represented by the address components until the path reaches a node within the radius of the landmark represented by the next lower level address component and repeating this procedure for the remaining address components until the signal reaches its destination.
References Cited (Backward Citations)
US4071908A
Cited
US4287592A
Cited
US4345326A
Cited
US4736363A
Cited
US4701756A
Cited
US4747100A
Cited
US4745593A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1992-04-17 | 1992-10-17 | 1993-04-18 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-04-17 | 1996-10-17 | 1997-04-18 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-04-17 | 2000-10-17 | 2001-04-18 | $7700.00 | Window Closed / Lapsed |