US5831982A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for forming routing information in an ATM communication network
Assignee: TRANSPACIFIC SILICA LLC
•
Filing: 1996-12-17
•
Granted: 1998-11-03
•
Expires: 2016-12-17
Abstract
Abstract For the connection setup between output switching nodes and a target switching node of an ATM communication network consisting of subnetworks, a best route, as well as the relevant routing information, is determined such that alternate routes are also taken into account. The alternate routes are thereby loops via one or several further subnetworks to a not-yet-passed reentry node of the already-passed subnetwork. The method is particularly suited for ATM communication networks whose signaling takes place according to the PNNI protocol.
Inventors
- 👤 Heinrich Hummel
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 16:37
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/02; H04L45/04; H04L45/34
Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
220 words
A method for forming routing information in an asynchronous transfer mode (ATM) communication network consisting of switching nodes for a connection setup message from an initial switching node to a target switching node, comprising the steps of: allocating the switching nodes to subnetworks, and networking the switching nodes together via links, and unambiguously allocating the switching nodes to subnetworks according to an ascending hierarchical ordering, subnetworks of a lower order in the hierarchical ordering being allocated into further subnetworks of a next-higher order, the number of subnetworks in a higher order of subnetworks being less than the number of subnetworks in a lower order of subnetworks; taking into account all topological information regarding links within a branch of the communication network hierarchy, the branch going out from a switching node that carries out formation of the routing information in an ascending direction in relation to the communication network hierarchy; also taking into account advantageous routing loops via at least one the subnetworks of higher order and next higher order of every hierarchy level having different entry and reentry switching nodes such that links are also included in the ascending direction in relation to the communication network hierarchy by the switching node that forms the routing information; and forming routing information using at least the topological information and the routing loops.
Claim 2
Independent Claim
220 words
A method for forming routing information in an asynchronous transfer mode (ATM) communication network consisting of switching nodes for a connection setup message from an initial switching node to a target switching node, comprising the steps of: allocating the switching nodes to subnetworks, and networking the switching nodes together via links, and unambiguously allocating the switching nodes to subnetworks according to an ascending hierarchical ordering, subnetworks of a lower order in the hierarchical ordering being allocated into further subnetworks of a next-higher order, the number of subnetworks in a higher order of subnetworks being less than the number of subnetworks in a lower order of subnetworks; taking into account all topological information regarding links within a branch of the communication network hierarchy, the branch going out from a switching node that carries out formation of the routing information in an ascending direction in relation to the communication network hierarchy; also taking into account advantageous routing loops via at least one the subnetworks of higher order and next higher order of every hierarchy level having different entry and reentry switching nodes such that links are also included in the ascending direction in relation to the communication network hierarchy by the switching node that forms the routing information; and forming routing information using at least the topological information and the routing loops.
Claim 3
Dependent Claim
21 words
The method according to claim 1, wherein the switching nodes operate according to the principles of the private network node protocol.
Claim 4
Dependent Claim
26 words
The method according to claim 1, wherein the formation of routing information in the initial switching node includes the routing loops for a connection setup message.
Claim 5
Dependent Claim
24 words
The method according to claim 1, wherein formation of routing information in a transit switching node includes routing loops for a connection setup message.
Claim 6
Dependent Claim
38 words
The method according to claim 1, wherein the initial switching node and the target switching node belong to a common subnetwork, and wherein the routing information is formed with inclusion of at least one loop to other subnetworks.
Claim 7
Dependent Claim
43 words
The method according to claim 1, wherein the initial switching node and the target switching node belong to different subnetworks, and wherein the routing information is formed with inclusion of at least one loop to subnetworks of all hierarchy levels during connection setup.
Claim 8
Dependent Claim
40 words
The method according to claim 1, wherein links between subnetworks from a predetermined hierarchy level are not taken into account for the formation of the routing information with loops, in that a common allocation symbol is determined for several links.
Claim 9
Dependent Claim
57 words
The method according to claim 1, wherein the switching nodes operate according to the principles of the private network node protocol, and wherein the routing information is structured into information elements by an original ATM switching node, whereby information elements are respectively determined for a first subnetwork and for each order of subnetworks included in the route.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-11-02 | 2002-05-04 | 2002-11-03 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-11-02 | 2006-05-04 | 2006-11-03 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-11-02 | 2010-05-04 | 2010-11-03 | $7700.00 | Window Closed / Lapsed |