CA2391168A1

CA2391168A1 - System for automatic learning of destination telephone number

Info

Publication number: CA2391168A1
Application number: CA002391168A
Authority: CA
Inventors: Sanshiro Fukada; Thiam C. Gan
Original assignee: Individual
Current assignee: OPEN LCR Corp
Priority date: 1999-11-11
Filing date: 2000-11-10
Publication date: 2001-05-17
Also published as: AU1485001A; WO2001035627A1

Abstract

A communication device having a memory element (8) that provides a transmission carrier assignment module (21) and may also provide a learn module (7). The learn module can execute programmed elements such as a destination identifier capture element (9), a destination identifier add element (10), a destination identifier comparison element (11), and a destination identifier attribution element (12). Captured destination identifiers with their associated attributes can be transferred to a second CPU device (6) for further processing. The transmission carrier assignment module can execute programmed elements such as a destination identifier match table or distance assessment element (26), a holiday assessment element (27), day of week assessment element (28), time of day assessment elements (29) which implement decision tree logic to position a pointer in a destination identifier-carrier match table (30) to select a carrier index code for a preferred transmission carrier. Updated destination identifier-carrier match tables can be transferred from the second CPU device (6) based on the processed destination identifier information from the learn module (7).

Description

SYSTEM FOR AUTOMATIC LEARNING OF DESTINATION TELEPHONE NUMBER
I. TECHNICAL FIELD
Generally, this invention applies to devices and methods to match destination identification information to services offered by a plurality of transmission Garners.
Specifically, computer implemented methods to capture, and assign attributes to destination identifiers in a computer memory of limited capacity within a communication device, such communication device being programmable with updated destination identifier-transmission carrier match information.
II. BACKGROUND
The size of a table to store all the destination identification information that may be used to connect two communication devices over a transmission medium can become very large. For example, in Japan, there are more than 1,000 kinds of destination identification information and that number cannot be reduced to less than 100 kinds even after categorization by distance. In the United States, there are more than 100,000 kinds of area code-exchange code destination identification information (NPA-NXX) and that cannot be reduced to less than a few thousand even after categorization by distance. In order to store all of this destination identification information, the size of a table can readily become a few thousand bytes or tens of thousands of bytes when the number of entries in a table reaches a few tens to a few hundreds in number. Naturally, each jurisdiction may similarly have numerous types of destination identification information.
A significant problem in building a preferred routing function into communication device based on conventional technology, may be that of building a table for determining the preferred carrier into a communication device which has a memory element of sufficient size to store the few thousand bytes, or tens of thousand of bytes, or more required. The cost of providing a memory element of sufficient size to store this amount of information in a table within a communication device can be large compared to the total cost of the communication equipment. The result may be that manufacturers may increase the selling price of the communication device if the cost of the memory is high. However, as the cost of communication device goes up it may be predicted that the sales volume will go down.
A related problem in providing a table for determining the preferred carrier in conventional communication devices) may be that the memory element has a limited capacity in order that the manufacturer can build and retail the communication devices) at a competitive price.
Another significant problem with conventional preferred routing functions may be that there no way to identify a subset of destination identifiers commonly input to particular communication device(s). Since there may be no way to learn which destination identifiers are used by a pool of communication devices the conventional preferred routing function may have to provide an unnecessarily large memory space for tables in which destination information that may be input is stored.
Another significant problem with conventional preferred routing functions may be that it isn't possible to assign further attributes to the destination identifier after it is captured by the communication device. As such, these additional attributes may not be available for consideration in the selection of a preferred transmission Garner. This may be especially true if the memory element has limited capacity as above-described.
Another problem with convention preferred routing functions may be that they cannot be updated transmission carrier cost information or the manner of updating the communication device may be inconvenient. When there is any change in tariff, the tariff or transmission carrier cost information in preferred routing function may need to be changed. Since conventional communication devices cannot know that tariff or cost information has changed, a server of the conventional preferred routing service will call all the communication device and download updated transmission Garner cost information.
With conventional technology, there is no way of knowing if a call is from a server for downloading cost information or a regular phone call from somebody. Therefore, there may not be a way to answer the communication device automatically to download updated transmission Garner cost information. Somebody has to answer manually. This may make it impractical to download updated transmission carrier cost information. This approach essentially obviates downloading of information during the night time.
Still another problem with conventional preferred routing functions that are built into communication devices or are responsive to communication devices may be that they are not compatible with all transmission Garners. As such, the choice of transmission carriers can be limited. For example, a customer who buys a telephone that has a Japan Telecom preferred routing function may have to use Japan Telecom. If the customer does not like Japan Telecom and wants to use Teleway Japan, for example, the customer may have to purchase another phone.
Yet another problem with convention preferred routing functions may be that there is no way to predict the duration of transmission. As such, a common carrier that offers a low cost rate for short calls (e.g. 1 minute), and another common Garner that offers low cost rate for long calls (e.g. 3 minutes) may not differentiated in the selection process.
With respect to the problems of matching destination identification information to services offered by a plurality of transmission carriers and with computer implemented methods to capture and assign attributes to destination identifiers in a computer memory of limited capacity within a communication device above-described the present invention addresses these concerns in a practical fashion.
III. DISCLOSURE OF THE INVENTION
Accordingly, the present invention includes a variety of aspects which may be selected in different combinations based upon the particular application or needs to be addressed. Naturally, as a result of these several different and potentially independent aspects of the invention, the objects of the invention are quite varied.
A broad object of an embodiment of the invention can be to provide a preferred transmission Garner routing enterprise to coordinate destination identification information with a plurality of transmission Garners so that transmission of information between communication devices may be routed automatically with a preferred transmission Garner.
An aspect of this embodiment of the invention may be provide a low cost transmission routing services by selection of a lower cost transmission carrier from a plurality of carriers.
Another object of a particular embodiment of the invention is to offer preferred transmission routing devices and a method to select a lower cost transmission carrier fairly from the viewpoint of users with less bias toward any particular transmission carrier.
Another broad goal of embodiments of the invention can be to provide a method of storing destination identification information into less memory storage space.
Another object of a particular object of the invention may be to provide destination identifier learn technology. An aspect of this object of the invention may be to provide a computer implemented method for the capture, comparison, addition, and attribution of characteristics to destination identification information.
Another broad goal of embodiments of the invention can be to provide a computer implemented method of storing destination identification information which is compatible for use with relatively inexpensive telecommunication devices.
Another obj ect of a particular embodiment of the invention may be to provide a low cost Garner selection table.
Another broad goal of embodiments of the invention can be to provide a Garner access prefix number table Another object of an embodiment of the invention may be to provide devices and methods to download tables in short time by providing simplified tariff decision table(s).
Naturally further objects of the invention are disclosed throughout other areas of the specification and claims.

IV. BRIEF DESCRIPTION OF THE DRAWINGS
Figure 1 shows a particular embodiment of a transmission routing selection system.
Figure 2 shows a particular embodiment of a computer implemented method for transmission routing selection.
Figure 3 shows a particular embodiment of a second central processing unit or second memory device.
Figure 4 shows a particular embodiment of a communication device having a built in transmission carrier selection equipment.
Figure 5 shows a particular embodiment of tariff tables.
Figure 6 shows a particular embodiment of a destination identifier table.
Figure 7 shows a particular embodiment of a distance block table.
Figure 8 shows a particular embodiment of a distance table having a division number.
Figure 9 shows a particular embodiment of a time of day table, holiday index, day of week index, and a 24-hour index.
Figure 10 shows particular embodiments of a rate table having distance steps.
Figure 11 shows a particular embodiment of a predicted transmission or call duration table.
The figures are intended as exemplary guides to the invention. The kind and number of elements shown are not intended to limit the scope of the invention to a particular configuration or use.

V. MODES) FOR CARRYING OUT THE INVENTION
As can be easily understood from the foregoing, the basic concepts of the present invention may be embodied in a variety of ways. It involves information transmission techniques, information transmission routing techniques, destination identification information management techniques, and computer implemented methods for the organization, analysis, and utilization of destination identification information, among others.
In this application, these techniques and computer implemented methods are disclosed as part of the results shown to be achieved by the various devices described and as steps which are inherent to their utilization. They are simply the natural result of utilizing the devices as intended and described. In addition, while some devices are disclosed, it should be understood that these not only accomplish certain methods but also can be varied in a number of ways. Importantly, as to all of the foregoing, all of these facets should be understood to be encompassed by this disclosure.
Referring now to Figure 1, which shows an embodiment of the information transmission invention. A transmission medium ( 1 ) can be provided over which information, such as analog information, digital information, or the like, can be transmitted from one location to another. The transmission medium can be a wired or wireless transmission medium. As such, the transmission medium can be selected from group including laser, microwaves, radio waves, coaxial cable, twisted pair, fiber optic, telephone networks, Internet networks, voice over Internet protocol (VoIP) networks, as examples.
Naturally, other transmission media exists or may be developed that can be utilized to transmit such information.
As shown, a plurality of transmission Garners (2) can provide access to the transmission medium. The transmission carriers can include private company telecommunication networks or public telecommunication networks. The transmission Garner may be federally licensed telecommunication service providers, state licensed telecommunication service providers, Internet service providers, or the like.
Specific examples of such transmission carriers may be American Telephone & Telegraph, MCI, and America On Line among the numerous transmission carriers which provide services world wide. Naturally, each country or jurisdiction may have numerous transmission Garners to chose from and each individual transmission carrier may offer their services based upon different tariff or charge structures or may be differentiated by the types or quality of services provided, as described above. These tariff structures are based upon various information transmission attributes or characteristics, such as the distance between the first communication device (3) and the other communication device(s)(4), including differentiating distance based upon international or national transmission of information, the duration of information transmission, holiday or non-holiday information transmission, the day of week on which information is transmitted, the time of day at which information is transmitted, or the like. Naturally, carriers may also combine such attributes or characteristics into communication plans which provide modified charge structures or flexible charge structures based upon the aggregated attributes of transmitted information over a duration of time by a single or by multiple communication device users.
As such, and as described above, it can be difficult for a communication device user, or group of communication device users, to select a transmission Garner for the transmission of information, whether it may be for a specific transmission of information, or for numerous transmissions of information having attributes or characteristics in aggregate.
A first communication device (3) can be connectable to the transmission medium (1 ) through the plurality of communication transmission carriers (2) to transmit information to at least one other communication device (3). The first communication device (3) or at least one other communication device (4) can be a wireless or a wired communication device(s), for example, wireless residential telephones, wireless commercial telephones, cellular telephones, caller identification telephones, answering machine telephones, wireless facsimile devices, wired residential telephones, wired commercial telephones, wired facsimile devices, or wireless computers, wireless computer modems, wireless modem cards, palm pilots, wired computers, wired modems, wired modem cards, cabled modems, telephone modems, digital subscriber line modems, or the like. Naturally, the first communication device (3) or at least one other communication device(s)(4) can be any device which sends or receives information transmitted through the transmission medium (1) accessible by a transmission carrier (2), including devices which have the communication device built in such as GPS tracking devices, or household appliances, to provide a range of further examples.
To differentiate the first communication device (3) from other communication devices (4), which could conceivably number in the billions, trillions, or more, each communication device can be assigned a destination identifier comprised of a sufficient amount of destination identification information to distinguish the first communication device (3) from the numerous other communication devices (4). The destination identifiers may comprise numeric code, alphabet code, analog code, digital code, frequency modulated code or combinations and permutations of each. Naturally, from jurisdiction to jurisdiction, and in coordination with the various transmission carriers or types of communication devices being used, the kind and amount of destination identification information making up the destination identifier for each communication device may vary.
Particular embodiments of the invention may also comprise a first central processing unit (CPU) (5) providing the circuitry necessary to interpret and execute program instructions. The first CPU (5) can be located within the first communication device (3) or other communication device(s)(4), such as cordless telephone(s), caller identification telephone(s), an answering machine telephone(s), or similar devices. The first CPU (5) can further comprise a variety of memory elements, individually or in combination, including for example, random access memory (RAM), static random access memory (SRAM), dynamic random access memory (DRAM), read only memory (ROM), programmable read only memory (PROM), erasable programmable read only memory (EPROM), bubble memory, flash memory, or the like.
Numerous types, brands, and models of communication devices are available, as such there can be considerable variation with respect to the type of first CPU (S) or memory elements) which are built into, or can be made responsive to, a communication device. The first CPU(5) or memory element may have a limited capacity to store and manipulate information due to the limited build in space available in a particular communication device, or due to a desire to provide a CPU with limited capacity to save costs in manufacturing of the communication device, or it may be desirable to use a limited portion of the total capacity of the CPU reserving the remaining capacity to other functions. In any case, this limited CPU or memory element capacity may comprise as little as about 5 bytes of capacity, or have a range depending on the set of communication devices in the pool used to transmit information which may be between about 5 bytes to about 100 bytes or could be between about 50 bytes to about 1000 bytes. Naturally, as more capacity can be developed into CPUs and CPUs have smaller physical dimensions the CPU capacity that can be built into a communication device may increase the range to between about 5 bytes to 10,000 bytes, or more. Presently, due to all of the factors mentioned above, a large number of CPUs built into communication devices have a limited capacity of between about 5 bytes to about 1000 bytes. Due to this variation in the types, kinds, and capacities of the various CPUs either built into or responsive to communication devices it can be difficult to provide a standard program for the selection of transmission carriers with a communication device (3) and additionally difficult to use such a transmission Garner selection program with a variety of other communication device(s)(4), or to coordinate such a transmission carrier selection program between communication devices to facilitate the transmission of information.
Some embodiments of the invention further include a learn module (7) that manages destination identifier information within the CPU (5) built into communication device(s)(3)(4). This management of destination identifier information can be accomplished even in the context of limited CPU(5) capacity, such as the limited capacity described above.
The learn module (7) can execute programmed elements which can include a destination identifier capture element (9). The destination identifier capture element captures destination identification information input to the first communication device (3) and places the destination identification information into a memory element (8) which can comprise a destination identifier table. The amount of destination identification information captured may be a minimal amount sufficient to differentiate the first communication device (3) from other communication devices (4) connectable to the transmission medium (1) through the plurality of transmission Garners (2) or can be more depending on the embodiment of the invention.

The learn module can further include a destination identifier add element (10) which operates to store destination identifiers into the memory element (8), including , but not limited to, those described above. The amount of destination identification information placed into the memory element (8) or into the learn table comprises the destination identifier can be a minimal amount or an amount sufficient to differentiate communication devices, but does not necessarily have to be the entire destination identifier. An initial destination identifier input can be stored into the a memory element by the operation of these two elements (8)(9).
The learn module can also include a destination identifier comparison element (11).
The destination identifier comparison element ( 11 ) compares subsequently input destination identifiers to those already stored in the memory element (8). Destination identifiers that are dissimilar to those already stored in the memory element (8) can be added into storage or into a learn table by the destination identification add element (10). Thus, the pool of stored destination identifiers can encompass only differentiated or dissimilar destination identifiers without taking up additional CPU or memory capacity to store repeated destination identifiers.
The learn module can further include a destination identifier attribution element ( 12).
As described above, destination identification identifiers can have attributes or characteristics. The destination identifier attribution element (12) operates to further define destination identifiers by these attributes or characteristics. In one embodiment of the invention the destination identifier attribution element (12), counts the number of times a particular destination identifier is captured by the destination identifier capture element ( 11 ).
Thus, while repeated destination identifiers are not stored in the memory element (8), the stored destination identifier acquires a defining characteristic, in this case the number of times it is captured over a duration of time. In another embodiment of the invention, the destination identifier attribution element ( 12) can calculate the total amount of transmission time to another communication device defined each destination identifier stored in the memory element (8) or learn table. In yet another embodiment of the invention, the destination identifier attribution element ( 12) can distinguish between destination identifiers having a zone in common with the communication device owned by a user and destination identifiers having a different zone than the communication device owned by the user. For example, the destination identifier attribution element ( 12) can differentiate between national and international transmission or local and long distance transmission.
Naturally, other types of zones may be attributed to destination identifiers based on selected thresholds other than the borders of nation states or distance which can include cost per unit time, transmission carrier, or type of device as but a few examples.
The learn module (7) may further comprise a destination identifier rank element ( 13).
The destination identifier rank element (13) ranks destination identifiers in the memory element (8) or learn table by the attributions or characteristics associated with each destination identifier by using the destination identifier attribution element (12). The destination identifier rank element (13) can rank the destination identifiers stored in the memory element (8) or learn table by the number of instances a particular destination identifier is captured during a duration of time, the total duration of transmission time associated with the destination identifier, or by any routing characteristic attributable to the destination identifier as discussed above.
The learn module (7) may further comprise a destination identifier edit element ( 14).
The destination identifier edit element may provide an automatic destination identifier delete feature (15) that can operate based upon the number of destination identifiers within the memory element (8) or the learn table. For example, destination identifiers stored in the memory element (8) or in the learn table can be automatically held to a certain total number by deletion of any further destination identifiers captured.
The destination identifier edit element (14) may further include a destination identifier attribution limit element ( 16) that automatically stops the accrual of attributions to a particular destination identifier. For example, the destination identifier attribution limit element may allow uses of a particular destination identifier to be counted up to a certain number and then held at that number. Naturally, any attribute or characteristic, such as, frequency of use, duration of use, distance between communication devices, or zones, as discussed above, that can be attributed by the destination identifier attribution element ( 12) could be limited in a similar manner.
The destination identifier edit element (14) may further comprise a destination identifier transfer element (17). The destination identifier transfer element ( 17) can operate to transfer destination identifiers along with destination identifier attributions to a second CPU (6) providing the circuitry necessary to interpret and execute program instructions to match a single carrier from among the plurality of transmission carriers (2) having access to the transmission medium (1) to each transferred destination identifier from the memory element (8) or the learn table in the first CPU(5). An example of this arrangement is shown by Figure 1 which shows communication devices) (3) (4) that have a built in first CPU (5) as shown by Figure 1 but the first CPU (5) does not have sufficient capacity to interpret or execute all the programs necessary to match a transmission carrier with the destination identifiers in the memory element (8) or in the learn table. Naturally, in certain embodiments of the invention the first CPU (5) and the second CPU (6) can be combined into a single CPU
providing the circuitry necessary to interpret and execute the programs of both the first CPU
(5) and the second CPU (6). These embodiments of the invention balance the capacity of the first CPU (5) with a memory element (8) having as little as 5 bytes of available memory storage with the capacity of the second CPU (6) with a memory element (19) having a larger memory storage. In some embodiments of the invention, for example, there may be an insufficient amount of capacity in the first CPU (5) to include the destination identification rank element (13) and the destination identification rank element may be included in the operations carried out by the second CPU(6).
The destination identifier transfer element (17) can be triggered automatically by a variety of events including, for example, the elapse of a set amount of time, the memory element (8) or the learn table contains the maximum number of allowed destination identifiers, the maximum number of allowed attributions to a destination identifier is reached, or the like.
The first CPU (5) may further comprise a transmission carrier assignment module (21). The transmission Garner assignment module (21) can provide a transmission carrier identifier-destination identifier match table (22) in which selected transmission carriers can be assigned to each of the destination identifiers stored in memory element (8) or in the learn table. The transmission Garner identifiers can be entered into the transmission carrier assignment module manually, for example through a keypad or other destination identifier input element (37), on the communication devices) (3)(4), or from the second CPU (6) or even another CPU(23) device. In some embodiments of the invention the learn module (7) and the transmission Garner assignment module (21) can comprise a single programmable relational data base.
After transmission carrier assignment information is input manually, or transferred from the second CPU (6), to the transmission carrier assignment module (21 ) in the first CPU
(5), destination identifiers subsequently captured by the destination identifier capture element (9) automatically connect the communication device (3)(4) to the transmission Garner assigned to that destination identifier.
Now referring to Figures 1 and 2, an example of an embodiment of a transmission carrier assignment module (21 ) can comprise a distance assessment element (26) that in some embodiments of the invention can comprise a separate domestic destination identifier table and a separate international destination identifier table (OXX identifier for international destination identifiers, 1 for domestic destination identifiers, as used in the United States, or OOXX for international destination identifiers, 0 for domestic destination identifiers, as used in Japan, as but two examples) to which captured destination identifiers are compared.
Similarly, the distance assessment element (26) can be structured to differentiate destination identifiers based on area code information, such as international country codes or the three digit area codes in the United States or the equivalent types of codes in the various jurisdictions in which the invention may be used. A pointer is provided to the next hierarchical step which can be a holiday assessment step.
The transmission carrier assignment module (21 ) can further comprise a holiday assessment element (27) that in some embodiments of the invention can comprise tables that matches holidays to the date on which the destination identifier is captured or is entered into the communication devices) (3)(4) for example. A first holiday match table may be used for domestic destination identifiers and a second used for international destination identifiers, as but one example. The holiday assessment element (27) based on the decision provides a pointer to the next step in the hierarchy.
The transmission carrier assignment module (21 ) can further comprise holiday time of day assessment element (28) that in some embodiments of the invention can comprise a domestic destination holiday time of day table and an international destination identifier holiday time of day table. The time of day table can be incremented in desired intervals, such as one hour intervals, providing 24 columns in the time of day table.
Naturally, other increments could be used.
The transmission carrier assignment module (21 ) can further comprise a day of week assessment element (28) that can determine what day of the week is associated with the date the destination identifier is entered into the communication devices) (3)(4).
1 S The transmission carrier assignment module (21 ) can further comprise a time of day assessment element (29). The time of day assessment element (29) can comprise several tables including a domestic destination identifier weekday time of day table and an international destination identifier weekday time of day table. The time of day assessment element (29) can further comprise a domestic destination identifier Saturday time of day table and an international destination identifier Saturday time of day table.
Similarly, the time of day assessment element (29) can further comprise a domestic destination identifier Sunday time of day table and an international destination identifier Sunday time of day table. The tables can be incremented in desired intervals such as one hour intervals or otherwise responsive to an interanal clock element (35).
Each of the above-described tables functions to define the location within the transmission carrier index or destination identifier-carrier match table (30) or which of multiple destination identifier-carrier match tables to search for the destination identifier with a Garner code appended. A Garner code from the table can then be used to retrieve the transmission Garner identifier. The transmission carrier identifier is responsive to a transmission carrier connect element (31) that connects the communication device to transmission media (1) through the selected transmission carrier (2) destination identifier s carrier match table.
Now refernng to Figures 1 and 2, Figure 2 shows a flow diagram of a particular embodiment of the invention and which also provides a specific example of the functional hierarchical organization of that particular computer implemented method as a guide to the invention. While this example of an embodiment of the invention utilizes telephone devices having at least one memory element along with destination identification information that may be typical of telephone destination identifiers used in the United States, this example is not intended to limit the scope of the technology and specifically is not meant to limit the scope of the types of communication devices, or destination identifiers, or memory elements that may be used in various other embodiments of the invention.
The invention can select a preferred transmission Garner, which may be based on low cost, in the following manner:
1. Capture the destination identifier, if the first digit is a 1 for domestic transmission the domestic destination identification table (40) is searched for the destination identifier. If the first digits are 011, then the international destination identification table (41) is searched for the destination identifier.
2. If the destination identifier is in either the domestic destination identification table (40) or the international destination identification table (41), then transmission carrier selection is performed as set out in step 4.
If, no, then abort transmission carrier selection and proceed to step 3 3. Update the learn table (43).
a. Does the destination identifier match an entry in the learn table (43)?

i. if, yes, then increment the count (44)(12) by 1, update the learn table (7), then dial the call without LCR function (31), and continue to 3b.
ii. if, no, add ( 10) destination identifier to the learn table (43) and set counter (12) to 1, update the learn table (7), then dial call without LCR function (31).
b. then check if learn table (43) has maximum entries:
i. if, yes, continue to 3d.
ii. if, no, then continue c.
c. then check if destination identifier attributes has reached a variably selectable count:
i. if no, stop processing ii. if, yes, continue to 3d..
d. check if learn table (43) has been processed within a variable selectable time period, for example 30 days:
i. if, no, then up load (48) learn table (43) to second CPU(6) per 3e.
ii. if, yes, stop processing.
e. combine destination identifiers information from learn table (43) with attributes and destination identification information from DII tables) (40) and (41) with attributes and upload to second CPU (6).
4. Perform transmission carrier selection.
a. check holiday table (45):
i. if, holiday, go to holiday time of day table (46), get transmission carrier pointer associated with the time of day in 1 hour increments, continue to 4c.
ii. if, not holiday, then continue to 4b.
b. check weekday, Saturday, Sunday time of day tables (47). Get transmission carrier pointer associated with the time of day in 1 hour increments, continue to 4c.
c. Refer back to destination identification tables) DII (40)(41) use pointer to select 1 of 12 columns within the destination information row (33), read earner index and cross reference earner index to transmission carrier index or transmission earner index or carrier match table (30) to yield the carrier identification code, continue to 4d.
d. Increment the destination identification information counter ( 26 ) by 1 in the destination identification table(s)(40) or (41) and continue to 4e.
e. Insert earner identification code before destination identifier to connect with the selected transmission carrier (for example, carrier identification code+1+destination identifier).
The invention can also perform automatic upload in the following manner:
a. Everyday or at a pre-determine date, the communication device check against internal clock to see if the predetermine automatic call-back date is reached.
This predetermine call back date is set at second CPU (6) and downloaded from second CPU (6).
b. If the date is reached, the device will initiate call back process by generating a random time in the next 24 hours for call back.
c. At the randomly generated time, the communication device can automatically call the second CPU (6) via a telephone number (Server Telephone Number) that has been pre-programmed into the communication device's ROM
memory or memory element. This Server Telephone Number can also be changed by downloading new numbers from second CPU (6) into the device memory.
d. When connected to the CPU (6), the device will combine destination identifier information from learn table (7) with attributes and destination identifier information from table (26) with attributes, and upload the combine information to second CPU (6).
In order to accomplish the obj ectives described above, the preferred transmission earner routing equipment and methods which comprises the invention can be offered by a preferred transmission earner routing company or (the "company") independent of any common earner. The company collects the tariff information of all the common earners, prepares the information necessary for selecting the least expensive carrier based upon parameters such as distance, when to call, call duration, call frequency per month, and concentration to particular destinations, for example. As described above this information may be downloaded to the transmission Garner assignment module (21 ) in a communication device (3)(4) as may be desired.
Now referring to Figure 3, to provide transmission carrier assignment information from the second CPU (6), the second CPU (6) or server provides the circuitry necessary to interpret and execute program instructions to select a transmission Garner from a plurality of transmission Garners (2) and to match the selected transmission Garner to a destination identifier. The second CPU (6) or transmission Garner selection system can comprise server equipment (50) is composed of line unit (51), Central control unit (52), memory unit (53), output unit (54) and input unit (55). The line unit (51 ) responds to an incoming call from the communication device (3) or (4) with built-in transmission carrier assignment module (21), and can receive a caller ID number which comes from the subscriber line, manufacturer code and model type of communication device or equipment. This information is passed to a central control unit (52), and can be stored in memory unit (53). Memory unit (53) may already store tariff information of each common Garner that corresponds to the caller ID
number. Using the caller ID number that may be received as a key, the corresponding tariff information of each common carrier is searched. The information necessary for preferred transmission carrier routing decision is extracted from memory unit (53), and the information is transmitted from line unit (51 ) to the transmission Garner assignment module of the communication device (3) or (4) or telephone equipment. Caller ID number, manufacturer code and model type which are stored in memory unit (53) are transmitted from output unit (54) periodically and are used for telemarketing or customer management by manufacturers.
When it may be necessary transfer or transfer a change in tariff information, the new tariff information is input through input unit (55) and is stored in memory unit (53).
Figure 4 shows a basic example of a specific embodiment of the invention utilizing telephone equipment (3) (but could work with any similar type of communication device even if built into non-telephone devices or appliances) with built-in transmission carrier selection equipment (56), which is composed of line unit (57), central control unit (58), memory unit (59) and clock unit (60). When it is first installed to a subscriber line after purchase, the central control unit (58) of the telephone equipment or other communication device (3) dials the preprogrammed telephone number through the line unit (57), and connects with the server equipment (50). If server equipment (50) responds, line unit (57) transmits the manufacturer code and model type that are stored. It receives the routing information transmitted from server equipment (50), and stores it to memory unit (59). It may search for routing information stored in memory unit (59) based upon the destination telephone number dialed by a user, and day of the week information, time information and holiday information read from clock unit (60). Central control unit (58) determines which common carrier to use. It sends out the prefix dial necessary to use the determined common earner and the destination telephone number from line unit (57). If power supply to the telephone equipment (3) stops temporarily, the routing information in memory unit (23) can remain stored. If the power supply and the connection to a subscriber line stop for more than predetermined length in time, then it is regarded as a user that has moved to another location and the same procedure takes place as a new installation, as above described, when the power supply and the connection to a subscriber line recover.
The example shown by Figure 5 are tariff tables; a first table (61) uses 2 common earners, a second table (62) uses 3 common earners and a third table (63) that use N number of common earners or transmission carriers. One of the 2-earner selection, 3-earner selection or N carrier selection is chosen according to a user choice and the corresponding table is used.
The example shown by Figure 6 is a table or destination identifier table (64) to use the first several digits of telephone number or destination identifier. When the destination telephone number dialed by a user matches the telephone number or destination identifier in this table (64), then one of the common carriers or plurality transmission earner (2) may be chosen. If the destination telephone number or destination identifier does not match any of the telephone numbers in this table (64), then the other common earner or a default common carrier may be chosen.

Sometimes special dialing is necessary for using a special calling plan. This can be done automatically. If the tariff changes and the lower cost calling plan is changed, the tariff table is automatically updated and then has the most up-to-date information. If a common Garner introduces a new calling plan, the new calling plan is added and users can always enj oy using the lower cost calling plan. With this invention, a company that offers a transmission carrier routing service can effect widespread distribution of the transmission carrier routing service in large quantity without a large investment. With this invention, the telephone equipment can automatically answer the incoming call from the server equipment (50) of the company, and therefore the efficiency of updating the data in telephone equipment or communication devices) will improve and also update can be done during nighttime.
A further example of particular embodiments of the decision tables) utilized in the invention as implemented in Japan (similarly the decision tables could be established for other countries or types of destinaton indentification information) they could be are provided in Figures 7-11 as a guide, however, the example is not meant to limit the scope of the invention to this embodiment, and specifically does not limit the use of the invention to a particular type of communication device. In this embodiment of the invention the transmission carrier assignment module (21), or its equivalent, can utilize a distance block table, a distance table, a time of day table, and a rates table.
The distance block table has distance block information corresponding to message identification information. The content of distance block information is a pointer to corresponding distance in distance table.
The distance table of this invention has the maximum distance of the concerned distance block corresponding to actual distances, and is used along with rates table to search for unit charge and unit time.
The time of day table of this invention is composed of day of the week index, holiday index amd 24 hours index, and is used to search for the corresponding unit charge and unit time in rates table based upon time of day, time and date.

The time of day index of this invention is composed of 7 pointers. A pointer corresponds to each of Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, or Sunday.
Each pointer shows which 24-hour index to use among multiple 24-hour indices.
The holiday index of this invention has year-month-day information and pointer. Each pointer shows which 24-hour index to use among multiple 24-hour indices.
The 24-hour index of this invention is composed of 24 pointers. Each pointer corresponds to midnight to each one hour thereafter 1 am, 1 am to 2 am, ... or 11 pm to midnight and so forth, and points to corresponding unit charge and unit time in rates table.
The rates table of this invention has unit charge and unit time for each distance block.
If rate is different for different day of the week, dates, or time of day, then rates table has multiple unit charges and unit times.
The decision tables) of this example of a particular embodiment of the invention operate as follows. It receives the telephone number of the called party dialed by a user, and the current date, day of the week, and time. It decides that the call is a local call if the first digit is other than 0. If the first digit of the dialed digits is 0, a distance block table is looked up with the second and following digits as key. As a result of the table look up if corresponding message area identification information is found, the corresponding distance block information is read out. The corresponding distance is read out from distance table using the distance block information.
The current date is checked against the holiday index. If included, go to 24-hour index pointed by the pointer in the holiday index. If not included, go to 24-hour index pointed by the pointer of the day of the week index corresponding to the current day of the week. Using a pointer corresponding to current time among 24-hour indices and the distance read out from distance table, corresponding unit charge and unit time are read out from rates table. This operation is repeated for each carrier and the unit charge and unit time of each carrier is read out.

Charges for a call are calculated using unit charge and unit time of each carrier, and predicted call duration. The least expensive carrier is determined by comparing charges of each Garner.
An example of implementation is shown in Figures 7-11. Now referring to Figure 7, it shows an example of distance block table of the invention. Figure 8 shows an example of distance table of this invention. Figure 9 shows an example of time of day table of this invention. Figure 10 shows an example of rates table. If N carriers are compared, N time of day tables and N rates tables are required. This example assumes that 2 carriers are compared. Figure 11 shows an example of a predicted call duration table.
In the example shown in figure 7, a distance block table (65) consists of message area identification information list (66) and distance block pointer (67). The received telephone number of the called party (excluding the first 0 for certain embodiments) is compared with message area identification information digit by digit. If the first digit matches a message area identification information list, then the next digit of the message area identification information list is read. If the next digit is the termination code, then the search is completed and the distance block pointer of the row is read out. If the next digit is not the termination code, then the search is continued.
In the example shown in figure 2, a distance table (68 ) has division number (69) which divides the actual distance into steps. A division number pointed by the distance block pointer is read out.
In an example shown in Figure 9 , a time of day table (74) consists of holiday index (70) and (71), day of the week index (72) and (73), 24-hour index (74) and (75).
Holiday index consists of year-month-day and pointer. Day of the week index consists of 7 pointers and they corresponds to Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, or Sunday.
The 24-hour index consists of 24 pointers and each pointer corresponds to each hour from 0 to 24 hours. If the received current date is included in the holiday index, go to the column of rates table pointed by the pointer. If not, then go to the day of the week index. Go to the 24-hour index pointed by the pointer of the current day of the week among day of the week indices. Go to the column of rates table pointed by the pointer of the current time in the pointed 24-hour index. These operations are repeated in (70), (74) and (72), and the same operations in (71), (73) and (75).
In an example shown in Figure 10, rates table (76) consists of distance steps (77) in vertical axis, and unit time (78) and unit charge (79) associated to each time of day on horizontal axis. In this example we assume that there are 3 kinds of unit time (78), (80) and (82), and also 3 kinds of unit charge (79), (81) and (83). We also assume that the rate table (84) that corresponds to the second carrier is composed the same. The corresponding unit charge and unit time in rates table (76) is read out using block number (69) read from distance table (68), and pointer read from holiday index (70) or pointer read from 24-hour index (74). The same operation is performed to rates table (84), and then the corresponding unit charge and unit time are read out.
In the example shown in figure 11, a predicted call duration table (92) has multiple predicted call durations in seconds, and corresponds to the extension phone equipment used.
A call charge is calculated for each carrier using predicted call duration, unit charge and unit time. The least expensive carrier is determined and the prefix dial or carrier identification code can be dialed to choose the said Garner.
The following example can be representative of the use as implemented into practice with four different Casio ~ cordless phone Models: CP-2575, CP-1275, TC-2775, TC
1425. The example is not intended to limit the scope of the invention but is merely illustrative of some embodiments of the invention. In particular the invention should not be understood to be limited to the use of Casio ~ cordless phone Models: CP-2575, CP-1275, TC-2775, TC
1425.
To use a Low Cost Routing (LCR) feature on these phones or similar type communication devices the customer is required to register and activate the LCR service.

To activate the LCR feature found on these phones the customer is required to register with a LCR service, such as openLCR.com. The activation process can be accomplished by one of four exemplary methods as set out below:
1. IVR (Interactive Voice Response) 2. by the openLCR.com Web Site, 3. by Fax, and 4. by US Mail.
This activation process sets up a customer's personal profile as well as a customer's selected long distance telephone Garner profile. These profiles are entered into a customer database, using the customers telephone number and telephone model number as the key index for customer identification.
Activation b,~IV-R
To access the IVR system the customer pick up the handset and presses talk and listen for a dial tone, then press the autodial key and then press the # (pound) key.
The phone will automatically dial a pre-stored telephone number (from factory) and connect to openLCR's inter-active voice response (IVR) system and the computer Server. The phone will then upload the manufacturer and model number of the phone to the computer server.
Voice prompts from the IVR system will guide the customer through the registration process. The customer must identify the name of his selected out-of state long distance telephone service and the calling plan. The customer presses the telephone keys in response to the questions that are ask for selected telephone Garner information. Then, when prompted, the customer record his name, address, and telephone number. At the next voice prompt, the customer places the handset in the charging cradle immediately to download new LCR
Information including the current time and date. A predetermined automatic callback date is also downloaded and will be programmed into the phone's memory. During the download (about two minutes) process, the Base unit of the telephone's "LCR" indicator will blink. When downloading is completed, the Base LCR indicator will turn on, a single long beep will be heard, and the LCR feature is activated. From this point the phone will automatically call back at the predetermined callback date for an automatic update of LCR
information from the computer server.
Activation by openLCR.com Web Site:
Access the openLCR web site (www.openlcr.com) and select the option for activation. The customer is then prompted to create an account with openLCR.
The customer enters their telephone number, choose the phone manufacturer and choose the model number of the telephone. The customer is prompted to enter their selected long distance telephone carrier profile consisting of Garner name and service plan. Next the customer is also prompted to enter their personal profile consisting of their name, address, password and the like.
The customer has the additional option, of entering "locked" frequently called numbers on the openLCR web site to further customize the LCR Information that is downloaded to the phone. When the personal account is created, the customer will be asked to initiate download to the telephone.
1 S To download LCR data into the phone, the customer connect the phone to a telephone line, and presses the autodial key, then press the # (pound) key. The phone will automatic dial a pre-stored telephone number (programmed from factory) and connect to openLCR's inter-active voice response (IVR) system and the computer server. The phone will then upload the manufacturer and model number of the phone to the IVR system. Voice prompts will guide the customer to download the LCR information into the telephone, including the current time and date. A predetermined automatic callback date is also downloaded and will be programmed into the phone's memory. During the download (about two minutes) process, the Base unit of the telephone's "LCR" indicator will blink. When downloading is completed, the Base LCR indicator will turn on, a single long beep will be heard, and the LCR feature is activated. From this point the phone will automatically call back at the predetermined callback date for an automatic update of LCR information from the computer server.

WO 01!35627 PCT/US00/31030 Registration by Fax and US mail.
These methods of registration rely on the user filling out a form that was enclosed in the box with phone purchase and than faxing or mailing the form to openLCR.com. The customer is advice to wait 3 business days and then to initiate the activation process.
For activation process and to download LCR data into the phone, the customer connect the phone to a telephone line, and presses the autodial key, then press the # (pound) key. The phone will automatic dial a pre-stored telephone number (programmed from factory) and connect to openLCR's inter-active voice response (IVR) system and the computer server. The phone will then upload the manufacturer and model number of the phone to the IVR system. Voice prompts will guide the customer to download the LCR
information into the telephone, including the current time and date. A
predetermined automatic callback date is also downloaded and will be programmed into the phone's memory. During the download (about two minutes) process, the Base unit of the telephone's "LCR" indicator will blink. When downloading is completed, the Base LCR
indicator will turn on, a single long beep will be heard, and the LCR feature is activated.
From this point the phone will automatically call back at the predetermined callback date for an automatic update of LCR information from the computer server.
After activation, the customer's phone will route domestic and international long distance calls to a low cost Garner if the call charges of the low cost Garner are less expensive than the customer' selected primary Garner. The Base unit's LCR indicator will light during telephone call to indicate that low cost routing is working.
The computer server (6) can comprise a Compaq Computers with four 800MHz processors 2G byte of RAM, and 1006 Byte of hard disk storage, for example.
The computer can run on a Window NT~ operating system and the customer database can be applications running under Oracle relational database, or similar programs.
It is thought that the apparatuses and methods of the embodiments of the present invention and many of its attendant advantages will be understood from the foregoing description and it will be apparent that various changes may be made in the form, construction and arrangement of the parts thereof without departing from the spirit and scope of the invention or sacrificing all of its material advantages, the form hereinbefore described being merely a preferred or exemplary embodiments thereof.
Particularly, it should be understood that as the disclosure relates to elements of the invention, the words for each element may be expressed by equivalent apparatus terms or method terms--even if only the function or result is the same. Such equivalent, broader, or even more generic terms should be considered to be encompassed in the description of each element or action. Such terms can be substituted where desired to make explicit the implicitly broad coverage to which this invention is entitled. As but one example, it should be understood that all action may be expressed as a means for taking that action or as an element which causes that action. Similarly, each physical element disclosed should be understood to encompass a disclosure of the action which that physical element facilitates.
Regarding this last aspect, and as but one example the disclosure of "a destination identifier comparison element " or "a means for comparing destination identifiers" should be understood to encompass disclosure of the act of "comparing destination identifiers"--whether explicitly discussed or not--and, conversely, were there only disclosure of the act of "comparing destination identifiers", such a disclosure should be understood to encompass disclosure of "a means for comparing destination identifiers" or "a destination identifier comparison element". Such changes and alternative terms are to be understood to be explicitly included in the description.
Any acts of law, statutes, regulations, or rules mentioned in this application for patent; or patents, publications, or other references mentioned in this application for patent are hereby incorporated by reference. Specifically, United States Patent Application Nos.
60/187,945; 60/188,903; and 09/631,332; and Japanese Patent Application No. 11-are each hereby incorporated by reference herein, including any figures or attachments.
Moreover, each of the references in the following table of references are hereby incorporated by reference herein.

U.S. PATENT DOCUMENTS
DOCUME DATE NAME CLASS SUBCLASS FILING
NT NO. DATE

4,104,48608/1/78 Martin et al. 179 2 AM 06/29/76 4,122,30808/24/78 Weinberger et 179 7.1 R 06/03/77 al.

4,136,26201/23/79 Clark, Jr. 179 6.3 R 09/15/77 4,198,54504/15/80 Haist et al. 179 6.31 03/08/78 4,209,66806/24/80 Wienberger et 179 90 B 09/20/78 al.

4,226,36008/07/80 Simjian 235 375 12/19/78 4,275,27306/23/81 02/08/79 4,410,76508/18/83 Hestad et al. 179 7.1 R 06/04/81 4,439,63603/27/84 Newkirk et al. 179 7.1 R 03/09/82 4,521,85706/04/85 Reynolds, III 364 439 05/17/83 4,585,90404/29/86 Mincone et al. 179 7.1 TP 01/06/84 1 4,656,65704/07/87 Hunsicker 379 140 08/15/85 S

4,751,72806/14/88 Treat 379 113 03/27/87 4,751,72906/14/88 Coleman 379 376 05/01/87 4,813,06503/14/89 Segala 379 112 08/13/87 4,888,82212/19/89 Weinberger et 379 130 01/05/89 al.

4,935,95606/19/90 Hellwarth et al. 379 112 04/20/89 5,003,58403/26/91 Benyacar et al. 379 119 04/16/90 5,163,04211 /10/92Ochiai 370 17 11 /22/89 5,187,71002/16/93 Chau et al. 370 110.1 12/19/90 5,251,25010/05/93 08/21 5,267,30811/30/93 09/23/91 5,319,70106/07/94 Hird et al. 379 132 03/04/93 5,343,51808/30/94 01/14/93 5,425,08506/13/95 Weinberger et 379 112 03/18/94 al.

5,515,42505/07/96 01 /19/93 5,519,76905/21/96 Weinberger et 379 112 04/04/94 al.

5,799,07108/25/98 10/05/92 5,894,50704/13/99 05/31/96 5,903,63405/11/99 03/20/97 5,903,634 FOREIGN PATENT DOCUMENTS
DOCUMENT DATE COUNTRY CLASS SUBCLASS TRANSLATION
NO

YES NO

3-78396 08/22/89 Japan 4-56007 02/07/92 Japan S 2-309747 05/25/89 Japan 2-310492 05/25/89 Japan 3-143145 10/30/89 Japan 5-003518 01-08-93 Japan 5-030334 02-05-93 Japan 5-114989 05-07-93 Japan 5-207541 08-13-93 Japan 5-236076 09-10-93 Japan 5-244239 09-21-93 Japan 5-327848 12-10-93 Japan 5-336338 12-17-93 Japan 5-344188 12-24-93 Japan 6-046090 02-18-94 Japan 6-078132 03-18-94 Japan 6-113007 04-22-94 Japan 6-133018 05-13-94 Japan 6-152712 05-31-94 Japan 6-164484 06-10-94 Japan 6-197169 07-15-94 Japan 6-205093 07-22-94 Japan 6-205118 07-22-94 Japan 6-209375 07-26-94 Japan 6-276252 09-30-94 Japan 63-98251 10/14/86 Japan 63-98252 10/14/86 Japan 63-99658 10/15/86 Japan 63-135050 11/26/86 Japan 63-135051 11/26/86 Japan 63-151146 12/15/86 Japan 63-151147 12/15/86 Japan 63-151148 12/15/86 Japan 63-151149 12/15/86 Japan 63-169152 12/29/86 Japan 63-169153 12/29/86 Japan 64-7125 09/11/87 Japan OTHER DOCUMENTS (Including Author, Title, Date, Pertinent Pages, Etc.) US Application 60/187,945, entitled "LCR Equipment to Choose the Lowest Cost Carrier Among Many Common Carriers", filed on March 3, 2000 US Application 60/188,903, entitled "LCR Telephone Tariff Table Structure", filed on March 13, 2000.

US Application 09/631,332, entitled "A System For Determining A Low Cost Communication Carrier", filed on August 2, 2000.

Additionally, as to each term used it should be understood that unless its utilization in this application is inconsistent with such interpretation, common dictionary definitions should be understood as incorporated for each term and all definitions, alternative terms, and synonyms such as contained in the Random House Webster's Unabridged Dictionary, second edition are hereby incorporated by reference herein. However, as to each of the above, to the extent that such information, statements, or definitions incorporated by reference might be considered inconsistent with the patenting of these inventions) such information, statements, or definitions are expressly not to be considered as made by the applicant(s).
Moreover, the various combinations and permutations of all elements or applications can be created and presented. All can be done to optimize the design or performance in a specific application.
In addition, unless the context requires otherwise, it should be understood that the term "comprise" or variations such as "comprises" or "comprising", are intended to imply the inclusion of a stated element or step or group of elements or steps but not the exclusion of any other element or step or group of elements or steps. Such terms should be interpreted in their most expansive form so as to afford the applicant the broadest coverage legally permissible in countries such as Australia and the like.
Thus, the applicants) should be understood to have support to claim at least:
i) each of the transmission systems, transmission routing devices, or communication devices as herein disclosed and described, ii) the related methods disclosed and described, iii) similar, equivalent, and even implicit variations of each of these devices and methods, iv) those alternative designs which accomplish each of the functions shown as are disclosed and described, v) those alternative designs and methods which accomplish each of the functions shown as are implicit to accomplish that which is disclosed and described, vi) each feature, component, and step shown as separate and independent inventions, vii) the applications enhanced by the various systems or components disclosed, viii) the resulting products produced by such systems or components, ix) methods and apparatuses substantially as described hereinbefore and with reference to any of the accompanying examples, x) the various combinations and permutations of each of the elements disclosed, xi) processes performed with the aid of or on a computer as described throughout the above discussion, xii) a programmable apparatus as described throughout the above discussion, xiii) a digitally readable memory encoded with data to direct a processor comprising means or elements which function as described throughout the above discussion, xiv) a computer configured as herein disclosed and described, xv) individual or combined subroutines and programs as herein disclosed and described, xvi) the related methods disclosed and described, xvii) similar, equivalent, and even implicit variations of each of these systems and methods, xviii) those alternative designs which accomplish each of the functions shown as are disclosed and described, xix) those alternative designs and methods which accomplish each of the functions shown as are implicit to accomplish that which is disclosed and described, xx) each programmable feature, component, and step shown as separate and independent inventions, and xxi) the various combinations and permutations of each of the above.

Claims

VI. CLAIMS
We claim:

1. A computer implemented method of managing destination identification information, comprising the steps of:
a. capturing destination identifiers;
b. comparing captured destination identifiers to previously captured destination identifiers;
c. adding dissimilar destination identifiers to a learn table; and d. attributing characteristics to said destination identifiers within said learn table;

2. A computer implemented method of managing destination identification information as described in claim 1 wherein said step of attributing characteristics to said destination identification elements within said learn table comprises counting the number of times a particular destination identifier is captured.

3. A computer implemented method of managing destination identification information as described in claim 1 wherein said step of attributing characteristics to said destination identifiers within said learn table comprises calculating total transmission time to a location defined by said destination identifiers within a duration of time.

4. A computer implemented method of managing destination identification information as described in claim 1 wherein said step of attributing characteristics to said destination identifiers within said learn table comprises determining the distance of transmission to said location defined by said destination identifiers.

5. A computer implemented method of managing destination identification information as described in claim 1 further comprising the step editing said destination identifiers within said learn table.

6. A computer implemented method of managing destination identification information as described in claim 5 wherein said step of editing said destination identifiers within said learn table comprises deleting at least one destination identifiers from within said learn table.

7. A computer implemented method of managing destination identification information as described in claim 1 further comprising the step of assessing when a variably selectable limit of said destination identifiers have been added to said learn table.

8. A computer implemented method of managing destination identification information as described in claim 7 further comprising the step of declining to add additional destination identifiers to said learn table.

9. A computer implemented method of managing destination identification information as described in claim 1 further comprising the step of assessing when a variably selectable limit of destination identifier attributes have been added to said learn table.

10. A computer implemented method of managing destination identification information as described in claim 9 further comprising the step of declining to attribute additional characteristics to said destination identifiers within said learn table.

11. A computer implemented method of managing destination identification information as described in claim 10 wherein said step of declining to attribute additional characteristics to said destination identifiers within said learn table comprises declining to count the number of times a particular destination identifier is captured.

12. A computer implemented method of managing destination identification information as described in claim 1 further comprising the step of assigning one of a plurality of transmission carriers to each of said destination identifiers within said learn table.

13. A computer implemented method of managing destination identification information as described in claim 12 wherein said step of assigning one of a plurality of transmission carriers to each of said destination identifiers within said learn table comprises assigning a low cost transmission carrier within said plurality of transmission carriers.

14. A computer implemented method of managing destination identification information as described in claim 1, further comprising the steps of:
a. maintaining a transmission carrier index;
b. maintaining at least one destination identifier match table responsive to said transmission carrier index;
c. matching said captured destination identifiers to a transmission carrier within said transmission carrier index using said destination identifier match table;
and d. reading out said transmission carrier code matched to said destination identifier.

15. A computer implemented method of managing destination identification information as described in claim 14 further comprising the step of connecting a communication device to a transmission medium through said transmission carrier matched with said destination identifier.

16. A computer implemented method of managing destination identification information as described in claim 14 further comprising the editing said at least one destination identifier match table.

17. A computer implemented method of managing destination identification information as described in claim 16 wherein said step of editing said destination identifier match table comprises the step of revising said destination identifier match table based on distance of transmission.

18. A computer implemented method of managing destination identification information as described in claim 16 wherein said step of editing said destination identifier match table comprises the step of revising said destination identifier match table based on stored holiday information.

19. A computer implemented method of managing destination identification information as described in claim 16 wherein said step of editing said destination identifier match table based on routing characteristics comprises the step of revising said destination identifier match table based on stored day of week information.

20. A computer implemented method of managing destination identification information as described in claim 16 wherein said step of editing said destination identifier element match table based on routing characteristics comprises the step of revising said destination identifier match table based on stored time of day information.

21. A computer implemented method of managing destination identification information as described in claim 16 wherein said step of editing said destination identifier match table comprises selecting from a plurality of destination identifier match tables based on said routing characteristics.

22. A computer implemented method of managing destination identification information as described in claim 16 wherein said step of editing said destination identified match table comprises the step of revising said destination identifier match table manually.

23. A computer implemented method of managing destination identification information as described in claim 22 wherein said step of editing said destination identifier match table manually comprises transmitting a revised destination identifier match table from a second computer device.

24. A computer implemented method of managing destination identification information as described in claim 1, further comprising the step of using a computer device having a limited capacity selected from the group consisting of about 5 bytes, between about 5 bytes and about 50 bytes, between about 50 bytes and about 100 bytes, between 100 bytes and about 1,000 bytes, between about 1,000 bytes and about 2,000 bytes, between about 2,000 bytes and about 3,000 bytes, between about 3,000 bytes and about 4,000 bytes, between about 4,000 and about 5,000 bytes, between about 5,000 bytes and about 6,000 bytes, between about 6,000 bytes and about 7,000 bytes, between about 7,000 bytes and about 8,000 bytes, between about 8,000 bytes and about 9,000 bytes, and between about 9,000 bytes and about 10,000 bytes.

25. A computer implemented method of managing destination identification information as described in claim 24 further comprising the step of locating said computer device inside a communication device.

26. A computer implemented method of managing destination identification information as described in claim 25 further comprising the step of selecting said communication device from the group consisting of wireless communication devices, wireless residential telephones, wireless commercial telephones, cellular telephones, wireless facsimile devices, wireless computers, wireless computer modems, wireless modem cards, palm pilots, hardwired communication devices, hardwired residential telephones, hardwired commercial telephones, hardwired facsimile devices, hardwired computers, hardwired modems, and hardwired modem cards.

27. A computer implemented method of managing destination identification information as described in claim 26 further comprising the step of assessing the minimal amount of said destination identification information to define said destination identifiers.

28. A computer implemented method of managing destination identification information as described in claim 27 wherein said step of assessing the minimal amount of said destination identification information to define said destination identifiers further comprises selecting said minimal amount of said destination identification information from the group consisting of numeric code, alphabet code, analog code, digital code, and frequency modulated code.

29. A computer implemented method of selecting a transmission carrier, comprising the steps of:
a. maintaining a transmission carrier index in a memory device;
b. maintaining a destination identifier match table responsive to said transmission carrier index in said memory device;
c. capturing destination identifiers;
d. matching said captured destination identifiers to a transmission carrier within said transmission carrier index using said destination identifier match table;
and e. reading out said transmission carrier matched with said destination identifies.

30. A computer implemented method of selecting a transmission carrier as described in claim 29 further comprising the step of connecting a communication device to a transmission medium through said transmission carrier matched with said destination identifier.

31. A computer implemented method of selecting a transmission carrier as described in claim 30 further comprising the step of editing said destination identifier match table based on routing characteristics.

32. A computer implemented method of selecting a transmission carrier as described in claim 31 wherein said step of editing said destination identifier match table based on routing characteristics comprises the step of revising said destination identifier match table based on distance of transmission.

33. A computer implemented method of selecting a transmission carrier as described in claim 31 wherein said step of editing said destination identifier match table based on routing characteristics comprises the step of revising said destination identifier match table based on stored holiday information.

34. A computer implemented method of selecting a transmission carrier as described in claim 31 wherein said step of editing said destination identifier match table based on routing characteristics comprises the step of revising said destination identifier match table based on stored day of week information.

35. A computer implemented method of selecting a transmission carrier as described in claim 31 wherein said step of editing said destination identifier element match table based on routing characteristics comprises the step of revising said destination identifier match table based on stored time of day information.

36. A computer implemented method of selecting a transmission carrier as described in claim 31 wherein said step of editing said destination identifier match table comprises selecting from a plurality of destination identifier match tables based on said routing characteristics.

37. A computer implemented method of selecting a transmission carrier as described in claim 31 further comprising the step of revising said destination identifier match table manually.

38. A computer implemented method of selecting a transmission carrier as described in claim 31 wherein said step of editing said destination identifier match table manually comprises transmitting a revised destination identifier match table from a second computer device.

39. A computer implemented method of selecting a transmission carrier as described in claims 29, 30, or 31 further comprising the steps of:
a. comparing captured destination identifiers to previously captured destination identification elements;

c. adding dissimilar destination identifiers to a learn table within said second memory device; and d. attributing characteristics to said destination identifiers within said learn table.

40. A computer implemented method of selecting a transmission carrier as described in claim 39 wherein said step of attributing characteristics to said destination identification elements within said learn table comprises counting the number of times a particular destination identifier is captured.

41. A computer implemented method of selecting a transmission carrier as described in claim 39 wherein said step of attributing characteristics to said destination identifiers within said learn table comprises calculating total transmission time to a location defined by said destination identifiers within a duration of time.

42. A computer implemented method of selecting a transmission carrier as described in claim 39 wherein said step of attributing characteristics to said destination identifiers within said learn table comprises determining the distance of transmission to said location defined by said destination identifiers.

43. A computer implemented method of selecting a transmission carrier as described in claim 39 further comprising the step editing said destination identifiers within said learn table.

44. A computer implemented method of selecting a transmission carrier as described in claim 43 wherein said step of editing said destination identifiers within said learn table comprises deleting at least one destination identifiers from within said learn table.

45. A computer implemented method of selecting a transmission carrier as described in claim 44 further comprising the step of assessing when a variable selectable limit of said destination identifiers have been added to said learn table.

46. A computer implemented method of selecting a transmission carrier as described in claim 45 further comprising the step of declining to add additional destination identifiers to said learn table.

47. A computer implemented method of managing destination identification information as described in claim 44 further comprising the step of assessing when a variably selectable limit of destination identifier attributes have been added to said learn table.

48. A computer implemented method of selecting a transmission carrier as described in claim 47 further comprising the step of declining to attribute additional characteristics to said destination identifiers within said learn table.

49. A computer implemented method of selecting a transmission carrier as described in claim 48 wherein said step of declining to attribute additional characteristics to said destination identifiers within said learn table comprises declining to count the number of times a particular destination identifier is captured.

50. A computer implemented method of selecting a transmission carrier as described in claim 39 further comprising the step of assigning one of a plurality of transmission carriers to each of said destination identifiers within said learn table.

51. A computer implemented method of selecting a transmission carrier as described in claim 50 wherein said step of assigning one of a plurality of transmission carriers to each of said destination identifiers within said learn table comprises assigning a low cost transmission carrier within said plurality of transmission carriers.

52. A computer implemented method of selecting a transmission carrier as described in claim 39 further comprising the step of transferring said learn table to a second memory device.

53. A computer implemented method of selecting a transmission carrier as described in claim 52 wherein said step of transferring said learn table to a second memory device occurs automatically upon elapse of a duration of time.

54. A computer implemented method of selecting a transmission carrier as described in claim 52 wherein said step of transferring said learn table to a second computer device occurs manually at a desired time.

55. A computer implemented method of selecting a transmission carrier as described in claim 52 further comprising the step of matching destination identifiers within said learn table with transmission carriers within a second transmission carrier index.

56. A computer implemented method of selecting a transmission carrier as described in claim 55 further comprising the step of transferring an updated transmission carrier index to said destination identifier assignment module.

57. A computer implemented method of selecting a transmission carrier as described in claim 39 further comprising the step of locating said memory device inside a communication device.

58. A computer implemented method of selecting a transmission carrier as described in claim 57 further comprising the step of selecting said communication device from the group consisting of wireless communication devices, wireless residential telephones, wireless commercial telephones, cellular telephones, wireless facsimile devices, wireless computers, wireless computer modems, wireless modem cards, palm pilots, hardwired communication devices, hardwired residential telephones, hardwired commercial telephones, hardwired facsimile devices, hardwired computers, hardwired modems, and hardwired modem cards.

59. A computer implemented method of selecting a transmission carrier as described in claim 57 wherein said memory device has a limited capacity selected from the group consisting of between about 5 bytes, between about 5 bytes and about 50 bytes, between about 50 bytes and about 100 bytes, between 100 bytes and about 1,000 bytes, between about 1,000 bytes and about 2,000 bytes, between about 2,000 bytes and about 3,000 bytes, between about 3,000 bytes and about 4,000 bytes, between about 4,000 and about 5,000 bytes, between about 5,000 bytes and about 6,000 bytes, between about 6,000 bytes and about 7,000 bytes, between about 7,000 bytes and about 8,000 bytes, between about 8,000 bytes and about 9,000 bytes, and between about 9,000 bytes and about 10,000 bytes.

60. A computer implemented method of selecting a transmission carrier as described in claim 59 further comprising the step of assessing the minimal amount of said destination identification information to define said destination identifiers further comprises selecting said minimal amount of said destination identification information from the group consisting of numeric code, alphabet code, analog code, digital code, and frequency modulated code.

61. A computer implemented method of selecting a transmission carrier as described in claim 60 further comprising the step of operating said communication device independent of said second memory device except during time elapsed transferring said learn table to said second memory device and transferring said updated transmission carrier index to said first memory element.

62. A transmission device, comprising:
a. a transmission medium;
b. a plurality of transmission carriers having access to said transmission medium;
c. a first communication device connectable to said plurality of carriers;
d. destination identifiers to define the location of at least one other communication device;
e. at least one learn module responsive to said destination identifiers; and f. a transmission carrier assignment module responsive to said at least one learn module.

63. A transmission device as described in claim 62 wherein said transmission medium is selected from a group consisting of laser, microwaves, radio waves, coaxial cable, twisted pair, telephone networks, Internet networks.

64. A transmission device as described in claim 62 wherein said plurality of transmission carriers is selected from a group consisting of Internet service providers, federally licensed telecommunication service providers, state licensed telecommunication service providers, public telecommunication service providers, and private company telecommunication network.

65. A transmission device as described in claim 62 wherein said first communication device is selected from the group consisting of wireless communication devices, wireless residential telephones, wireless commercial telephones, cellular telephones, wireless facsimile devices, wireless computers, wireless computer modems, wireless modem cards, palm pilots, hardwired communication devices, hardwired residential telephones, hardwired commercial telephones, hardwired facsimile devices, hardwired computers, hardwired modems, and hardwired modem cards.

66. A transmission device as described in claim 62 wherein said destination identifiers comprise an amount of destination identification information sufficient to distinguish said first communication device from said at least one other communication device.

67. A transmission device as described in claim 66 wherein said amount of destination identification information to distinguish said first communication device from said at least one other communication device is selected from the group consisting of numeric code, alphabet code, analog code, digital code, and frequency modulated code.

68. A transmission device as described in claim 62 wherein said at least one learn module comprises a destination identifier capture element.

69. A transmission device as described in claim 68 wherein said at least one learn module further comprises a destination identifier comparison element.

70. A transmission device as described in claim 68 wherein said at least one learn module further comprises a destination identifier add element.

71. A transmission device as described in claim 68 wherein said at least one learn module further comprises a destination identifier attribution element.

72. A transmission device as described in claim 68 wherein said at least one learn module further comprises a destination identifier edit element.

73. A transmission device as described in claim 72 wherein said destination identifier edit element allows destination identifiers in said learn module to be edited manually.

74. A transmission device as described in claim 72 wherein said destination identifier edit element allows destination identifiers in said learn module to be edited automatically.

75. A transmission device as described in claim 62 further comprises a transmission carrier assignment module comprising:
i. a transmission carrier match index; and ii. at least one destination identifier match table responsive to said transmission carrier match index.

76. A transmission device as described in claim 75 wherein said wherein said at least one destination identifier match table further comprises a distance assessment element.

77. A transmission device as described in claim 75 wherein said transmission carrier assistant identifier analysis module further comprises a holiday assessment element.

78. A transmission device as described in claim 75 wherein said transmission carrier assistant identifier analysis module further comprises a day of week assessment element.

79. A transmission device as described in claim 75 wherein said transmission carrier assistant identifier analysis module further comprises a time of day assessment element.

80. A transmission device as described in claim 75 wherein said transmission carrier assistant identifier analysis module further comprises a carrier index code selection element.

81. A transmission device as described in claim 75 wherein said transmission carrier assistant identifier analysis module further comprises a transmission carrier connection element.

82. A transmission device as described in claim 62 wherein said at least one learn module comprises a memory device.

83. A transmission device as described in claim 75 wherein said transmission carrier assignment module comprises a memory device.

84. A transmission device as described in claims 82 or 83 wherein said memory device is selected from the group consisting of random access memory, flash memory, and hard disk.

85. A transmission device as described in claim 84 wherein said memory device has a memory capacity selected from the group consisting of between about 5 bytes, between about 5 bytes and about 50 bytes, between about 50 bytes and about 100 bytes, between 100 bytes and about 1,000 bytes, between about 1,000 bytes and about 2,000 bytes, between about 2,000 bytes and about 3,000 bytes, between about 3,000 bytes and about 4,000 bytes, between about 4,000 and about 5,000 bytes, between about 5,000 bytes and about 6,000 bytes, between about 6,000 bytes and about 7,000 bytes, between about 7,000 bytes and about 8,000 bytes, between about 8,000 bytes and about 9,000 bytes, and between about 9,000 bytes and about 10,000 bytes.

86. A transmission device as described in claim 85 wherein said at least one learn module has a location within said first communication device.

87. A transmission device as described in claim 85 wherein said transmission carrier assignment module has a location within said within said first communication device.

88. A transmission device as described in claim 87 wherein said first communication device comprises a telephone.

89. A transmission device as described in claim 84 further comprising a second memory device remotely connected to said first communication device through said transmission medium.

90. A transmission routing enterprise, comprising:
a. at least one communication device having a memory element comprising:
i. a learn module;
ii. a transmission carrier assignment module;
iii. a destination identifier capture element; and b. a second memory device responsive to said learn module and said transmission carrier assignment module.

91. A transmission routing enterprise as described in claim 90 wherein said transmission carrier assignment module comprises:
i. a programmable transmission carrier match index; and ii. at least one destination identifier match table responsive to said transmission carrier match index.

92. A transmission routing enterprise as described in claim 91 wherein said wherein said at least one destination identifier match table further comprises a distance assessment element.

93. A transmission routing enterprise as described in claim 91 wherein said transmission carrier assignment module comprises a holiday assessment element.

94. A transmission routing enterprise as described in claim 91 wherein said transmission carrier assignment module further comprises a day of week assessment element.

95. A transmission routing enterprise as described in claim 91 wherein said transmission carrier assignment module further comprises a time of day assessment element.

96. A transmission routing enterprise as described in claim 91 wherein said transmission carrier assignment module further comprises a carrier index code selection element.

97. A transmission routing enterprise as described in claim 91 wherein said transmission carrier assignment module further comprises a transmission carrier connection element.

98. A transmission routing enterprise as described in claims 90 or 91 wherein said second memory device further comprises a transmission carrier connect module.

99. A transmission routing enterprise as described in claim 98 further comprising:
a. a plurality of transmission carriers having access to said transmission medium; and b. at least one other communication device having a location defined by said destination identifiers.

100. A transmission routing enterprise as described in claim 98 wherein said at least one learn module further comprises a destination identifier comparison element.

101. A transmission routing enterprise as described in claim 100 wherein said at least one learn module further comprises a destination identifier add element.

102. A transmission routing enterprise as described in claim 100 wherein said at least one learn module further comprises a destination identifier attribution element.

103. A transmission routing enterprise as described in claim 100 wherein said at least one learn module further comprises a destination identifier edit element.

104. A transmission routing enterprise as described in claim 103 wherein said destination identifier edit element allows destination identifiers in said learn module to be edited manually.

105. A transmission routing enterprise as described in claim 103 wherein said destination identifier edit element has an automatic edit feature.

106. A transmission routing enterprise as described in claim 105 wherein said automatic edit feature comprises automatic destination identifier deletion.

107. A transmission routing enterprise as described in claim 106 wherein said automatic destination identifier deletion is based upon a variably selectable limit of destination identifiers captured.

108. A transmission routing enterprise as described in claim 106 wherein said automatic destination identifier deletion is based upon number of attributes assigned to each said destination identifiers.

109. A transmission device as described in claim 90 wherein said memory element is selected from the group consisting of random access memory, flash memory, and hard disk.

110. A transmission device as described in claim 90 wherein said memory element has a limited memory capacity selected from the group consisting of between 5 bytes, between about 5 bytes and about 50 bytes, between about 50 bytes and about 100 bytes, between 100 bytes and about 1,000 bytes, between about 1,000 bytes and about 2,000 bytes, between about 2,000 bytes and about 3,000 bytes, between about 3,000 bytes and about 4,000 bytes, between about 4,000 and about 5,000 bytes, between about 5,000 bytes and about 6,000 bytes, between about 6,000 bytes and about 7,000 bytes, between about 7,000 bytes and about 8,000 bytes, between about 8,000 bytes and about 9,000 bytes, and between about 9,000 bytes and about 10,000 bytes.

111. A transmission device as described in claim 90 wherein said at least one communication device comprises a telephone.

112. A transmission device as described in claim 90 further comprising a transmission medium selected from a group consisting of laser, microwaves, radio waves, coaxial cable, twisted pair, telephone networks, and Internet networks.

113. A transmission device as described in claim 90 further comprising a said plurality of transmission carriers selected from a group consisting of Internet service providers, federally licensed telecommunication service providers, state licensed telecommunication providers, public telecommunication service providers, and private company telecommunication network.

114. A transmission device as described in claim 90 wherein said at least one communication device is selected from the group consisting of wireless communication devices, wireless residential telephones, wireless commercial telephones, cellular telephones, wireless facsimile devices, wireless computers, wireless computer modems, wireless modem cards, palm pilots, hardwired communication devices, hardwired residential telephones, hardwired commercial telephones, hardwired facsimile devices, hardwired computers, hardwired modems, and hardwired modem cards.

115. A transmission device as described in claim 90 wherein said destination identifier comprises an amount of information to sufficient distinguish said first communication device from said at least one other communication device.

116. A transmission device as described in claim 115 wherein said destination identification information is selected from the group consisting of numeric code, alphabet code, analog code, digital code, and frequency modulated code.

117. A communication device, comprising:
a. a destination identifier input module; and b. a learn module responsive to said prioritized destination identifier input module comprising:
i. a destination identifier capture element;
ii. a destination identifier comparison element; and iii. a destination identifier add element.

118. A communication device as described in claim 117 wherein said destination identifier add element adds said destination identifier to a learn table.

119. A communication device as described in claim 117 wherein said at least one learn module further comprises a destination identifier attribute element.

120. A communication device as described in claim 117 wherein said at least one learn module further comprises a destination identifier edit element.

121. A communication device as described in claim 120 wherein said destination identifier edit element allows destination identifiers in said learn table to be manually edited.

122. A communication device as described in claim 120 wherein said destination identifier edit element further comprises an automatic edit feature.

123. A communication device as described in claim 122 wherein said automatic edit feature comprises automatic destination identifier deletion.

124. A communication device as described in claim 123 wherein said automatic destination identifier deletion is based upon total number of said ranked destination identifiers added.

125. A communication device as described in claim 123 wherein said automatic destination identifier deletion is based upon the total times a destination identifier is used within a duration of time.

126. A communication device as described in claim 123 wherein said automatic destination identifier deletion is based upon the total amount of transmission time to a second communication device defined by said destination identifier.

127. A communication device as described in claim 117 wherein said at least one learn module comprises a memory element.

128. A communication device as described in claim 127 wherein said memory element is selected from the group consisting of random access memory, flash memory, and hard disk.

129. A communication device as described in claim 127 wherein said memory element has a capacity selected from the group consisting of about 5 bytes, between about 5 bytes and about 50 bytes, between about 50 bytes and about 100 bytes, between 100 bytes and about 1,000 bytes, between about 1,000 bytes and about 2,000 bytes, between about 2,000 bytes and about 3,000 bytes, between about 3,000 bytes and about 4,000 bytes, between about 4,000 and about 5,000 bytes, between about 5,000 bytes and about 6,000 bytes, between about 6,000 bytes and about 7,000 bytes, between about 7,000 bytes and about 8,000 bytes, between about 8,000 bytes and about 9,000 bytes, and between about 9,000 bytes and about 10,000 bytes.

130. A communication device as described in claim 129 wherein said at least one learn module has a location within said communication device.

131. A communication device as described in claim 129 wherein said learn module has a location within at least one other communication device.

132. A communication device as described in claim 130 wherein said communication device comprises a telephone.

133. A communication device as described in claim 131 wherein said at least one other communication device comprises a telephone.

134. A communication device as described in claim 129 wherein said communication device is selected from the group consisting of wireless communication devices, wireless residential telephones, wireless commercial telephones, cellular telephones, wireless facsimile devices, wireless computers, wireless computer modems, wireless modem cards, palm pilots, hardwired communication devices, hardwired residential telephones, hardwired commercial telephones, hardwired facsimile devices, hardwired computers, hardwired modems, and hardwired modem cards.

135. A communication device as described in claim 134 wherein said destination identifier comprises an amount of information to distinguish said first communication device from said at least one other communication device.

136. A communication device as described in claim 135 wherein said destination identifier is selected from the group consisting of numeric code, alphabet code, analog code, digital code, and frequency modulated code.

137. A communication device as described in claim 117 further comprising:
a. a transmission medium; and b. a plurality of transmission carriers having access to said transmission medium.

138. A communication device as described in claim 137 wherein said transmission medium is selected from a group consisting of laser, microwaves, radio waves, coaxial cable, twisted pair, telephone networks, Internet networks, PBX, PDA, and TBS.

139. A communication device as described in claim 137 wherein said plurality of transmission carriers is selected from a group consisting of Internet service providers, federally licensed telecommunication service providers, state licensed telecommunication providers, public telecommunication service providers, and private company telecommunication service providers.

140. A communication device as described in claim 137 wherein said communication device further comprises a transmission carrier connect module.

141. A communication device as described in claim 140 further comprising an transmission carrier assignment module.

142. A transmission device as described in claim 141 further comprises a transmission carrier assignment module comprising:
i. a transmission carrier match index; and ii. at least one destination identifier match table responsive to said transmission carrier match index.

143. A transmission device as described in claim 142 wherein said wherein said at least one destination identifier match table further comprises a distance assessment element.

144. A transmission device as described in claim 142 wherein said transmission carrier assignment module further comprises a holiday assessment element.

145. A transmission device as described in claim 142 wherein said transmission carrier assignment module further comprises a day of week assessment element.

146. A transmission device as described in claim 142 wherein said transmission carrier assignment module further comprises a time of day assessment element.

147. A transmission device as described in claim 142 wherein said transmission carrier assignment module further comprises a carrier index code selection element.

148. A communication device as described in claim 142 wherein said transmission carrier match index can be programmed from a second memory device.

149. A method to determine the low cost carrier, comprising the steps of:
a. storing destination identification information in advance;
b. storing corresponding low cost carrier information in advance;
c. detecting dialed destination identification information;
d. comparing said dialed destination identification information to stored destination identification information; and e. reading out the low cost carrier information that corresponds to matched information.

150. A method to determine the low cost carrier as described in claim 149, further comprising the steps of:
a. storing time information in advance;
b. detecting current time information, and c. comparing said current time information to stored time information.

151. A method to determine the low cost carrier as described in claim 149, further comprising the steps of:
a. storing day of week information;
b. detecting current day of week information; and c. comparing said current day of week information to stored day of week information.

152. A method to determine the low cost carrier as described in claim 149, further comprising the steps of:
a. storing holiday information;
b. detecting current holiday information; and c. comparing said current holiday information to stored holiday information.

153. A method to determine the low cost carrier as described in claim 149, further comprising the step of letting a user specify said destination identification information often dialed.

154. A method to determine the low cost carrier as described in claim 153 wherein said step of storing destination identification information in advance comprises storing only specified destination identification information in advance.

155. A method to determine the low cost carrier as described in claim 154 further comprising the step of reducing necessary memory storage device size.

156. A method to determine the low cost carrier as described in claim 155 wherein said step of storing only specified destination identification information in advance comprises storing NPA-NXX specified in advance.

157. A method to determine the low cost carrier as described in claim 155 wherein said step of storing only specified destination identification information in advance comprises storing country code information specified in advance.

158. A method to determine the low cost carrier as described in claims 155 or 157, further comprising the steps of:
a. storing time information in advance;
b. detecting current time information, and c. comparing said current time information to stored time information.

159. A method to determine the low cost carrier as described in claim 158, further comprising the steps of:
a. storing day of week information;
b. detecting current day of week information; and c. comparing said current day of week information to stored day of week information.

160. A method to determine the low cost carrier as described in claim 159, further comprising the steps of:
a. storing holiday information;
b. detecting current holiday information; and c. comparing said current holiday information to stored holiday information.

161. A method to determine the low cost carrier as described in claim 160, wherein said step of reducing necessary memory storage device size comprises reducing random access memory storage device size.

162. A telephone equipment and server equipment for determining the model code and the manufacturer's code of the phone equipment which is installed on the telephone subscriber line and the telephone number of the telephone subscriber line on which the telephone is installed, comprising:
a. means for a telephone equipment to store the model code and the manufacturer's code in the memory of the telephone equipment;
b. means for a telephone equipment to automatically generate a call to server equipment and transmit the model code and manufacturer's code to server equipment; and c. means for a server equipment to receive the caller identification information before it receives the call from a telephone equipment and also to receive the model code and the manufacturer's code from a telephone equipment after a server equipment answers the call.

163. A telemarketing method for effectively and efficiently making phone calls to promote subscriptions for LCR service, comprising:
a. means for getting the information of the phone numbers of those who actually purchased telephone equipments with LCR function.

164. A telephone equipment and other telephone related devices for selecting fairly the least cost carrier without biasing to one particular common carrier, comprising:
a. means for providing tariff information of common carriers without having any one particular common carrier equity.

165. A telephone equipment and other telephone related devices for selecting a common carrier with cheaper tariff, comprising:

a. means for storing all the tariff information of major common carriers; and b. means for comparing one tariff with another tariff and deciding which tariff is the least expensive.

166. A least cost routing device for keeping the number of bills sent from common carriers to subscribers within a reasonable number, comprising:

a. means for limiting the number of common carriers to select from.

167. A least cost routing device for reducing the duration for transmitting decision tables, comprising:
a. means for adding a prefix for choosing a common carrier other than primary carrier as a basic mode; and b. means for tables describing the cases when it should not add a prefix rather than tables describing the cases when it should add a prefix.

168. A method for prevailing a phone equipment with a automatic common carrier selection function built with minimum investment, comprising:

a. means for founding a service company jointly with manufacturers of a telephone equipment; and b. means for manufacturers of a telephone equipment building in the function to choose the least cost common carrier in telephone equipment at its cost.

169. A telephone equipment for generating a call to a server equipment automatically instead of answering to a call from a server equipment by a user's manual response, comprising:

a. means for receiving caller identification information.

170. A method for calculating a price for a call based upon the telephone number of a called party, comprising:

a. means for storing message area identification information and its associated distance band information;

b. means for detecting the telephone number dialed by a user;

c. means for comparing said telephone number of the called party and said message area identification information;

d. means for reading out the distance block information of the message area identification information which matches said telephone number of the called party;

e. means for reading out the unit time information and unit charge information which corresponds to said distance block information; and f. means for calculating the price of the call.

171. The method according to claim 170, further comprising:
a. means for dividing into multiple distance steps which associate to message area identification information instead of using the real distance for each message area identification information;

b. means for storing only the information specifying said distance step; and c. means for reducing the memory size from the case when using the real distance.

172. The method according to claim 170, further comprising:
a. means for storing said message area identification information in read only memory; and b. means for reducing the random access memory size required.

173. A method for calculating a price for a call based upon the telephone number of a called party, comprising:
a. means for dividing one day into 24 blocks, wherein a first block represents midnight to 1 a.m., and wherein a second block represents 1 a.m. to 2 a.m.
and so on wherein a twenty fourth block represents 11 p.m. to midnight;
b. means for storing different tariff tables for each tone zone;
c. means for storing a pointer information in each block;
d. means for said pointer specifying tariff tables for each 1 hour block; and e. means for making it possible to specify any tariff table for each hour of the day.

174. The method according to claim 170, further comprising:
a. means for storing two information as a pair representing a unit charge and a unit time; and b. means for making it possible to use either Hudson tariff method and Karlson tariff method.

175. The method according to claim 170, further comprising a. means for storing two information as a pair representing a unit charge and a unit time; and b. means for displaying call charge information on telephone display unit.

176. The method according to claim 170, further comprising a. means for storing two information as a pair representing a unit charge and a unit time; and b. means for displaying multiple call charge information comparing with each other.

177. The method according to claim 170, further comprising a. means for storing the information of 10 times the unit charge in the memory;
b. means for reading out said information and for dividing said information by 10; and c. means for expressing a unit charge in increment of Y en 0.1.

178. The method according to claim 170, further comprising a. means for storing expected call duration for each extension;
b. means for reading out said expected call duration for the extension which is generating a call; and c. means for calculating the price of the call with said expected call duration.

179. Methods substantially as described hereinbefore and with reference to any of the accompanying examples.

180. Apparatuses substantially as described hereinbefore and with reference to any of the accompanying examples.