Least cost routing with repeated searches for lower cost route

• US 6,023,501 A
• Filed: 03/03/1999
• Issued: 02/08/2000
• Est. Priority Date: 03/03/1998
• Status: Expired due to Fees

• Current Assignee: NEC Corporation
• Original Assignee: NEC Corporation
• Inventors: Wakamatsu, Takashi
• Primary Examiner(s): Loomis, Paul N
• Assistant Examiner(s): BARNIE, REXFORD N
• Application Number:
  US09/261,746
• Time in Patent Office: 342 Days
• Field of Search: 379/112, 379/111, 379/113, 379/114, 379/115, 379/121, 379/127, 379/128, 379/219, 379/220, 379/221, 379/67.1, 379/88.12, 455/405, 455/406
• US Class Current: 379/114.02
• CPC Class Codes: H04M 15/00 Arrangements for metering, time-control or time indication ; Metering, charging or billing arrangements for voice wireline or wireless communications, e.g. VoIP
• CPC Class Codes: H04M 15/745 Customizing according to wishes of subscriber, e.g. friends or family
• CPC Class Codes: H04M 15/8044 Least cost routing
• CPC Class Codes: H04M 15/8083 involving reduced rates or discounts, e.g. time-of-day reductions or volume discounts
• CPC Class Codes: H04M 2215/0108 Customization according to wishes of subscriber, e.g. customer preferences, friends and family, selecting services or billing options, Personal Communication Systems [PCS]
• CPC Class Codes: H04M 2215/0168 On line or real-time flexible customization or negotiation according to wishes of subscriber
• CPC Class Codes: H04M 2215/0184 involving reduced rates or discounts, e.g. time-of-day reductions, volume discounts, cell discounts, group billing, frequent calling destination(s) or user history list
• CPC Class Codes: H04M 2215/42 Least cost routing, i.e. provision for selecting the lowest cost tariff
• CPC Class Codes: H04M 2215/745 Least cost routing, e.g. Automatic or manual, call by call or by preselection

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.

Claims

1. 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.

2. 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).

3. 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).

4. 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).

5. 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).

6. 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).

7. 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.

8. 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.

9. 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.

10. 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.

11. 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.

12. 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.

13. The communications network of claim 10, wherein said central database is arranged to update said search program when said tariff data is revised.

14. 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.