Patent Grant
8321511
1. Field of the Invention
This invention relates generally to the field of network data services. More particularly, the invention relates to an apparatus and method for synchronizing a wireless data processing device with a wireless messaging service.
2. Description of the Related Art
A variety of wireless data processing devices have been introduced over the past several years. These include wireless personal digital assistants (“PDAs”) such as the Palm® VIIx handheld, cellular phones equipped with data processing capabilities (e.g., those which include wireless application protocol (“WAP”) support), and, more recently, wireless messaging devices such as the Blackberry™ wireless pager developed by Research In Motion (“RIM”).™
Personal digital assistants such as the Palm devices typically provide only limited wireless messaging capabilities (e.g., instant messaging and basic Internet access). For example, these devices typically require a user to manually establish a connection to the Internet via an Internet Service Provider (“ISP”) or to a corporate server to check e-mail messages.
Although corporate messaging systems such as the RIM Blackberry provide more comprehensive messaging capabilities, there are significant limitations to these systems. Specifically, these systems employ e-mail “redirection” or “forwarding” techniques in which messages are redirected to the wireless device only if certain conditions are met. These conditions, referred to as “redirection events,” may include, for example, an indication that the user is not working at his corporate desktop (e.g., removal of the wireless device from the desktop cradle, a screen saver firing on the desktop, . . . etc) or a manual redirection command initiated by the user (e.g., via the wireless device or the corporate desktop). One such message redirection system is described in U.S. Pat. No. 6,219,694 (“System and Method for Pushing Information From a Host System to a Mobile Data Communication Device Having a Shared Electronic Address”).
As a result, these systems are (as a practical matter) incapable of providing complete synchronization between the wireless device and the corporate e-mail database. For example, because messages are only redirected to the wireless device under certain conditions (e.g., following a redirection event), at any given point in time, the wireless device may contain an incomplete set of e-mail data. Moreover, even when messages are actively being forwarded to the wireless device, the e-mail data stored at the wireless device and the e-mail database are not truly synchronized. For example, certain types of transactions performed on the wireless device, such as an indication that a message has been viewed by the user, message deletions, movement of messages from one folder to another, . . . etc., are not updated at the e-mail service wirelessly.
Moreover, only basic e-mail functions such as sending and receiving messages may be controlled at the wireless device. More advanced e-mail management functions must be set at the user's desktop (e.g., configuring e-mail filters, outgoing e-mail signatures, security settings such as passwords, . . . etc).
In addition, prior messaging systems require a corporate desktop to which the device must be attached when the user is in the office. The problem with this is not merely that a corporate desktop is required, but also that the corporate desktop must be configured with software and a proprietary “cradle” that allows it to communicate directly to the wireless device.
Accordingly, what is needed is a system and method for providing complete synchronization and management between a wireless device and a messaging service (e.g., a corporate e-mail account). What is also needed is a wireless apparatus for receiving and sending e-mail messages which does not require a corporate desktop or any software to be installed and executed on the corporate desktop.
A system is disclosed in which a data processing device is completely synchronized with a messaging service. One embodiment of the system comprises a wireless data processing device; a messaging service to maintain messages and other information on behalf of a user; and synchronization logic for maintaining synchronization of the messages and other information between the wireless device and the messaging service.
A better understanding of the present invention can be obtained from the following detailed description in conjunction with the following drawings, in which:
a-c illustrate an exemplary sequence of related e-mail messages.
a and b illustrate embodiments of a method for generating a move command.
In the following description, for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be apparent, however, to one skilled in the art that the present invention may be practiced without some of these specific details. In other instances, well-known structures and devices are shown in block diagram form to avoid obscuring the underlying principles of the present invention.
In one embodiment of the invention, an interface 100 forwards data objects maintained by the service 102 (e.g., e-mail messages, instant messages, calendar data, . . . etc) to a plurality of wireless data processing devices (represented in
In one embodiment, the interface 100 is a software module adapted to work with the particular service 120. It should be noted, however, that the interface 100 may be implemented in hardware or any combination of hardware and software while still complying with the underlying principles of the invention.
In one embodiment, the external data network 170 is comprised of a plurality of servers/clients (not shown) and other networking hardware (e.g., routers, hubs, . . . etc) for transmitting data between the interface 100 and the wireless devices 130. In one embodiment, the interface 100 encapsulates data in one or more packets containing an address identifying the wireless devices 130 (e.g., such as a 24-bit Mobitex Access Number (“MAN #”)). The external data network 170 transmits the packets to a wireless service provider network 171 which, in turn, transmits the packets (or the data contained therein) over a wireless communication link to the wireless device 130. In one embodiment, the wireless service provider network is a 2-way paging network. However, various other network types may be employed (e.g., CDMA 2000, PCS, . . . etc) while still complying with the underlying principles of the invention.
It should be noted that the network service provider network 171 and the external data network 170 (and associated interface 100) may be owned/operated by the same organization or, alternatively, the owner/operator of the external data network 170 may lease wireless services from the wireless service provider network. The underlying principles of the invention are not limited to any particular service arrangement.
In one embodiment of the invention, the service 102 (e.g., the e-mail database) is fully synchronized with the wireless data processing device 130. Thus, any actions performed on the wireless device 130 are automatically updated on the service 102 and any transactions occurring at the service 102 are automatically reflected on the device 130. Synchronization updates of this type may include but are not limited to device configuration modifications, calendar updates, e-mail message updates, instant messages, to-do list updates and/or any other type of personal information management transactions or corporate data management transactions (hereinafter “message transactions”). As one example, when a user views an e-mail message using the device 130, an indication that the user viewed the message is transmitted to the service 102 (via the interface 100). Accordingly, if the user subsequently connects to e-mail via a client 110, the e-mail will appear as having already been viewed. Other actions such as message deletions, filing activities (e.g., moving a message to a particular folder), message responses, meeting confirmations/additions . . . etc, will automatically be reflected in the service 102, thereby providing complete synchronization between the service 102, the device 130 and/or the client 110 (if one is being used).
Current messaging systems do not offer complete wireless device synchronization. As such, these systems require that the user have a desktop computer with a “cradle” to which the device is attached to received certain types of synchronization updates. One reason for this is that prior systems process message transactions in a relatively inefficient manner and employ only limited compression techniques, thereby making complete synchronization impractical. As such, in order to realize complete wireless synchronization, embodiments of the invention employ one or more of the following compression and/or message processing techniques.
The local message cache 210 is comprised of an input queue 211 for temporarily storing a incoming messags and an output queue 212 for storing outgoing messages. Although illustrated as separate logical units in
The interface 100 of one embodiment is comprised of a remote data compression/decompression module 220 (hereinafter “codec module 220”) and a remote message cache 200 with a remote input queue 201 and a remote output queue 202. The codec module 220 compresses messages transmitted to the wireless data processing device 130 and decompresses messages received from the data processing device 130 according to the techniques described herein. The remote message cache 200 temporarily stores messages transmitted to/from the data processing device 130 (e.g., using various cache replacement algorithms as described above). In one embodiment, the cache replacement policy implemented on the interface 100 is the same as the policy implemented on the wireless device 130 (i.e., so that cache content is synchronized between the remote cache 200 and the local cache 210).
a-c illustrate an exemplary sequence of e-mail messages which will be used to describe various aspects of the invention.
b illustrates the second e-mail message 301 in the sequence transmitted by user Roger Collins in response to the initial e-mail message. As indicated by the new header information 335, this message is transmitted directly to the initial sender, John Smith, and to a user who was CC'ed on the initial e-mail message, Tom Webster. The message is also CC'ed to everyone else in the group to whom the initial message was transmitted. This “reply to all” feature, which is found in most e-mail clients, provides a simple mechanism for allowing a sequence of e-mail messages to be viewed by a common group of individuals.
As illustrated in
Accordingly, even after the initial e-mail response in a sequence of e-mails, the e-mail history (i.e., the portions of text and attachments reproduced from prior messages) represents a significant portion of the overall message, resulting in the transmission of a significant amount of redundant information being transmitted over the wireless network, in both the text portion of the e-mail and the header portion of the e-mail.
c illustrates the final e-mail message 302 in the sequence in which the addressee of the second e-mail responds to the sender of the second e-mail and CC's all of the other members in the group. As illustrated, the only non-redundant information in the e-mail message 302 is a few lines of text 355. The e-mail addresses of all of the group members are the same as in the previous two messages (although switched between different fields, the underlying addresses are the same) and the text and header information from the previous messages 300, 301, including the attachment 320 are reproduced, with only a few minor modifications (e.g., the additional “>” characters inserted by the e-mail system).
One embodiment of the invention compresses e-mail messages by taking advantage of this high level of redundancy. In particular, rather than sending the actual content contained in new e-mail messages, portions of the new messages identified in previous e-mail messages stored in the caches 200, 201 are replaced by pointers to the redundant portions. For example, in message 302 all of the redundant content from message 301 may be replaced by a pointer which identifies the redundant content in message 301 stored in the cache of the user's wireless device. These and other compression techniques will be described in greater detail below.
Various message identification parameters 505 may be used by the message identification logic 500 to search for messages. For example, in one embodiment, the message identification logic will initially attempt to determine whether the new message is the latest in a sequence of messages. Various techniques may be employed by the message identification logic 500 to make this determination. For example, in one embodiment, the message identification logic 500 will search the subject field of the message for the stings which indicate the new message is a response to a prior message. If these strings are identified, the message identification logic 500 may then look for the most recent message in the sequence (e.g., based on the text found in the subject field). For example, referring back to the
If the message subject does not contain characters such as RE: or FW: indicating that the message is part of a sequence, then message identification logic 500 may employ a different set of identification parameters 505 for identifying previous messages. For example, in one embodiment, the message identification logic 500 will search for the most recent message in which the sender of the new message is listed in the header (e.g., as the recipient). Moreover, the message identification logic 500 may search for certain keywords or combinations of words indicating that the message contains relevant data (e.g., such as the electronic signature 315 illustrated in
If no redundant data exists in prior messages, determined at 410, then at 420 additional compression techniques are applied to compress the message, some of which are described below. If, however, redundant data exists in prior messages then, at 415, the redundant data is replaced with pointers/offsets identifying the redundant data on the cache 210 of the wireless device 130 (or in the cache 200 of the interface 100, depending on the direction of message transmission). As illustrated in
Similarly, if message 301 from
In one embodiment, when a user has not received messages for a long period of time, numerous related messages (e.g., such as messages 300-302) may build up in his inbox on the e-mail service 102. Accordingly, in one embodiment, the interface 100 will employ state-based compression techniques as described above using pointers to messages which have not yet arrived in the cache of the user's wireless device. That is, the interface 100 will determine where messages in the group (stored in the user's inbox on the service 102) will be stored in the cache 210 of the wireless data processing device 130 once the user re-connects to the service.
Referring once again to
The state-based compression techniques were described above in the context of an interface 100 compressing messages before transmitting the messages to a wireless device 130. It will be appreciated, however, that the same compression techniques may be performed by the wireless device 130 before it transmits a message to the interface 100 (e.g., lengths/offsets may identify redundant data stored in the remote message cache 200). In addition, although described above with respect to e-mail messages, the described compression techniques may be employed to compression various other message types (e.g., newsgroup articles, instant messages, HTML documents . . . etc).
Various additional compression techniques may be employed, either in addition to or as an alternative to the state-based compression techniques just described.
In one embodiment of the invention, common characters and strings of characters (i.e., which are frequently transmitted between the wireless device 130 and the interface 100) are encoded using relatively small code words whereas infrequent characters or strings of characters are encoded using relatively larger code words. In order to encode data in this manner, a statistical analysis is performed to identify common character strings. Based on the statistical analysis, a lookup table similar to the one illustrated in
In one embodiment, a different look up table may be generated for different types of data transmitted between the interface 100 and the wireless data processing device 130, resulting in greater precision when identifying common strings of characters. For example, a different set of code words may be used to compress e-mail messages than that used to compress the corporate address book. Accordingly, the code word table used to compress e-mail messages would likely contain relatively small code words for the most common e-mail domains whereas the corporate address book might also contain relatively small code words for the corporate address and portions of the corporate phone number.
Moreover, in one embodiment, a unique code word table may be generated for each field within a particular type of data. For example, a different code word table may be employed for the e-mail header field than that used for the remainder of the e-mail message. Similarly, a different table may be generated for the “address” field of the corporate address book than that used for the “e-mail address” field, resulting in even greater precision when generating the set of code words.
Rather than statistically generating and transmitting a code word table for each field, alternatively, or in addition, one embodiment of the invention refers to a dictionary of “known” words, like an English dictionary, and therefore does not need to transmit the dictionary with the data. For example, in one embodiment, a spell-check dictionary maintained on the wireless device 130 and/or the interface 100 may be used to compress content. Rather than sending the actual text of the e-mail message, each word in the message would be identified by its entry in the spell-check dictionary (e.g., the word “meeting” might be replaced by entry#3944).
One type of data particularly suitable to the foregoing types of compression is the corporate address book maintained on most corporate e-mail servers. In one embodiment of the invention, the corporate address book is synchronized initially through a direct link to the client 110 (see
The updates may represent a small percentage of the entire address book, but may still represent a significant number of bytes, especially when multiplied by all the wireless devices in use in use at a given company. Accordingly, reducing the amount of data required to transmit the updates to the address book as described above, would result in a significant savings in transmission costs. Additionally, as the address book can be very large relative to the storage available on the client, storing the address book on the client in a compressed form will allow more entries to be stored.
In one embodiment, to conserve additional space, only certain fields of the corporate address book will be synchronized wirelessly. For example, only the Name, Address, E-mail, and Phone Number fields may be updated wirelessly. All fields of the address book may then be updated when the wireless device is once again directly linked to the client 110.
One embodiment of a method for generating a code word table is illustrated in
At 830 the occurrences of tokens are counted in the same way as the occurrences of the byte strings are counted, though one occurrence of, say, a four-byte token adds four to the count. At 840 a code word table of all the letters and those tokens that occur more than once (or maybe the top N tokens that occur more than once) is generated. Part of the table will include the tokens themselves. At 850, each record is compressed using the code word table of characters and tokens and, at 860, the code word tables and the compressed records are then sent to the wireless device 130.
In one embodiment, the code word tables are identified with a unique number, such as a timestamp. Both the interface 100 and the wireless device 130 would store the tables. On the wireless device 130, the records may remain compressed to conserve space, being decompressed only when opened. On subsequent syncs, the wireless device 130 may request updates to the corporate dictionary. As part of the request, the wireless device 130 may include the unique number assigned to the code word tables. If, for some reason, the wireless device 130 doesn't have the original tables, it may send a particular type of ID to notify the interface 100 (e.g., by using a “0” for the ID). Likewise, if the host doesn't recognize the ID for some reason, it can ignore the original tables and create new ones.
In most cases, however, the wireless device 130 and interface 100 will agree on what the ID is, and the compression of the update will use the existing code word tables previously computed. For example, a new employee with the same e-mail domain and phone prefix as existing employees would compress nicely. Since the updates should be a small percentage of the overall address book, it will most likely be very similar to the existing data.
One embodiment of the invention converts alphanumeric characters (e.g., standard ASCII text) into a proprietary variable-bit character format, allocating relatively fewer bits for common characters and relatively more bits for uncommon characters. In one particular embodiment, 6 bits are allocated for most characters, and 12 bits are allocated for all other characters. This embodiment may be seamlessly integrated with the other forms of compression described above (e.g., message pointer generation, code word lookups, . . . etc) through an escape function described below.
Most messages will have ASCII text in them. For example, the TO: field in an e-mail, or the name in an Address Book entry are generally comprised of ASCII text. Most ASCII text use 7 bits/character. Typical exceptions are accented characters, like ñ or ö. Realistically, though, most text in a text field consists of a-z, 0-9, space, and a few symbols.
Compressing text using code word tables as described above is a good way to encode large amounts of text, because it gathers statistics about how frequently a given character occurs, and represents more frequent characters in fewer bits. For example, the letter ‘e’ occurs more often than the letter ‘k’, so it may be represented in, say, 3 bits. It is also particularly suitable for compressing data in specific data fields where it is known that the same character strings appear regularly (e.g., such as the e-mail domain “@good.com”). One problem with this technique, however, is that it requires transmitting and storing the statistical information with the encoded text. For small amounts of text (e.g., short e-mail messages), this becomes impractical.
A 6-bit character format provides for 64 characters (26=64). In one embodiment, the following symbols are encoded using 6-bits: a zero, handy for denoting the end of strings; ‘a’ through ‘z;’ ‘0’ through ‘9;’ space; and the most common symbols (e.g., dot, comma, tabs, new-lines, @, parens, !, colon, semicolon, single, double quotes, . . . etc). The values above account for 48 of the 64 values, leaving 16 values remaining.
In one embodiment, the remaining 16 values are used for the following escape values:
(1) Four values for combining with the next 6-bits to allow any possible ASCII value to be encoded in two 6-bit values. It allows for any upper case letter, symbols not in the top ten, accented characters, and so on. For example, binary values of 60, 61, 62, and 63 may each identify another 6-bit value which contains the underlying character information. This provides for the coding of an additional 256 characters (4*64=256), more than enough to encode the entire US-ASCII character set.
(2) Shift Lock. Turns on shifting until a subsequent Shift Lock turns off shifting. For letters, this is like a caps lock. For numbers and symbols, this may have no effect. Alternatively, a second set of values may be defined when shift lock is on (e.g., a second “top ten” list of symbols).
In one embodiment, the remaining 11 6-bit characters are “installable escape values,” allowing one or more standard or custom compressors. For example, the TO:, FROM:, CC:, and BCC: fields in an e-mail all contain a list of e-mail addresses, separated by a semicolon. As such, the following special escape values may be defined: (1) the customer's/user's e-mail address may be converted into a 6-bit value; (2) the customer's/user's domain may be converted into a 6-bit value (e.g., “@Good.Com” would become 6 bits); (3) “common” domain names and suffixes may be converted into a 6-bit value and a 6-bit argument (e.g., the “common” list may be 64 of the most common names, and might include “@aol.com”, “@webtv.com”, “.com”, “.net”, “.org”, “.gov”, “.us”, “.uk”, . . . etc); and (4) names “used recently” in an e-mail may be converted into a 6-bit value and a 6-bit argument. Elsewhere in the message is the e-mail ID this is dependent on. The argument might include 2 bits identifying the field (TO:, FROM:, CC:, or BCC:), and 4 bits identifying the first 16 e-mail addresses in that field.
The new character format may be employed seamlessly with the other types of compression described above (e.g., code words, repeated characters; LZ compression; dictionary lookups; and/or referring to prior messages). In one embodiment, illustrated in
For example, as illustrated in
After the e-mail header information is encoded, the block of new text 355 is encoded using the 6-bit character format. Of course, depending on the code words employed by the code word generation module 920 and/or previous e-mails on the system, portions of the block of new text 355 may also be encoded using code words and/or pointers to previous messages. Following the text block 355, the state-based compression module 910, after analyzing the message, notifies the text compression module 900 that it can achieve a higher level of compression by identifying content found in a previous message. As such, an escape sequence “110011” is generated indicating that compression is being handled by the state-based compression module 910 from that point onward. The state-based compression logic 910 then identifies a previous e-mail message using a message ID code (indicating message 301), and generating an offset and a length indicating specific content within that e-mail message (e.g., employing one or more of the state-based compression techniques described above).
It should be noted that the specific example shown in
Various supplemental/alternative compression techniques may also be employed (e.g., represented by alternate compression module 930). In one embodiment, certain types of data are not transmitted wirelessly between the wireless data processing device 130 and the interface 100. For example, in one embodiment, when a device has been unable to receive messages for a certain period of time (e.g., one week), only message headers are initially transmitted to the device 130, thereby avoiding an unreasonably long download period (i.e., wherein all messages received over the period of unavailability are transmitted to the device). Alternatively, or in addition, in one embodiment, when the device is out of touch for an extended period of time, only relatively new messages (e.g., received over a 24-hour period) are transmitted to the device when it comes back online. Similarly, in one embodiment, only e-mail header information is transmitted to the wireless device 130 (e.g., indicating the subject and the sender) when the user is a CC addressee and/or when the e-mail is from a folder other than the user's inbox.
In one embodiment, only certain fields are updated on the device 130. For example, with respect to a corporate or personal address book, only Name, E-mail Address and Phone Number fields may be synchronized on the device 130. When the device is connected directly to the client, all of the fields may then be updated.
In one embodiment, certain details are stripped from e-mail messages to make them more compact before transmitting them to the device 130. For example, only certain specified header information maybe transmitted (e.g., To, From, CC, Date, Subject, body, . . . etc). Similarly, the subject line may be truncated above a certain size (e.g., after 20 characters). Moreover, attachments and various formatting objects (e.g., embedded pictures) may not be transmitted. In one embodiment, when a user lists him/herself as a CC addressee on an outgoing message, this message will not be retransmitted back to the wireless device 130.
Although attachments may not be transmitted to the wireless device 130, in one embodiment, users may still forward the attachments to others from the wireless device (the attachments will, of course, be stored on the e-mail server). Moreover, in one embodiment, attachments may be sent to a fax machine in response to a user command from the wireless device 130. Accordingly, if a user is away from the office and needs to review a particular attachment, he can type in the number of a nearby fax machine and transmit this information to the interface 100. The interface 100 will then open the attachment using a viewer for the attachment file type (e.g., Word, Power Point, . . . etc) and transmit the document via a fax modem using the fax number entered by the user. Thus, the user may view the attachment without ever receiving it at the device.
As illustrated in
As illustrated, once the user begins viewing messages on the device 130, message transaction updates are continually sent to the interface 100. For example, when the user reads message 1, an indication that the message was read is transmitted to the interface 100. This may be followed by an acknowledgement from the interface 100 (e.g., indicating that the communication was received). Similarly, when the user reads and then deletes message 2, separate indications that the message was read and then deleted are transmitted to the interface 100, respectively, followed by an acknowledgement for each transaction.
Because each individual data transmission between the device 130 and the interface 100 may include a significant amount of overhead (e.g., header information such as the device address 130, the service address 102 and various other types of header/control information), and because each message may require an acknowledgement from the interface 100, synchronizing messages in this manner may consume a significant amount of bandwidth. Put another way, the ratio of actual data (e.g., database updates) to control data (e.g., header data) will be relatively low. Moreover, continual data transmissions of this type will tend to consume significantly more power (e.g., because the device's radio will not be idle long enough to enter its low-power mode).
Accordingly, in one embodiment of the invention, under certain conditions (described below), data transactions between the device 130 and the interface 100 are combined, or batch-processed to conserve bandwidth. For example, as illustrated in
Similarly, under certain conditions, database modifications at the service 102 may be batch-processed before being transmitted to the device 130. For example, if the user is in the office reading through and responding to a series of e-mail messages (e.g., from the client 110), transmitting each message transaction to the wireless device 130 independently of one another may not be efficient for the reasons set forth above. As such, in one embodiment, these transactions (or a subset thereof) are combined and concurrently transmitted to the wireless device 130.
As indicated in
Once batch-processing is triggered, message transactions occurring over periodic intervals (e.g., every 10 minutes) may be combined and transmitted at the end of each interval. Alternatively, or in addition, once the combined message transactions reach some predetermined threshold (e.g., based on the sheer number of transactions and/or the amount of data contained within the combined transactions), the combined messages may be transmitted together. Various other message combination parameters may be employed while still complying with the underlying principles of the invention.
One embodiment of a method for performing batch processing of message transactions is illustrated in
If the conditions are not met, then at 1310, the system remains in standard message transaction mode. If, however, the conditions have been met, then at 1315, the system (i.e., the wireless device 130 and/or interface 100) processes messages according to the established batch-processing parameters. For example, at this stage the device 130 and/or interface 100 may combine message transactions which occur over a predetermined period of time (or which result in a specified number of transactions or amount of data as described above).
At 1325 it is determined whether the standard message processing conditions have once again been met. For example, if the user's data processing device has been in range for a predetermined period of time after entering the batch-processing mode, and the user is periodically receiving and quickly responding to messages, this may cause the system to revert back to the standard message transmission mode. Depending on the system configuration, various additional/alternative conditions may cause the system to enter its standard message processing mode.
In one embodiment of the invention, two levels of batch processing are employed: one at the customer site 120 and another at a data center located on the external data network 170. This embodiment will be described with respect to
Batch processing logic 1400 at the customer site provides the first level of batch processing. Specifically, in one embodiment, when a user concurrently performs a group of message transactions, the batch processing logic 1400 logically combines the message transactions before transmitting them to the data center 1410. For example, when a user deletes a block of e-mail messages or moves a block of messages from one folder to another, the block of individual deletions/moves are transmitted as a group (i.e., as opposed to transmitting a series of individual deletes/moves and waiting for an equal number of individual acknowledgements form the data center 1410). In addition, the block of message transactions are temporarily stored off in the remote message cache 200 (described above with respect to
At the data center 1410, the batch-processed message transactions are initially stored off in a secondary cache, referred to herein as a “message switch” 1412. After receiving and storing the block of message transactions, the message switch sends a block acknowledgement to the batch processing logic 1400, which may thereafter delete the block of message transactions from the remote message cache 200. Alternatively, the batch processing logic 1400 may continue to store the block of message transactions for some predetermined amount of time or after some predetermined event has occurred (e.g., until it receives an indication that the message transactions have been successfully received by the wireless device 130).
If the wireless device is actively connected to the wireless network, the message transactions are forwarded from the message switch 1412 to the wireless device as a group (via the wireless gateway 1411). For example, an indication that 10 messages have been moved from the user's “inbox” to the user's “saved mail” folder may be transmitted together. The wireless device 130 may then respond with a single acknowledgement that it received all 10 message transactions. Alternatively, if one of the message transactions had not been successfully received, the wireless device 130 may request that individual message transaction as opposed to the entire group (as described in detail below in the section entitled “In-Order Delivery of Message Transactions”).
In one embodiment, the message switch 1412 performs a second level of batch processing functions in addition to (or in lieu of) the first level of batch processing performed by the batch processing logic 1400 at the customer site. Specifically, the message switch 1412 batch-processes sequences of message transactions generated over a period of time as opposed to the bulk message transactions (e.g., “delete 10 messages”) just described. For example, a user will typically read one new e-mail message after another at the customer site, and may continually add new to-do list entries and calendar entries throughout the day. In one embodiment, these individual message transactions are transmitted from the interface 100 to the message switch 1412 as they occur at the service 102. For example, when a user reads a single new e-mail message, an indication that the message has been read is transmitted to the message switch 1412. Similarly, when a user generates a new calendar entry, the new entry is automatically transmitted to the message switch 1412.
In one embodiment, the message switch 1412 groups the various individual message transactions together before transmitting them to the wireless device 130. If the wireless device 130 is actively connected to the wireless network, the message switch 1412 may group a certain number of message transactions together and/or may group all message transactions together occurring over a period of time before transmitting them as a group to the wireless device 130. While the wireless device 130 is not actively communicating over the wireless network, the message switch 1412 may combine all message transactions and transmit them as a group once the wireless device comes online. In one embodiment, the message switch 1412 and/or the batch processing logic 1400 may batch-process message transactions based on the batch processing parameters 1210 and 1220 described above with respect to
In order to fully synchronize a wireless device 130 with a service 102 as described herein, it is not only important that message transactions are reliably communicated to and from the wireless device but also that the message transactions are communicated in the proper order (e.g., in the same sequential order in which they occur at the service). For example, if a user creates a new folder at the service 102 and then moves several messages into the folder, the transaction creating the folder must be received by the wireless device before the move transaction.
While wireless networks such as Mobitex ensure reliable delivery of data, they do not necessarily ensure that the delivered data arrives in-order. Moreover, while network protocols such as the Transmission Control Protocol (“TCP”) ensure in-order delivery of data, these protocols assume that both the sending node and the receiving node are always active and, therefore, are not necessarily adapted to a system in which one of the nodes (i.e., the wireless device) is inactive for extended periods.
As such, one embodiment of the invention illustrated in
In one embodiment, if the wireless device has not received message transaction 4 after some specified period of time (e.g., because the message transaction was lost during transmission), the wireless device 130 will send a request to the data center 1410 and/or the interface 100 to retransmit message transaction 4. The in-order control logic 1500 or 1510 executed at the interface 100 and/or the data center 1410, respectively, will then retransmit message transaction 4 from either the remote message cache 200 or the message switch 1412, respectively.
The wireless device 130 notifies the interface 100 and/or the message switch 1412 once it successfully receives message transaction 4, thereby allowing the message transaction to be removed from the remote message cache 200 and/or the message switch 1412 (i.e., assuming that other cache removal conditions described herein have been met). In one embodiment, the wireless device may send a block notification as opposed to an individual notification for each message transaction. For example, rather than simply sending a notification that it has received message transaction 4, the wireless device 130 may send a single notification that it has successfully received messages 1-10 (or some alternate number of message transactions), thereby allowing all messages to be cleared from remote message cache 200 and/or the message switch 1412 with a single notification. It should be noted that the sequential transaction numbers set forth above are for the purpose of illustration only. Various alternate sequential codes may be employed to indicate message transaction order while still complying with the underlying principles of the invention.
Each e-mail message, calendar entry, to-do list entry, . . . etc, is assigned a unique identification code by the service 102. For example, if the service is Microsoft Exchange, a 128-byte identification code is generated for each new data object. Accordingly, when fully synchronizing a wireless device 130 to the service 102, some mechanism must be provided to ensure that no duplicate identification codes are assigned for two distinct data objects. For example, if both the service 102 and the wireless device 130 are capable of independently generating data objects, they may both concurrently generate data objects with the same identification codes, resulting in a conflict.
One mechanism for solving this problem is to require the wireless device 130 to request a new identification code from the service 102 each time it generates a new data object. One potential problem with this scenario is that it may take an unreasonably long time for the wireless device 130 to acquire the identification code, depending on the speed of the wireless network. For example, several seconds may be considered an unreasonable amount of time to wait to begin entering a new e-mail message or calendar entry.
Alternatively, in one embodiment, the range of all possible data object codes are divided between the wireless device 130 and the service 103. In other words, a certain percentage (e.g., 1/2) of all possible codes are allocated to the wireless device 130 and the remaining possible codes are allocated to the service 103. In operation, when a new data object is generated at the wireless device (e.g., a new “to-do” list entry) the wireless device 130 will select a data object code only from within its pre-assigned range, thereby preventing a conflict at the service 102. In one particular embodiment, all negative codes are assigned to the wireless device 130 and all positive codes are assigned to the service 102. If a 32-bit (4-byte) code is used, this will result in 2,147,483,648 (231) negative codes and 2,147,483,648 (231) positive codes. It should be noted, however, that the particular manner in which codes are divided up is not pertinent to the underlying principles of the invention'.
Another potential problem which exists when fully synchronizing a wireless device with a service is that the standard data object identification codes employed by many services are unnecessarily large. As mentioned above, Microsoft Exchange generates a 128-byte (1024 bit) code to identify each unique data object.
Accordingly, in one embodiment of the invention illustrated in
Because copies of data objects may be maintained at both the wireless device 130 and on the service 102, one embodiment of the invention employs techniques to ensure that concurrent modifications to the same data object at both the wireless device 130 and the service 102 are resolved in a logical manner. For example, in one embodiment, a version number is associated with each data object. Each time the data object is modified, the version code is changed to indicate the new version.
In one embodiment, illustrated in
In one embodiment, the conflict detection logic 1700, 1701 executed on the interface 100 and/or the wireless device 130, respectively, detects the version conflict. In response, the conflict detection logic 1700, 1701 triggers conflict resolution logic 1710, 1711 which attempts to resolve the conflict by applying one or more conflict resolution techniques. Various techniques may be employed to resolve the conflict. For example, in one embodiment, the version of the data object at the service 102 (Version 21) is automatically retained, and the user is notified that his modification of the data object from the wireless device 130 will not be entered. The notification may be accompanied by a visual indication of the new version (Version 22) and/or an explanation as to why the modification will not be entered. Alternatively, in one embodiment, the user may be prompted from the data processing device to select between the two potential versions. Upon making a selection, the selected version will be stored on both the wireless device 130 and the service 102. If another individual attempted to enter the non-selected version (e.g., the user's administrative assistant), then that individual may subsequently be notified. In one embodiment, the version which is selected is based on who entered it. For example, one embodiment of the invention may be configured to always accept the version generated by the user (i.e., and not the user's administrative assistant). Thus, if the user modifies Data Object X from either the wireless device 130 or directly at the service 102 (i.e., from a desktop connected to the service 102), the user's modifications will be accepted over any other modifications.
It should be noted that the specific conflict resolution techniques described above are for the purpose of illustration only. Various additional conflict resolution techniques may be employed by the conflict resolution logic 1710, 1711 while still complying with the underlying principles of the invention.
The advanced compression and message processing techniques described above allow the wireless device 130 to be fully synchronized with the service 102. For example, in one embodiment of the invention, all major components of the messaging service are completely synchronized on the wireless device 130. For example, if the service is Microsoft Exchange, these components will include e-mail, electronic calendar, contacts, tasks and notes. Accordingly, all user transactions (message filings, to-do list entries, . . . etc) are maintained up-to-date on the wireless device without the need for a cradle.
In one embodiment, not only are messages synchronized, but the entire state of the service 102 may be synchronized. This state information may include, for example, the creation of new folders, the deletion of old folders, filing of messages to folders, reading a message from the device, marking a message unread, e-mail deletions, arrival of new messages, copying of messages to a folder, filing of messages and/or any other transaction which has an effect on the mailbox maintained at the service.
In addition, in one embodiment, the wireless device 130 is provisioned wirelessly. Thus, once a user's account has been enabled on the service, all initial user data is sent wirelessly. This data may include, for example, initial contacts (e.g. address book), notes, tasks and calendar data. In one embodiment, a unique encryption key may initially be installed on the wireless device 130 to encrypt communication between the device and the service (e.g., by device installation software).
In one embodiment, even though the data on the wireless device 130 is completely synchronized, an aging algorithm may be employed to conserve space on the device. For example, at a given point in time, the service may be storing 40,000 data objects (e.g., e-mail messages, calendar entries, . . . etc), whereas, the wireless device (having a limited amount of memory) may only be capable of storing 20,000 data objects. Accordingly, in one embodiment, the wireless device 130 will store data objects which have not been modified or otherwise manipulated (e.g., moved from one folder to another) for the longest period of time. In one embodiment, the user may specify which types of messages should be automatically deleted (e.g., only messages in the “sent mail” folder, any messages over 1 month old, etc). Once a message has been removed from the device, however, it may always be recovered from the service.
For example, a user may request certain data objects to be re-transmitted from the service 102 based on one or more specified variables (e.g., creator, client, sender, recipient, date range, . . . etc). Similarly, in one embodiment, if the user manipulates a data object which has been deleted from the wireless device 130 from the user's desktop (e.g., moves an e-mail message from one folder to another) that data object will be re-transmitted to the wireless device and stored in the destination folder.
One embodiment of the invention maintains synchronization events even if any part of the system is “down” (e.g., the data network 170 and/or the wireless service provider network 171). For example, as described above, any synchronization events which occur during system downtime may be maintained in one of the batch processing caches 1412 or 200 at the data center 1410 and/or the interface 100, respectively. Thus, the interface 100 may be down for a period of time, the data network 170 may be unavailable, the wireless device 130 may be off, out of coverage or broken, and synchronization updates will still be maintained. Once all parts of the system are again working properly, the queued synchronization updates are processed.
In one embodiment of the interface 100, “move” events are detected and processed in an efficient manner. As indicated in
In order to provide a move command to the wireless device 130 in this manner, the system (e.g., the interface 100) must first identify the message which is to be moved. One embodiment of the interface identifies the message using the methods set forth in
Referring now to
When a wireless device 130 has been “out-of-touch” with the service 102 for an extended period of time, a significant number of transactions may have accumulated which need to be synchronized. Accordingly, in one embodiment, in the interest of both saving bandwidth and time on the device (e.g. not swamping it with unsynchronized data), only representative portions of some data may be transmitted. For example, if the wireless device 130 has been off for two weeks, only message headers may be transmitted to the device (i.e., not the message bodies). The underlying reason for this is that the user will not likely want/need to read all of the older mail on the device.
In one embodiment, the specific manner in which data is transmitted to the device after an extended period of time may be selected by the user. Thus, the user may select a period of time after which only headers should be sent (e.g., older than 1 week, never, etc). In any case, the user may still request the full messages bodies after the headers have been transmitted.
As used herein, “zero desktop install” refers to the ability of the wireless device 130 to function normally without the installation of any client software on a user's desktop computer. One embodiment of the invention does not require a desktop because, as described above, all messaging features (e.g., management of device options, configuration of the messaging service, message filters, outgoing e-mail signatures, security settings, . . . etc) may be accessed by the wireless device. This feature is not available in current messaging systems because current wireless devices support only a subset of all messaging functions. As such, current systems require desktop software and a cradle to complete the synchronization process.
In one embodiment, the wireless device's configuration settings are stored and continually updated on the messaging server. Accordingly, if the device settings are ever lost (e.g., because the device is initialized or lost) the settings may be automatically recovered along with the messaging data. In fact, in one embodiment, the device does not ever need to be backed up because there is no data unique to the device that isn't synchronized to the messaging server.
In addition, in one embodiment, software upgrades are transmitted wirelessly to the device, thereby completely removing any required link between the device and a desktop. Software upgrades may include upgrades to the device's operating system as well as application installations.
Embodiments of the invention may include various steps as set forth above. The steps may be embodied in machine-executable instructions. The instructions can be used to cause a general-purpose or special-purpose processor to perform certain steps. Alternatively, these steps may be performed by specific hardware components that contain hardwired logic for performing the steps, or by any combination of programmed computer components and custom hardware components.
Elements of the present invention may also be provided as a machine-readable medium for storing the machine-executable instructions. The machine-readable medium may include, but is not limited to, floppy diskettes, optical disks, CD-ROMs, and magneto-optical disks, ROMs, RAMs, EPROMs, EEPROMs, magnetic or optical cards, propagation media or other type of media/machine-readable medium suitable for storing electronic instructions. For example, the present invention may be downloaded as a computer program which may be transferred from a remote computer (e.g., a server) to a requesting computer (e.g., a client) by way of data signals embodied in a carrier wave or other propagation medium via a communication link (e.g., a modem or network connection).
Throughout the foregoing description, for the purposes of explanation, numerous specific details were set forth in order to provide a thorough understanding of the invention. It will be apparent, however, to one skilled in the art that the invention may be practiced without some of these specific details. For example, while illustrated as an interface 100 to a service 102 executed on a server 103 (see
This application is a continuation application of prior application Ser. No. 10/109,928, filed Mar. 29, 2002 now U.S. Pat. No. 7,243,163, entitled “A System and Method for Full Wireless Synchronization of a Data Processing Apparatus with a Messaging Service” which is assigned to the assignee of the present application. This application is a continuation-in-part of U.S. Application entitled APPARATUS AND METHOD FOR CONSERVING BANDWIDTH BY BATCH PROCESSING DATA TRANSACTIONS, Ser. No. 09/924,283, filed Aug. 7, 2001 now U.S. Pat. No. 7,155,483.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4682150 | Mathes et al. | Jul 1987 | A |
| 5049881 | Gibson et al. | Sep 1991 | A |
| 5086502 | Malcolm | Feb 1992 | A |
| 5115392 | Takamoto et al. | May 1992 | A |
| 5126739 | Whiting et al. | Jun 1992 | A |
| 5159592 | Perkins | Oct 1992 | A |
| 5321840 | Ahlin et al. | Jun 1994 | A |
| 5469161 | Bezek | Nov 1995 | A |
| 5521597 | Dimitri | May 1996 | A |
| 5553281 | Brown et al. | Sep 1996 | A |
| 5559800 | Mousseau et al. | Sep 1996 | A |
| 5563595 | Strohacker | Oct 1996 | A |
| 5666530 | Clark | Sep 1997 | A |
| 5715387 | Barnstijn et al. | Feb 1998 | A |
| 5727159 | Kikinis | Mar 1998 | A |
| 5727202 | Kucala | Mar 1998 | A |
| 5729735 | Meyering | Mar 1998 | A |
| 5760716 | Mathews et al. | Jun 1998 | A |
| 5771010 | Masenas | Jun 1998 | A |
| 5790974 | Tognazzini | Aug 1998 | A |
| 5793970 | Fakes et al. | Aug 1998 | A |
| 5802312 | Lazaridis et al. | Sep 1998 | A |
| 5813016 | Sumimoto | Sep 1998 | A |
| 5838923 | Lee et al. | Nov 1998 | A |
| 5841376 | Hayashi | Nov 1998 | A |
| 5870610 | Beyda | Feb 1999 | A |
| 5875329 | Shan | Feb 1999 | A |
| 5878434 | Draper et al. | Mar 1999 | A |
| 5903230 | Masenas | May 1999 | A |
| 5930471 | Milewski et al. | Jul 1999 | A |
| 5961590 | Mendez et al. | Oct 1999 | A |
| 5974238 | Chase, Jr. | Oct 1999 | A |
| 5987464 | Schneider | Nov 1999 | A |
| 6003089 | Shaffer et al. | Dec 1999 | A |
| 6023708 | Mendez et al. | Feb 2000 | A |
| 6034621 | Kaufman | Mar 2000 | A |
| 6052735 | Ulrich et al. | Apr 2000 | A |
| 6065017 | Barker | May 2000 | A |
| 6085185 | Matsuzawa et al. | Jul 2000 | A |
| 6104392 | Shaw et al. | Aug 2000 | A |
| 6111707 | Buddecke et al. | Aug 2000 | A |
| 6151606 | Mendez | Nov 2000 | A |
| 6182117 | Christie | Jan 2001 | B1 |
| 6188695 | Przybysz | Feb 2001 | B1 |
| 6216157 | Vishwanath et al. | Apr 2001 | B1 |
| 6218970 | Jaquette | Apr 2001 | B1 |
| 6219694 | Lazaridis et al. | Apr 2001 | B1 |
| 6226618 | Downs et al. | May 2001 | B1 |
| 6259891 | Allen | Jul 2001 | B1 |
| 6275848 | Arnold | Aug 2001 | B1 |
| 6279001 | DeBettencourt et al. | Aug 2001 | B1 |
| 6304881 | Halim et al. | Oct 2001 | B1 |
| 6310889 | Parsons et al. | Oct 2001 | B1 |
| 6330618 | Hawkins et al. | Dec 2001 | B1 |
| 6343299 | Huang et al. | Jan 2002 | B1 |
| 6347340 | Coelho et al. | Feb 2002 | B1 |
| 6360272 | Lincke et al. | Mar 2002 | B1 |
| 6384850 | McNally et al. | May 2002 | B1 |
| 6393434 | Huang et al. | May 2002 | B1 |
| 6396482 | Griffin et al. | May 2002 | B1 |
| 6401136 | Britton et al. | Jun 2002 | B1 |
| 6430601 | Eldridge et al. | Aug 2002 | B1 |
| 6449622 | LaRue et al. | Sep 2002 | B1 |
| 6457062 | Pivowar et al. | Sep 2002 | B1 |
| 6460055 | Midgley et al. | Oct 2002 | B1 |
| 6463463 | Godfrey et al. | Oct 2002 | B1 |
| 6463464 | Lazaridis et al. | Oct 2002 | B1 |
| 6477543 | Huang et al. | Nov 2002 | B1 |
| 6505055 | Kahn et al. | Jan 2003 | B1 |
| 6535892 | LaRue et al. | Mar 2003 | B1 |
| 6571245 | Huang et al. | May 2003 | B2 |
| 6604236 | Draper et al. | Aug 2003 | B1 |
| 6615253 | Bowman-Amuah | Sep 2003 | B1 |
| 6625621 | Tan et al. | Sep 2003 | B2 |
| 6636873 | Carini et al. | Oct 2003 | B1 |
| 6640244 | Bowman-Amuah | Oct 2003 | B1 |
| 6654746 | Wong et al. | Nov 2003 | B1 |
| 6658167 | Lee et al. | Dec 2003 | B1 |
| 6671757 | Multer et al. | Dec 2003 | B1 |
| 6675203 | Herrod et al. | Jan 2004 | B1 |
| 6694335 | Hopmann et al. | Feb 2004 | B1 |
| 6697458 | Kunjibettu | Feb 2004 | B1 |
| 6701378 | Gilhuly et al. | Mar 2004 | B1 |
| 6721787 | Hiscock | Apr 2004 | B1 |
| 6721871 | Piispanen et al. | Apr 2004 | B2 |
| 6757698 | McBride et al. | Jun 2004 | B2 |
| 6779019 | Mousseau et al. | Aug 2004 | B1 |
| 6792085 | Rigaldies et al. | Sep 2004 | B1 |
| 6810405 | LaRue et al. | Oct 2004 | B1 |
| 6874029 | Hutcheson et al. | Mar 2005 | B2 |
| 6874037 | Abram et al. | Mar 2005 | B1 |
| 6901415 | Thomas et al. | May 2005 | B2 |
| 6931454 | Deshpande et al. | Aug 2005 | B2 |
| 6934766 | Russell | Aug 2005 | B1 |
| 6941348 | Petry et al. | Sep 2005 | B2 |
| 6941349 | Godfrey et al. | Sep 2005 | B2 |
| 6954789 | Dietz et al. | Oct 2005 | B2 |
| 6973299 | Apfel | Dec 2005 | B2 |
| 6983308 | Oberhaus et al. | Jan 2006 | B1 |
| 7003776 | Sutherland | Feb 2006 | B2 |
| 7085809 | Mori et al. | Aug 2006 | B2 |
| 7092699 | Hefter | Aug 2006 | B1 |
| 7136934 | Carter et al. | Nov 2006 | B2 |
| 7139555 | Apfel | Nov 2006 | B2 |
| 7149813 | Flanagin et al. | Dec 2006 | B2 |
| 7155483 | Friend et al. | Dec 2006 | B1 |
| 7191218 | Innes | Mar 2007 | B1 |
| 7243163 | Friend et al. | Jul 2007 | B1 |
| 7287097 | Friend et al. | Oct 2007 | B1 |
| 7743119 | Friend et al. | Jun 2010 | B2 |
| 20010004744 | Lazaridis et al. | Jun 2001 | A1 |
| 20010005864 | Mousseau et al. | Jun 2001 | A1 |
| 20010010059 | Burman et al. | Jul 2001 | A1 |
| 20010034654 | Vigil et al. | Oct 2001 | A1 |
| 20010054115 | Ferguson et al. | Dec 2001 | A1 |
| 20020013853 | Baber et al. | Jan 2002 | A1 |
| 20020016818 | Kirani et al. | Feb 2002 | A1 |
| 20020019225 | Miyashita | Feb 2002 | A1 |
| 20020032722 | Baynes et al. | Mar 2002 | A1 |
| 20020046286 | Caldwell et al. | Apr 2002 | A1 |
| 20020119793 | Hronek et al. | Aug 2002 | A1 |
| 20020120696 | Mousseau et al. | Aug 2002 | A1 |
| 20020146240 | Ogawa et al. | Oct 2002 | A1 |
| 20020160773 | Gresham et al. | Oct 2002 | A1 |
| 20030046434 | Flanagin et al. | Mar 2003 | A1 |
| 20030050046 | Conneely et al. | Mar 2003 | A1 |
| 20030069842 | Kight et al. | Apr 2003 | A1 |
| 20030081621 | Godfrey et al. | May 2003 | A1 |
| 20030097381 | Detweiler et al. | May 2003 | A1 |
| 20040054739 | Friend et al. | Mar 2004 | A1 |
| 20040105423 | Koehler et al. | Jun 2004 | A1 |
| 20040109436 | Vargas et al. | Jun 2004 | A1 |
| 20040213283 | Ohkubo et al. | Oct 2004 | A1 |
| 20050148356 | Ferguson et al. | Jul 2005 | A1 |
| 20070239898 | Friend et al. | Oct 2007 | A1 |
| 20070266107 | Friend et al. | Nov 2007 | A1 |
| Number | Date | Country |
|---|---|---|
| 0617373 | Sep 1994 | EP |
| 0666651 | Aug 1995 | EP |
| 0736989 | Oct 1996 | EP |
| 0909037 | Apr 1999 | EP |
| 0917077 | May 1999 | EP |
| 1014629 | Jun 2000 | EP |
| 1014629 | Nov 2001 | EP |
| 1995182263 | Jul 1995 | JP |
| 1998269125 | Oct 1998 | JP |
| 1999136365 | May 1999 | JP |
| 2001076040 | Mar 2001 | JP |
| 2001339422 | Dec 2001 | JP |
| WO-9945484 | Sep 1999 | WO |
| 0067158 | Nov 2000 | WO |
| WO-0178342 | Oct 2001 | WO |
| WO 0178342 | Oct 2001 | WO |
| 0219626 | Mar 2002 | WO |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 10109928 | Mar 2002 | US |
| Child | 10348281 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 09924283 | Aug 2001 | US |
| Child | 10109928 | US |
