Concurrent maintenance of rings

DOI10.1007/s00446-006-0008-7zbMath1266.68039OpenAlexW1971233424MaRDI QIDQ1954197

Jayadev Misra, Xiao-Zhou Li, C. Greg Plaxton

Publication date: 20 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-006-0008-7

zbMATH Keywords

correctnessconcurrencydistributed algorithmnetwork protocolsdistributed data structures

Mathematics Subject Classification ID

Data structures (68P05) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (3)

Tiara: a self-stabilizing deterministic skip list and skip graph ⋮ Maintaining the Ranch topology ⋮ Self-Stabilizing Prefix Tree Based Overlay Networks

Uses Software

• Chord
• Pastry
• UNITY

Cites Work

• Distributed object location in a dynamic network
• An assertional correctness proof of a distributed algorithm
• Proving assertions about parallel programs
• The theorem of E. Hopf under uniform magnetic fields
• Accessing nearby copies of replicated objects in a distributed environment
• Viceroy
• Analysis of the evolution of peer-to-peer systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Concurrent maintenance of rings