US6023501A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Least cost routing with repeated searches for lower cost route
Assignee: NEC Corp
•
Filing: 1999-03-03
•
Granted: 2000-02-08
•
Expires: 2019-03-03
Abstract
Abstract In a communications network, a database is searched for a least cost route in response to a call request from a subscriber, and a connection is established along the least cost route between the calling subscriber and a called subscriber. For the duration of the call, the database is repeatedly searched for a route having a cost lower than the cost of a previously determined route. If the route of lower cost is detected, a new connection is established along the lower cost route, instead of the currently established connection.
Inventors
- 👤 Takashi Wakamatsu
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 03:11
CPC Classifications
H; H04; H04M; H04M15/00; H04M15/70; H04M15/745; H04M15/80; H04M15/8044; H04M15/8083; H04M2215/00; H04M2215/01; H04M2215/0108; H04M2215/0168; H04M2215/0184; H04M2215/42; H04M2215/74; H04M2215/745
Claims Analysis
Total Claims: 19
Claim 1
Independent Claim
102 words
A method of least cost routing through a communications network, comprising the steps of: a) detecting a least cost route through the network in response to a request from a calling subscriber; b) establishing a first connection along the least cost route for connecting the calling subscriber and a called subscriber; c) detecting a route through the network, said route having a cost lower than the cost of the route detected by the step (a); and d) establishing a second connection along the route detected by the step (c) for connecting the calling and called subscribers, instead of via the first connection.
Claim 2
Independent Claim
102 words
A method of least cost routing through a communications network, comprising the steps of: a) detecting a least cost route through the network in response to a request from a calling subscriber; b) establishing a first connection along the least cost route for connecting the calling subscriber and a called subscriber; c) detecting a route through the network, said route having a cost lower than the cost of the route detected by the step (a); and d) establishing a second connection along the route detected by the step (c) for connecting the calling and called subscribers, instead of via the first connection.
Claim 3
Dependent Claim
27 words
The method of claim 1, further comprising the step of sending a vocal announcement to said subscribers before the second connection is established by the step (d).
Claim 4
Independent Claim
107 words
A method of least cost routing through a communications network, comprising the steps of: a) detecting a least cost route through a communications network in response to a request from a calling subscriber; b) establishing a connection along the least cost route between the calling subscriber and a called subscriber; c) making a search through the network for a route having a cost lower than the cost of a previously determined route; d) if the route of lower cost is detected by the step (c), establishing a connection along the lower cost route, instead of the currently established connection; and e) repeating the steps (c) and (d).
Claim 5
Independent Claim
107 words
A method of least cost routing through a communications network, comprising the steps of: a) detecting a least cost route through a communications network in response to a request from a calling subscriber; b) establishing a connection along the least cost route between the calling subscriber and a called subscriber; c) making a search through the network for a route having a cost lower than the cost of a previously determined route; d) if the route of lower cost is detected by the step (c), establishing a connection along the lower cost route, instead of the currently established connection; and e) repeating the steps (c) and (d).
Claim 6
Dependent Claim
27 words
The method of claim 3, further comprising the step of sending a vocal announcement to said subscribers before the second connection is established by the step (d).
Claim 7
Independent Claim
109 words
A method of least cost routing through a communications network, comprising the steps of: a) making a search through a database for a least cost route in response to a request from a calling subscriber; b) establishing a connection along the least cost route between the calling subscriber and a called subscriber; c) making a search through the database for a route having a cost lower than the cost of a previously determined route; d) if the route of lower cost is detected by the step (c), establishing a connection along the lower cost route, instead of the currently established connection; and e) repeating the steps (c) and (d).
Claim 8
Independent Claim
109 words
A method of least cost routing through a communications network, comprising the steps of: a) making a search through a database for a least cost route in response to a request from a calling subscriber; b) establishing a connection along the least cost route between the calling subscriber and a called subscriber; c) making a search through the database for a route having a cost lower than the cost of a previously determined route; d) if the route of lower cost is detected by the step (c), establishing a connection along the lower cost route, instead of the currently established connection; and e) repeating the steps (c) and (d).
Claim 9
Dependent Claim
27 words
The method of claim 5, further comprising the step of sending a vocal announcement to said subscribers before the second connection is established by the step (d).
Claim 10
Dependent Claim
164 words
A communications network comprising: a database for making a first search for a least cost route in response to a request packet and sending a reply packet containing data of said least cost route; and a plurality of network nodes interconnected by communication links, each of said network nodes functioning as an originating node for sending said request packet to said database in response to a call request from a calling subscriber, said originating node being responsive to said reply packet for establishing a first connection along the least cost route determined by the database between the calling subscriber and a called subscriber, said database making a second search for a route having a cost lower than the cost of said least cost route, and sending a second reply packet containing data of the route of lower cost, said originating node being responsive to the second reply packet for establishing a second connection along the route of lower cost, instead of the first connection.
Claim 11
Dependent Claim
164 words
A communications network comprising: a database for making a first search for a least cost route in response to a request packet and sending a reply packet containing data of said least cost route; and a plurality of network nodes interconnected by communication links, each of said network nodes functioning as an originating node for sending said request packet to said database in response to a call request from a calling subscriber, said originating node being responsive to said reply packet for establishing a first connection along the least cost route determined by the database between the calling subscriber and a called subscriber, said database making a second search for a route having a cost lower than the cost of said least cost route, and sending a second reply packet containing data of the route of lower cost, said originating node being responsive to the second reply packet for establishing a second connection along the route of lower cost, instead of the first connection.
Claim 12
Dependent Claim
40 words
The communications network of claim 7, wherein said database is arranged to make said first and second searches based on information including day of month, day of week, time of day, and telephone numbers of said calling and called subscribers.
Claim 13
Dependent Claim
26 words
The communications network of claim 7, wherein said originating node is arranged to send a vocal announcement to said subscribers before the second connection is established.
Claim 14
Dependent Claim
138 words
A communications network comprising: a central database for holding tariff data and producing a search program based on the tariff data; and a plurality of network nodes interconnected by communication links, each of said network nodes comprising a local database and functioning as an originating node for making a first search through the local database for a least cost route in response to a call request from a calling subscriber using said search program, and establishing a first connection along the least cost route between the calling subscriber and a called subscriber, said originating node making a second search through the local database for a route having a cost lower than the cost of said least cost route using said search program and establishing a second connection along the route of lower cost, instead of the first connection.
Claim 15
Dependent Claim
138 words
A communications network comprising: a central database for holding tariff data and producing a search program based on the tariff data; and a plurality of network nodes interconnected by communication links, each of said network nodes comprising a local database and functioning as an originating node for making a first search through the local database for a least cost route in response to a call request from a calling subscriber using said search program, and establishing a first connection along the least cost route between the calling subscriber and a called subscriber, said originating node making a second search through the local database for a route having a cost lower than the cost of said least cost route using said search program and establishing a second connection along the route of lower cost, instead of the first connection.
Claim 16
Dependent Claim
41 words
The communications network of claim 10, wherein said originating node is arranged to make said first and second searches based on information including day of month, day of week, time of day, and telephone numbers of said calling and called subscribers.
Claim 17
Dependent Claim
26 words
The communications network of claim 10, wherein said originating node is arranged to send a vocal announcement to said subscribers before the second connection is established.
Claim 18
Dependent Claim
23 words
The communications network of claim 10, wherein said central database is arranged to update said search program when said tariff data is revised.
Claim 19
Dependent Claim
28 words
The communications network of claim 10, wherein said central database is arranged to produce a plurality of said search programs respectively adapted for said plurality of network nodes.
References Cited (Backward Citations)
US5027388A
Cited
US5515425A
Cited
US5802502A
Cited
US5790643A
Cited
US5675636A
Cited
US5748718A
Cited
US5915214A
Cited
US5659601A
Cited
US5781620A
Cited
US5799072A
Cited
US5606602A
Cited
US5930343A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-02-07 | 2003-08-09 | 2004-02-08 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-02-07 | 2007-08-09 | 2008-02-08 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-02-07 | 2011-08-09 | 2012-02-08 | $7700.00 | Window Closed / Lapsed |