Maintaining the Ranch topology

DOI10.1016/J.JPDC.2010.06.004zbMath1233.68070OpenAlexW2077534043MaRDI QIDQ666250

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

Publication date: 7 March 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2010.06.004

zbMATH Keywords

correctnessconcurrencymaintenance protocolsstructured peer-to-peer networks

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Distributed systems (68M14)

Uses Software

• Chord
• Pastry
• UNITY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Concurrent maintenance of rings
• HyperTree for self-stabilizing peer-to-peer systems
• Failure recovery for structured p2p networks: protocol design and performance under churn
• Correctness of gossip-based membership under message loss
• Viceroy
• Analysis of the evolution of peer-to-peer systems
• Active and Concurrent Topology Maintenance
• Global Computing
• Choosing a random peer

This page was built for publication: Maintaining the Ranch topology