Handling failed transaction peers in a distributed hash table
US9141480B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Sep 24, 2013 |
| Grant date | Sep 22, 2015 |
| Priority date | — |
| Expiry date | Mar 9, 2034 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F11/1662
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Data storage systems and methods for storing data are described herein. The storage system includes at least two data storage nodes for storing portions of a distributed hash table and related data. After a first node attempts to complete a write request at a second node and is unable to complete the request, the first node ceases responses to interactions from other nodes. Once the first node's failure to respond has caused a sufficient number of nodes to cease responding, the nodes enter a service mode to resolve the live lock. While in live lock, the nodes determine the oldest, unfulfilled request using a system-wide logical timestamp associated with write requests. Once the oldest request is determined, a removal vote to remove the non-responsive node from the group is initiated and, if other nodes agree, the non-responsive node is removed from the group of nodes.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.