US6385172B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Administrative weight assignment for enhanced network operation
Assignee: Nokia of America Corp
•
Filing: 1999-03-19
•
Granted: 2002-05-07
•
Expires: 2019-03-19
Abstract
Abstract Methods and communication networks having a plurality of connection-oriented switches in which administrative weights are assigned based on link call blocking probabilities. Three assignment schemes include, first, a solution that can be built in the switch software of sufficiently similar switches to enable the switches to determine administrative weights for their links. The second and third schemes employ administrative weight management stations. The second scheme uses an administrative weight management station that operates to enhance total network revenue or throughput in a communication network in which all of the switches implement a certain type of accounting management information databases (MIB). The third scheme uses an administrative weight management station that computes administrative weights for switches that do not have the capability for the second scheme, but which employ appropriate MIBs.
Inventors
- 👤 Deepak Kataria
- 👤 Dimitris Logothetis
- 👤 Santhanam Srinivasan
- 👤 Malathi Veeraraghavan
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 01:49
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/12; H04L45/124; H04Q; H04Q3/00; H04Q3/0016; H04Q2213/00; H04Q2213/13003; H04Q2213/1305; H04Q2213/1307; H04Q2213/13103; H04Q2213/13106; H04Q2213/1313; H04Q2213/13164; H04Q2213/13166; H04Q2213/13176; H04Q2213/13178; H04Q2213/13299; H04Q2213/13335; H04Q2213/13349; H04Q2213/1338
Claims Analysis
Total Claims: 22
Claim 1
Independent Claim
110 words
In a communication network including a plurality of switches and a plurality of communication links that can be interconnected by at least one of said plurality of switches to form a communication path characterized by a class of service, a method for assigning administrative weights to said plurality of communication links, comprising the steps of: computing for said class of service a call blocking probability at each of said plurality of switches; and assigning for said class of service an administrative weight to a respective one of said plurality of communication links directly related to the computed call blocking probability of the respective one of said plurality of communication links.
Claim 2
Dependent Claim
110 words
In a communication network including a plurality of switches and a plurality of communication links that can be interconnected by at least one of said plurality of switches to form a communication path characterized by a class of service, a method for assigning administrative weights to said plurality of communication links, comprising the steps of: computing for said class of service a call blocking probability at each of said plurality of switches; and assigning for said class of service an administrative weight to a respective one of said plurality of communication links directly related to the computed call blocking probability of the respective one of said plurality of communication links.
Claim 3
Dependent Claim
107 words
The method according to claim 1 , wherein the steps are performed at each one of said plurality of switches for the at least one of said plurality of communication links that can be interconnected by said one of said plurality of switches, the method further comprising the steps of: recording for said class of service the number of call setup requests arriving at each of said plurality of switches via each of said plurality of communication links; and recording for said class of service the number of call setup requests rejected at each of said plurality of switches for each of said plurality of communication links.
Claim 4
Dependent Claim
23 words
The method according to claim 2 , wherein the manners of performance of the steps by the plurality of switches are essentially identical.
Claim 5
Dependent Claim
51 words
The method according to claim 1 , wherein the plurality of switches have available accounting data relating to service class, traffic matrix, link capacities, and bandwidth requirements, and the step of computing call-blocking probabilities involves recursively calculating call-blocking probabilities for each link from the data with the criterion of increasing revenue.
Claim 6
Dependent Claim
37 words
The method according to claim 4 , wherein the step of recursively calculating involves calculating so that application of the administrative weights will tend to optimize revenue for a network of the switches and the communication links.
Claim 7
Dependent Claim
50 words
The method according to claim 1 , wherein the plurality of switches differ but have access to like accounting information, including accepted traffic, link capacities, and bandwidth requirements for each class of service, and wherein the step of calculating call-blocking probabilities recursively solves for both offered traffic and call-blocking probabilities.
Claim 8
Dependent Claim
120 words
The method according to claim 6 , wherein the step of calculating call-blocking probabilities employs the relationships: for traffic class k on a link l in the network, b l,k =ƒ({c l , . . . , c k }, {ρ 1 . . . , ρ k }C l where C k is the bandwidth of a type k call and ρ k is the traffic intensity of a class k call, on link l and C l is the bandwidth of link l, the intensity of accepted traffic of class k, ρ k a , being written in terms of the CBP for class k calls on link l as ρ k a =ρ k ×(1−b l,k ).
Claim 9
Dependent Claim
26 words
The method according to claim 6 , wherein the step of calculating call-blocking probabilities includes recursively solving while including prior values with the last calculated values.
Claim 10
Dependent Claim
27 words
The method according to claim 6 , wherein each step is performed through all of the nodes in order to provide a centralized solution for the network.
Claim 11
Dependent Claim
29 words
The method according to claim 6 , wherein each step is performed separately for each of the plurality of nodes in order to provide distributed solutions in the network.
Claim 12
Dependent Claim
109 words
A communication network including a plurality of switches, a plurality of communication links that can be interconnected by at least one of said plurality of switches to form a communication path characterized by a class of service, and means for assigning administrative weights to said plurality of communication links, comprising: means for computing for said class of service a call blocking probability at each of said plurality of switches; and means for assigning for said class of service an administrative weight to a respective one of said plurality of communication links directly related to the computed call blocking probability of the respective one of said plurality of communication links.
Claim 13
Dependent Claim
109 words
A communication network including a plurality of switches, a plurality of communication links that can be interconnected by at least one of said plurality of switches to form a communication path characterized by a class of service, and means for assigning administrative weights to said plurality of communication links, comprising: means for computing for said class of service a call blocking probability at each of said plurality of switches; and means for assigning for said class of service an administrative weight to a respective one of said plurality of communication links directly related to the computed call blocking probability of the respective one of said plurality of communication links.
Claim 14
Dependent Claim
71 words
The communication network according to claim 11 , further comprising means for recording for said class of service the number of call setup requests arriving at each of said plurality of switches via each of said plurality of communication links; and means for recording for said class of service the number of call setup requests rejected at each of said plurality of switches for each of said plurality of communication links.
Claim 15
Dependent Claim
23 words
The communication network according to claim 11 , wherein the plurality of switches are equally capable with respect to collecting and using data.
Claim 16
Dependent Claim
52 words
The communication network according to claim 11 , wherein the plurality of switches have available accounting data relating to service class, traffic matrix, link capacities, and bandwidth requirements, and further including a separate management unit capable of calculating call-blocking probabilities for each link from the data with the criterion of increasing revenue.
Claim 17
Dependent Claim
39 words
The communication network according to claim 14 , wherein the separate management unit is capable of calculating so that application of the administrative weights will tend to optimize revenue for a network of the switches and the communication links.
Claim 18
Dependent Claim
56 words
The communication network according to claim 11 , wherein the plurality of switches differ but have access to like accounting information, including accepted traffic, link capacities, and bandwidth requirements for each class of service, and wherein the separate management unit is capable of calculating call-blocking probabilities by recursively solving for both offered traffic and call-blocking probabilities.
Claim 19
Dependent Claim
124 words
The communication network according to claim 16 , wherein the separate management unit calculates call-blocking probabilities by employing the following relationships: for traffic class k on a link l in the network, b l,k =ƒ({c l , . . . , c k }, {ρ 1 . . . , ρ k },C l where C k is the bandwidth of a type k call and ρ k is the traffic intensity of a class k call, on link l and C l is the bandwidth of link l, the intensity of accepted traffic of class k, ρ k a , being written in terms of the CBP for class k calls on link l as ρ k a =ρ k ×(1=b l,k ).
Claim 20
Dependent Claim
24 words
The communication network according to claim 17 , wherein the separate management unit recursively solves while including prior values with the last calculated values.
Claim 21
Dependent Claim
42 words
The communication network according to claim 11 , wherein the means for computing and the means for assigning together include means for calculating through all of the plurality of nodes considered together in order to provide a centralized solution for the network.
Claim 22
Dependent Claim
40 words
The communication network according to claim 11 , wherein the means for computing and the means for assigning together include means for calculating separately for each of the plurality of nodes in order to provide distributed solutions in the network.
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) | 2005-05-06 | 2005-11-05 | 2006-05-07 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2009-05-06 | 2009-11-05 | 2010-05-07 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2013-05-06 | 2013-11-05 | 2014-05-07 | $7700.00 | Window Closed / Lapsed |