CA2166751C

CA2166751C - System for automatically providing customer access to alternative telephony service providers

Info

Publication number: CA2166751C
Application number: CA002166751A
Authority: CA
Inventors: Charles Calvin Byers
Original assignee: AT&T IPM Corp
Current assignee: AT&T Corp
Priority date: 1995-03-28
Filing date: 1996-01-08
Publication date: 1999-11-30
Anticipated expiration: 2016-01-08
Also published as: US5570417A; CA2166751A1

Abstract

A telecommunications network including a plurality of local exchanges or switching systems, each local switch supporting at least one customer line accessed by customer premise equipment (CPE) such as telephone station sets or multimedia stations. The local switches are connected to one another directly and through tandem switches to create the network. A data base is associated with each local exchange, or with a limited number of local exchanges, and is accessed by the local exchange to provide information for controlling the routing of a call. Each data base contains rate information for the service providers offering competitive services. Such rate information includes the service providers' basic rate structures, time of day discounts, group calling plans, usage discounts and the like. The switching system, in response to information provided by the data base, automatically routes the call to the lowest cost service provider based on this rate information. The data base is updated to reflect changes in service provider rates and to record calls made by each customer for purposes of tracking quantity calling discounts or the like and to update the rate information.

Description

216676~

-A SYSTEM FOR AUTOMATICALLY PROVIDING CUSTOMER ACCESS
TO ALTERNATIVE TELEPHONY SERVICE PROVIDERS

Te~hni~l Field This invention relates, generally, to customer access to competitive 5 telephony service providers and, more particularly, to a system for automatically switching a customer to the least expensive service provider for a particular call.
Back~round of the Invention As will be appreciated, telephony cu~tomçrs in the United States presently can choose from a number of long ~ t~nce service providers or carriers10 each offering various subscription services and rate pac~ges. Moreover, a rate package from even a single service provider can result in different rates for different calls depending on the time of day, customer usage, the identity of the person called and/or other factors, such as pr~,motional offers. As a result, the ;uslc,ll.~.'s decision as to which carrier to use is a complicated one and will not necess~rily result in the 15 lowest cost service for all long distance calls. It is also likely that, in the relatively near future, local service will be provided by a number of competing entities such that the cus~lllel will have the same choices in selecting local service that now exist for long rli~t~n~e service. Such open competition will only increase the complexity of selecting service carriers.
In response to this problem, a personal data base maintained on the customer's personal colllpulcl for use with the cu~lo~ ,r's premise e~luiplll~,nt such as a telephone or m~lltime~ station has been developed that includes rate information for various long di~tance providers. The ~;U:i~OllJe,~ can search the data base in an attempt to identify the lowest cost carrier for a particular call. One 25 problem with such a system is that each customer must import and m~int~in his or her own personal data base. Such a system is expensive and is clearly not feasible for all telephony customers. Moreover, the user must somehow gather rate information and load this information into the data base. Even for those customers who have the capakility of establishing such a data base, the continual maintenance 30 and updating of such a system is time consuming and cumbersome because the service providers' rate p~c~ges and subscriber plans change frequently.
The.erore, a problem in the art is that there is no simple and cost-effective system for routing any customer to the least expensive service for a particular call.

216~751 Summary of the Invention This problem is solved and a technical advance in the art is achieved by the switch based call routing system of the present invention. The system of theinvention operates in a telecomlllullications r.~,lwolk including a plurality of local 5 switches or exchanges where each local switch ~upl)olls c~lstomer lines açcesse~l by cl1stomer premise equipment (CPE) such as telephone station sets or mllltime~
st~tion~ The local switches are connected to one another directly and through tandem switches to create the telephone network as will be understood by one skilled in the art. In the pl~felled form of the invention, a data base is associated with each 10 local exch~nge, or with a limited number of local exchanges, and is acces~e~l by the local exchange to provide infol -lation for controlling the routing of calls of many, if not all, of the custom~rs served by the exchange. Each data base contains rate inforrnation for the service providers offering coml~e~ /e services. Such rate information includes the service providers' basic rate structures, time of day 15 discounts, group calling plans, usage discounts and the like. In the preferred system, customers subscribe to the service thereby allowing access to the data base for all outgoing calls made by the subscribing customer. The switching system, in response to inrollllation provided by the data base, autom~tic~lly routes the call through a selected service provider. The data base is routinely up~ted to m~int~in the current 20 rate structures of the service providers and to record the calls made by each customer for purposes of tracking quantity calling discounts or the like. Thus, the customer can be guaranteed of getting the least expensive service for every call.
Brief Description of the Drawin~
FIG. 1 is a block diagram of the teleco~ nications network in which 25 the present invention operates, FIG. 2 is a flow diagram of the method for opel~alillg the system of the invention; and FIG. 3 is a flow diagram of an alternate method for operating the systems of the invention.
30 Detailed Description FIG. 1 is an architectural block diagram illustrating the operation of the invention. FIG. 1 shows a telecollllnullications network 1 including a local exchange or switching system 2. Switching system 2 can be a SESS~) switch, described in AT&T Technical Journal, Vol. 64, No. 6, part 2, pp. 1305-1564, July/August 1985,35 and manufactured by AT&T. Other suitable switches or switching systems can also be used as will be understood by one skilled in the art.

211~6751 A plurality of CPEs, such as telephone station set 3 or mul~ims~
station 5, are connected to switching system 1 over customer lines 4. The customer lines 4 can include analog lines, Integrated Services Digital Network (ISDN) lines, coaxial cable or other access loop technologies, switching system 2 having the S capabilities for dealing with these technologies. Accordingly, switch 2 may be an ISDN switching system such as the system disclosed in U.S. Patent No. 4,592,048 issued to Beckner et al. on May 27, 1986.
The switching system 2 comprises a processor 8 for controlling the switch. The processor 8, in turn, comprises a central processing unit (CPU) 10, a 10 call control 12 storing a call control program for controlling the operations of the central processing unit, and call data 14. Switching system 2 also includes a local data base 16 for storing data such as: 1) cuctom~r lines connecte~ to the system, such as a Q.931 equipped customer line, 2) interconnecting nelwolks, 3) data links, and 4) data about the data base control. CPU 10 accesses the local data base 16 for 15 supplying data for display at CPEs connected to switching system 2 andtor forsupplying data in response to requests received from signaling network 23.
Sign~ling network 23 can consist of a CCS7 si~n~ling network. CPU 10 controls a transaction recorder 18 for recording billing info.lllation ~csoci~te~3 with services provided in accordance with the invention. Voice and data switching network 6, 20 under control of the CPU 10, transmits data among p~cessor 8 and regional data base control 20, and transmits voice and data among data links coming into the system such as the data link 21 to the sign~ling network 23, data link 25 to the local telephone network 27 of the public switched telephone network and customer lines 4. Regional data base 22 is connected to the data base control 20 via data25 link 24 such that data in the regional data base can be accessed by processor 8.
In the typical arrangement of nG. 1, the location at which the calls are connec~,d with the long ~ t~nce service providers is in a tandem switch. As will be appreciated, a tandem switch links local exchanges such as switching system 2 toone another and to other tandem switches. As illustrated in FIG. 1, switch 30 30 .~,lesenls a tandem switch in which voice and data switching network 32 routes calls received from the local telephone network 27 and routes those calls to one of the alternative long ~ t~nce service providers SPl ,SP2...SPN. Like switching system 2, switch 30 includes voice and data switching network 32 that is controlled by a processor 34 and can include data bases andtor transaction recorders (not 35 shown). Moreover, the voice and data switching network 32 is connected to andforms a part of the local telephone network 27 and the si~n~ling network 23. While 21~675~

in the exemplary arrangement the connection to the long distance service providers is at the tandem switch 30, it will be appreciated that connection to the long distance service providers can also be made at the local exchange or switching system 2. It is immflterial for purposes of this invention whether the long ~ t~nce service providers 5 are accesse~ at the local exchange, at a tandem switch or elsewhere in the network.
Further, while in the illustrated embodiment, switch 30 is described as a tandemswitch, it will be appreciated that switch 30 could constitute another local exchange or an inter-network switch.
The change required in the switching system 2 to implement the present 10 invention is the ~rlrlition of a program in the CPU 10 for exec~lfing the tasks describe~ in the flow chart of FIG. 2. The inf~ ation supplied to the CPU 20 forexecuting the program may come from the local data base 16 or from the regional data base 22 where the regional data base is ~ccessed by a limited number of local switches located in that region. It is to be understood that a centralized data base 15 could be used for storing this data; however, the use of the local or regional data bases speeds call set up time. The data base contains information about the ratestructures of the service providers SP 1 ... SPN and provides this data to the switching system 2 when requested.
Specifir~lly, the data base contains the general rate structure for each 20 long ~ t~nce carrier that can be ~cessed via the network to carry calls made from the switching system associated with that data base. In addition to the general rate structure, the data base includes a table of rate v~ri~tions based on the time of day at which the call is made to account for discounts provided by most service providers for off-peak calls. In this regard, CPU 20 is provided with a real time clock to25 identify the time of the call. The data base also includes special pr~ olions and subscriber plan information such as discounts for calls to selected numbers in apre~lesign~ted group of numbers or the like. It will be appreciated that such customer ii,fo~ ation must be m~int~ined in a conficle-nti~l manner such that access to this inform~tion is limited to entities entitled to such access. Finally, the data base 30 m~int~in~ a running tally for all calls made by a customer during a billing cycle (i.e., monthly). In this manner, when an individual customer reaches a predetermined call quantity on a particular carrier that triggers discounts, the system of the invention can take advantage of those discounts.
It is also possible to split up the rate information between local data 35 base 16 and regional data base 22. For example, local data base 16 could include information relevant to the customers served by switching system 2 such as the 2~6675~

calling and/or called party infolll.ation and the subscriber information. Regional data base 22 could include informadon common to all customers such as general rate structures, dme of day discounts, p~u~otions or the like. It will be appreciated that all of the rate inforrnation can be stored in either local data base 16 or regional data S base 22, if desired. In any event, CPU 20 will access the data base containing the relevant information and retrieve the specific information required for the particular call.
In addition to the above-mentioned information, the data base is intended to m~int~in data on any rate structure and is up~l~ted routinely to 10 incol~ te such information, as will be appreciated by one skilled in the art. In the plef~ d forrn of the invendon, the data base of the invention is upd~t~
aulo...~;c~lly when revised rate information is input into the system for billing purposes. For example, the data base containing the rate information for Op~,ld~ g the system of the invention, such as regional data base 22 is connected to the 15 signaling n~lwolk 23 by data link 31. When a long rli~t~nce service provider updates its rate informadon in the network, the new info..~ation is delivered to the regional data bases through the sign~ling network 23. Other m~tho~s for up~ting the rate info...-~;Q~ in the data base via the nc lwolL. can also be used as will be understood by one sl~illed in the art. Unlike the prior art, the switch based data base is 20 m~int~ined current even for short lived special p~l--olions that would otherwise be impossible to m~int~in on a customer's personal data base.
The operation of the system will now be described with reference to the flow diagram of FIG. 2. Upon receipt of a long ~ t~nre call at ~wilching system 2 (E~G. 1), the CPU detefmines if the calling stadon or customer is endtled to access to 25 the service of the invendon (block 201). For purposes of this description, calling stadon includes any ~ngin~ting CPE served by switching system 2. For example, ifservice is available only to customers who presubscribe, the CPU determines if the calling station or the personal identification number of the calling customer identify a pfesubscriber. If the c~l~tomer does not presubscribe, long distance service is 30 selected in the normal manner (block 202). If desired, all customers on a local exchange could autom~t~ lly be entitled to the service in which case the step ofblock 201 could be elimin~ted for any calls made from a CPE in that local exchange.
It is also possible to include some processing functions in, for example, data base control 20 such that the data base control can make some determinations such as 35 customer access to the service of the invention without the need to transmit data from the data base to the CPU.

~16~751 If the customer does presubscribe, the CPU then determines if the customer has disabled the service (block 203). In a preferred embodiment, the customer is given the ability to disable the service for any particular call even though the customer subscribes to the service. By entering a numeric code before dialing 5 the called number, the customer may disable the service and is allowed to choose a desired service provider regardless of its relative cost. If the service is disabled, the long distance carrier is chosen by the customer in the normal manner (block 202).
Alternatively, the customer may not be given the option of disabling the service, with the result that all calls made by that customer would ~utom~ti(~lly be routed to 10 the system selected service provider.
If the calling customer subscribes to the service and the service is not disabled, the specific rate information relevant to the call (including calling and called party infoll.,a~ion) is retrieved from either the local or regional data base, depending on where the information is stored (block 204). CPU searches the 15 retrieved rate information for the lowest cost service provider by looking up the basic rate structure of each service provider, de~ermining if a time of day discount applies and del~ ing, based on the called and calling party information, if a quantity discount applies, if the called party is a member of the calling party's design~te~ group, if a special prul~olion is applicable or any other relevant selection 20 criteria (block 205). It should be noted that not all customers are m.om~xrs of a design~ted group or are entitled to quantity discounts or special promotions, therefore, before these searches are executed, a prelimin~y check can be made todetermine if the subscribing custom~r is entitled to such discounts. As previously described, this prelimin~y check can be made in data base control 20 rather than25 CPU 10, if desired. Based on these searches, the lowest cost carrier for the call is - determined. Once the specific rate data is located, it is retrieved and the CPU
detennines the lowest cost carrier (block 206).
Before routing the call to the lowest cost carrier, a user analysis could be made, if desired (block 207). The user analysis is intended to prevent routing to a 30 lowest cost carrier where such routing otherwise would be undesirable for thecustomer. For example, if a call is made near the end of a billing cycle and thelowest cost carrier has not yet been used during the billing cycle (and the ratedifferential is minim~l), the call is routed to the slightly more expensive carrier to avoid sending the customer an additional bill. Other user analyses could also be35 made. For example, subscribers may choose not to be connected to a particularcarrier or a limit could be made on the number of different carriers a customer is -connected to during a billing cycle. Alternatively, some of these decisions could be made as part of the initial search process. Further, if two carriers have the same cost for a particular call, a predesignated customer preferred carrier would be selected. It will be appreciated that the user analysis could be elimin~ted and the customer could always be routed to a lowest cost carrier.
Once the final carrier is determined, the call is routed to that carrier in the known manner (block 208) by switching network 6 in accordance with routing instructions provided by CPU 10. A record of the call is made for billing purposes and the ap~ iate data base is llp~t~A to record the last call on the calling 10 cllctQmer's record for pull,oses of quantity discounts and the like (block 209).
A similar system can be used to autom~tic~lly route local calls to a low cost carrier where competitive local services are available. In the simplest scenario, all calls within a local exchange are non-competitively routed to a single carrier. For local calls outside of the service area of that exchange, a call could be routed to any of the competing local carriers. Referring to FIG. 1, for example, any calls with a destin~t on outside the service area of switching system 2 would be eligible forrouting to one of several coll~eting local carriers. A single carrier would carry all calls be~een CPEs served by switching system 2.
To implement such a system, an additional plateau is incorporated in the operation of the system of the invention. Referring to FIGs. 2 and 3, for a call made from a CPE served by switching system 2 to a CPE served by a dirr~lent ~wilclling system, CPU 20 first determines if the call is local or long ~ t~n~e (block 301). If it is long di~t~nre~ the operation described with respect to FIG. 2 occurs. If it is a local call, the CPU determines if the destin~tion is far enough away from the switching system 2 to warrant a search for the lowest cost carrier (block 302). The threshold distance at which the service of the invention is implemPnted is somewhat arbitrary;
however, use of a threshold level will elimin~te searching ~ltern~te carriers where there is little or no economic justification for making the search. Once it is determined that the call is outside of the threshold flict~nce, the search process proceeds as previously descfibed with reference to FIG.2 except that the data base, or a portion of the data base, is searched for local rather than long rli~t~nce service providers. If the call is not outside the threshold ~ t~nce, selection of the local carrier occurs in the normal manner (block 303).
Eventually there may exist competition for local service, even within a local exchange. In such a situation, the switching system 2 will be physically divided among a number of competitive carriers where access to any carrier on the 21~7Sl exchange will be controlled in the same manner as access to long ~i~t~nce carriers.
The routing system of the invention is equally applicable to such a situation and access to the local carrier can be decided as described with reference to FIGs. 2 and 3 except that access to the selected local carrier occurs within switching system 2 such S as by using data in local data base 16.
While the invention has been described in detail with respect to the attached figures, it is will be appreciated that that numerous changes and mo~ifications can be made in the system without without departing from the scopeof the invention.

Claims

1. In a telecommunications network having at least one switching system connected to a plurality of calling stations, a method of automatically routing a call from one of the plurality of calling stations to a selected one of a plurality of service providers accessible from the switching system, said selected service provider offering the lowest cost service for carrying the call, comprising the steps of:
storing in a data base rate information regarding said plurality of service providers and said plurality of calling stations, said data base being associated with said switching system such that it is accessible by all calling stations;
receiving the call in said switching system;
before accessing the data base, determining if accessing the data base is economically justified for the call;
accessing said data base responsive to receiving the call;
retrieving from said data base specific rate information associated with said call;
determining the selected one of said plurality of service providers based on said specific rate information; and routing the call through said selected one of said service providers.

2. The method according to claim 1, wherein the rate information includes the basic rate structures for the plurality of service providers.

3. The method according to claim 1, wherein the rate information includes time-of-day discounts.

4. The method according to claim 1, wherein the rate information includes special discounts available to a calling party.

5. The method according to claim 1, further including the preliminary step of determining if the data base is to be accessed for the call.

6. The method according to claim 1, wherein before routing the call, determining if the call should not be routed to the selected one of said service providers.

7. The method according to claim 1, wherein the step of determining if accessing the data base is economically justified includes the step of determining the distance of the call.

8. The method according to claim 1, wherein the data base is a local data base in the switching system and said step of accessing includes the step of accessing the local data base.

9. The method according to claim 1, wherein the data base is a regional data base serving a region of the network and said step of accessing includes using a data link to access said regional data base.

10. The method of claim 1, further including the step of updating the data base with information regarding the call made by the calling party.

11. The method of claim 1, further including the step of updating the data base with revised rate information supplied by the service providers.

12. A telecommunications network including a switching system connected to a plurality of calling stations, said switching system receiving a call made by a calling party from one of the plurality of calling stations and routing said call to a selected one of a plurality of service providers accessible from the switching system, said selected one of a plurality of service providers offering the lowest cost service for carrying the call, comprising:
a data base for storing rate information on said plurality of service providers and said plurality of calling stations, said data base being associated with said switching system such that it is accessible by said plurality of calling stations;
means for receiving a call in said switching system;

means for preliminary determining if accessing the data base is economically justified;
means for accessing said data base responsive to receiving said call;
means for retrieving from said data base, specific rate information associated with said call;
means for determining the selected one of said plurality of service providers based on said specific rate information; and means for routing the call through said selected one of said service providers.

13. The apparatus according to claim 12, wherein the rate information includes the basic rate structure of the service providers.

14. The apparatus according to claim 12, wherein the rate structure includes time-of-day discounts.

15. The apparatus according to claim 12, wherein the rate information includes special discounts available to the calling party.

16. The apparatus according to claim 12, further including means for determining if the call should not be routed to the selected one of said service providers.

17. The apparatus according to claim 12, wherein the data base is in the switching system.

18. The apparatus according to claim 12, wherein the data base serves a region of the network including said switching system.

19. The apparatus of claim 12, further including means for updating the data base with information regarding the calling party.

20. The method of claim 12, further including means for updating the data base with information regarding the rate information of said service providers, wherein the rate information is input to said data base through the network.