Patent US4862496A successfully refreshed from Google Patents.
US4862496A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Routing of network traffic
Assignee: British Telecommunications PLC
•
Filing: 1986-12-16
•
Granted: 1989-08-29
•
Expires: 2006-12-16
Abstract
Abstract A method and apparatus for routing traffic in a circuit switched network. A call between two nodes interconnected by a direct link is first offered to the direct route, and if that is blocked it is offered to a currently nominated two-link alternative route between the two nodes. If that route is busy, the call is lost, and a randomly chosen two-link route is assigned to be the new current nominated alternative route. The strategy is particularly effective because it is simple, available routes are quickly located and once one available route is found, that same route is used for rerouting further calls until it is full. Trunk reservation protection is applied on alternative routes.
Inventors
- 👤 Francis P. Kelly
- 👤 Richard J. Gibbens
- 👤 Peter B. Key
- 👤 Paul A. Turton
- 👤 Roger R. Stacey
- 👤 Martin J. Whitehead
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 17:02
CPC Classifications
H; H04; H04M; H04M3/00; H04M3/22; H04M3/36; H04Q; H04Q3/00; H04Q3/64; H04Q3/66; H04L; H04L12/00; H04L12/50; H04Q2213/00; H04Q2213/13141; H04Q2213/13164; H04Q2213/13166; H04Q2213/13332; H04Q2213/13344
Claims Analysis
Total Claims: 49
Claim 1
Independent Claim
129 words
A method of routing traffic in a circuit-switched network, said method comprising: offering calls between an origin node and a destination node to one or more pre-assigned preferred routes, and if the or each of said one or more preferred routes is not available, offering said calls to at least one alternative route, wherein calls continue to be offered to one or more current nominated alternative routes until the or one of said current nominated alternative routes is not available, at which point a replacement nomination for the unavailable current nominated alternative route is made from a set of alternative routes to the destination node, said current nominated alternative route being an alternative route which the origin node immediately offers to a call blocked on the pre-assigned preferred route.
Claim 2
Independent Claim
129 words
A method of routing traffic in a circuit-switched network, said method comprising: offering calls between an origin node and a destination node to one or more pre-assigned preferred routes, and if the or each of said one or more preferred routes is not available, offering said calls to at least one alternative route, wherein calls continue to be offered to one or more current nominated alternative routes until the or one of said current nominated alternative routes is not available, at which point a replacement nomination for the unavailable current nominated alternative route is made from a set of alternative routes to the destination node, said current nominated alternative route being an alternative route which the origin node immediately offers to a call blocked on the pre-assigned preferred route.
Claim 3
Independent Claim
150 words
A method of routing traffic in a circuit-switched network, comprising: offering calls between an origin node and a destination node to one or more preferred routes, and if the or each of said one or more preferred routes is not available, offering at least one alternative route, wherein calls are offered to one or more current nominated alternative routes until the or one of said current nominated alternative routes is not available, at which point a replacement nomination for the unavailable current nominated alternative route is made from a set of alternative routes to the destination node, wherein a call between an origin node and a destination node which is blocked on the said one or more preferred routes is offered to only one current nominated alternative route, and if the said one current nominated alternative route is not available, the call is lost, and the replacement nomination is made.
Claim 4
Independent Claim
150 words
A method of routing traffic in a circuit-switched network, comprising: offering calls between an origin node and a destination node to one or more preferred routes, and if the or each of said one or more preferred routes is not available, offering at least one alternative route, wherein calls are offered to one or more current nominated alternative routes until the or one of said current nominated alternative routes is not available, at which point a replacement nomination for the unavailable current nominated alternative route is made from a set of alternative routes to the destination node, wherein a call between an origin node and a destination node which is blocked on the said one or more preferred routes is offered to only one current nominated alternative route, and if the said one current nominated alternative route is not available, the call is lost, and the replacement nomination is made.
Claim 5
Independent Claim
156 words
A method of routing traffic in a circuit-switched network, comprising: offering calls between an origin node and a destination node to one or more preferred routes, and if the or each of said one or more preferred routes is not available, offering at least one alternative route, wherein calls are offered to one or more current nominated alternative routes until the or one of said current nominated alternative routes is not available, at which point a replacement nomination for the unavailable current nominated alternative route is made from a set of alternative routes to the destination node, wherein calls between an origin node and a destination node which are blocked on the said one or more preferred routes are offered to a first current nominated alternative route, and if the said first current nominated alternative route is not available said replacement nomination is made, and said calls are offered to a second current nominated alternative route.
Claim 6
Independent Claim
156 words
A method of routing traffic in a circuit-switched network, comprising: offering calls between an origin node and a destination node to one or more preferred routes, and if the or each of said one or more preferred routes is not available, offering at least one alternative route, wherein calls are offered to one or more current nominated alternative routes until the or one of said current nominated alternative routes is not available, at which point a replacement nomination for the unavailable current nominated alternative route is made from a set of alternative routes to the destination node, wherein calls between an origin node and a destination node which are blocked on the said one or more preferred routes are offered to a first current nominated alternative route, and if the said first current nominated alternative route is not available said replacement nomination is made, and said calls are offered to a second current nominated alternative route.
Claim 7
Independent Claim
112 words
A method of routing traffic in a circuit-switched network, comprising: offering calls between an origin node and a destination node to one or more preferred routes, and if the or each of said one or more preferred routes is not available, offering at least one alternative route, wherein calls are offered to one or more current nominated alternative routes until the or one of said current nominated alternative routes is not available, at which point a replacement nomination for the unavailable current nominated alternative route is made from a set of alternative routes to the destination node, wherein successive replacement nominations are made by stepping cyclically through the set of alternative routes.
Claim 8
Independent Claim
112 words
A method of routing traffic in a circuit-switched network, comprising: offering calls between an origin node and a destination node to one or more preferred routes, and if the or each of said one or more preferred routes is not available, offering at least one alternative route, wherein calls are offered to one or more current nominated alternative routes until the or one of said current nominated alternative routes is not available, at which point a replacement nomination for the unavailable current nominated alternative route is made from a set of alternative routes to the destination node, wherein successive replacement nominations are made by stepping cyclically through the set of alternative routes.
Claim 9
Independent Claim
165 words
A method of routing traffic in a circuit-switched network, comprising: offering calls between an origin node and a destination node to one or more preferred routes, and if the or each of said one or more preferred routes is not available, offering at least one alternative route, wherein calls are offered to one or more current nominated alternative routes until the or one of said current nominated alternative routes is not available, at which point a replacement nomination for the unavailable current nominated alternative route is made from a set of alternative routes to the destination node, wherein a set of current nominated alternative routes is chose, and each successive call which is blocked on said one or more preferred routes is offered to a respective cyclically selected member of the set, and wherein if the respective member to which a call is so offered is not available, that member is replaced in the set of current nominated alternative routes by a said replacement nomination.
Claim 10
Independent Claim
165 words
A method of routing traffic in a circuit-switched network, comprising: offering calls between an origin node and a destination node to one or more preferred routes, and if the or each of said one or more preferred routes is not available, offering at least one alternative route, wherein calls are offered to one or more current nominated alternative routes until the or one of said current nominated alternative routes is not available, at which point a replacement nomination for the unavailable current nominated alternative route is made from a set of alternative routes to the destination node, wherein a set of current nominated alternative routes is chose, and each successive call which is blocked on said one or more preferred routes is offered to a respective cyclically selected member of the set, and wherein if the respective member to which a call is so offered is not available, that member is replaced in the set of current nominated alternative routes by a said replacement nomination.
Claim 11
Independent Claim
120 words
A method of routing traffic in a circuit-switched network, comprising: offering calls between an origin node and a destination node to one or more preferred routes, and if the or each of said one or more preferred routes is not available, offering at least one alternative route, wherein calls are offered to one or more current nominated alternative routes until the or one of said current nominated alternative routes is not available, at which point a replacement nomination for the unavailable current nominated alternative route is made from a set of alternative routes to the destination node, wherein the or each of said one or more preferred routes is a single link route and the alternative routes are two-link routes.
Claim 12
Independent Claim
120 words
A method of routing traffic in a circuit-switched network, comprising: offering calls between an origin node and a destination node to one or more preferred routes, and if the or each of said one or more preferred routes is not available, offering at least one alternative route, wherein calls are offered to one or more current nominated alternative routes until the or one of said current nominated alternative routes is not available, at which point a replacement nomination for the unavailable current nominated alternative route is made from a set of alternative routes to the destination node, wherein the or each of said one or more preferred routes is a single link route and the alternative routes are two-link routes.
Claim 13
Independent Claim
139 words
A method of routing traffic in a circuit-switched network, comprising: offering calls between an origin node and a destination node to one or more preferred routes, and if the or each of said one or more preferred routes is not available, offering at least one alternative route, wherein calls are offered to one or more current nominated alternative routes until the or one of said current nominated alternative routes is not available, at which point a replacement nomination for the unavailable current nominated alternative route is made from a set of alternative routes to the destination node, wherein links between pairs of nodes are assigned respective trunk reservation parameters, and an alternative route is available if, for each link of the route, the sum of current traffic and trunk reservation parameter is less than the capacity of the link.
Claim 14
Independent Claim
139 words
A method of routing traffic in a circuit-switched network, comprising: offering calls between an origin node and a destination node to one or more preferred routes, and if the or each of said one or more preferred routes is not available, offering at least one alternative route, wherein calls are offered to one or more current nominated alternative routes until the or one of said current nominated alternative routes is not available, at which point a replacement nomination for the unavailable current nominated alternative route is made from a set of alternative routes to the destination node, wherein links between pairs of nodes are assigned respective trunk reservation parameters, and an alternative route is available if, for each link of the route, the sum of current traffic and trunk reservation parameter is less than the capacity of the link.
Claim 15
Independent Claim
116 words
A method of routing traffic in a circuit-switched network, comprising: offering calls between an origin node and a destination node to one or more preferred routes, and if the or each of said one or more preferred routes is not available, offering at least one alternative route, wherein calls are offered to one or more current nominated alternative routes until the or one of said current nominated alternative routes is not available, at which point a replacement nomination for the unavailable current nominated alternative route is made from a set of alternative routes to the destination node, wherein the replacement nomination is made such as to give equal weight to each of the said alternative routes.
Claim 16
Independent Claim
116 words
A method of routing traffic in a circuit-switched network, comprising: offering calls between an origin node and a destination node to one or more preferred routes, and if the or each of said one or more preferred routes is not available, offering at least one alternative route, wherein calls are offered to one or more current nominated alternative routes until the or one of said current nominated alternative routes is not available, at which point a replacement nomination for the unavailable current nominated alternative route is made from a set of alternative routes to the destination node, wherein the replacement nomination is made such as to give equal weight to each of the said alternative routes.
Claim 17
Independent Claim
116 words
A method of routing traffic in a circuit-switched network, comprising: offering calls between an origin node and a destination node to one or more preferred routes, and if the or each of said one or more preferred routes is not available, offering at least one alterative route, wherein calls are offered to one or more current nominated alternative routes until the or one of said current nominated alternative routes is not available, at which point a replacement nomination for the unavailable current nominated alternative route is made from a set of alternative routes to the destination node, wherein the replacement nomination is made on the basis as to which route is intrinsically likely to be available.
Claim 18
Independent Claim
116 words
A method of routing traffic in a circuit-switched network, comprising: offering calls between an origin node and a destination node to one or more preferred routes, and if the or each of said one or more preferred routes is not available, offering at least one alterative route, wherein calls are offered to one or more current nominated alternative routes until the or one of said current nominated alternative routes is not available, at which point a replacement nomination for the unavailable current nominated alternative route is made from a set of alternative routes to the destination node, wherein the replacement nomination is made on the basis as to which route is intrinsically likely to be available.
Claim 19
Dependent Claim
20 words
A method as claimed in claim 1, wherein the replacement nomination is made by a stochastic, pseudo-random or cyclic mechanism.
Claim 20
Independent Claim
98 words
A method of routing traffic in a circuit-switched network, said method comprising: offering calls between an origin node and a destination node to one of a plurality of routes, wherein calls are and continue to be offered to one or more current nominated routes until the or one of said current nominated routes is not available, at which point a replacement nomination for the unavailable current nominated route is made from a set of said routes, a current nominated route being an alternative route which the origin node immediately offers to a call blocked on previously offered routes.
Claim 21
Independent Claim
98 words
A method of routing traffic in a circuit-switched network, said method comprising: offering calls between an origin node and a destination node to one of a plurality of routes, wherein calls are and continue to be offered to one or more current nominated routes until the or one of said current nominated routes is not available, at which point a replacement nomination for the unavailable current nominated route is made from a set of said routes, a current nominated route being an alternative route which the origin node immediately offers to a call blocked on previously offered routes.
Claim 22
Independent Claim
106 words
A method of routing traffic in a circuit-switched network, comprising: offering calls between an origin node and a destination node to one of a plurality of routes, wherein calls are offered to one or more current nominated routes until the or one of said current nominated routes is not available, at which point a replacement nomination for the unavailable current nominated route is made from a set of said routes, wherein if a call between an origin node and a destination node is blocked on the or a first of said one or more current nominated routes, the call is lost, and said replacement is made.
Claim 23
Independent Claim
106 words
A method of routing traffic in a circuit-switched network, comprising: offering calls between an origin node and a destination node to one of a plurality of routes, wherein calls are offered to one or more current nominated routes until the or one of said current nominated routes is not available, at which point a replacement nomination for the unavailable current nominated route is made from a set of said routes, wherein if a call between an origin node and a destination node is blocked on the or a first of said one or more current nominated routes, the call is lost, and said replacement is made.
Claim 24
Independent Claim
118 words
A method of routing traffic in a circuit-switched network, comprising: offering calls between an origin node and a destination node to one of a plurality of routes, wherein calls are offered to one or more current nominated routes until the or one of said current nominated routes is not available, at which point a replacement nomination for the unavailable current nominated route is made from a set of said route, wherein if a desired call between an origin node and a destination node is not available on a first current nominated route, the call is offered to only one other current nominated route, and if the said other current nominated route is not available, the call is lost
Claim 25
Independent Claim
118 words
A method of routing traffic in a circuit-switched network, comprising: offering calls between an origin node and a destination node to one of a plurality of routes, wherein calls are offered to one or more current nominated routes until the or one of said current nominated routes is not available, at which point a replacement nomination for the unavailable current nominated route is made from a set of said route, wherein if a desired call between an origin node and a destination node is not available on a first current nominated route, the call is offered to only one other current nominated route, and if the said other current nominated route is not available, the call is lost
Claim 26
Dependent Claim
61 words
A method as claimed in claim 11, wherein if a desired call between an origin node and a destination node is not available on a first current nominated route, the call is offered to a second current nominated route, and if the said second current nominated route is not available, the said call is offered to a third current nominated route.
Claim 27
Independent Claim
85 words
A method of routing traffic in a circuit-switched network, comprising: offering calls between an origin node and a destination node to one of a plurality of routes, wherein calls are offered to one or more current nominated routes until the or one of said current nominated routes is not available, at which point a replacement nomination for the unavailable current nominated route is made from a set of said routes, wherein successive replacement nominations are made by stepping cyclically through the set of alternative routes.
Claim 28
Independent Claim
85 words
A method of routing traffic in a circuit-switched network, comprising: offering calls between an origin node and a destination node to one of a plurality of routes, wherein calls are offered to one or more current nominated routes until the or one of said current nominated routes is not available, at which point a replacement nomination for the unavailable current nominated route is made from a set of said routes, wherein successive replacement nominations are made by stepping cyclically through the set of alternative routes.
Claim 29
Dependent Claim
63 words
A method as claimed in claim 11, wherein a set of current nominated routes is chosen, and each successive call is offered to a respective selected member cyclically of the set, and wherein if the respective member to which a call is so offered is not available, that member is replaced in the set of current nominated routes by a said replacement nomination.
Claim 30
Dependent Claim
16 words
A method as claimed in claim 1, wherein the circuit-switched network is a virtual circuit network.
Claim 31
Dependent Claim
16 words
A method as claimed in claim 11, wherein the circuit-switched network is a virtual circuit network.
Claim 32
Dependent Claim
133 words
Apparatus for routing traffic through a circuit-switched network comprising: a plurality of processors at respective nodes, the said processors being adapted to offer calls between their respective node and a destination node to one or more pre-assigned preferred routes and, if the one or each of said one or more preferred routes is not available, offering alternative routes, wherein calls are offered to one or more current nominated alternative routes until the or one of said current nominated alternative routes is not available, at which point a replacement nomination for the unavailable current nominated alternative route is made form a set of said alternative routes to the destination node, said current nominated alternative route being an alternative route which the origin node immediately offers to a call blocked on the pre-assigned preferred route.
Claim 33
Dependent Claim
133 words
Apparatus for routing traffic through a circuit-switched network comprising: a plurality of processors at respective nodes, the said processors being adapted to offer calls between their respective node and a destination node to one or more pre-assigned preferred routes and, if the one or each of said one or more preferred routes is not available, offering alternative routes, wherein calls are offered to one or more current nominated alternative routes until the or one of said current nominated alternative routes is not available, at which point a replacement nomination for the unavailable current nominated alternative route is made form a set of said alternative routes to the destination node, said current nominated alternative route being an alternative route which the origin node immediately offers to a call blocked on the pre-assigned preferred route.
Claim 34
Dependent Claim
151 words
Apparatus for routing traffic through a circuit-switched network comprising: a plurality of processors at respective nodes, the said processors being adapted to offer calls between their respective node and a destination node to one or more preferred routes and if the one or each of said one or more preferred routes is not available, offering alternative routes, wherein calls are offered to one or more current nominated alternative routes until the or one of said current nominated alternative routes is not available, at which point a replacement nomination for the unavailable current nominated alternative route is made from a set of said alternative routes to the destination node, wherein each processor is adapted to offer a call which is blocked on the said preferred routes to only one current nominated route, and if the said current nominated route is not available, the call is lost, and said replacement nomination is made.
Claim 35
Dependent Claim
151 words
Apparatus for routing traffic through a circuit-switched network comprising: a plurality of processors at respective nodes, the said processors being adapted to offer calls between their respective node and a destination node to one or more preferred routes and if the one or each of said one or more preferred routes is not available, offering alternative routes, wherein calls are offered to one or more current nominated alternative routes until the or one of said current nominated alternative routes is not available, at which point a replacement nomination for the unavailable current nominated alternative route is made from a set of said alternative routes to the destination node, wherein each processor is adapted to offer a call which is blocked on the said preferred routes to only one current nominated route, and if the said current nominated route is not available, the call is lost, and said replacement nomination is made.
Claim 36
Dependent Claim
131 words
Apparatus for routing traffic through a circuit-switched network comprising: a plurality of processor at respective nodes, the said processors being adapted to offer calls between their respective node and a destination node to one or more preferred routes and if the one or each of said one or more preferred routes is not available, offering alternative routes, wherein calls are offered to one or more current nominated alternative routes until the or one of said current nominated alternative routes is not available, at which point a replacement nomination for the unavailable current nominated alternative route is made from a set of said alternative routes to the destination node, wherein the or each of said one or more preferred routes in a single link route and the alternative routes are two-link routes.
Claim 37
Dependent Claim
131 words
Apparatus for routing traffic through a circuit-switched network comprising: a plurality of processor at respective nodes, the said processors being adapted to offer calls between their respective node and a destination node to one or more preferred routes and if the one or each of said one or more preferred routes is not available, offering alternative routes, wherein calls are offered to one or more current nominated alternative routes until the or one of said current nominated alternative routes is not available, at which point a replacement nomination for the unavailable current nominated alternative route is made from a set of said alternative routes to the destination node, wherein the or each of said one or more preferred routes in a single link route and the alternative routes are two-link routes.
Claim 38
Dependent Claim
99 words
Apparatus for routing traffic through a circuit-switched network comprising: a plurality of processors at respective nodes, the said processors being adapted to continue to offer calls between their respective node and a destination node to one or more current nominated routes until the one or more of said current nominated routes is not available, at which point a replacement nomination for the unavailable current nominated route is made from a set of routes to the destination node, a current nominated route being an alternative route which the origin node immediately offers to a call blocked on previously offered routes.
Claim 39
Dependent Claim
99 words
Apparatus for routing traffic through a circuit-switched network comprising: a plurality of processors at respective nodes, the said processors being adapted to continue to offer calls between their respective node and a destination node to one or more current nominated routes until the one or more of said current nominated routes is not available, at which point a replacement nomination for the unavailable current nominated route is made from a set of routes to the destination node, a current nominated route being an alternative route which the origin node immediately offers to a call blocked on previously offered routes.
Claim 40
Dependent Claim
128 words
Apparatus for routing traffic through a circuit-switched network comprising: a plurality of processors at respective nodes, the said processors being adapted to offer calls between their respective node and a destination node to one or more current nominated routes until the one or more of said current nominated routes is not available, at which point a replacement nomination for the unavailable current nominated route is made from a set of routes to the destination node, wherein each processor is adapted to offer a call which is blocked on the or a first of said one or more current nominated routes to only one other current nominated route, and if the said other current nominated route is not available, the call is lost, and said replacement nomination is made.
Claim 41
Dependent Claim
128 words
Apparatus for routing traffic through a circuit-switched network comprising: a plurality of processors at respective nodes, the said processors being adapted to offer calls between their respective node and a destination node to one or more current nominated routes until the one or more of said current nominated routes is not available, at which point a replacement nomination for the unavailable current nominated route is made from a set of routes to the destination node, wherein each processor is adapted to offer a call which is blocked on the or a first of said one or more current nominated routes to only one other current nominated route, and if the said other current nominated route is not available, the call is lost, and said replacement nomination is made.
Claim 42
Dependent Claim
123 words
Apparatus for routing traffic through a circuit-switched network comprising: a plurality of processors at respective nodes, the said processors being adapted to offer calls between their respective node and a destination node to one or more preferred routes and if the one or each of said one or more preferred routes is not available, offering alternative routes, wherein calls are offered to one or more current nominated alternative routes until the or one of said current nominated alternative routes is not available, at which point a replacement nomination for the unavailable current nominated alternative route is made from a set of said alternative routes to the destination node, wherein successive replacement nominations are made by stepping cyclically through the set of alternative routes.
Claim 43
Dependent Claim
123 words
Apparatus for routing traffic through a circuit-switched network comprising: a plurality of processors at respective nodes, the said processors being adapted to offer calls between their respective node and a destination node to one or more preferred routes and if the one or each of said one or more preferred routes is not available, offering alternative routes, wherein calls are offered to one or more current nominated alternative routes until the or one of said current nominated alternative routes is not available, at which point a replacement nomination for the unavailable current nominated alternative route is made from a set of said alternative routes to the destination node, wherein successive replacement nominations are made by stepping cyclically through the set of alternative routes.
Claim 44
Dependent Claim
90 words
Apparatus for routing traffic through a circuit-switched network comprising: a plurality of processors at respective nodes, the said processors being adapted to offer calls between their respective node and a destination node to one or more current nominated routes until the one or more of said current nominated routes is not available, at which point a replacement nomination for the unavailable current nominated route is made from a set of routes to the destination node, wherein successive replacement nominations are made by stepping cyclically through the set of alternative routes.
Claim 45
Dependent Claim
90 words
Apparatus for routing traffic through a circuit-switched network comprising: a plurality of processors at respective nodes, the said processors being adapted to offer calls between their respective node and a destination node to one or more current nominated routes until the one or more of said current nominated routes is not available, at which point a replacement nomination for the unavailable current nominated route is made from a set of routes to the destination node, wherein successive replacement nominations are made by stepping cyclically through the set of alternative routes.
Claim 46
Dependent Claim
172 words
Apparatus for routing traffic through a circuit-switched network comprising: a plurality of processors at respective nodes, the said processors being adapted to offer calls between their respective node and a destination node to one or more preferred routes and if the one or each of said one or more preferred routes is not available, offering alternative routes, wherein calls are offered to one or more current nominated alternative routes until the or one of said current nominated alternative routes is not available, at which point a replacement nomination for the unavailable current nominated alternative route is made from a set of said alternative routes to the destination node wherein the said processors are adapted to nominate a set of current nominated alternative routes, to successive calls which are blocked on said one or more preferred routes to respective cyclically selected members of the set, and , if a respective member to which a call is offered is not available, to replace said respective member in the set by a said replacement nomination.
Claim 47
Dependent Claim
172 words
Apparatus for routing traffic through a circuit-switched network comprising: a plurality of processors at respective nodes, the said processors being adapted to offer calls between their respective node and a destination node to one or more preferred routes and if the one or each of said one or more preferred routes is not available, offering alternative routes, wherein calls are offered to one or more current nominated alternative routes until the or one of said current nominated alternative routes is not available, at which point a replacement nomination for the unavailable current nominated alternative route is made from a set of said alternative routes to the destination node wherein the said processors are adapted to nominate a set of current nominated alternative routes, to successive calls which are blocked on said one or more preferred routes to respective cyclically selected members of the set, and , if a respective member to which a call is offered is not available, to replace said respective member in the set by a said replacement nomination.
Claim 48
Dependent Claim
130 words
Apparatus for routing traffic through a circuit-switched network comprising: a plurality of processors at respective nodes, the said processors being adapted to offer calls between their respective node and a destination node to one or more current nominated routes until the one or more of said current nominated routes is not available, at which point a replacement nomination for the unavailable current nominated route is made from a set of routes to the destination node, wherein the said processors are adapted to nominate a set of current nominated routes, to offer each successive call to a respective cyclically selected member of the set, and, if a respective member to which a call is offered is not available, to replace said respective member in the set by a said replacement nomination.
Claim 49
Dependent Claim
130 words
Apparatus for routing traffic through a circuit-switched network comprising: a plurality of processors at respective nodes, the said processors being adapted to offer calls between their respective node and a destination node to one or more current nominated routes until the one or more of said current nominated routes is not available, at which point a replacement nomination for the unavailable current nominated route is made from a set of routes to the destination node, wherein the said processors are adapted to nominate a set of current nominated routes, to offer each successive call to a respective cyclically selected member of the set, and, if a respective member to which a call is offered is not available, to replace said respective member in the set by a said replacement nomination.
References Cited (Backward Citations)
US3394231A
Cited
GB1078302A
Cited
GB1089633A
Cited
US3536842A
Cited
US4004103A
Cited
US4348554A
Cited
US4669113A
Cited
US4704724A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1992-08-28 | 1993-02-27 | 1993-08-29 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-08-28 | 1997-02-27 | 1997-08-29 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-08-28 | 2001-02-27 | 2001-08-29 | $7700.00 | Window Closed / Lapsed |