Patent US5317562A successfully refreshed from Google Patents.
US5317562A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for routing cell messages using delay
Assignee: Cisco Technology Inc
•
Filing: 1993-05-07
•
Granted: 1994-05-31
•
Expires: 2013-05-07
Abstract
Abstract A method and apparatus for use in a cell network node for initial routing and rerouting of connections to a slave node based on ordering candidate slave connections, searching existing connections for candidate best routes and validating the selected best route comparing actual route delays and available bandwidth with maximum allowable delays and loading of the candidate slave connection. The invention also provides for programmable queuing delays by controlling queue lengths and for improved justification of reassembled information using actual maximum node delays.
Inventors
- 👤 Raffaele P. Nardin
- 👤 Charles M. Corbalis
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 20:00
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/302; H04L45/02; H04L45/10; H04L45/12; H04L45/121; H04L45/22; H04L45/38; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L2012/5619; H04L2012/562
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
297 words
In a cell switching network having a multiplicity of nodes, a method of rerouting connections, each connection connecting a master node and a slave node, the master node and the slave node each being a one of the multiplicity of nodes, each connection having an associated loading and being a type of a multiplicity of types of connections accommodated by the cell switching network, the method comprising the steps of: a) identifying connections needing to be rerouted; b) ordering the connections needing to be rerouted according to their associated loading; c) selecting a selected connection from the connections needing to be rerouted and that have been ordered, the selected connection connecting a selected master node and a selected slave node; and d) rerouting the selected connection by: 1) selecting candidate routes from among working routes connecting the selected master node and the selected slave node, each candidate route having the smallest route delay in terms of a total node delay between the selected master node and the selected slave node as compared to route delays of other working routes between the selected master node and selected slave node, each candidate route having a bandwidth; 2) validating true each candidate route if the route delay of the candidate route is within a user configurable prescribed limit for the type of the selected connection and if the bandwidth of the candidate route is sufficient to accommodate the selected connection; 3) rerouting the selected connection via a one of the candidate routes that have been validated true; and 4) updating a validated route description table in the selected master node to reflect packing of the candidate route by which the selected connection has been rerouted, the validated route table including the route delay, bandwidth, and packing of each candidate route.
Claim 2
Dependent Claim
297 words
In a cell switching network having a multiplicity of nodes, a method of rerouting connections, each connection connecting a master node and a slave node, the master node and the slave node each being a one of the multiplicity of nodes, each connection having an associated loading and being a type of a multiplicity of types of connections accommodated by the cell switching network, the method comprising the steps of: a) identifying connections needing to be rerouted; b) ordering the connections needing to be rerouted according to their associated loading; c) selecting a selected connection from the connections needing to be rerouted and that have been ordered, the selected connection connecting a selected master node and a selected slave node; and d) rerouting the selected connection by: 1) selecting candidate routes from among working routes connecting the selected master node and the selected slave node, each candidate route having the smallest route delay in terms of a total node delay between the selected master node and the selected slave node as compared to route delays of other working routes between the selected master node and selected slave node, each candidate route having a bandwidth; 2) validating true each candidate route if the route delay of the candidate route is within a user configurable prescribed limit for the type of the selected connection and if the bandwidth of the candidate route is sufficient to accommodate the selected connection; 3) rerouting the selected connection via a one of the candidate routes that have been validated true; and 4) updating a validated route description table in the selected master node to reflect packing of the candidate route by which the selected connection has been rerouted, the validated route table including the route delay, bandwidth, and packing of each candidate route.
Claim 3
Dependent Claim
26 words
The method of claim 1 wherein the step of selecting candidate routes further comprises selecting from the candidate routes a candidate route having the greatest bandwidth.
Claim 4
Dependent Claim
44 words
The method of claim 1, further comprising the steps of: a) validating false each candidate route which has a route delay greater than the user configurable prescribed limit; and b) validating false each candidate route which has bandwidth insufficient to accommodate the selected connection.
Claim 5
Dependent Claim
47 words
The method of claim 1 further comprising the step of: a) if all connections needing rerouting have not been rerouted selecting another connection needing rerouting as the selected connection, the selected connection having the same route delay and the same bandwidth as the immediately previous selected connection.
Claim 6
Dependent Claim
100 words
The method of claim 1, wherein the step of validating true each candidate route comprises: a) summing node delays for all nodes between the selected master node and the selected slave node along the candidate route to determine the route delay for the candidate route; b) comparing the route delay of the candidate route to the user configurable prescribed limit for the connection type of the selected connection; and c) validating true the candidate route if the user configurable prescribed limit for the connection type of the selected connection is not exceeded by the route delay of the candidate route.
Claim 7
Dependent Claim
78 words
The method of claim 5 wherein each node in the cell switching network includes a queue for each connection type accommodated by the cell switching network, each queue having a queue length and wherein the method further comprises: a) adjusting a node delay of a node within the cell switching network by adjusting a queue length of a queue; and b) broadcasting the queue length that has been adjusted to all other nodes in the cell switching network.
Claim 8
Dependent Claim
80 words
The method of claim 6, further comprising the steps of: a) updating the validated route description table in each node automatically when a queue length is broadcast; b) for each selected connection, broadcasting the candidate route by which the selected connection has been routed to all nodes in the cell switching network; and c) updating the validated route description table in each node when the selected master node broadcasts the candidate route by which the selected connection has been rerouted.
References Cited (Backward Citations)
US4491945A
Cited
US4494230A
Cited
US4506358A
Cited
US4771425A
Cited
US4819228A
Cited
US4903261A
Cited
US4771424A
Cited
US4825206A
Cited
US4703475A
Cited
US4905233A
Cited
US5088032A
Cited
US4974224A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-05-30 | 1997-11-29 | 1998-05-31 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-05-30 | 2001-11-29 | 2002-05-31 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-05-30 | 2005-11-29 | 2006-05-31 | $7700.00 | Window Closed / Lapsed |