Patent DE2215768A1 successfully refreshed from Google Patents.
Patent US6338092B1 successfully refreshed from Google Patents.
US6338092B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method, system and computer program for replicating data in a distributed computed environment
Assignee: International Business Machines Corp
•
Filing: 1998-09-24
•
Granted: 2002-01-08
•
Expires: 2018-09-24
Abstract
Abstract A method for replicating data in a distributed computer environment wherein a plurality of servers are configured about one or more central hubs in a hub and spoke arrangement. In each of a plurality of originating nodes, updates and associated origination sequence numbers are sent to the central hub. The hub sends updates and associated distribution sequence numbers to the plurality of originating nodes. The hub tracks acknowledgments sent by nodes for a destination sequence number acknowledged by all nodes. Thereafter, a highest origination sequence number is sent from the central hub back to each originating node.
Inventors
- 👤 Ching-Yun Chao
- 👤 Roger Eldred Hough
- 👤 Amal Ahmed Shaheen
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 23:10
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/12; H04L1/16; H04L1/18; H04L1/1809; H04L1/1867; H04L1/187; H04L1/1887; H04L67/00; H04L67/01; H04L67/10; H04L67/1001; H04L2001/0092; H04L2001/0093; Y; Y10; Y10S; Y10S707/00; Y10S707/99951; Y10S707/99952; Y10S707/99953; Y10S707/99954
Claims Analysis
Total Claims: 25
Claim 1
Independent Claim
123 words
A method for replicating data in a distributed system, comprising the steps of: from each of a plurality of originating nodes, sending updates and associated origination sequence numbers to a central hub, wherein a given update is directed to a distribution group comprising a set of the originating nodes; from the central hub, sending updates and associated distribution sequence numbers to the plurality of originating nodes; in the central hub, tracking acknowledgments sent by originating nodes, each acknowledgment identifying a last in-sequence distribution sequence number processed by a respective originating node; and in the central hub, periodically sending a message to each originating node, the message including information identifying a highest origination sequence number acknowledged by originating nodes comprising the given distribution group.
Claim 2
Independent Claim
123 words
A method for replicating data in a distributed system, comprising the steps of: from each of a plurality of originating nodes, sending updates and associated origination sequence numbers to a central hub, wherein a given update is directed to a distribution group comprising a set of the originating nodes; from the central hub, sending updates and associated distribution sequence numbers to the plurality of originating nodes; in the central hub, tracking acknowledgments sent by originating nodes, each acknowledgment identifying a last in-sequence distribution sequence number processed by a respective originating node; and in the central hub, periodically sending a message to each originating node, the message including information identifying a highest origination sequence number acknowledged by originating nodes comprising the given distribution group.
Claim 3
Dependent Claim
30 words
The method as described in claim 1 wherein the message further includes the highest origination sequence number associated with an update received at the central hub from the originating node.
Claim 4
Dependent Claim
35 words
The method as described in claim 1 wherein an update remains queued at its originating node at least until the message from the central hub indicates the update has been received by the distribution group.
Claim 5
Dependent Claim
29 words
The method as described in claim 1 wherein updates and associated distribution sequence numbers are sent to originating nodes with no more than a permitted quantity of unacknowledged updates.
Claim 6
Dependent Claim
38 words
The method as described in claim 1 further including the step of: from the central hub, rebroadcasting updates and associated distribution sequence numbers to originating nodes whose acknowledgments indicate lack of receipt of updates from the central hub.
Claim 7
Dependent Claim
23 words
The method as described in claim 5 wherein the rebroadcasting step begins with an update associated with a lowest unacknowledged distribution sequence number.
Claim 8
Dependent Claim
32 words
The method as described in claim 1 further including the step of: upon failure of a given originating node, isolating the given originating node from other nodes in the given distribution group.
Claim 9
Dependent Claim
38 words
The method as described in claim 1 further including the steps of: subsequently associating the given originating node with another originating node of the given distribution group; and readmitting the given originating node to the given distributing group.
Claim 10
Dependent Claim
42 words
The method as described in claim 1 further including the step of: upon failure of the central hub, having a given set of the originating nodes confer to designate a substitute central hub; and transferring hub responsibilities to the substitute central hub.
Claim 11
Dependent Claim
49 words
The method as described in claim 9 further including the step of having each originating node retransmit to the substitute central hub each update for which the central hub, upon failure of the central hub, had not indicated successful receipt by every node of the plurality of originating nodes.
Claim 12
Dependent Claim
24 words
The method as described in claim 1 wherein a given originating node sends a plurality of updates to the central hub in a package.
Claim 13
Dependent Claim
24 words
The method as described in claim 11 wherein the central hub sends a plurality of updates to a given originating node in a package.
Claim 14
Dependent Claim
141 words
A computer program product in a computer-readable medium for replicating data in a distributed system comprising a plurality of originating nodes associated with a central hub, wherein origination nodes send updates and associated origination sequence numbers to the central hub, comprising: wherein a given update is directed to a distribution group comprising a set of the originating nodes, means operative in the central hub for sending updates and associated distribution sequence numbers to the plurality of originating nodes; means operative in the central hub for tracking acknowledgments sent by originating nodes, each acknowledgment identifying a last in-sequence distribution sequence number processed by a respective originating node; and means operative in the central hub for periodically sending a message to each originating node, the message including information identifying a highest origination sequence number acknowledged by originating nodes comprising the given distribution group.
Claim 15
Dependent Claim
141 words
A computer program product in a computer-readable medium for replicating data in a distributed system comprising a plurality of originating nodes associated with a central hub, wherein origination nodes send updates and associated origination sequence numbers to the central hub, comprising: wherein a given update is directed to a distribution group comprising a set of the originating nodes, means operative in the central hub for sending updates and associated distribution sequence numbers to the plurality of originating nodes; means operative in the central hub for tracking acknowledgments sent by originating nodes, each acknowledgment identifying a last in-sequence distribution sequence number processed by a respective originating node; and means operative in the central hub for periodically sending a message to each originating node, the message including information identifying a highest origination sequence number acknowledged by originating nodes comprising the given distribution group.
Claim 16
Dependent Claim
28 words
The computer program product as described in claim 13 wherein the message further includes the highest origination sequence number received at the central hub from the originating node.
Claim 17
Dependent Claim
41 words
The computer program product as described in claim 13 further including means operative in the central hub for rebroadcasting updates and associated distribution sequence numbers to originating nodes whose acknowledgments indicate lack of receipt of updates during a given time period.
Claim 18
Dependent Claim
28 words
The computer program product as described in claim 13 further including means operative in the central hub for isolating a given originating node from a given distribution group.
Claim 19
Dependent Claim
21 words
The computer program product as described in claim 13 further including means for packaging a plurality of updates in a batch.
Claim 20
Independent Claim
97 words
An apparatus for replicating data in a distributed data processing system, the apparatus comprising: receiving means for receiving updates and associated origination sequence numbers from a plurality of originating nodes; first sending means for sending updates and associated disribution sequence numbers to the plurality of originating nodes; tracking means for tracking acknowledgments sent by originating nodes, each acknowledgment identifying a last in-sequence distribution sequence number processed by a respective originating node; and second sending means for periodically sending a message to originating nodes, the message comprising information identifying a highest origination sequence number acknowledged by originating nodes.
Claim 21
Independent Claim
97 words
An apparatus for replicating data in a distributed data processing system, the apparatus comprising: receiving means for receiving updates and associated origination sequence numbers from a plurality of originating nodes; first sending means for sending updates and associated disribution sequence numbers to the plurality of originating nodes; tracking means for tracking acknowledgments sent by originating nodes, each acknowledgment identifying a last in-sequence distribution sequence number processed by a respective originating node; and second sending means for periodically sending a message to originating nodes, the message comprising information identifying a highest origination sequence number acknowledged by originating nodes.
Claim 22
Dependent Claim
22 words
The apparatus as described in claim 18 wherein the message further comprises the highest origination sequence number received from the originating node.
Claim 23
Dependent Claim
34 words
The apparatus as described in claim 18 further comprising: means for rebroadcasting updates and associated distribution sequence numbers to originating nodes whose acknowledgments indicate lack of receipt of updates during a given time period.
Claim 24
Dependent Claim
21 words
The apparatus as described in claim 18 for comprising: means for isolating a given originating node from a given distribution group.
Claim 25
Dependent Claim
19 words
The apparatus as described in claim 18 further comprising: means for packaging a plurality of updates in a batch.
References Cited (Backward Citations)
US5261094A
Cited
US5689706A
Cited
US5625818A
Cited
US5745753A
Cited
US5649195A
Cited
US5713017A
Cited
US5721735A
Cited
US5765171A
Cited
US6021443A
Cited
US5812773A
Cited
US5878434A
Cited
US5872777A
Cited
US6118765A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2005-01-07 | 2005-07-09 | 2006-01-08 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2009-01-07 | 2009-07-09 | 2010-01-08 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2013-01-07 | 2013-07-09 | 2014-01-08 | $7700.00 | Window Closed / Lapsed |