Patent US5629930A successfully refreshed from Google Patents.
US5629930A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Call routing in an ATM switching network
Assignee: Zarbana Digital Fund LLC
•
Filing: 1995-10-31
•
Granted: 1997-05-13
•
Expires: 2015-10-31
Abstract
Abstract A routing scheme for an ATM switching network includes a plurality of switching nodes, each of which includes individual storage for storing routing messages for each outgoing link. A call at a source node is routed through one possible routing path which requires only one or two links to complete a connection to a destination node. In such case, one of the routing paths is selected based on link state information concerning only the possible routing paths. If the call requires a route path which includes three or more links to the destination node, the source node performs a predefined sequential routing to its neighboring node before the neighboring node negotiates with selected intermediate nodes for a connection involving two links. The routing messages stored at each node are processed independently and simultaneously by each node. The main requirement is that routing decisions must be based on true link-state information. A protocol is devised for fast and efficient bulk processing while avoiding protential deadlocks.
Inventors
- 👤 Maged E. Beshai
- 👤 James Yan
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 10:01
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/12; H04L45/122; H04L45/44
Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
209 words
A method of routing a call between an originating node and a destination node in an ATM network having a plurality of nodes wherein each node stores routing information, comprising steps of: selecting candidate route paths from the originating node to the destination node; selecting direct route paths among the candidate route paths which require only one link to complete a connection for the call between the originating and destination nodes; granting the call a connection using one of the selected direct route paths whose routing information meets predetermined criteria; if no direct route paths are found, selecting two-link route paths which require two links to complete a connection for the call between the originating and destination nodes; the originating node sending connection messages to candidate middle nodes located in the selected two-link route paths; each of the middle nodes storing the connection message in a respective message queue and responding to the originating node with state information when the connection message in the queue of the middle node reaches the head of the queue; comparing the routing information given to the originating node by each candidate middle node; and granting the call a connection using one of the selected two-link route paths whose routing information meets predetermined criteria.
Claim 2
Independent Claim
209 words
A method of routing a call between an originating node and a destination node in an ATM network having a plurality of nodes wherein each node stores routing information, comprising steps of: selecting candidate route paths from the originating node to the destination node; selecting direct route paths among the candidate route paths which require only one link to complete a connection for the call between the originating and destination nodes; granting the call a connection using one of the selected direct route paths whose routing information meets predetermined criteria; if no direct route paths are found, selecting two-link route paths which require two links to complete a connection for the call between the originating and destination nodes; the originating node sending connection messages to candidate middle nodes located in the selected two-link route paths; each of the middle nodes storing the connection message in a respective message queue and responding to the originating node with state information when the connection message in the queue of the middle node reaches the head of the queue; comparing the routing information given to the originating node by each candidate middle node; and granting the call a connection using one of the selected two-link route paths whose routing information meets predetermined criteria.
Claim 3
Dependent Claim
76 words
The method of routing a call between an originating node and a destination node in an ATM network according to claim 1 wherein the routing information stored in each node comprises routing table and state information of each link emanating therefrom and the step of granting the call a connection includes a step of deciding on one of the route paths in view of the least link metrics based on the state information of each link.
Claim 4
Dependent Claim
81 words
The method of routing a call between an originating node and a destination node in an ATM network according to claim 2 wherein the originating node sends a connection message to one of the middle nodes indicating a threshold value of link metric required to complete a connection; and said one of the middle nodes completes a connection therethrough to the destination node if the link between said one of the middle nodes and the destination node meets the threshold value.
Claim 5
Dependent Claim
56 words
The method of routing a call between an originating node and a destination node in an ATM network according to claim 2 comprising a further step of imposing a time-out to each of the middle nodes of the selected two-link route paths so that after such time-out the connection message in the queue will be discarded.
Claim 6
Dependent Claim
135 words
The method of routing a call between an originating node and a destination node in an ATM network according to claim 3 wherein, if no two-link route paths are found, the method comprises further steps of: the originating node determining that the call requires three or more links to complete a connection to the destination node; the originating node selecting a link to a neighboring node according to its pre-established order of preference; the neighboring node selecting direct or two-link route paths which require one or two links to complete a connection for the call between the neighboring node and the destination node; and granting the call a connection using one of the route paths whose routing information meets a predetermined criterion in the order of the preference from a direct to two-link route paths.
Claim 7
Dependent Claim
75 words
The method of routing a call between an originating node and a destination node in an ATM network according to claim 5 wherein: each of the nodes has one message queue for each of its outgoing links and a candidate table containing a list of candidate route paths to complete connections for calls requested thereat; and each node processes its queues to respond to the originating node of each call independently from the other nodes.
Claim 8
Dependent Claim
68 words
The method of routing a call between an originating node and a destination node in an ATM network according to claim 6, wherein each node processes its queues to respond to the originating node of each call in such a way that the connection messages at the heads of the queues seek non-conflicting state information to complete the calls independently from the other queues of the same node.
Claim 9
Dependent Claim
34 words
The method of routing a call between an originating node and a destination node in an ATM network according to claim 7 wherein the queues at each node are logically partitioned in a memory.
Claim 10
Independent Claim
150 words
A method of routing a call between an originating node and a destination node in an ATM network having a plurality of nodes wherein each node having one message queue for each of its outgoing links and a candidate table containing a list of candidate route paths to complete connections for calls requested thereat, comprising each node performing independently from each other following steps of: sending connection messages for calls requested thereat to appropriate nodes; storing and processing the connection messages in its respective message queues; selecting a route path to each destination node according to the order of preference among direct route paths, two-link route paths and multiple-link route paths, respectively requiring one, two or three or more links to complete a connection from the node to the destination node of each call; and granting the call a connection using a route path whose routing parameters meet predetermined criteria.
Claim 11
Independent Claim
150 words
A method of routing a call between an originating node and a destination node in an ATM network having a plurality of nodes wherein each node having one message queue for each of its outgoing links and a candidate table containing a list of candidate route paths to complete connections for calls requested thereat, comprising each node performing independently from each other following steps of: sending connection messages for calls requested thereat to appropriate nodes; storing and processing the connection messages in its respective message queues; selecting a route path to each destination node according to the order of preference among direct route paths, two-link route paths and multiple-link route paths, respectively requiring one, two or three or more links to complete a connection from the node to the destination node of each call; and granting the call a connection using a route path whose routing parameters meet predetermined criteria.
Claim 12
Dependent Claim
124 words
The method of routing a call between an originating node and a destination node in an ATM network, according to claim 9 wherein: if no direct route paths are found, the method comprises further steps of: selecting two-link route paths and sending a connection message to middle nodes located in the selected two-link route paths; each of the middle nodes storing the connection message in a respective message queue and responding to the originating node with routing information when the connection message in its queue reaches the head of the queue; comparing the routing information given to the originating node by each middle node; and granting the call a connection using one of the selected two-link route paths whose routing information meets predetermined criteria.
Claim 13
Dependent Claim
78 words
The method of routing a call between an originating node and a destination node in an ATM network according to claim 10 wherein the originating node sends a connection message to one of the middle nodes indicating a threshold value required to complete a connection; and said one of the middle nodes completes a connection therethrough to the destination node if the link between said one of the middle nodes and the destination node meets the threshold value.
Claim 14
Dependent Claim
135 words
The method of routing a call between an originating node and a destination node in an ATM network according to claim 11 wherein: if no two-link route paths are found, the method comprises further steps of: the originating node determining that the call requires three or more links to complete a connection to the destination node; the originating node selecting a link to a neighboring node according to its preestablished order of preference; the neighboring node selecting direct or two-link route paths which require one or two links to complete a connection for the call between the neighboring node and the destination node; and granting the call a connection using one of the route paths whose routing information meets a predetermined criterion in the order of the preference from a direct to two-link route paths.
Claim 15
Dependent Claim
49 words
The method of routing a call between an originating node and a destination node in an ATM network according to claim 10 wherein the originating node sends a connection message to the middle nodes, one of which grants the call a connection after a predetermined time-out period has elapsed.
Claim 16
Dependent Claim
75 words
The method of routing a call between an originating node and a destination node in an ATM network according to claim 10 wherein each of the nodes has one message queue for each of its outgoing links and a candidate table containing a list of candidate route paths to complete connections for calls requested thereat, and each node processes its queues to respond to the originating node of each call independently from the other nodes.
Claim 17
Dependent Claim
68 words
The method of routing a call between an originating node and a destination node in an ATM network according to claim 14, wherein each node processes its queues to respond to the originating node of each call in such a way that the connection messages at the heads of the queues seek non-conflicting state information to complete the calls independently from the other queues of the same node.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-05-12 | 2000-11-11 | 2001-05-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-05-12 | 2004-11-11 | 2005-05-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-05-12 | 2008-11-11 | 2009-05-13 | $7700.00 | Window Closed / Lapsed |