CA2100533C - Method and system for synchronizing computer mail user directories - Google Patents

Method and system for synchronizing computer mail user directories Download PDF

Info

Publication number
CA2100533C
CA2100533C CA002100533A CA2100533A CA2100533C CA 2100533 C CA2100533 C CA 2100533C CA 002100533 A CA002100533 A CA 002100533A CA 2100533 A CA2100533 A CA 2100533A CA 2100533 C CA2100533 C CA 2100533C
Authority
CA
Canada
Prior art keywords
transactions
node
transaction
sequence number
directory
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
CA002100533A
Other languages
French (fr)
Other versions
CA2100533A1 (en
Inventor
Duncan Wayne Lee
Mark Ledsome
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Microsoft Corp
Original Assignee
Microsoft Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Microsoft Corp filed Critical Microsoft Corp
Publication of CA2100533A1 publication Critical patent/CA2100533A1/en
Application granted granted Critical
Publication of CA2100533C publication Critical patent/CA2100533C/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/10—Office automation; Time management
    • G06Q10/107—Computer-aided management of electronic mailing [e-mailing]
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00—Data processing: database and file management or data structures
    • Y10S707/99951—File or database maintenance
    • Y10S707/99952—Coherency, e.g. same view to multiple users

Abstract

A method and system for synchronising directories containing information about computer mail users is provided. In a preferred embodiment , a computer mail facility synchronizes a user directory stored in a respondin g directory node with a more current user directory stored in an originating directory node. The facility first acquires in the originating directory nod e one or more directory update transactions for updating the contents of the user directory stored in the originating directory node. The facility assigns a consecutive sequence number to each transaction indicating the order of acquisition. The facility then updates the contents of the user directory stored in the originating directory node by processing the transactions in the order o f their sequence numbers. At a later time, the facility selects a series of the transactions for transmission to the responding directory node. The sequence number of the first directory update transaction in the series is consecutiv e to an originating directory node synchronization number that stores the sequence number of a last confirmed transmitted directory update transaction. Also, t he assigned sequence numbers of all directory update transactions in the series are consecutive. After selecting the series of transactions, the facility transmits transactions of the series from the originating directory node to the responding directory node. The facility receives the transactions of the series in the responding directory node, then transmits a confirmation message indicating the largest consecutive sequence number of the received directory update transactions from the responding directory node to the originating directory node. Upon receiving the confirmation message in the originating directory node, the facility sets the originating directory node synchronization numbe r to the sequence number indicated by the confirmation message.

Description

1 ~1t~0~~3~
Description METHOD AND SYSTEM FOR SYNCHRONIZING
COMPUTER MAIL USER DIRECTORIES
Technical Field The invention relates generally to a method and system for maintaining the synchronization of separate files, and, more specifically, to a method and system for synchronizing user directories in a computer mail to system.
Background of the Invention Computers have long been used by human users to communicate with other human users. In a computer mail system, also lmown as an electronic mail system, a user may send messages to other users. Messages may contain text, or data in any other form. After a message is sent by a sending user to a receiving user, the message is stored in a computer system until the receiving user is able to examine it.
Computer mail systems (mail system) comprise one or more computer systems, called nodes. In a single node mail system, a sending user sends a message from the same node at which the receiving user receives the message. In a multiple node mail system, several nodes are connected together by a computer network (network), which allows a node to transmit data to other nodes. The network in a multiple node mail system permits a sending user to send a message from a sending node to receiving user at a separate receiving node. In order to correctly route such an inter-node message to the node at which the receiving user expects to receive it, computer mail systems usually maintain a user directory (directory).
3o A directory contains the names of users and the nodes at which they expect to receive messages. When a sending user sends a message to a receiving user, the computer mail system first accesses the directory to determine the node at which the receiving user expects to receive messages, then transmits the message to that node.
Since computer networks often contain hundreds of nodes, it is in some cases desirable to maintain several directories on nodes at different locations within the network. (A node on which a directory is
2~U~~33 maintained is known as a directory node.) This allows the mail system to transmit a message from the sending node to a nearby directory node for routing, reducing the overall travel of the message.
Maintaining multiple directories presents the challenge of synchronization: each directory must contain a current list of mail system users, as well as the correct receiving node for each user. This problem would be trivial if directories were invariant: once the mail system generated the first directory, it could merely copy it once to different directory nodes. However, users sometimes change their receiving node, i0 or are added to or deleted from the list of users. It is also impractical to copy the entire directory each time it changes, as the large size of the entire directory adds an unacceptable transmission load to most networks.
In order to maintain the synchronization of directories in light of these problems, some mail systems employ a scheme of transactional updates. In such a scheme, when a user is added or deleted, or changes his or her receiving node, the mail system generates a user update transaction (transaction) containing the information required to update a directory to reflect this change. The mail system transmits the transaction to every directory node in order to update the directory node's directory.
2o The shortcoming of the transactional update scheme is that, in order for transactions to be intelligible, they must be processed in the same order that they are generated. Transactions may be received in an order different than the one in which they are generated, due to transmission errors within the network. For example, if a user is added, then deleted, and the mail system processes the delete transaction before the add transaction, the delete transaction causes an error, and afterwards the user erroneously remains in the list of users.
Summanr of the Invention 3o ~ It is an object of the invention to provide a method and system in a computer mail system for synchronizing a user directory stored in a responding directory node with a more current user directory stored in an originating directory node.
It is another object of the invention to provide a method and system in a computer mail system for transmitting to a responding directory node sequential directory update transactions for updating the contents of a user directory stored in an originating directory node.

~~.0~~3~
3 It is a fiuther object of the invention to provide a method and system in a responding directory node in a computer mail system for receiving and confirming sequential directory update transactions transmitted from an originating directory node.
These and other objects, which will become apparent as the invention is more fully described below, are provided by a method and system for synchronizing directories containing information about computer mail users. In a preferred embodiment, a computer mail facility synchronizes a user directory stored in a responding directory node with a to more current user directory stored in an originating directory node. The facility first acquires in the originating directory node one or more directory update transactions for updating the contents of the user directory stored in the originating directory node. The facility assigns a consecutive sequence number to each transaction indicating the order of acquisition.
The facility then updates the contents of the user directory stored in the originating directory node by processing the transactions in the order of their sequence numbers. At a later time, the facility selects a series of the transactions for transmission to the responding directory node. The sequence number of the first directory update transaction in the series is 2o consecutive to an originating directory node synchronization number that stores the sequence number of a last confirmed transmitted directory update transaction. Also, the assigned sequence numbers of all directory update transactions in the series are consecutive. After selecting the series of transactions, the facility transmits transactions of the series from the originating directory node to the responding directory node. The facility receives the transactions of the series in the responding directory node, then transmits a confirmation message indicating the largest consecutive sequence number of the received directory update transactions from the responding directory node to the originating directory node. Upon 3o receiving the confirmation message in the originating directory node, the facility sets the originating directory node synchronization number to the sequence number indicated by the confirmation message.
Brief Description of the Drawinss Figure 1 is a block diagram showing the structure of and interaction within the computer mail system.

2~~0~~3
4 Figure 2 is a high-level block diagram of one of the general-puapose computer systems that preferably comprise the local and master directory nodes and upon which the facility preferably operates.
Figure 3 is a transmission diagram illustrating the generic directory update cycle.
Figure 4 is a block diagram of the initial state of a local directory node dirt .
Figure 5 is a block diagram of the initial state of the master directory node.
l0 Figure g is a block diagram of the state of the master directory node after receiving transactions from the local directory node dirl.
Figure 7 is a flow diagram of the AssignSequenceNumbers routine.
Figure 8 is a flow diagram of the TransmitTransactions routine.
Figure 9 is a flow diasram of the ReceiveTransactions routine.
Figure 10 is a flow dia.g~ram of the ReceiveConfi~ation routine.
Detailed Description of the Invention A method and system for synchronizing directories containing information about computer mail users is provided. In a preferred embodiment, a computer mail facility (facility) synchronizes a user directory (directory) stored in a responding directory node (responding directory) with a more current directory stored in an originating directory node (originating directory). The facility first acquires in the originating directory node (originating node) one or more directory update transactions (transactions) for updating the originating directory. The facility assigns a consecutive sequence number to each transaction indicating the order of acquisition. The facility then updates the oziginating directory by processing the transactions in the order of their sequence numbers. At a later time, the facility selects a series of the transactions for transmission to the responding directory node (responding node). The selected transactions are known as outstanding transactions. The sequence number of the first transaction in the series is consecutive to an originating directory node synchronization number (originating synchronization number) that stores the sequence number of a last confirmed transmitted 2~OJ~33 transaction. Also, the assigned sequence numbers of all transactions in the series are consecutive. After selecting the series of transactions, the facility transmits transactions of the series from the originating node to the responding node. The facility receives the transactions in the responding
5 node, then transmits a confirmation message indicating the largest consecutive sequence number of the received transactions from the responding node to the originating node. Upon receiving the confirmation message in the originating node, the facility sets the originating synchronization number to the sequence number indicated by the to confirmation message.
In a preferred embodiment, the facility also utilizes a responding directory node synchronization number (responding synchronization number). The facility sets the responding synchronization number to the sequence number of the last transaction received and processed in the responding node. When the facility receives further transactions in the responding node, it only processes those that are consecutive to each other and to the responding synchronization number The networks that connect multiple node mail systems are sometimes susceptible to the problems of transmission loss or delay. Even 2o in cases of transmission loss and or delay the facility ensures that all transactions acquired in the originating node are received and processed in the responding node in the order in which they were acquired. One such case of transmission loss and or delay is the loss of a transaction transmission message. If the facility transmits a series of transactions from the originating node to the responding node that are not received in the responding node, the responding node does not transmit a confirmation message. The originating synchronization number is therefore not set to the sequence number of the last transaction received and processed in the responding node, but rather remains at one less than the sequence number of the first transaction in the lost series transaction in the lost series.
When the facility next transmits transactions from the originating node to the responding node, the transactions of the lost series are included in the new series that is transmitted.
Another such case of transmission loss and or delay is the loss of a confirmation message. If the facility transmits a confirmation message from the responding node to the originating node that is not received in the originating node, the next series that the facility transmits from the 2~~~533 originating node to the responding node erroneously contains transactions that have been successfully received and processed in the responding node.
However, when the responding node receives the series it processes only those transactions whose sequence numbers are larger than the responding synchronization number. As a result, the redundant transactions are not processed again.
A further such case of transmission loss and or delay is the delay of a confirmation message. As above, the facility retransmits in a second transaction transmission the transactions whose confirmation to message is delayed to the responding node, but does not reprocess them. I:f the confirmation message for the second transmission arrives before the delayed confirmation message, the facility will set the originating synchronization number to the sequence number contained in the confirmation message for the second transmission, then ignore the smaller sequence number contained in the delayed confirmation message. If the con:6rmation message for the second transmission arzives after the delayed confirmation message, then the facility will first set the originating synchronization number to the smaller sequence number contained in the delayed confirmation message, then to the larger sequence number 2o contained in the confnmation message for the second transmission. In either case, the originating synchronization number is eventually set to the larger sequence number contained in the confirmation message for the second transmission.
Figure 1 is a block diagram showing the structure of and interaction within the computer mail system. Local nodes 101-104 acquire directory update transactions from connected subscriber nodes (not shown). In a preferred embodiment, an add user transaction associates a local node with the new user. When other transactions are subsequently generated with respect to a particular user, they are transmitted to ' and acquired by the associated local node. This ensures that all transactions that apply to a particular user are properly sequenced. In each case, the assigned local node is preferably the nearest local node to the user's address. The local directory nodes regularly transmit the update transactions that they have received to a master directory node 105 in a master directory update cycle. The master node regularly transmits the update transactions that it has received from local nodes to all of the local nodes in local directory update cycles.

1 ~ ~ J
Figure 2 is a high-level block diagram of one of the general-purpose computer systems that preferably comprise the local and master nodes and upon which the facility preferably operates. The computer system 201 contains a central processing unit (CPU) 202, a computer memory (memory) 203, and input/output devices 204. Among the inputloutput devices are a storage device 205, such as a hard disk drive and a network connection 206. The computer system can use its network connection to transmit data to and receive data from other computer systems. The computer programs that preferably control the actions of the to facility reside in the memory and executes on the CPU.
Master directory update cycles and local directory update cycles are performed in a similar manner. Because the update cycles are performed in a similar manner, they are described here generically. The facility performs an update cycle periodically from each directory node.
During the master directory update cycle, the local node is updating the master directory. Therefore the local node is the originating node, transmitting transactions to the responding node, which is the master node.
During the local directory update cycle, the master node is updating the local directory. Therefore the master node is the originating node, 2o transmitting transactions to the responding node, which is the local node.
Figure 3 is a transmission diagram illustrating a generic directory update cycle. An originating node 301 is connected to a responding node 302 by a computer network. The computer network may contain other nodes intermediate to the originating node and the responding node. First, the originating node transmits to the responding node a transaction message 303. The transaction message contains transmitted transactions 304 for updating the responding directory. When the responding node receives the transaction message, it updates the responding directory by processing each of the transmitted transactions.
3o The responding node then transmits a confirmation message 305 back to the originating node. The confirmation message contains the sequence number of the last transaction processed by the responding node. When the originating node receives the confumation message, it makes a record of the sequence number of the last transaction processed by the responding node so that it does not have to retransmit the same transactions confirmed again later.

21~0~~3 s Figure 4 is a block diagram of the initial state of local directory node dirl. The local directory node 401 has a directory 402 and originating synchronization number 403, a responding synchronization number 404, and a transaction table 405. The directory contains the names of mail users and the nodes at which they expect to receive mail. These nodes are called the users' addresses. The originating synchronization number indicates the sequence number of the last transaction transmitted to the master node to which the master node has responded with a confirmation message. The responding synchronization number indicates 1o the last consecutive transaction that the local node has received from the master node. Transactions received from the master node have been used to update the directory, as have transactions acquired initially by the local node. The transaction table contains outstanding transactions and their sequence numbers. The transaction having sequence number 6 will, when processed, cause the address of a user "martin" to be changed, the transaction having sequence number 7 will cause a user "wilson" to be deleted, and the transaction having sequence number 8 will cause a user "newhart" to be added. These are transactions that have been acquired by the local node and that the local node has either not transmitted to the 2o master node, or that the local node has transmitted to the master node but has not received a confirmation message for. When the facility periodically attempts to transmit outstanding transactions to the master node, it will transmit the transactions contained in the ~ansaction table.
Figure 5 is a block diagram of the initial state of the master directory node. The master directory node 501 has a directory 502, an originating synchronization number table 503, a responding synchronization number table 504, and a transaction table 505. The directory contains the names and addresses of mail users as updated with transactions transmitted from local nodes. The originating synchronization table indicates the sequence number of the last transaction transmitted to each local node to which the master node has responded with a confirmation message. Here, the local node has transmitted transactions through sequence number 235 to the local nodes, and the local nodes have all responded with a confirmation message. The responding synchronization table indicates the last consecutive transaction that the master node has received from each local node. The transaction table is empty of outstanding transactions. This means that all transactions 92I~J~3~
transmitted by the master node have been confirmed by the local nodes to which they were transmitted.
Figure 6 is a block diagram of the state of the master directory node after receiving transactions from local directory node dirl. The local node has transmitted the transactions having sequence number 6, 7 and 8.
The master node received these transactions and updated its directory by processing them. In the directory, the address of a user "martin" has been changed, a user "wilson" has been deleted, and a user "newhart" has been added. The master node has transmitted a confirmation message to the to local node containing the sequence number of the last consecutive transaction received-8. The master node has set its responding synchronization number for local node dirl to the sequence number of the last consecutive transaction received-8.
When the master node received the transactions having sequence numbers 6, 7, and 8 from the local node, it acquired the transactions. The master node then assigned its own sequence numbers, 236, 237, and 238, to the transactions, and stored the transactions with their sequence numbers in its transaction table. Here the transactions will wait for the next local directory update cycle. At that point, all the 2o transactions in the transaction table whose sequence number is greater than the master nodes originating synchronization number will be transmitted to all of the local nodes. When the local nodes receive the transactions, they will update their directories by processing the transactions and send a confirmation back to the master node. The master node will use the synchronization message to set the appropriate originating synchronization number to the last consecutive transaction received by the confirming node.
Figure 7 is a flow diagram of the AssignSequenceNumbers routine. The AssignSequenceNumbers routine preferably executes 3o continuously on the originating node. When a transaction arrives at the originating node, the facility receives and assigns sequence numbers to it.
In step 701, the facility initializes a LastSequenceNumber variable. In step 702, the facility acquires a new transaction. A local node may acquire a transaction either by generating the transaction itself, or receiving it from a subscriber node. A master node may acquire a transaction by receiving it from a local node. In step 703, the facility stores the acquired transaction in the originating node's transaction table, assigning it a sequence number nl~~~~3 of LastSequenceNumber + 1. In step 704, the facility increments the last sequence number to correspond with the sequence number of the newly stored transaction. The facility then continues at step 702 to acquire another transaction.
Figure 8 is a flow diagram of the TransmitTransactions routine. The facility periodically calls the TransmitTransactions routine to transmit from the originating node to the responding node any outstanding transactions not yet confirmed as received by the responding node. In step 801, if the last sequence number assigned to a transaction by the to originating node is greater than the originating synchronization number stored in the originating node, then one or more outstanding transactions have been acquired and not confirmed, and the facility proceeds to step 802 to transmit the outstanding transactions to the responding node, else the facility returns. In step 802, the facility selects the transaction with the next consecutive sequence number, beginning with the sequence number following the originating synchronization number. In step 803, the facility hansmits the selected transaction to the responding node. In step 804, if all transactions have been selected, then the facility returns, else the facility continues at step 802 to select another transaction.
2o Figure 9 is a flow diagram of the ReceiveTransactions routine.
Whenever transactions arrive at the responding node, the facility calls the ReceiveTransactions routine to receive and process them. In step 901, the facility receives transactions transmitted from the originating node. In step 902, the facility updates the responding node directory by processing all of the received transactions whose sequence number is consecutive to the responding synchronization number. In step 903, if the sequence number of the last processed transaction is greater than the responding synchronization number, i. e., a transaction was processed, then the facility continues in step 904, else the facility returns. In step 904, the facility sets 3o the responding synchronization number to the sequence number of the last transaction process. In step 905, the facility transmits a confirmation message to the originating node containing the responding synchronization number. The facility then returns.
Figure 10 is a flow diagram of the ReceiveConfirmation routine. Whenever a confirmation message transmitted from the responding node arrives at the originating node, the facility calls the ReceiveConfumation routine to receive and process it. In step 1001, the 2I~~~~
n facility receives a confirmation message from the responding node. In step 1002, if the sequence number indicated by the confirmation message is greater than the originating synchronization number, then the facility continues at step 1003, else the facility returns. In step 1003, the facility sets the originating synchronization number to the sequence number indicated by the confirmation message. This advances the sequence number of the first transaction that will be transmitted from the originating node the next time it transmits transactions to the responding node, In step 1004, the facility deletes any transactions from the originating node's 1o transaction table that have sequence numbers that are less than or equal to the sequence number indicated by the confirmation message, i. e., the new originating synchronization number. The facility then returns.
While this invention has been shown and descn'bed with reference to preferred embodiments, it w~l be understood by those skilled in the art that various changes or modifications in form and detail may be made without departing from the scope of this invention.

Claims (40)

We claim:
1. A method in a computer mail system for synchronizing a user directory stored in a responding directory node with a more current user directory stored in an originating directory node, the method comprising the steps of, for each of a plurality of consecutive synchronization cycles:

acquiring in the originating directory node a plurality of directory update transactions for updating the contents of the user directory stored in the originating directory node;

assigning to each acquired directory update transaction a consecutive sequence number indicating an order of acquisition;

updating the contents of the user directory stored in the originating directory node based on the acquired directory update transactions;

selecting a series of two or more of the acquired directory update transactions for transmission to the responding directory node, the assigned sequence number of the first directory update transaction in the series being consecutive to an originating directory node synchronization number that stores the sequence number of a last confirmed directory update transaction, the assigned sequence numbers of all directory update transactions in the series being consecutive, such that each directory update transaction after the last confirmed directory update transaction is selected;

transmitting the selected series of directory update transactions from the originating directory node to the responding directory node;

receiving in the responding directory node at least one of the directory update transactions in the transmitted series of directory update transactions;

updating the contents of the user directory stored in the responding directory node by processing any directory update transactions received in the responding directory node whose sequence numbers are consecutive to each other and consecutive to a responding directory node synchronization number that stores the sequence number of a last processed directory update transaction;

transmitting from the responding directory node to the originating directory node a confirmation message indicating the largest consecutive sequence number of the directory update transactions received and processed in the responding directory node;
and upon receiving the transmitted confirmation message in the originating directory node, setting the originating directory node synchronization number to the sequence number indicated by the confirmation message thereby completing the synchronization of the user directory stored in the responding directory node with the user directory stored in the originating directory node, such that the originating directory node transmits to the responding directory node in each synchronization cycle all directory update transactions acquired after the last confirmed directory update transaction, irrespective of whether these directory update transactions were previously transmitted, so that the responding directory node can receive all of these transactions in order even though some of these transactions may have been previously received in the responding directory node.
2. The method of claim 1 wherein the responding directory node is a master directory node for maintaining a master user directory, and the originating directory node is a local directory node for maintaining a local user directory and for forwarding the directory update transactions to the master directory node in order to update the master user directory, and wherein the directory update transactions further comprise updates to the master user directory.
3. The method of claim 1 wherein the originating directory node is a master directory node for maintaining a master user directory and for broadcasting the directory update transactions to a plurality of local directory nodes for updating local user directories, and the responding directory node is a local directory node for maintaining the local user directory based upon the master user directory, and wherein the directory update transactions further comprise updates to the local user directories.
4. The method of claim 1, wherein the step of updating the contents of the user directory further comprises the steps of:

if one or more directory update transactions is processed, changing the value of the responding directory node synchronization number to the largest sequence number among the processed directory update transactions; and if no directory update transactions are processed, inhibiting the step of transmitting the confirmation message from the responding directory node to the originating directory node.
5. A computer-readable medium having contents that cause a computer mail system to synchronize a user directory stored in a responding directory node with a more current user directory stored in an originating directory mode by performing the steps of, for each of a plurality of consecutive synchronization cycles:
acquiring in the originating directory node a plurality of directory update transactions for updating the contents of the user directory stored in the originating directory node;
assigning to each acquired directory update transaction a consecutive sequence number indicating an order of acquisition;
updating the contents of the user directory stored in the originating directory node based on the acquired directory update transactions;
selecting a series of the acquired directory update transactions for transmission to the responding directory node, the assigned sequence number of the first directory update transaction in the series being consecutive to an originating directory node synchronization number that stores the sequence number of a last confirmed transmitted directory update transaction, the assigned sequence numbers of all directory update transactions in the series being consecutive, such that each directory update transaction after the last confirmed directory update transaction is selected;
transmitting the selected series of directory update transactions from the originating directory node to the responding directory node;
receiving in the responding directory node at least one of the directory update transactions in the transmitted series of directory update transactions;
updating the contents of the us er directory stored in the responding directory node by processing any directory update transactions received in the responding directory node whose sequence numbers are consecutive to each other and consecutive to a responding directory node synchronization number that stores the sequence number ~ of a last processed directory update transaction;

transmitting from the responding directory node to the originating directory node a confirmation message indicating the largest consecutive sequence number of the directory update transactions received and processed in the responding directory node;
and upon receiving the transmitted confirmation message in the originating directory node, setting the originating directory node synchronization number to the sequence number indicated by the confirmation message thereby completing the synchronization of the user directory stored in the responding directory node with the user directory stored in the originating directory node, such that the originating directory node transmits to the responding directory node in each synchronization cycle all directory update transactions acquired after the last confirmed directory update transaction, irrespective of whether these directory update transactions were previously transmitted, so that the responding directory node can receive all of these transactions in order even though some of these transactions may have been previously received in the responding directory node.
6. The computer-readable medium of claim 5 wherein the step of updating the contents of the user directory further comprises the steps of:
if one or more directory update transactions is processed, changing the value of the responding directory node synchronization number to the largest sequence number among the processed directory update transactions; and if no directory update transactions are processed, inhibiting the step of transmitting the confirmation message from the responding directory node to the originating directory node.
7. A method in a computer system for synchronizing the remote execution of an ordered series of transactions transmitted from an originating node to a responding node, the method comprising the steps of in the originating node:

assigning consecutive sequence numbers to the transactions in the ordered series;

at each of a plurality of transmission times:

identifying each transaction in the ordered series having a sequence number larger than a last confirmed sequence number value, and transmitting to the responding node a batch of a plurality of transactions including each identified transaction;

in the responding node, for each batch of transactions received from the originating node:

selecting each transaction included in thereceived batch that is consecu-tive to a last executed sequence number value;
executing the selected transactions of the batch;

ignoring the unselected transactions of the batch;

if any transactions are executed:

transmitting to the originating node a confirmation containing the highest sequence number of the executed transactions;
setting the last executed sequence number value to the highest sequence number of the executed transactions; and in the originating node:

for each confirmation received from the responding node, setting the last confirmed sequence number value to the sequence number in the confirmation, such that the originating code transmits to the responding node all transactions whose sequence number is larger than the last contained sequence number, irrespective of whether these transactions were previously transmitted, so that the responding node can receive all of these transactions in sequence number order even though some of these transactions may have been previously received in the responding node.
8. The method of claim 7 wherein the executing step includes a step of ignoring any transactions included in the batch whose sequence numbers are not consecutive to the last executed sequence number value.
9. The method of claim 7 wherein thetransmitting step includes the step of re-transmitting transactions executed by the responding node but for which no confirmation has been received in the originating node.
10. The method of claim 7, further including the step of adding transactions to the ordered series between a first and a second of the transmission times.
11. The method of claim 7 wherein the transmitting step in the originating node includes the step of transmitting a first batch of transactions comprising a transaction having a first sequence number through a transaction having a second sequence number, and wherein the receiving step includes the step of receiving only a portion of the first batch of transactions from the transaction having the first sequence number to a transaction having a third sequence number, and wherein the executing step includes the step of executing the received transactions from the first sequence number to the third sequence number, and wherein the transmitting step in the originating node includes the step of transmitting a confirmation containing the third sequence number, and wherein the transmitting step in the originating node further includes the step of transmitting a second batch of transactions comprising a transaction having a fourth sequence number immediately succeeding the third sequence number through a transaction having a fifth sequence number at least as large as the second sequence number, such that transactions from the transaction having the fourth sequence number through the transaction having the second sequence number are transmitted a second time.
12. The method of claim 7 wherein the transmitting step in the originating node includes the step of transmitting a first batch of transactions comprising a transaction having a first sequence number through a transaction having a second sequence number, and wherein the receiving step includes the step of receiving only a portion of the first batch of transactions not including the transaction having the first sequence, and wherein the ignoring step ignores all of the transactions received in the first batch, and wherein the transmitting step in the originating node further includes the step of transmitting a second batch of transactions comprising the transaction having the first sequence number through a transaction having a third sequence number at least as large as the second sequence number, such that transactions from the transaction having the first sequence number through the transaction having the second sequence number are transmitted a second time.
13. The method of claim 7 wherein the transmitting step in the originating node includes the step of transmitting a first batch of transactions comprising a transaction having a first sequence number through a transaction having a second sequence number, and wherein the receiving step includes the step of never receiving the first batch of transactions, and wherein the transmitting step in the originating node further includes the step of transmitting a second batch of transactions comprising the transaction having the first sequence number through a transaction having a third sequence number at least as large as the second sequence number, such that transactions from the transaction having the first sequence number through the transaction having the second sequence number are transmitted a second time.
14. The method of claim 7 wherein the transmitting step in the originating node includes the step of transmitting a first batch of transactions comprising a transaction having a first sequence number through a transaction having a second sequence number, and wherein the delivery of the first batch is delayed, and wherein the transmitting step in the originating node further includes the step of transmitting a second batch of transactions comprising the transaction having the first sequence number through a transaction having a third sequence number at least as large as the second sequence number, such that transactions from the transaction having the first sequence number through the transaction having the second sequence number are transmitted a second time, and wherein the receiving step includes the step of receiving the second batch of transactions before the first batch of transactions, and wherein the executing step includes the step of executing all of the transactions of the second batch of transactions, and wherein the transmitting step in the originating node for the second batch includes the step of transmitting a confirmation containing the third sequence number, and wherein the receiving step further includes the step of receiving the first batch of transactions after the second batch of transactions, and wherein the executing step includes the step of executing none of the transactions of the first batch of transactions.
15. The method of claim 7 wherein the transmitting step in the originating node includes the step of transmitting a first batch of transactions comprising a transaction having a first sequence number through a transaction having a second sequence number, and wherein the receiving step includes the step of receiving the first batch of transactions, and wherein the executing step includes the step of executing the received transactions of the first batch, and wherein the transmitting step in the originating node includes the step of transmitting a confirmation containing the second sequence number, and wherein the confirmation containing the second sequence number is never received in the originating node, and wherein the transmitting step in the originating node further includes the step of transmitting a second batch of transactions comprising the transaction having the first sequence number through a transaction having a third sequence number larger than the second sequence number, such that transactions from the transaction having the first sequence number through the transaction having the second sequence number are transmitted a second time, and wherein the executing step includes the step of executing the only the transactions of the second batch from a fourth sequence number immediatelysubsequent to the second sequence number to the third sequence number.
16. The method of claim 7 wherein the transmitting step in the originating node includes the step of transmitting a first batch of transactions comprising a transaction having a first sequence number through a transaction having a second sequence number, and wherein the receiving step includes the step of receiving the first batch of transactions, and wherein the executing step includes the step of executing the received transactions of the first batch, and wherein the transmitting step in the originating node includes the step of transmitting a confirmation containing the second sequence number, and wherein delivery of the confirmation containing the second sequence number is delayed, and wherein the transmitting step in the originating node further includes the step of transmitting a second batch of transactions comprising the transaction having the first sequence number through a transaction having a third sequence number larger than the second sequence number, such that transactions from the transaction having the first sequence number through the transaction having the second sequence number are transmitted a second time, and wherein the executing step includes the step of executing the only the transactions of the second batch from a fourth sequence number immediatelysubsequent to the second sequence number to the third sequence number, and wherein the transmitting step in the originating node further includes the step of transmitting a confirmation containing the third sequence number, and wherein the confirmation containing the third sequence number is received in the originating node before the confirmation containing the second sequence number, and wherein, in response to receiving the confirmation containing the third sequence number,the setting step in the originating node sets the last confirmed sequence number value to the third sequence number, and wherein the confirmation containing the second sequence number is received in the originating node after the confirmation containing the third sequence number, and wherein, in response to receiving the confirmation containing the third sequence number, the setting step in the originating node does not set the last confirmed sequence number value to the second sequence number.
17. A computer-readable medium whose contents cause nodes in a computer network to synchronize the remote execution of an ordered series of transactions by performing the steps of:
in an originating node:
assigning consecutive sequence numbers to the transactions in the ordered series;
at each of a plurality of transmission times:
identifying each transaction in the ordered series at the transmission time having a sequence number larger than a last confirmed sequence number value, and transmitting to the responding node a batch of a plurality of transactions including each identified transaction;
in the responding node, for each batch of transactions received from the originating node:
selecting each transaction included in the received batch that is consecu-tive to a last executed sequence number value;
executing the selected transactions of the batch;
ignoring the unselected transactions of the batch;
if any transactions are executed:
transmitting to the originating node a confirmation containing the highest sequence number of the executed transactions;
setting the last executed sequence number value to the highest sequence number of the executed transactions; and in the originating node:
for each confirmation received from the responding node, setting the last confirmed sequence number value to the sequence number in the confirmation, such that the originating code transmits to the responding node all transactions whose sequence number is larger than the last contained sequence number, irrespective of whether these transactions were previously transmitted, so that the responding node can receive all of these transactions in sequence number order even though some of these transactions may have been previously received in the responding node.
18. The computer-readable medium of claim 17 wherein the executing step includes a step of ignoring any transactions included in the batch whose sequence numbers are not consecutive to the last executed sequence number value.
19. The computer-readable medium of claim 17 wherein the transmitting step includes the step of re-transmitting transactions executed by the responding node but for which no confirmation has been received in the originating node.
20. A system for synchronizing the remote execution of an ordered series of transactions, comprising:
a responding node that executes transactions and transmits confirmations identifying executed transactions; and an originating node communicatively connected to the responding node from which transactions are transmitted to the responding node and to which confirmations are transmitted by the responding node, the originating node assigning consecutive sequence numbers to the transactions in the ordered series, the originating node further identifying each transaction in the ordered series having a sequence number larger than a last confirmed sequence number, the originating node further transmitting to the responding node, at each of a plurality of transmission times, a batch of a plurality of transactions including each identified transaction, the responding node, for each batch of transactions received from the originating node, selecting any transactions included in the batch that are consecutive to a last executed sequence number value, the responding node further executing any selected transactions, ignoring any unselected transactions, and, if any transactions are executed, transmitting to the originating node a confirmation containing the highest sequence number of the executed transactions and setting the last executed sequence number value to the highest sequence number of the executed transactions, the originating node further setting the last confirmed sequence number value to the sequence number in each received confirmation, such that the originating code transmits to the responding node all transactions whose sequence number is larger than the last contained sequence number, irrespective of whether these transactions were previously transmitted, so that the responding node can receive all of these transactions in sequence number order even though some of these transactions may have been previously received in the responding node.
21. The system of claim 20 wherein the responding node does not execute transactions included in each batch whose sequence numbers are not consecutive to the last executed sequence number value.
22. The system of claim 20 wherein the originating node retransmits transactions executed by the responding node for which no confirmation has been received in the originating node.
23. A method in a computer system for synchronizing the remote execution of an ordered series of transactions, the method comprising the steps of:
in an originating node:
at each of a plurality of transmission times, identifying and transmitting to a responding node a batch of a plurality of transactions including each transaction in the ordered series not yet identified in a confirmation received from the responding node;
in the responding node, for each batch of transactions received from the originating node:
selecting and executing only those transactions included in the batch that have not yet been executed in the responding node and that are consecu-tive to the transactions already executed in the responding node, ignoring any unselected transactions included in the batch; and if any transactions are executed, transmitting to the originating node a confirmation identifying the executed transactions, such that the originating node transmits to the responding node all transactions in the ordered series after the last transaction confirmed, irrespective of whether these transactions were previously transmitted, so that the responding node can receive all of these transactions in order even though some of these transactions may have been previously received in the responding node.
24. The method of claim 23 wherein the executing step includes a step of ignoring any transactions included in the batch that are not consecutive to the transactions already executed.
25. The method of claim 23 wherein the transmitting step includes the step of re-transmitting transactions executed by the responding node but for which no confirmation has been received in the originating node.
26. The method of claim 23, further including the step of adding transactions to the ordered series between a first and a second of the transmission times.
27. A computer-readable medium whose contents cause nodes in a computer network to synchronize the remote execution of an ordered series of transactions by performing the steps of:

in an originating node:
at each of a plurality of transmission times, identifying and transmitting to a responding node a batch of a plurality of transactions including each transaction in the ordered series at the transmission not yet identified in a confirmation received from the responding node;
in the responding node, for each batch of transactions received from the originating node:
selecting and executing only those transactions included in the batch that have not yet been executed in the responding note and that are consecutive to the transactions already executed in the responding node, ignoring only unselected transactions included in the batch; and if any transactions are executed, transmitting to the originating node a confirmation identifying the executed transactions, such that the originating node transmits to the responding node all transactions in the ordered series after the last transaction confirmed irrespective of whether these transactions were previously transmitted, so that the responding node can receive all of these transactions in order even though some of these transactions may have been previously received in the responding node.
28. The computer-readable medium of claim 27 wherein the executing step includes a step of ignoring any transactions included in the batch that are not consecutive to the transactions already executed.
29. The computer-readable medium of claim 27 wherein the transmitting step includes the step of re-transmitting transactions executed by the responding node but for which no confirmation has been received in the originating node.
30. A system for synchronizing the remote execution of an ordered series of transactions, the method, comprising:
a responding node that executes transactions and transmits confirmations identifying executed transactions; and an originating node communicatively connected to the responding node from which transactions are transmitted to the responding node, the originating node identifying and transmitting, at each of a plurality of transmission times, a batch of a plurality of transactions including each transaction in the ordered series at the transmission not yet identified in a confirmation received from the responding node, the responding node, for each batch of transactions received from the originating node:
selecting and executing only those transactions included in the batch that have not yet been executed in the originating node and that are consecutive to the transactions already executed in the responding node, ignoring any unselected transactions included in the batch; and if any transactions are executed, transmitting to the originating node a confirmation identifying the executed transactions, such that the originating node transmits to the responding node all transactions in the ordered series after the last transaction confirmed, irrespective of whether these transactions were previously transmitted, so that the responding node can receive all of these transactions in order even though some of these transactions may have been previously received in the responding node.
31. The system of claim 30 wherein the responding node ignores any transactions included in the batch that are not consecutive to the transactions already executed.
32. The system of claim 30 wherein the originating node retransmits transactions executed by the responding node for which no confirmation has been received in the originating node.
33. A method in a computer system for error-tolerant transmission of an ordered series of transactions from an originating node to a responding node, comprising the steps of:

assigning consecutive sequence numbers to the transactions in the ordered series;
at each of a plurality of transmission times:
identifying each transaction in the ordered series having a sequence number larger than a last confirmed sequence number value, and transmitting to the responding node a batch of a plurality of transactions including each identified transaction;
receiving confirmations from the responding node each specifying the sequence number of the last transaction processed in the responding node;
and for each confirmation received from the responding node, setting the last confirmed sequence number value to the sequence number specified by the confirmation, such that the originating code transmits to the respond-ing node all transactions whose sequence number is larger than the last contained sequence number, irrespective of whether these transactions were previously transmitted, so that the responding node can receive all of these transactions in sequence number order even though some of these transactions may have been previously received in the responding node.
34. A method in a computer system for error-tolerant receipt and execution of an ordered series of transactions sent from an originating node to a responding node, comprising the steps of:
receiving batches of transactions from the originating node, each transaction having a sequence number;
for each batch of transactions received:
selecting each transaction included in the received batch that is consecu-tive to a last executed sequence number value;
executing the selected transactions of the batch;
ignoring the unselected transactions of the batch; and if any transactions are executed:
transmitting to the originating node a confirmation containing the highest sequence number of the executed transactions, and setting the last executed sequence number value to the highest sequence number of the executed transactions, such that only received transactions that are consecutive to the last executed transaction are executed, and such that only executed transactions are confirmed so that any transac-tions subsequent to the last executed transactions are transmitted by the originatingnode in the next batch irrespective of whether such subsequent transactions have already been transmitted.
35. Acomputer-implementedmethod in an originatingnode for error-tolerant transmission of ordered transactions from the originating node to first and second responding nodes, the originating node maintaining a latest confirmed transaction for each of the first and second responding nodes, the method comprising:
(a) accumulating a first plurality of ordered transactions for transmission to the responding nodes, the first plurality comprising an initial transaction followed by a plurality of transactions ending with an intermediate transaction followed by a plurality of transactions ending with a last transaction;
(b) transmitting as a group the first plurality of ordered transactions to each of the responding nodes;
(c) receiving a single confirmation of processing the transactions in the transmitted group by the first responding node;
(d) in response to step (c), setting the first responding node latest confirmed transaction to the last transaction;
(e) receiving a single confirmation of processing all transactions from the initial transaction to the intermediate transaction by the second responding node;
(f) in response to step (e), setting the second responding node latest confirmed transaction to the intermediate transaction;
(g) accumulating a second plurality of ordered transactions;
(h) transmitting as a group to the first responding node all transactions that accumulated after the first responding node latest confirmed transaction, such that only the second plurality of ordered transactions are transmitted; and (i) transmitting as an ordered group to the second responding node all transactions that accumulated after the second responding node latest confirmed transaction, such that both the transactions in the first plurality following the intermediate transaction and the second plurality of transactions are transmitted.
36. The method of claim 35 wherein each responding node maintains a latest processed transaction such that any transactions received by a responding node that are not consecutive in order to the latest processed transaction for the responding node are not processed.
37. A computer memory containing a transaction processing status data structure usable by an originating node with a first plurality of ordered transactions to conduct error-tolerant transmission of transactions to first and second responding nodes, the first plurality comprising an initially accumulated transaction followed by a plurality of accumulated transactions ending with an intermediate transaction followed by a plurality of accumulated transactions ending with a last transaction, the data structure comprising:
a first responding node transaction value indicating a latest transaction whose processing by the first responding node has been confirmed, wherein, after the first plurality of ordered transactions is transmitted as a group to the first responding node and after a single confirmation is received from the first responding node of processing the transactions in the transmitted group, the first responding node transaction value indicates the last transaction; and a second responding node transaction value indicating a latest transaction whose processing by the second responding node has been confirmed, wherein, after the first plurality of ordered transactions is transmitted as a group to the second responding node and after a single confirmation is received from the second responding node of processing all transactions from the initial transaction to the intermediate transaction, the second responding node transaction value indicates the intermediate transaction, such that, after the originating node accumulates a second plurality of ordered transactions, the first responding node transaction value indicates that a group consisting only of the transactions in the second plurality of ordered transactions is to be transmitted to the first responding node and the second responding node transaction value indicates that an ordered group consisting of all transactions in the first plurality after the intermediate transaction and all transactions in the second plurality of transactions is to be transmitted to the second responding node.
38. The computer memory of claim 37 additionally containing a processed transaction status data structure comprising:
a second responding node processed transaction value indicating a latest transaction processed by the second responding node, wherein, after the second responding node processes all transactions in the first plurality of ordered transactions from the initial transaction to the intermediate transaction, the second responding node processed transaction value indicates the intermediate transaction, such that after the originating node transmits additional ordered transactions to the second responding node, the second responding node processed transaction value indicates that only additional transactions consecutive in order to the intermediate transaction are to be processed by the second responding node.
39. A computer-readable medium containing instructions that cause an originating node to perform error-tolerant transmission of ordered transactions from the originating node to first and second responding nodes, the originating node maintaining a latest confirmed transaction for each of the first and second responding nodes, by performing the steps of:
(a) accumulating a first plurality of ordered transactions for transmission to the responding nodes, the first plurality comprising an initial transaction followed by a plurality of transactions ending with an intermediate transaction followed by a plurality of transactions ending with a last transaction;
(b) transmitting as a group the first plurality of ordered transactions to each of the responding nodes;
(c) receiving a single confirmation of processing the transactions in the transmitted group by the first responding node;
(d) in response to step (c), setting the first responding node latest confirmed transaction to the last transaction;
(e) receiving a single confirmation of processing all transactions from the initial transaction to the intermediate transaction by the second responding node;
(f) in response to step (e), setting the second responding node latest confirmed transaction to the intermediate transaction;
(g) accumulating a second plurality of ordered transactions;
(h) transmitting as a group to the first responding node all transactions that accumulated after the first responding node latest confirmed transaction, such that only the second plurality of ordered transactions are transmitted; and (i) transmitting as an ordered group to the second responding node all transactions that accumulated after the second responding node latest confirmed transaction, such that both the transactions in the first plurality following the intermediate transaction and the second plurality of transactions are transmitted.
40. The computer-readable medium of claim 39 wherein each responding node maintains a latest processed transaction such that any transactions received by a responding node that are not consecutive in order to the latest processed transaction for the responding node are not processed.
CA002100533A 1993-06-22 1993-07-14 Method and system for synchronizing computer mail user directories Expired - Lifetime CA2100533C (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US8144493A 1993-06-22 1993-06-22
US08/081,444 1993-06-22

Publications (2)

Publication Number Publication Date
CA2100533A1 CA2100533A1 (en) 1994-12-23
CA2100533C true CA2100533C (en) 2004-05-25

Family

ID=22164204

Family Applications (1)

Application Number Title Priority Date Filing Date
CA002100533A Expired - Lifetime CA2100533C (en) 1993-06-22 1993-07-14 Method and system for synchronizing computer mail user directories

Country Status (2)

Country Link
US (1) US5838923A (en)
CA (1) CA2100533C (en)

Families Citing this family (47)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH09331352A (en) * 1996-06-12 1997-12-22 Matsushita Electric Ind Co Ltd Electronic mail system
US6212529B1 (en) * 1996-11-13 2001-04-03 Puma Technology, Inc. Synchronization of databases using filters
US5943676A (en) 1996-11-13 1999-08-24 Puma Technology, Inc. Synchronization of recurring records in incompatible databases
US6405218B1 (en) 1996-11-13 2002-06-11 Pumatech, Inc. Synchronizing databases
US6330568B1 (en) 1996-11-13 2001-12-11 Pumatech, Inc. Synchronization of databases
US6141664A (en) 1996-11-13 2000-10-31 Puma Technology, Inc. Synchronization of databases with date range
US6381633B2 (en) 1997-05-09 2002-04-30 Carmel Connection, Inc. System and method for managing multimedia messaging platforms
US7546346B2 (en) 1997-07-28 2009-06-09 Juniper Networks, Inc. Workflow systems and methods for project management and information management
US5978836A (en) 1997-07-28 1999-11-02 Solectron Corporation Workflow systems and methods
US6181694B1 (en) 1998-04-03 2001-01-30 Vertical Networks, Inc. Systems and methods for multiple mode voice and data communciations using intelligently bridged TDM and packet buses
CA2326894C (en) 1998-04-03 2010-07-13 Vertical Networks Inc. Voice and data apparatus comprising a selective tapping digital signal processing resource
US6498791B2 (en) 1998-04-03 2002-12-24 Vertical Networks, Inc. Systems and methods for multiple mode voice and data communications using intelligently bridged TDM and packet buses and methods for performing telephony and data functions using the same
US6389009B1 (en) 2000-12-28 2002-05-14 Vertical Networks, Inc. Systems and methods for multiple mode voice and data communications using intelligently bridged TDM and packet buses
US7072330B2 (en) * 1998-04-03 2006-07-04 Consolidated Ip Holdings, Inc. Systems for voice and data communications having TDM and packet buses and telephony station cards including voltage generators
US6266340B1 (en) 1998-04-03 2001-07-24 Vertical Networks, Inc. Systems and methods for multiple voice data communication which includes interface cards including configurable clocks that are dynamically coupled to a TDS bus
US6343074B1 (en) 1998-09-29 2002-01-29 Vertical Networks, Inc. Systems and methods for multiple mode voice and data communications using intelligenty bridged TDM and packet buses and methods for performing telephony and data functions using the same
US6154465A (en) 1998-10-06 2000-11-28 Vertical Networks, Inc. Systems and methods for multiple mode voice and data communications using intelligenty bridged TDM and packet buses and methods for performing telephony and data functions using the same
US6493007B1 (en) * 1998-07-15 2002-12-10 Stephen Y. Pang Method and device for removing junk e-mail messages
US7275082B2 (en) * 1998-07-15 2007-09-25 Pang Stephen Y F System for policing junk e-mail messages
US6167434A (en) * 1998-07-15 2000-12-26 Pang; Stephen Y. Computer code for removing junk e-mail messages
US6445682B1 (en) 1998-10-06 2002-09-03 Vertical Networks, Inc. Systems and methods for multiple mode voice and data communications using intelligently bridged TDM and packet buses and methods for performing telephony and data functions using the same
US6643705B1 (en) * 1999-03-29 2003-11-04 Microsoft Corporation Routing of electronic messages using a routing map and a stateful script engine
US6965918B1 (en) 1999-04-30 2005-11-15 International Business Machines Corporation System and method for integrated management of electronic messages
US6636897B1 (en) * 1999-09-28 2003-10-21 Microsoft Corporation Selective information subset synchronization based on single user action
US7369648B1 (en) 2000-07-06 2008-05-06 Purplecomm, Inc. Apparatus and method for PBX-integrated unified messaging services on a switched backbone
US6868070B1 (en) 2000-10-06 2005-03-15 Vertical Networks, Inc. Systems and methods for providing voice/data communication systems and voice/data communications
US7359920B1 (en) 2001-04-18 2008-04-15 Intellisync Corporation Communication protocol for synchronization of personal information management databases
US7962622B2 (en) * 2001-08-07 2011-06-14 Motorola Mobility, Inc. System and method for providing provisioning and upgrade services for a wireless device
US7243163B1 (en) * 2001-08-07 2007-07-10 Good Technology, Inc. System and method for full wireless synchronization of a data processing apparatus with a messaging system
US7107297B2 (en) * 2002-01-10 2006-09-12 International Business Machines Corporation System and method for metadirectory differential updates among constituent heterogeneous data sources
US6947942B1 (en) * 2002-05-30 2005-09-20 Taiwan Semiconductor Manufacturing Company, Ltd. Methods of managing user and computer objects in directory service
US7706359B2 (en) * 2002-07-01 2010-04-27 Converged Data Solutions, Inc. Systems and methods for voice and data communications including a network drop and insert interface for an external data routing resource
US7869424B2 (en) 2002-07-01 2011-01-11 Converged Data Solutions Inc. Systems and methods for voice and data communications including a scalable TDM switch/multiplexer
US7191192B2 (en) * 2002-09-30 2007-03-13 International Business Machines Corporation Metadirectory agents having extensible functions
US7117221B2 (en) * 2003-01-09 2006-10-03 International Business Machines Corporation Replication of changed information in a multi-master environment
US7257603B2 (en) * 2003-05-08 2007-08-14 Microsoft Corporation Preview mode
US7636720B2 (en) * 2003-05-08 2009-12-22 Microsoft Corporation Associating and using information in a metadirectory
US7634480B2 (en) * 2003-05-08 2009-12-15 Microsoft Corporation Declarative rules for metadirectory
US7516157B2 (en) 2003-05-08 2009-04-07 Microsoft Corporation Relational directory
US20040225632A1 (en) * 2003-05-08 2004-11-11 Microsoft Corporation Automated information management and related methods
US7620658B2 (en) * 2003-09-24 2009-11-17 Microsoft Corporation Configuration of a directory system
GB0414291D0 (en) * 2004-06-25 2004-07-28 Ibm Methods, apparatus and computer programs for data replication
US8134727B1 (en) 2006-11-27 2012-03-13 Ringcentral, Inc. Message preview control
US10346369B2 (en) * 2012-10-11 2019-07-09 Delphix Corp. Retrieving point-in-time copies of a source database for creating virtual databases
US8670529B1 (en) 2012-12-17 2014-03-11 Ringcentral, Inc. Context aware help system
US8831191B1 (en) 2013-06-28 2014-09-09 Ringcentral, Inc. Call preview system
US11120006B2 (en) * 2018-06-21 2021-09-14 Amazon Technologies, Inc. Ordering transaction requests in a distributed database according to an independently assigned sequence

Family Cites Families (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE3376590D1 (en) * 1982-04-28 1988-06-16 Int Computers Ltd Data processing system
US4653048A (en) * 1984-05-14 1987-03-24 American Telephone And Telegraph Company Method for interprocessor message accountability
US5335324A (en) * 1985-08-30 1994-08-02 Hitachi, Ltd. Distributed processing system and method for job execution using a plurality of processors and including identification of replicated data
JPS63138439A (en) * 1986-12-01 1988-06-10 Hitachi Ltd Processing system for access request to decentralized data base
US5036518A (en) * 1988-11-02 1991-07-30 Tseung Lawrence C N Guaranteed reliable broadcast network
GB8916489D0 (en) * 1989-07-19 1989-09-06 British Telecomm Data communication method and system
US5257369A (en) * 1990-10-22 1993-10-26 Skeen Marion D Apparatus and method for providing decoupling of data exchange details for providing high performance communication between software processes
US5262942A (en) * 1990-06-05 1993-11-16 Bankers Trust Company Financial transaction network
US5222061A (en) * 1991-10-31 1993-06-22 At&T Bell Laboratories Data services retransmission procedure
US5363090A (en) * 1992-07-23 1994-11-08 Motorola, Inc. Method and apparatus for combining submessages of a message to form the complete message
US5315635A (en) * 1992-09-30 1994-05-24 Motorola, Inc. Reliable message communication system
US5442637A (en) * 1992-10-15 1995-08-15 At&T Corp. Reducing the complexities of the transmission control protocol for a high-speed networking environment
US5392336A (en) * 1993-05-27 1995-02-21 At&T Corp. Data message storage and pick up service
US5444850A (en) * 1993-08-04 1995-08-22 Trend Micro Devices Incorporated Method and apparatus for controlling network and workstation access prior to workstation boot

Also Published As

Publication number Publication date
US5838923A (en) 1998-11-17
CA2100533A1 (en) 1994-12-23

Similar Documents

Publication Publication Date Title
CA2100533C (en) Method and system for synchronizing computer mail user directories
US5649195A (en) Systems and methods for synchronizing databases in a receive-only network
US6256634B1 (en) Method and system for purging tombstones for deleted data items in a replicated database
US5802062A (en) Preventing conflicts in distributed systems
US7149761B2 (en) System and method for managing the synchronization of replicated version-managed databases
US5832514A (en) System and method for discovery based data recovery in a store and forward replication process
JP3578385B2 (en) Computer and replica identity maintaining method
US6643669B1 (en) Method for optimization of synchronization between a client's database and a server database
EP1326184B1 (en) Conflict resolution for collaborative work system
US5970488A (en) Real-time distributed database system and method
US7836015B1 (en) Fast synchronization of computer databases using coverage status
EP0533407A2 (en) Heterogeneous transaction coordination
US7251670B1 (en) Methods and apparatus for replicating a catalog in a content distribution network
US20040153483A1 (en) Mail system synchronization
US7860827B1 (en) Data synchronization method for an application database available on multiple wirelessly connected platforms
US6339796B1 (en) System for logical connection resynchronization
US20020042910A1 (en) Method of detecting write conflicts in replicated databases without memory overhead
US7533132B2 (en) Parallel replication mechanism for state information produced by serialized processing
US6230283B1 (en) Logical connection resynchronization
KR920005878B1 (en) Local area system transport
EP1244015B1 (en) Parallel replication mechanism for state information produced by serialized processing
JPH07210436A (en) Distributed transaction processing system
Ramírez et al. Distributed control of updates in multiple copy databases: A time optimal algorithm
JP2005310008A (en) Device and method for synchronizing tree structure data
JP3470585B2 (en) Broadcast connection data distribution system and distribution server, and recording medium recording broadcast connection distribution program

Legal Events

Date Code Title Description
EEER Examination request