Patent US5970050A successfully refreshed from Google Patents.
US5970050A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Allocating communication traffic
Assignee: British Telecommunications PLC
•
Filing: 1996-11-15
•
Granted: 1999-10-19
•
Expires: 2016-11-15
Abstract
Abstract Communication traffic is allocated through a network of interconnected nodes. A communication path may be established between terminals via a plurality of routes. Processors are provided for processing parameters for portions of a set of potential routes to determine a notional cost of using each of these routes. An optimal level of traffic is identified for each route portion and a parameter (such as notional route length) is adjusted to make use of the route more costly if the traffic for that portion exceeds the notional value and, in addition, if the traffic for the portion falls below the optimum value, a route is then selected with reference to route cost comparisons.
Inventors
- 👤 David Johnson
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 07:29
CPC Classifications
H; H04; H04L; H04L45/00; H04Q; H04Q3/00; H04Q3/0016; H04Q3/0029; H04Q2213/00; H04Q2213/13522; H04Q2213/13524; H04Q2213/13541
Claims Analysis
Total Claims: 20
Claim 1
Independent Claim
110 words
A method for selecting one of a plurality of possible routes through a communications network from a first node to a second node, said method comprising the steps of: defining a relationship between a range of costs for routes and the traffic density for routes, said relationship being represented by a curve having at least one point of inflection; monitoring and using traffic density for each of said plurality of possible routes to establish the cost of each said possible route in accordance with said relationship; and selecting one of said plurality of possible routes in dependence on the cost of each said possible route as established by said relationship.
Claim 2
Independent Claim
110 words
A method for selecting one of a plurality of possible routes through a communications network from a first node to a second node, said method comprising the steps of: defining a relationship between a range of costs for routes and the traffic density for routes, said relationship being represented by a curve having at least one point of inflection; monitoring and using traffic density for each of said plurality of possible routes to establish the cost of each said possible route in accordance with said relationship; and selecting one of said plurality of possible routes in dependence on the cost of each said possible route as established by said relationship.
Claim 3
Dependent Claim
39 words
A method as in claim 1 in which the magnitude of the gradient of a portion of the curve for traffic density values within a first range is less than that for a second range of traffic density values.
Claim 4
Dependent Claim
29 words
A method as in claim 2 in which the first range of traffic density values represent optimum traffic density values, said relationship being substantially linear within said first range.
Claim 5
Dependent Claim
42 words
A method as in claim 1 wherein in said monitoring step, if a possible route connects said first node to said second node via one or more other nodes using a plurality of sub-routes, a cost for each said sub-route is established.
Claim 6
Dependent Claim
30 words
A method as in claim 4 wherein in said monitoring step the costs of sub-routes of a given possible route are combined to give the cost for said possible route.
Claim 7
Dependent Claim
30 words
A method as in claim 1 wherein in said monitoring step the cost of a given possible route is established with reference to the effective length of the respective sub-routes.
Claim 8
Dependent Claim
32 words
A method as in claim 1 wherein said plurality of possible routes is constituted by a subset chosen from a set of possible routes from said first node to said second node.
Claim 9
Dependent Claim
112 words
Apparatus for selecting one of a plurality of possible routes through a communications network from a first node to a second node, said apparatus comprising: means for defining a relationship between a range of costs for routes and the traffic density for routes, said relationship being represented by a curve having at least one point of inflection; means for monitoring and using traffic density for each of said plurality of possible routes to establish the cost of each said possible route in accordance with said relationship; and means for selecting one of said plurality of possible routes in dependence on the cost of each said possible route as established by said relationship.
Claim 10
Dependent Claim
112 words
Apparatus for selecting one of a plurality of possible routes through a communications network from a first node to a second node, said apparatus comprising: means for defining a relationship between a range of costs for routes and the traffic density for routes, said relationship being represented by a curve having at least one point of inflection; means for monitoring and using traffic density for each of said plurality of possible routes to establish the cost of each said possible route in accordance with said relationship; and means for selecting one of said plurality of possible routes in dependence on the cost of each said possible route as established by said relationship.
Claim 11
Dependent Claim
38 words
Apparatus as in claim 8 in which the magnitude of the gradient of a portion of the curve for traffic density values within a first range is less than that for a second range of traffic density values.
Claim 12
Dependent Claim
28 words
Apparatus as in claim 9 in which the first range of traffic density values represent optimum traffic density values, said relationship being substantially linear within said first range.
Claim 13
Dependent Claim
42 words
Apparatus as in claim 8 wherein said monitoring means is operable, if a possible route connects said first node to said second node via one or more other nodes using a plurality of sub-routes, to establish a cost for each said sub-route.
Claim 14
Dependent Claim
30 words
Apparatus as in claim 11 wherein said monitoring means is operable to combine the costs of sub-routes of a given possible route to give the cost for said possible route.
Claim 15
Dependent Claim
29 words
Apparatus as in claim 8 wherein said monitoring means is operable to establish the cost of a given possible route with reference to the effective length of respective sub-routes.
Claim 16
Dependent Claim
31 words
Apparatus as in claim 8 wherein said plurality of possible routes is constituted by a subset chosen from a set of possible routes from said first node to said second node.
Claim 17
Independent Claim
88 words
A method for calculating costs of each of a plurality of possible routes through a communications network from a first node to a second node, said method comprising the steps of: defining a relationship between a range of costs for routes and the traffic density for routes, said relationship being represented by a curve having at least one point of inflection; and using the traffic density for each of said plurality of possible routes to establish the cost of each said possible route in accordance with said relationship.
Claim 18
Independent Claim
88 words
A method for calculating costs of each of a plurality of possible routes through a communications network from a first node to a second node, said method comprising the steps of: defining a relationship between a range of costs for routes and the traffic density for routes, said relationship being represented by a curve having at least one point of inflection; and using the traffic density for each of said plurality of possible routes to establish the cost of each said possible route in accordance with said relationship.
Claim 19
Dependent Claim
89 words
Apparatus for calculating costs of each of a plurality of possible routes through a communications network from a first node to a second node, said apparatus comprising: means for defining a relationship between a range of costs for routes and the traffic density for routes, said relationship being represented by a curve having at least one point of inflection; and means for using the traffic density for each of said plurality of possible routes to establish the cost of each said possible route in accordance with said defining means.
Claim 20
Dependent Claim
89 words
Apparatus for calculating costs of each of a plurality of possible routes through a communications network from a first node to a second node, said apparatus comprising: means for defining a relationship between a range of costs for routes and the traffic density for routes, said relationship being represented by a curve having at least one point of inflection; and means for using the traffic density for each of said plurality of possible routes to establish the cost of each said possible route in accordance with said defining means.
References Cited (Backward Citations)
US4707832A
Cited
GB2189111A
Cited
US5163042A
Cited
US5317566A
Cited
US5649108A
Cited
US5533016A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-10-18 | 2003-04-19 | 2003-10-19 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-10-18 | 2007-04-19 | 2007-10-19 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-10-18 | 2011-04-19 | 2011-10-19 | $7700.00 | Window Closed / Lapsed |