Explains a novel distributed algorithm for constructing distributed doubly linked lists (or bidir...
Explains a novel distributed algorithm for constructing distributed doubly linked lists (or bidirectional ring), which are common in structured P2P networks.
This presentation is used at the 2015 IEEE International Conference on Peer-to-Peer Computing (P2P2015).
The paper is available at
Author: Kota Abe (Osaka City University/NICT), Mikio Yoshida (BBR Inc.)
A distributed doubly linked list (or bidirectional ring) is a fundamental distributed data structure commonly used in structured peer-to-peer networks. This paper presents DDLL, a novel decentralized algorithm for constructing distributed doubly linked lists. In the absence of failure, DDLL maintains consistency with regard to lookups of nodes, even while multiple nodes are simultaneously being inserted or deleted. Unlike existing algorithms, DDLL adopts a novel strategy based on conflict detection and sequence numbers. A formal description and correctness proofs are given. Simulation results show that DDLL outperforms conventional algorithms in terms of both time and number of messages.