Araneola: a scalable reliable multicast system for dynamic environments

DOI10.1016/j.jpdc.2008.07.011zbMath1243.68067MaRDI QIDQ436913

Roie Melamed, Idit Keidar

Publication date: 26 July 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.2008.07.011

zbMATH Keywords

reliability; scalability; fault-tolerance; load balancing; peer-to-peer; gossip; \(k\)-regular random graphs; application-level multicast; dynamic wide-area environments; network proximity; unstructured overlay networks

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

68R10: Graph theory (including graph drawing) in computer science

68M14: Distributed systems

68M15: Reliability, testing and fault tolerance of networks and computer systems

Related Items

Investigating the existence and the regularity of logarithmic Harary graphs, DEX: self-healing expanders

Uses Software

• SCRIBE
• Chord
• Pastry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• On the second eigenvalue and random walks in random \(d\)-regular graphs
• The asymptotic number of labeled graphs with given degree sequences
• The small-world phenomenon
• Uniform generation of random regular graphs of moderate degree
• Generating Random Regular Graphs Quickly
• Viceroy
• Spatial gossip and resource location protocols
• THE MAXIMUM CONNECTIVITY OF A GRAPH
• Generating random regular graphs
• The giant component threshold for random regular graphs with edge faults H. Prodinger