Universal exchange for making least-cost non-local telephone calls

• US 6,381,315 B1
• Filed: 12/02/1999
• Issued: 04/30/2002
• Est. Priority Date: 12/02/1999
• Status: Expired due to Term

• Current Assignee: Eli Nhaissi
• Original Assignee: Eli Nhaissi
• Inventors: Nhaissi, Eli
• Primary Examiner(s): TIEU, BINH KIEN
• Application Number:
  US09/452,703
• Time in Patent Office: 880 Days
• Field of Search: 379/112, 379/114, 379/115, 379/121, 379/127, 379/144, 379/202, 379/207, 379/220, 379/221, 455/405, 455/406, 455/407, 455/408
• US Class Current: 379/111
• 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/30 the meter or calculation of charges not being controlled from an exchange
• CPC Class Codes: H04M 15/43 Billing software details
• CPC Class Codes: H04M 15/49 Connection to several service providers
• CPC Class Codes: H04M 15/7655 shared by technologies
• CPC Class Codes: H04M 15/77 involving multiple accounts per user
• CPC Class Codes: H04M 15/772 per service, e.g. prepay or post-pay
• 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 17/00 Prepayment of wireline communication systems, wireless communication systems or telephone systems using a coded card to authorise calls from a telephone set H04M1/675
• CPC Class Codes: H04M 2203/5063 Centrally initiated conference, i.e. conference server dials participants
• 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/2026 Wireless network, e.g. GSM, PCS, TACS
• CPC Class Codes: H04M 2215/32 Involving wireless systems
• CPC Class Codes: H04M 2215/42 Least cost routing, i.e. provision for selecting the lowest cost tariff
• CPC Class Codes: H04M 2215/46 Connection to several service providers
• CPC Class Codes: H04M 2215/725 Shared by technologies, e.g. one account for different access technologies
• CPC Class Codes: H04M 2215/7254 Multiple accounts per user
• CPC Class Codes: H04M 2215/7263 per service, e.g. prepay and post-pay
• CPC Class Codes: H04M 2215/745 Least cost routing, e.g. Automatic or manual, call by call or by preselection
• CPC Class Codes: H04M 2215/92 : Autonomous calculations of charges in terminal, i.e. meter not controlled from exchange
• CPC Class Codes: H04M 3/56 : Arrangements for connecting several subscribers to a common circuit, i.e. affording conference facilities video conference systems H04N7/15
• CPC Class Codes: H04Q 2213/13103 : Memory
• CPC Class Codes: H04Q 2213/13138 : Least cost routing, LCR
• CPC Class Codes: H04Q 2213/13141 : Hunting for free outlet, circuit or channel
• CPC Class Codes: H04Q 3/66 : Traffic distributors
• CPC Class Codes: H04W 4/24 : Accounting or billing

Abstract

A method and an apparatus for making least-cost non-local telephone calls. In accordance with this method, an identification code of a customer and a plurality of carrier codes associated with the identification code are stored in a memory which is accessible by a computer at a universal exchange. Each carrier code identifies a respective one of a plurality of telephone call carriers. Subsequent to the storing step, the universal exchange receives the customer identification code and a destination telephone number by means of a telephone call from the customer. The computer at the universal exchange processes the destination telephone number and the plurality of carrier codes corresponding to the customer identification code in accordance with respective rate schedules for those carriers and a least-cost routing algorithm, thereby determining a least-cost carrier for connecting the customer to the station identified by the destination telephone number. The computer then controls a telephone switching matrix to route the telephone call to an exchange of the least-cost carrier.

Claims

1. A method comprising the steps of:

storing an identification code of a customer and a plurality of carrier codes associated with said identification code in memory accessible by a computer at a call processing platform, each of said plurality of carrier codes identifying a respective one of a plurality of telephone call carriers;

receiving a telephone call from said customer at said call processing platform in response to said customer dialing an access telephone number of said call processing platform from a telephony device;

receiving said customer identification code and a destination telephone number at said call processing platform during said telephone call;

processing said destination telephone number and said plurality of carrier codes corresponding to said customer identification code in said computer in accordance with a plurality of respective rate schedules for said plurality of telephone call carriers and a least-cost routing algorithm to determine a least-cost carrier from said plurality of telephone call carriers for connecting said customer to the station identified by said destination telephone number; and

routing said telephone call to an exchange of said least-cost carrier.

2. The method as recited in claim 1, wherein a PIN number is stored for the carrier code of said least-cost carrier, said PIN number identifying a respective prepayment transaction in which said customer had purchased future telephone service to be provided by said least-cost carrier, further comprising the step of transmitting said PIN number to said least-cost carrier in association with said routed telephone call.

3. The method as recited in claim 1, further comprising the steps of:

receiving a respective rate schedule from each of said plurality of telephone call carriers; and

storing said respective plurality of rate schedules in said memory.

4. The method as recited in claim 1, further comprising the steps of:

interrogating each of said plurality of telephone call carriers to obtain said respective plurality of rate schedules; and

storing said respective plurality of rate schedules in said memory.

5. The method as recited in claim 1, further comprising the steps of:

receiving from said customer a respective PIN number for each carrier code representing a prepaid carrier, each PIN number identifying a respective prepayment transaction in which said customer had purchased future telephone service to be provided by a respective prepaid carrier;

receiving a respective available balance for each prepayment transaction from each prepaid carrier; and

constructing in memory a database comprising said customer identification codes, said plurality of carrier codes, said PIN numbers and said available balances.

6. The method as recited in claim 5, wherein said least-cost routing algorithm comprises the step of excluding as least-cost carrier any carrier for which said respective available balance is insufficient to cover the initial cost of said telephone call to said station identified by said destination telephone number.

7. The method as recited in claim 1, further comprising the steps of:

receiving from said customer a respective PIN number for each carrier code representing a prepaid carrier, each PIN number identifying a respective prepayment transaction in which said customer had purchased future telephone service to be provided by a respective prepaid carrier;

interrogating each prepaid carrier to obtain an available balance for each prepayment transaction; and

constructing in memory a database comprising said customer identification codes, said plurality of carrier codes, said PIN numbers and said available balances.

8. The method as recited in claim 7, wherein said least-cost routing algorithm comprises the step of excluding as least-cost carrier any carrier for which said respective available balance is insufficient to cover the initial cost of said telephone call to said station identified by said destination telephone number.

9. The method as recited in claim 1, further comprising the steps of:

processing said destination telephone number and said plurality of carrier codes corresponding to said customer identification code in said computer in accordance with said plurality of respective rate schedules for said plurality of telephone call carriers and said least-cost routing algorithm to determine a next least-cost carrier from said plurality of telephone call carriers; and

routing said telephone call to an exchange of said next least-cost carrier in response to a predetermined message received from said least-cost carrier.

10. A system comprising:

a telephony device capable of transmitting destination telephone numbers;

a universal exchange for performing least-cost routing and having an access telephone number; and

an exchange for routing a telephone call from said telephony device to said universal exchange in response to transmission of said access telephone number by said telephony device;

wherein said universal exchange comprises;

memory storing an identification code of a customer and a plurality of carrier codes associated with said identification code, each of said plurality of carrier codes identifying a respective one of a plurality of telephone call carriers;

a telephone switch for receiving said customer identification code and a destination telephone number from said customer during a telephone call; and

a processor in communication with said telephone switch and with said memory for processing said destination telephone number and said plurality of carrier codes corresponding to said customer identification code in accordance with a plurality of respective rate schedules for said plurality of telephone call carriers and a least-cost routing algorithm to determine a least-cost carrier from said plurality of telephone call carriers for connecting said customer to the station identified by said destination telephone number,

wherein said telephone switch routes

said telephone call to an exchange of said least-cost carrier in response to determination of said least-cost carrier by said processor.

11. The system as recited in claim 10, wherein said memory further stores a PIN number for the carrier code of said least-cost carrier, said PIN number identifying a respective prepayment transaction in which said customer had purchased future telephone service to be provided by said least-cost carrier, further comprising means for transmitting said PIN number to said least-cost carrier in association with said routed telephone call.

12. The system as recited in claim 10, further comprising means for receiving a respective rate schedule from each of said plurality of telephone call carriers, said respective plurality of rate schedules being stored in said memory.

13. The system as recited in claim 12, wherein said receiving means comprise a plurality of data lines respectively connected to said plurality of telephone call carriers.

14. The system as recited in claim 10, further comprising means for interrogating each of said plurality of telephone call carriers to obtain said respective plurality of rate schedules, said respective plurality of rate schedules being stored in said memory.

15. The system as recited in claim 10, wherein said processor further comprises:

means for acquiring from said customer a respective PIN number for each carrier code representing a prepaid carrier, each PIN number identifying a respective prepayment transaction in which said customer had purchased future telephone service to be provided by a respective prepaid carrier;

means for acquiring a respective available balance for each prepayment transaction from each prepaid carrier; and

means for constructing in memory a database comprising said customer identification codes, said plurality of carrier codes, said PIN numbers and said available balances.

16. The system as recited in claim 15, wherein said least-cost routing algorithm comprises means for excluding as least-cost carrier any carrier for which said respective available balance is insufficient to cover the initial cost of said telephone call to said station identified by said destination telephone number.

17. The system as recited in claim 10, wherein said processor further comprises:

means for processing said destination telephone number and said plurality of carrier codes corresponding to said customer identification code in said computer in accordance with said plurality of respective rate schedules for said plurality of telephone call carriers and said least-cost routing algorithm to determine a next least-cost carrier from said plurality of telephone call carriers; and

means for controlling said telephone switching matrix to route said telephone call to an exchange of said next least-cost carrier in response to a predetermined message received from said least-cost carrier.

18. A method of routing a telephone call at a call processing platform, comprising the steps of:

storing an identification code of a customer in a database accessible by a computer located at a call processing platform;

storing in said database a respective carrier code for each one of a respective plurality of telephone call carriers to which said customer had made a respective telephone service prepayment;

storing rate schedule information for each of said plurality of telephone call carriers, said rate schedule information being accessible by said computer;

receiving at said call processing platform a telephone call from said customer;

during said telephone call, receiving from said customer said identification code and a destination telephone number identifying a station which said customer wishes to call;

electronically computing which carrier code identifies the least-cost carrier for said call to said station based on said rate schedule information and said destination telephone number; and

routing said telephone call from said call processing platform to an exchange of said least-cost carrier.

19. The method as recited in claim 18, wherein a respective PIN number is stored for each of said plurality of telephone service prepayments, further comprising the step of transmitting one of said PIN numbers to said exchange of said least-cost carrier in association with said routed telephone call.

20. The method as recited in claim 18, further comprising the step of interrogating each of said plurality of telephone call carriers to obtain said rate schedule information.

21. The method as recited in claim 18, further comprising the steps of:

storing a respective PIN number for each of said plurality of telephone service prepayments;

storing said plurality of telephone service prepayment amounts; and

electronically constructing a database comprising said customer identification code, said plurality of carrier codes, said PIN numbers and said telephone service prepayment amounts.

22. The method as recited in claim 21, further comprising the step of interrogating each of said plurality of telephone call carriers to obtain said telephone service prepayment amounts.

23. The method as recited in claim 21, wherein said electronic computing steps comprises the step of excluding as least-cost carrier any carrier for which the available balance remaining from said respective telephone service prepayment amount is insufficient to cover the initial cost of said telephone call to said station identified by said destination telephone number.

24. The method as recited in claim 18, further comprising the steps of:

electronically computing which carrier code identifies the next least-cost carrier for said call to said station based on said rate schedule information and said destination telephone number; and

routing said telephone call to an exchange of said next least-cost carrier in response to a predetermined message received from said exchange of said least-cost carrier.

25. A telephone call processing platform comprising:

an access line having an access telephone number for receiving telephone calls from any telephony device;

memory storing an identification code of a customer, a respective carrier code for each one of a respective plurality of telephone call carriers to which said customer had made a respective telephone service prepayment, and rate schedule information for each of said plurality of telephone call carriers;

means for receiving from said customer, via said access line, said identification code and a destination telephone number identifying a station which said customer wishes to call;

a telephone call router; and

a computer programmed to electronically compute which carrier code identifies the least-cost carrier for said call to said station based on said rate schedule information and said destination telephone number; and

then control said telephone call router to route said call to an exchange of said least-cost carrier.

26. A telephone system comprising a universal exchange and a plurality of special exchanges coupled to said universal exchange, wherein said universal exchange comprises:

memory storing an identification code of a customer, a respective carrier code for each one of said plurality of special exchanges to which said customer has made a respective telephone service prepayment, and rate schedule information for each of said plurality of telephone call carriers;

means for receiving an identification code and a destination telephone number identifying a station which said customer wishes to call from said customer;

a telephone switching matrix; and

a computer programmed to electronically compute which carrier code identifies a least-cost special exchange for routing said call to said station based on said rate schedule information and said destination telephone number, and then control said telephone switching matrix of said universal exchange to route said call to said least-cost special exchange, and

wherein each of said special exchanges comprises;

memory storing a PIN number and an available prepayment amount associated with said customer;

means for receiving said PIN number from said customer;

means for receiving said destination telephone number from said universal exchange;

a telephone switching matrix; and

a computer programmed to electronically verify that said PIN number is valid and that said available prepayment amount is sufficient to cover the initial cost of said call to said station, and then control said telephone switching matrix of said special exchange to route said call to said station.

27. A telephone system comprising a universal exchange and a plurality of special exchanges coupled to said universal exchange, wherein said universal exchange comprises:

memory storing an identification code of a customer, a respective carrier code for each one of said plurality of special exchanges to which said customer has made a respective telephone service prepayment, a respective PIN number for each of said plurality of telephone service prepayments, and rate schedule information for each of said plurality of telephone call carriers;

means for receiving identification code and a destination telephone number identifying a station which said customer wishes to call from said customer;

a telephone switching matrix; and

a computer programmed to electronically compute which carrier code identifies a least-cost special exchange for routing said call to said station based on said rate schedule information and said destination telephone number, control said telephone switching matrix of said universal exchange to route said call to said least-cost special exchange, and transmit one of said PIN numbers to said least-cost special exchange, and

wherein each of said special exchanges comprises;

memory storing a respective one of said PIN numbers and a respective available prepayment amount associated with said customer;

means for receiving said PIN number and said destination telephone number from said universal exchange;

a telephone switching matrix; and

a computer programmed to electronically verify that said PIN number is valid and that said available prepayment amount is sufficient to cover the initial cost of said call to said station, and then control said telephone switching matrix of said special exchange to route said call to said station.

28. A method of making a telephone call, comprising the steps of:

prepaying for telephone services to be provided by a plurality of special carriers;

storing at a universal exchange a respective carrier code for each one of a respective plurality of telephone call carriers to which said customer had made a respective telephone service prepayment;

acquiring rate schedule information for each of said plurality of telephone call carriers;

accessing said universal exchange from a remote location;

transmitting a customer identification code and a destination telephone number from said remote location to said universal exchange, said destination telephone number identifying a station which a customer wishes to call;

electronically computing which carrier code identifies the least-cost carrier for said call to said station based on said rate schedule information and said destination telephone number;

routing said call from said universal exchange to a special exchange of said least-cost carrier;

transmitting a PIN number to said special exchange;

electronically verifying that said PIN number is valid and that said available prepayment amount is sufficient to cover the initial cost of said call to said station; and

routing said call from said special exchange to said station.

29. A method of making a telephone call, comprising the steps of:

prepaying for telephone services to be provided by a plurality of special carriers;

storing at a universal exchange a respective carrier code for each one of a respective plurality of telephone call carriers to which said customer had made a respective telephone service prepayment and a respective PIN number;

acquiring rate schedule information for each of said plurality of telephone call carriers;

accessing said universal exchange from a remote location;

transmitting a customer identification code and a destination telephone number from said remote location to said universal exchange, said destination telephone number identifying a station which a customer wishes to call;

electronically computing which carrier code identifies the least-cost carrier for said call to said station based on said rate schedule information and said destination telephone number;

electronically verifying that said PIN number is valid and that said available prepayment amount is sufficient to cover the initial cost of said call to said station if routed through a special exchange of said low-cost carrier; and

routing said call from said universal exchange to said special exchange of said least-cost carrier; and

routing said call from said special exchange to said station.

30. A system comprising:

a telephony device capable of transmitting destination telephone numbers;

a universal exchange for performing least-cost routing and having an access telephone number; and

an exchange for routing a telephone call from said telephony device to said universal exchange in response to transmission of said access telephone number by said telephony device;

wherein said universal exchange comprises;

memory storing an identification code of a customer and a plurality of carrier codes associated with said identification code, each of said plurality of carrier codes identifying a respective one of a plurality of telephone call carriers;

an input communication channel for receiving said customer identification code and a destination telephone number from said customer during said telephone call;

a processor in communication with said input communication channel and with said memory for processing said destination telephone number and said plurality of carrier codes corresponding to said customer identification code in accordance with a plurality of respective rate schedules for said plurality of telephone call carriers and a least-cost routing algorithm to determine a least-cost carrier from said plurality of telephone call carriers for connecting said customer to the station identified by said destination telephone number; and

means for routing said telephone call to an exchange of said least-cost carrier in response to determination of said least-cost carrier by said processor.

31. A method for routing a prepaid telephone call comprising the steps of:

receiving a telephone call from a customer who has purchased prepaid airtime from a plurality of prepaid carriers;

determining which one of said plurality of prepaid carriers is the least-cost prepaid carrier for said telephone call;

routing said telephone call to said least-cost prepaid carrier;

receiving a message from said least-cost prepaid carrier indicating that the prepaid airtime purchased from said least-cost prepaid carrier by said customer is exhausted or nearly exhausted; and

re-routing said telephone call to one of said plurality of prepaid carriers other than said least-cost prepaid carrier in response to receipt of said message.

32. The method as recited in claim 31, further comprising the step of determining which one of said plurality of prepaid carriers is the second-lowest-cost prepaid carrier for said telephone call, wherein said telephone call is re-routed to said second-lowest-cost carrier.

34. The system as recited in claim 31, further comprising means for determining which one of said plurality of prepaid carriers is the second-lowest-cost prepaid carrier for said telephone call, wherein said telephone call is re-routed to said second-lowest-cost carrier by said re-routing means.

33. A system for routing a prepaid telephone call comprising:

an access line for receiving a telephone call from a customer who has purchased prepaid airtime from a plurality of prepaid carriers;

means for determining which one of said plurality of prepaid carriers is the least-cost prepaid carrier for said telephone call;

means for routing said telephone call to said least-cost prepaid carrier;

a communications channel for receiving a message from said least-cost prepaid carrier indicating that the prepaid airtime purchased from said least-cost prepaid carrier by said customer is exhausted or nearly exhausted; and

means for re-routing said telephone call to one of said plurality of prepaid carriers other than said least-cost prepaid carrier in response to receipt of said message.

35. A method for routing a telephone call comprising the steps of:

receiving a telephone call from a person who is a customer of a multiplicity of long-distance/international carriers;

determining which one of said of long-distance/international carriers is the least-cost carrier for said telephone call;

routing said telephone call to said least-cost carrier;

receiving a busy signal from said least-cost carrier; and

re-routing said telephone call to one of said plurality of long-distance/international carriers other than said least-cost carrier in response to receipt of said busy signal.

36. The method as recited in claim 35, further comprising the step of determining which one of said plurality of long-distance/international carriers is the second-lowest-cost carrier for said telephone call, wherein said telephone call is re-routed to said second-lowest-cost carrier.

37. A system for routing a telephone call comprising:

an access line for receiving a telephone call from a person who is a customer of a multiplicity of long-distance/international carriers;

means for determining which one of said plurality of long-distance/international carriers is the least-cost carrier for said telephone call;

means for routing said telephone call to said least-cost carrier;

means for detecting a busy signal from said least-cost carrier; and

means for re-routing said telephone call to one of said plurality of long-distance/international carriers other than said least-cost carrier in response to receipt of said busy signal.

38. The system as recited in claim 37, further comprising means for determining which one of said plurality of long-distance/international carriers is the second-lowest-cost carrier for said telephone call, wherein said telephone call is re-routed to said second-lowest-cost carrier by said re-routing means.

39. A method for routing a telephone call comprising the steps of:

receiving a telephone call from a person who is a customer of a multiplicity of long-distance/international carriers;

determining which one of said of long-distance/international carriers is the least-cost carrier for said telephone call;

routing said telephone call to said least-cost carrier;

monitoring the quality of the voice signal during said telephone call routed to said least-cost carrier; and

re-routing said telephone call to one of said plurality of long-distance/international carriers other than said least-cost carrier in response to detection of poor quality.

40. The method as recited in claim 39, further comprising the step of determining which one of said plurality of long-distance/international carriers is the second-lowest-cost carrier for said telephone call, wherein said telephone call is re-routed to said second-lowest-cost carrier.

41. A system for routing a telephone call comprising:

an access line for receiving a telephone call from a person who is a customer of a multiplicity of long-distance/international carriers;

means for determining which one of said plurality of long-distance/international carriers is the least-cost carrier for said telephone call;

means for routing said telephone call to said least-cost carrier;

means for monitoring the quality of the voice signal during said telephone call routed to said least-cost carrier; and

means for re-routing said telephone call to one of said plurality of long-distance/international carriers other than said least-cost carrier in response to detection of poor quality.

42. The system as recited in claim 41, further comprising means for determining which one of said plurality of long-distance/international carriers is the second-lowest-cost carrier for said telephone call, wherein said telephone call is re-routed to said second-lowest-cost carrier by said re-routing means.

43. A system for connecting a conference call at a universal exchange, comprising the steps of:

receiving a telephone call at said universal exchange from a person who is a customer of first and second carriers and wishes to make a conference call;

routing a first call to a first exchange of said first carrier for connecting a first participant to said conference call; and

routing a second call to a second exchange of said second carrier for concurrently connecting a second participant to said conference call.

44. A system for connecting a conference call at a universal exchange, comprising the steps of:

receiving a telephone call at said universal exchange from a person who has purchased first and second PIN numbers from a prepaid carrier and wishes to make a conference call;

routing a first call to a special exchange of said prepaid carrier using said first PIN number for connecting a first participant to said conference call; and

routing a second call to said special exchange of said prepaid carrier using said second PIN number for concurrently connecting a second participant to said conference call.

45. A method for routing a telephone call, comprising the steps of:

storing an identification code for a calling party and a multiplicity of carrier codes in a database, each one of said multiplicity of carrier codes corresponding to a respective one of a multiplicity of carriers, said carrier codes being associated with said identification code in said database;

answering a telephone call from said calling party;

receiving said identification code and a destination telephone number via said telephone call;

retrieving each carrier code associated with said identification code from said database;

determining which one of said multiplicity of carriers identified by said retrieved carrier codes is the least-cost carrier for connecting said telephone call to a station identified by said destination telephone number; and

routing said telephone call to said least-cost carrier.

46. A system for routing a telephone call, comprising the steps of:

a database storing an identification code for a calling party and a multiplicity of carrier codes, each one of said multiplicity of carrier codes corresponding to a respective one of a multiplicity of carriers, said carrier codes being associated with said identification code in said database;

an access line for receiving a telephone call from said calling party; and

a universal exchange programmed to perform the following steps;

receiving said identification code and a destination telephone number via said access line while said telephone call is connected;

retrieving each carrier code associated with said identification code from said database;

determining which one of said multiplicity of carriers identified by said retrieved carrier codes is the least-cost carrier for connecting said telephone call to a station identified by said destination telephone number; and

routing said telephone call to said least-cost carrier.

47. A system for routing a telephone call comprising:

a universal exchange having an access telephone number; and

a regular exchange programmed to connect a telephony device to said universal exchange in response to initiation of a telephone call to said access telephone number by a calling party employing said telephony device,

wherein said universal exchange is programmed to route said telephone call to a least-cost carrier selected from a list of carriers and comprises;

a database storing a respective identification code for each of a multiplicity of customers and a respective set of carrier codes, each carrier code identifying a respective one of a multiplicity of carriers, each set of carrier codes being associated with a respective identification code in said database;

a telephone switching system for receiving telephone calls directed thereto by said regular exchange; and

a call processor connected to said telephone switching system for processing identification codes and destination telephone numbers received from calling parties with reference to said database, wherein said call processor is programmed to perform the following steps;

determining which one of a multiplicity of carriers is the least-cost prepaid carrier for a telephone call from a particular customer identified by an identification code in said database, said least-cost carrier being selected from the carriers identified by the multiplicity of carrier codes associated with the identification code of said particular customer in said database; and

routing said telephone call to said least-cost carrier via said telephone switching system.

48. The system as recited in claim 47, wherein said regular exchange is a land-line exchange.

49. The system as recited in claim 47, wherein said regular exchange is a wireless exchange.

50. The system as recited in claim 47, wherein said regular exchange is an Internet exchange.

51. A method for making a telephone call, comprising the steps of:

storing an identification code for a calling party and a multiplicity of carrier codes in a database, each one of said multiplicity of carrier codes corresponding to a respective one of a multiplicity of carriers, said carrier codes being associated with said identification code in said database;

dialing an access telephone number using a telephony device;

connecting said telephony device to a universal exchange identified by said access telephone number via a regular exchange;

transmitting an identification code and a destination telephone number from said telephony device to said universal exchange during said connection;

retrieving each carrier code associated with said identification code from said database in response to receipt of said identification code and said destination telephone number at said universal exchange;

determining which one of said multiplicity of carriers identified by said retrieved carrier codes is the least-cost carrier for connecting said telephone call to a station identified by said destination telephone number; and

routing said telephone call from said universal exchange to said least-cost carrier.

52. The method as recited in claim 51, wherein said transmitting step is initiated by touching an input device on a wireless telephone.

53. The method as recited in claim 52, wherein said identification code is a mobile identification number for a wireless telephone.

54. The method as recited in claim 52, further comprising the steps of:

transmitting a PIN number taken from a prepaid calling card from said telephony device to said universal exchange during said connection; and

verifying that said PIN number is valid and that a prepaid account balance associated with said PIN number is sufficient to cover an initial cost of said telephone call to said station identified by said destination telephone number.

55. A method of making wireless telephone calls, comprising the steps of:

obtaining a wireless telephone from a wireless carrier;

opening an account entitling a customer having a special code to receive least-cost routing service from a universal exchange;

storing said special code and a plurality of carrier codes associated with said special code in a database;

operating said wireless telephone to cause said wireless telephone to transmit signals representing said special code and a destination telephone number;

receiving said transmitted signals at a distance from said wireless telephone;

routing said received special code and destination phone number to said universal exchange;

determining at said universal exchange that said special code is valid for obtaining least-cost routing service;

determining, at said universal exchange, which one of a multiplicity of carriers having a carrier code associated with said special code in said database is the least-cost carrier for connecting said telephone call to a station identified by said destination telephone number; and

routing said telephone call from said universal exchange to said least-cost carrier.

56. A system for connecting a telephone call from a calling party using a wireless telephone to a called party using a telephone, comprising:

a universal exchange having an access number; and

a wireless exchange programmed to connect a wireless telephone to said universal exchange in response to said calling party dialing said access number using said wireless telephone,

wherein said universal exchange is programmed to route said telephone call from said wireless telephone to a least-cost carrier selected from a list of carriers and comprises a database containing a mobile identification number of said wireless telephone and a plurality of carrier codes associated with said mobile identification number, each of said carrier codes identifying a respective one of said carriers on said list.

57. A method for making a telephone call, comprising the steps of:

receiving from a customer the identities of a multiplicity of carriers with whom said customer wishes to receive long-distance telephone service from;

storing an identification code for said customer and a multiplicity of carrier codes in a database accessible by a universal exchange, each one of said multiplicity of carrier codes corresponding to a respective one of said multiplicity of carriers identified by said customer, said carrier codes being associated with said identification code in said database;

connecting a telephony device being used by said customer to said universal exchange;

transmitting a destination telephone number from said telephony device to said universal exchange during said connection;

determining said identification code of said customer at said universal exchange;

retrieving each carrier code associated with said identification code from said database;

determining which one of said multiplicity of carriers identified by said retrieved carrier codes is the least-cost carrier for connecting said telephone call to a station identified by said destination telephone number; and

routing said telephone call from said universal exchange to said least-cost carrier.