The present invention relates to telephone systems, and more specifically to a data network based telephone system that can dispatch, receive, and store messages.
Answering machine is probably the most popular peripheral connected to a telephone. It answers telephone calls automatically and allows callers to leave messages if the machine owner is not able to answer the calls. The answering machine is especially useful for business because it facilitates delivery of information. A few technology companies realized that they can design systems containing more features to further improve the utility of this kind of machines. The resulting product is a system called “voice mail”. A voice mail system can serve many telephones in a premise, and provides centralized management of voice messages to all these telephones. It also allows users more options in controlling their mails (e.g., varying the duration of mail retention, multiple greeting messages, message broadcasting, etc.). Some voice mail systems even allow callers to edit their messages before hanging up. As of today, almost all large and medium sized companies have implemented some form of voice mail systems.
Telephone calls are carried by telephone networks. The basic structure of a conventional telephone network has been the same for several decades. Basically, a communication line (called a subscriber loop) is used to connecting a telephone (or voice mail system) to a conventional central office. If the incoming signal is analog signal, the central office converts the analog voice electrical signal on the subscriber loop into digital data. The digital data is carried by long distant trunk lines to the central office of the recipient telephone (or voice mail system). If the recipient telephone accepts analog signal, this recipient central office reconverts the digital data into analog signal. As a result, the users of the telephones can communicate verbally.
When a telephone call is made, a dedicated connection (called switched circuit) is created between a calling telephone and a called telephone. This connection is maintained even during silent periods when no one is talking on the two telephones. As a result, this is not an efficient way of using the connection. Recently, there are suggestions that telephone voice signals can be carried using networks designed for carrying regular digital data instead of digitized voice. Under this suggestion, the voice signals are digitized in the telephone (instead of the central office), and the digitized voice data is encapsulated into data packets. These data packets are delivered to the data network. The data network groups together the data packets generated by many telephones and then transports these packets together with other types of data packets. There is no need to set up a dedicated connection between the calling and the called telephones. Further, bandwidth can be assigned on an on-demand basis. As a result, this is a more efficient telephone system. The technology for transporting voice using a regular data network instead of a dedicated connection has been developed, and is commonly called voice-over-data-network. If the network is the Internet, it is called voice-over-IP.
However, there are problems in using regular data network to carry voice data. In order for voice to sound natural in a telephone system, the voice data packets must travel from one telephone to another within a very short time (e.g., less than 100 milliseconds). However, the size of a regular data file could be very large in some cases (e.g., more than a thousand times the size of a voice packet). While this data file is being transported through the network, it could block out the voice data packets for several seconds. Thus, in many cases, it is necessary to give voice data packets higher priority in the network so that they can move rapidly even in the present of a big data file. Consequently, a special network that can assign priority to different types of data packets needs to be used. However, this kind of network is expensive. Thus, it is desirable to provide more services to telephone users that use this kind of network.
U.S. Pat. No. 5,623,538 issued to Petty and U.S. Pat. No. 5,781,615 issued to Bales et al. disclose message storage devices, and are incorporated herein by reference.
There are some situations in which it is more convenient to communicate using one-way voice messages instead of simultaneous two-way voice communication. One example is the common situation where the voice message is not urgent and the sender deems it inappropriate to disturb the intended recipient. Another example is when the sender does not want to talk to the recipient because the sender is in a hurry. The present invention provides a low cost and efficient method for allowing voice messages to be delivered using data network.
Under the telephone system of the present invention, the telephones exchange handshake signals prior to the delivery and recording of voice messages. A message sender's telephone first sends a status request to a recipient's telephone. If the sender's telephone does not receive a reply (i.e., an acknowledgment) from the recipient's telephone within a reasonable time, the sender's telephone informs the sender. Similarly, if the recipient's telephone notifies the sender's telephone that it cannot receive voice messages (e.g., its memory is full), the sender's telephone also informs the sender. Thus, the sender will not waste time to record the voice message. From the sender's standpoint, this is similar to encountering a busy signal in a regular telephone. Consequently, the sender can easily learn how to use this new system.
In one embodiment of the present invention, the data network provides different levels of quality of services (QOS). The voice message can be sent using a low QOS level that permits long delays between voice-based data packets. On the other hand, the handshaking negotiation (e.g., the status request and acknowledgment packets) is carried out using a higher QOS level that permits shorter delays (e.g., less than one second).
In another embodiment of the present invention, the sender's telephone needs to deliver an access code to the recipient's telephone. Otherwise, a request to deliver voice messages will be denied. This feature could prevent the recording of “junk” mails. In one implementation of the access code, it comprises an encryption of (a) a base code of the recipient's telephone and (b) the telephone number of the sender's telephone.
These and other features and advantages of the present invention are described by the following detailed description of the embodiments together with the accompanying drawings.
The present invention comprises a novel system and related methods for telephony messaging using a data network. The following description is presented to enable any person skilled in the art to make and use the invention. Description of specific applications provided only as examples. Various modifications to the preferred embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other embodiments and applications without departing from the spirit and scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown, but is to be accorded the widest scope consistent with the principles and features disclosed herein.
One useful function of the telephone of the present invention (e.g., telephone 114) is to provide the ability to conduct simultaneous two-way voice communication with a remote telephone in a similar manner as a conventional telephone. Further, telephone 114 is able to provide an inventive voice message recording and dispatching operations: A user can use telephone 114 to deliver a message intended for recording in a remote telephone (e.g., telephone 124 in a different cluster or telephone 118 in the same cluster) rather than for initiating a two-way communication.
Digitized voice data generated by A/D converter 143 is processed by a voice processor in a processor system 150. Processor system 150 preferably contains memory (random access and read-only), one or more digital signal processors, and input/output circuits. The voice processor in processor system 150 performs audio compression and decompression (codec). The processed audio data is delivered to a network interface 152 for communicating with voice communication port 112 of
The audio data traveling in a data network need to conform to the requirements of the network. In many networks, data (audio and regular) is encapsulated by packets or cells. The size of each packet or cell may be fixed or variable.
A user may elect to use telephone 140 to initiate two-way communication or record a voice message on a remote telephone (e.g., telephone 124). The two-way communication is carried out using conventional voice-over-data-network methods. The message dispatching and recording operation of the present invention will be described in detail below.
Turning now to the receiving operation of telephone 140, digitized voice data originated by the remote telephone (e.g., telephone 124) is received by network interface 152. The received data is decompressed by the voice processor of processor system 150. If it is determined that the voice data is intended for recording, processor system 150 stores the digitized voice data into a message memory 154. It notifies the user about the voice message using non-intrusive means (e.g., turning on a LED light). The user may retrieve the stored voice message at his/her convenience. If the audio data is intended for simultaneous two-way communication, processor system 150 alerts the user immediately (e.g., by generating a loud audio signal). When the user answers the phone, processor system 150 decompresses the digital voice data and delivers the decompressed data to D/A converter 147.
Telephone 140 contains a plurality of buttons 156. These buttons include numerical keys for dialing telephone numbers (or alphanumeric keys for entering Internet addresses, depending on the implementation of the system). Other buttons are included for controlling the operation of telephone 140 (e.g., a button may be used to indicate whether a message is intended for remote recording only). Telephone 140 may also contain a display 158 for providing visual information to users. For example, it may be used to indicate how many messages have been recorded and the telephone number of callers.
Telephone 140 contains a status register 162 for storing current status information of telephone 140. It also contains a database memory 164 for storing contact information of frequently called persons (e.g., telephone numbers, names, etc.). As explained below, it may be advisable to encrypt digital voice and other data. Thus, telephone 140 contains a key memory 166 for storing encryption and decryption keys.
In one embodiment of the present invention, the sender of a voice message first records the voice message in his/her own telephone. The voice message is then sent to the recipient's telephone when a button is pressed. One advantage is that the sender can change, edit, or delete the voice message before sending. However, a problem of this procedure is that the sender does not know whether the recipient's telephone is available to receive the voice message. In the event that the recipient's telephone is not available (e.g., the message memory is full, or the telephone is not connected to the network), the sender's voice message cannot be delivered. As a result, the sender may feel frustrated because all the efforts in editing and recording are wasted. If the frustration level becomes too high, the sender may decide not to use the system again. Consequently, it is desirable to find out the status of the recipient's telephone before the sender records any voice message.
Processor system 150 also contains a handshake processor. This processor handles handshaking operations between two telephones. One of the functions of handshaking is to allow the telephones to exchange information about message recording. Note that both audio processor and handshake processor can physically be the same processor that executes different sets of computer codes (e.g., executing codec code during voice processing and handshaking codes during handshaking operation).
In the situation that the recipient's telephone receives the status request, it delivers a reply (i.e., acknowledgment) to the sender's telephone via network 108. The acknowledgment preferably contains the status of the recipient's telephone (obtained from a status register, such as register 162). The sender's telephone analyzes the status information (step 210). The acknowledgment may inform the sender's telephone that the receiver's telephone is not fully functional (e.g., low message storage memory, recipient wishes to block all messages, etc.). In this case, the sender's telephone also informs the sender that the recipient's telephone is not available. In this case, the sender will not record any voice message. The sender's telephone asks the sender to record a voice message only when the recipient's telephone gives a positive acknowledgment (step 212). The recorded voice message is delivered to the recipient's phone (step 214). The recipient's telephone can also inform the sender's telephone about restrictions on the voice message (e.g., the maximum duration of the message). The sender's telephone can show the restriction on its display so that the sender can adjust his/her voice message accordingly.
As pointed out above, it is possible for a voice communication port to manage the operation of telephones. In this case, all or some of the above-mentioned steps are carried out by the port.
The system of the present invention may be implemented using regular data network with no QOS enhancement. In another embodiment of the present invention, the present invention can be implemented using a network that has such enhancement. The voice messages of the present invention can be delivered without any need for immediate interaction between the sender and recipient. Thus, the delay in delivery the voice messages could be more than a few minutes, and in some cases more than half an hour. As a result, the voice messages may be delivered using a low QOS level allowing long delays. On the other hand, the handshaking negotiations between the sender's telephone and recipient's telephone (e.g., status request, acknowledgment, extension request, etc.) are preferably delivered using a QOS level allowing low delays, preferably less than a second. This is because the sender would like to know the status of the recipient's telephone as soon as possible.
The QOS requirements of the present invention are different from that of regular voice-over-data-network requirements for two-way voice communication. In the case of two-way communication, the voice packets must be delivered in less than 100 milliseconds to avoid undesirable effects (e.g., echo and voice breakup). Thus, the present invention offers complementary requirement in delivery of voice packets (i.e., low priority for voice packets of the present invention versus high priority for voice packets of two-way voice communication). As a result, the load on the data network can be balanced more efficiently.
In many situations, a user may want to immediately respond to the person who left a voice message. In an embodiment of the present invention, the sending telephone includes its telephone number in the handshake negotiation and/or voice message. This telephone number can be stored in the recipient's telephone. The recipient can press a button, and the recipient's telephone will start handshake negotiation with, and later deliver a reply voice message to, the sender's telephone.
In another embodiment of the present invention, the privacy of the telephone users is protected. Based on current cost structure, it will cost very little to deliver voice messages over a data network using low QOS level. Consequently, there is a risk that mass advertisers may dispatch a large number of voice messages to many telephones. When this happens, it may create a backlash against this type of telephones. One method to reduce this risk is to give users an option to program a telephone (e.g., telephone 140) to accept voice messages only if the messages (or handshake negotiations) contain an authorized access code. This code is given only to friends, relatives and business associates of the owner of telephone 140. It is also important that this access code cannot be further distributed so that the owner can maintain full control over the access code.
In the present invention, one component of the access code is made up of a confidential base code of one telephone. This is an alphanumeric value selected by the owner of telephone 140. It is entered by the owner into telephone 140 using buttons 156, and is stored in the telephone (e.g., database memory 164). Another component of the access code is an alphanumeric value that can be used to identify a second telephone. An example of this value is the telephone number (or Internet address).
The reverse procedure is used when the receiving telephone sends a request to the originating telephone to request permission to send a voice message. The access code is retrieved from its database memory and embedded in the status request. The telephone number of the receiving telephone is also embedded in the status request. Upon receiving the access code, the originating telephone decrypts the access code using a private decrypting key stored in its key memory 166. It compares the decrypted base code with the base code stored in its database memory 164. It also compares the decrypted telephone number with the telephone number embedded in the status request. If the results of the comparisons are positive, the originating telephone accepts the request. Otherwise, the originating telephone denies the request.
One advantage of the method of the present invention is that the access code is different for different telephones. Thus, even if the receiving telephone distributes this access code to other telephones, they cannot use it to establish handshaking. Because the access code is encrypted, it will be very difficult for others to know the base code.
Another problem with delivering voice messages over data network is that many people do not trust routing private voice messages through routers and servers in the data network. This is because other people may be able to listen to the voice messages during their journey from one telephone to another. One way to solve this problem is for the sender to use public key encryption to encrypt voice messages. Public key is preferably used because the key would be given to a large number of friends, relatives and business associates. An easy way to give the public key to a person who wishes to send messages is for the sender and recipient to first establish a two-way telephone communication. The person who wishes to give out the key can press a button on the telephone, and the telephone will pass the public key to the database memory of the other telephone. The telephone may also send other identification information (e.g., name and phone number) for storage in the database memory. The sender's telephone can then automatically encrypt voice messages directed to the recipient.
In a different embodiment of the present invention, the voice messages are stored in the voice communication port instead of the telephone. When the port (e.g., port 122) receives a voice message intended for a recipient (e.g., telephone 124), it sends a signal to notify telephone 124 that a voice message is received. The owner of telephone 124 may retrieve the voice message immediately or at a later time. An advantage of this arrangement is that a port has more memory to more efficiently store and archive messages.
The invention has been described with reference to specific exemplary embodiments thereof. Various modification and changes may be made thereunto without departing from the broad spirit and scope of the invention. The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense; the invention is limited only by the provided claims.
This application is a continuation of U.S. patent application Ser. No. 10/700,888 filed Nov. 4, 2003, now U.S. Pat. No. 7,245,707 which is a continuation in part of U.S. patent application Ser. No. 09/532,616, filed Mar. 22, 2000, now abandoned which claims the benefit of U.S. Provisional Application Ser. No. 60/126,289 filed Mar. 26, 1999. All these patent applications are incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
4006447 | Narbaits-Jaureguy et al. | Feb 1977 | A |
4499601 | Matthews | Feb 1985 | A |
5095532 | Mardus | Mar 1992 | A |
5119507 | Mankovitz | Jun 1992 | A |
5195109 | Bochmann et al. | Mar 1993 | A |
5276909 | Milner et al. | Jan 1994 | A |
5355527 | Owaki | Oct 1994 | A |
5398285 | Borgelt et al. | Mar 1995 | A |
5406626 | Ryan | Apr 1995 | A |
5428610 | Davis | Jun 1995 | A |
5442646 | Chadwick et al. | Aug 1995 | A |
5477487 | Greenberg | Dec 1995 | A |
5483506 | Yoshioka et al. | Jan 1996 | A |
5497372 | Nankoh et al. | Mar 1996 | A |
5524051 | Ryan | Jun 1996 | A |
5524279 | Keba et al. | Jun 1996 | A |
5548828 | Kozaki et al. | Aug 1996 | A |
5561849 | Mankovitz | Oct 1996 | A |
5572442 | Schulhof et al. | Nov 1996 | A |
5623538 | Petty | Apr 1997 | A |
5689245 | Noreen et al. | Nov 1997 | A |
5708662 | Takashima | Jan 1998 | A |
5710994 | Shiota | Jan 1998 | A |
5719943 | Amada et al. | Feb 1998 | A |
5734780 | Ichiura et al. | Mar 1998 | A |
5734973 | Honda | Mar 1998 | A |
5745525 | Hunsinger et al. | Apr 1998 | A |
5751806 | Ryan | May 1998 | A |
5774798 | Gaskill | Jun 1998 | A |
5781615 | Bales et al. | Jul 1998 | A |
5809065 | Dapper et al. | Sep 1998 | A |
5809472 | Morrison | Sep 1998 | A |
5815671 | Morrison | Sep 1998 | A |
5841979 | Schulhof et al. | Nov 1998 | A |
5850415 | Hunsinger et al. | Dec 1998 | A |
5864305 | Rosenquist | Jan 1999 | A |
5870474 | Wasilewski et al. | Feb 1999 | A |
5881365 | Yang et al. | Mar 1999 | A |
5953068 | Jacobsen | Sep 1999 | A |
5956628 | Owaki | Sep 1999 | A |
5991334 | Papadopoulos et al. | Nov 1999 | A |
5995630 | Borza | Nov 1999 | A |
6009177 | Sudia | Dec 1999 | A |
6011854 | Van Ryzin | Jan 2000 | A |
6021307 | Chan | Feb 2000 | A |
6023762 | Dean et al. | Feb 2000 | A |
6028937 | Tatebayashi et al. | Feb 2000 | A |
6057890 | Virden et al. | May 2000 | A |
6075813 | Chen et al. | Jun 2000 | A |
6088455 | Logan et al. | Jul 2000 | A |
6092193 | Loomis et al. | Jul 2000 | A |
6097816 | Momiki et al. | Aug 2000 | A |
6144705 | Papadopoulos et al. | Nov 2000 | A |
6154452 | Marko et al. | Nov 2000 | A |
6161002 | Migliaccio et al. | Dec 2000 | A |
6163683 | Dunn et al. | Dec 2000 | A |
6170060 | Mott et al. | Jan 2001 | B1 |
6181684 | Turcotte et al. | Jan 2001 | B1 |
6216006 | Scholefield et al. | Apr 2001 | B1 |
6269446 | Schumacher et al. | Jul 2001 | B1 |
6285745 | Bartholomew et al. | Sep 2001 | B1 |
6289207 | Hudecek et al. | Sep 2001 | B1 |
6336189 | Takeda et al. | Jan 2002 | B1 |
6351500 | Kumar | Feb 2002 | B2 |
6385596 | Wiser et al. | May 2002 | B1 |
6389271 | Kaneko | May 2002 | B1 |
6396908 | O'Donovan et al. | May 2002 | B1 |
6411800 | Emerson, III | Jun 2002 | B1 |
6412006 | Naudus | Jun 2002 | B2 |
6510515 | Raith | Jan 2003 | B1 |
6550009 | Uranaka et al. | Apr 2003 | B1 |
6577735 | Bharat | Jun 2003 | B1 |
6598164 | Shepard | Jul 2003 | B1 |
6650717 | Cupo et al. | Nov 2003 | B1 |
6765929 | Cupo et al. | Jul 2004 | B1 |
6832318 | Yaegashi et al. | Dec 2004 | B1 |
6904270 | Chan | Jun 2005 | B1 |
6934838 | Boyce et al. | Aug 2005 | B1 |
6938166 | Sarfati et al. | Aug 2005 | B1 |
6988205 | Walker et al. | Jan 2006 | B2 |
7023966 | Finnigan | Apr 2006 | B2 |
7055034 | Levy | May 2006 | B1 |
7245707 | Chan | Jul 2007 | B1 |
7369824 | Chan | May 2008 | B1 |
7636691 | Maari | Dec 2009 | B2 |
20010012334 | Lester et al. | Aug 2001 | A1 |
20020116509 | DeLaHuerga | Aug 2002 | A1 |
20030133406 | Fawaz et al. | Jul 2003 | A1 |
20050010778 | Walmsley | Jan 2005 | A1 |
20070136597 | Levy | Jun 2007 | A1 |
20070180266 | Kang et al. | Aug 2007 | A1 |
Number | Date | Country | |
---|---|---|---|
60126289 | Mar 1999 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10700888 | Nov 2003 | US |
Child | 11744951 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 09532616 | Mar 2000 | US |
Child | 10700888 | US |