A self-stabilizing algorithm for constructing spanning trees
Information Processing Letters
Time optimal self-stabilizing synchronization
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Information Processing Letters - Special issue in honor of Edsger W. Dijkstra
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
IEEE Transactions on Computers
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
State-optimal snap-stabilizing PIF in tree networks
ICDCS '99 Workshop on Self-stabilizing Systems
A Composite Stabilizing Data Structure
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
INS/Twine: A Scalable Peer-to-Peer Architecture for Intentional Resource Discovery
Pervasive '02 Proceedings of the First International Conference on Pervasive Computing
Scalable, Efficient Range Queries for Grid Information Services
P2P '02 Proceedings of the Second International Conference on Peer-to-Peer Computing
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
A Stabilizing Search Tree with Availability Properties
ISADS '01 Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems
Enabling Flexible Queries with Guarantees in P2P Systems
IEEE Internet Computing
Self-stabilization of dynamic systems assuming only read/write atomicity
Distributed Computing - Special issue: Self-stabilization
Range Queries in Trie-Structured Overlays
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Supporting Multi-Dimensional Range Queries in Peer-to-Peer Systems
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Dynamic Prefix Tree for Service Discovery within Large Scale Grids
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
A repair mechanism for fault-tolerance for tree-structured peer-to-peer systems
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
Snap-Stabilizing optimal binary search tree
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
Tiara: A Self-stabilizing Deterministic Skip List
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Snap-stabilizing linear message forwarding
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Future Generation Computer Systems
| Hi-index | 0.00 |
Resource Discovery is a crucial issue in the deployment of computational grids over large scale peer-to-peer platforms. Because they efficiently allow range queries, Tries (a.k.a., Prefix Trees) appear to be among promising ways in the design of distributed data structures indexing resources. Self-stabilization is an efficient approach in the design of reliable solutions for dynamic systems. A snap-stabilizing algorithm guarantees that it always behaves according to its specification. In other words, a snap-stabilizing algorithm is also a self-stabilizing algorithm which stabilizes in 0 steps. In this paper, we provide the first snap-stabilizing protocol for trie construction. We design particular tries called Proper Greatest Common Prefix (PGCP) Tree. The proposed algorithm arranges the n label values stored in the tree, in average, in O(h + h′) rounds, where h and h′ are the initial and final heights of the tree, respectively. In the worst case, the algorithm requires an O(n) extra space on each node, O(n) rounds and O(n2) actions. However, simulations show that, using relevant data sets, this worst case is far from being reached and confirm the average complexities, making this algorithm efficient in practice.