US5933425A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Source routing for connection-oriented network with repeated call attempts for satisfying user-specified QOS parameters
Assignee: NEC Corp
•
Filing: 1996-12-03
•
Granted: 1999-08-03
•
Expires: 2016-12-03
Abstract
Abstract In a connection-oriented network where ATM nodes are interconnected by links, periodically updated link status information of the network is stored in a database to indicate resource constraints of the network links. Responsive to a connection request specifying multiple QOS parameters, a first path to a destination is selected and a first signaling message is transmitted containing routing data of the first path toward the destination if resource constraints of the first path satisfy all the specified QOS parameters. If the transmission of the first signaling message is unsuccessful or the resource constraints of the first path do not satisfy all the specified QOS parameters, then a second path to the destination is selected according to contents of the database that correspond to one of the specified QOS parameters, and a second signaling message containing routing data of the second path is transmitted toward the destination.
Inventors
- 👤 Atsushi Iwata
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 11:15
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/12; H04L45/02; H04L45/03; H04L45/302
Claims Analysis
Total Claims: 19
Claim 1
Independent Claim
190 words
A routing apparatus for a connection-oriented network comprising a plurality of nodes interconnected by communication links, the routing apparatus comprising: a database for storing periodically updated link status information of the network indicating resource constraints of the links; and control means, responsive to a connection request specifying a plurality of QOS (quality of service) parameters, for performing the functions of: selecting a first path to a destination; transmitting a first signaling message containing routing data of the first path toward the destination if resource constraints of the first path satisfy all the specified QOS parameters; selecting one of the specified OOS parameters; determining a plurality of candidate paths to the destination using resource constraints of the database corresponding to the selected QOS parameter; selecting an optimum one of the candidate paths as a second path if the transmission of the first signaling message is unsuccessful or the resource constraints of the first path do not satisfy all the specified QOS parameters; and transmitting a second signaling message containing routing data of the second path toward the destination if resource constraints of the second path satisfy all other specified OOS parameters.
Claim 2
Dependent Claim
190 words
A routing apparatus for a connection-oriented network comprising a plurality of nodes interconnected by communication links, the routing apparatus comprising: a database for storing periodically updated link status information of the network indicating resource constraints of the links; and control means, responsive to a connection request specifying a plurality of QOS (quality of service) parameters, for performing the functions of: selecting a first path to a destination; transmitting a first signaling message containing routing data of the first path toward the destination if resource constraints of the first path satisfy all the specified QOS parameters; selecting one of the specified OOS parameters; determining a plurality of candidate paths to the destination using resource constraints of the database corresponding to the selected QOS parameter; selecting an optimum one of the candidate paths as a second path if the transmission of the first signaling message is unsuccessful or the resource constraints of the first path do not satisfy all the specified QOS parameters; and transmitting a second signaling message containing routing data of the second path toward the destination if resource constraints of the second path satisfy all other specified OOS parameters.
Claim 3
Independent Claim
204 words
A method for routing a call through a connection-oriented network comprising a plurality of nodes interconnected by communication links, the method comprising the steps of: a) storing link status information of the network and periodically updating the stored information according to link status of the network, the link status information indicating resource constraints of the links; b) responsive to a connection request specifying a plurality of QOS (quality of service) parameters, selecting a first path to a destination; c) transmitting a first signaling message toward the destination containing routing data of the first path if resource constraints of the first path satisfy all the specified QOS parameters; d) selecting one of the specified OOS parameters; determining a plurality of candidate paths to the destination using resource constraints of the database corresponding to the selected QOS parameter; selecting an optimum one of said candidate paths as a second path if the resource constraints of the first path do not satisfy all the specified QOS parameters or the transmission of the first signaling message is unsuccessful; and e) transmitting a second signaling message containing routing data of the second path toward the destination if resource constraints of the second path satisfy all other specified OOS parameters.
Claim 4
Independent Claim
204 words
A method for routing a call through a connection-oriented network comprising a plurality of nodes interconnected by communication links, the method comprising the steps of: a) storing link status information of the network and periodically updating the stored information according to link status of the network, the link status information indicating resource constraints of the links; b) responsive to a connection request specifying a plurality of QOS (quality of service) parameters, selecting a first path to a destination; c) transmitting a first signaling message toward the destination containing routing data of the first path if resource constraints of the first path satisfy all the specified QOS parameters; d) selecting one of the specified OOS parameters; determining a plurality of candidate paths to the destination using resource constraints of the database corresponding to the selected QOS parameter; selecting an optimum one of said candidate paths as a second path if the resource constraints of the first path do not satisfy all the specified QOS parameters or the transmission of the first signaling message is unsuccessful; and e) transmitting a second signaling message containing routing data of the second path toward the destination if resource constraints of the second path satisfy all other specified OOS parameters.
Claim 5
Dependent Claim
19 words
A method as claimed in claim 2, wherein said first path of the step (b) is a predetermined path.
Claim 6
Dependent Claim
49 words
A method as claimed in claim 2 or 3, wherein the step (d) further comprises the steps of: calculating a sum of weights respectively assigned to the links of each of the candidate paths; and selecting, as the second path, one of the candidate paths having a minimum sum.
Claim 7
Dependent Claim
61 words
A method as claimed in claim 2 or 3, wherein the step (d) further comprises the steps of: selecting, as a link cost, one of the QOS parameters; calculating a sum of the link costs for each of the candidate paths to said destination; and selecting, as the second path, one of the candidate paths having a minimum link cost sum.
Claim 8
Dependent Claim
39 words
A method as claimed in claim 5, wherein the step (d) further comprises the steps of: selecting, as the link cost, one of the QOS parameters with each of which the transmission of a signaling message was previously unsuccessful.
Claim 9
Dependent Claim
56 words
A method as claimed in claim 2, wherein the step (b) further comprises the steps of: finding a plurality of candidate paths to said destination; calculating a sum of weights respectively assigned to the links of each of the candidate paths; and selecting, as the first path, one of the candidate paths having a minimum sum.
Claim 10
Dependent Claim
62 words
A method as claimed in claim 2, wherein the step (b) further comprises the steps of: selecting one of the QOS parameters as a link cost; calculating a sum of the link costs for each one of a plurality of candidate paths to said destination; and selecting, as the first path, one of the candidate paths having a minimum link cost sum.
Claim 11
Independent Claim
172 words
A method for routing a call through a connection-oriented network comprising a plurality of nodes interconnected by communication links, comprising the steps of: a) storing link status information of the network and periodically updating the stored information according to link status of the network, said link status information indicating resource constraints of the links; b) responsive to a connection request specifying a plurality of QOS (quality of service) parameters, resetting a count value; c) selecting a path to a destination according to said count value, one of the specified QOS parameters and contents of the stored information corresponding to said one of the QOS parameters; d) transmitting a signaling message containing routing data of the path toward the destination if resource constraints of the path satisfy all the specified QOS parameters; e) incrementing the count value if the resource constraints of the path do not satisfy all the QOS parameters or if the transmission of the signaling message is unsuccessful; and f) repeating steps (c) to (e) a predetermined number of times.
Claim 12
Independent Claim
172 words
A method for routing a call through a connection-oriented network comprising a plurality of nodes interconnected by communication links, comprising the steps of: a) storing link status information of the network and periodically updating the stored information according to link status of the network, said link status information indicating resource constraints of the links; b) responsive to a connection request specifying a plurality of QOS (quality of service) parameters, resetting a count value; c) selecting a path to a destination according to said count value, one of the specified QOS parameters and contents of the stored information corresponding to said one of the QOS parameters; d) transmitting a signaling message containing routing data of the path toward the destination if resource constraints of the path satisfy all the specified QOS parameters; e) incrementing the count value if the resource constraints of the path do not satisfy all the QOS parameters or if the transmission of the signaling message is unsuccessful; and f) repeating steps (c) to (e) a predetermined number of times.
Claim 13
Dependent Claim
52 words
A method as claimed in claim 9, wherein the step (c) further comprises the steps of: finding a plurality of candidate paths to said destination; calculating a sum of weights respectively assigned to the links of each of the candidate paths; and selecting one of the candidate paths having a minimum sum.
Claim 14
Dependent Claim
60 words
A method as claimed in claim 9 or 10, wherein the step (c) further comprises the steps of: selecting one of the QOS parameters as a link cost; calculating a sum of the link costs for each one of a plurality of candidate paths to said destination; and selecting one of the candidate paths having a minimum link cost sum.
Claim 15
Dependent Claim
74 words
A method as claimed in claim 9 or 10, wherein the step (c) further comprises the steps of: selecting, as a link cost, one of the QOS parameters with each of which the transmission of a transmitter signaling message was previously unsuccessful; calculating a sum of the link costs for each one of a plurality of candidate paths to said destination; and selecting one of the candidate paths having a minimum link cost sum.
Claim 16
Dependent Claim
70 words
A method as claimed in claim 9, wherein the step (c) further comprises the steps of: when the count value is 0, selecting a predetermined path; when the count value is incremented to 1, finding a plurality of candidate paths to said destination; calculating a sum of weights respectively assigned to the links of each of the candidate paths; and selecting one of the candidate paths having a minimum sum.
Claim 17
Dependent Claim
76 words
A method as claimed in claim 9, wherein the step (c) further comprises the steps of: when the count value is 0, selecting a predetermined path; when the count value is incremented to 1, selecting one of the QOS parameters as a link cost; calculating a sum of the link costs for each one of a plurality of candidate paths to said destination; and selecting one of the candidate paths having a minimum link cost sum.
Claim 18
Dependent Claim
119 words
A method as claimed in claim 9, wherein the step (c) further comprises the steps of: when the count value is 0, selecting a predetermined path; when the count value is incremented to 1, finding a plurality of candidate paths to said destination; calculating a sum of weights respectively assigned to the links of each of the candidate paths; selecting one of the candidate paths having a minimum sum; when the count value is incremented to 2, selecting one of the QOS parameters as a link cost; calculating a sum of the link costs for each one of a plurality of candidate paths to said destination; and selecting one of the candidate paths having a minimum link cost sum.
Claim 19
Dependent Claim
47 words
A method as claimed in claim 15, wherein the step (c) further comprises the steps of: when the count value is incremented to 3, selecting, as the link cost, one of the QOS parameters with each of which the transmission of a signaling message was previously unsuccessful.
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) | 2002-08-02 | 2003-02-01 | 2003-08-03 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-08-02 | 2007-02-01 | 2007-08-03 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-08-02 | 2011-02-01 | 2011-08-03 | $7700.00 | Window Closed / Lapsed |