RaWMS -: random walk based lightweight membership service for wireless ad hoc network
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Evaluating unstructured peer-to-peer lookup overlays
Proceedings of the 2006 ACM symposium on Applied computing
EquiCast: scalable multicast with selfish users
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
SpiderCast: a scalable interest-aware overlay for topic-based pub/sub communication
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
OSDI '06 Proceedings of the 7th symposium on Operating systems design and implementation
Gossiping in distributed systems
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
A comparison of structured and unstructured P2P approaches to heterogeneous random peer selection
ATC'07 2007 USENIX Annual Technical Conference on Proceedings of the USENIX Annual Technical Conference
RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks
ACM Transactions on Computer Systems (TOCS)
Interest clustering techniques for efficient event routing in large-scale settings
Proceedings of the second international conference on Distributed event-based systems
Brahms: byzantine resilient random membership sampling
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Matrix Signatures: From MACs to Digital Signatures in Distributed Systems
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
A performance evaluation of scalable live video streaming with nano data centers
Computer Networks: The International Journal of Computer and Telecommunications Networking
Investigating the existence and the regularity of Logarithmic Harary Graphs
Theoretical Computer Science
Brahms: Byzantine resilient random membership sampling
Computer Networks: The International Journal of Computer and Telecommunications Networking
EquiCast: Scalable multicast with selfish users
Computer Networks: The International Journal of Computer and Telecommunications Networking
CLON: Overlay Networks and Gossip Protocols for Cloud Environments
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
FlightPath: obedience vs. choice in cooperative services
OSDI'08 Proceedings of the 8th USENIX conference on Operating systems design and implementation
Middleware mechanisms for dependable network services in a distributed processing system
MMACTEE'09 Proceedings of the 11th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering
Randomised broadcasting: memory vs. randomness
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Long range contacts in overlay networks
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
Tailoring consistency in group membership for mobile networks
Future Generation Computer Systems
Randomised broadcasting: Memory vs. randomness
Theoretical Computer Science
Hi-index | 0.00 |
We present Araneola, a scalable reliable application-level multicast system for highly dynamic wide-area environments. Araneola supports multi-point to multi-point reliable communication in a fully distributed manner while incurring constant load on each node.For a tunable parameter k 驴 3, Araneola constructs and dynamically maintains an overlay structure in which each node's degree is either k or k + 1, and roughly 90% of the nodes have degree k.Empirical evaluation shows that Araneola's overlay structure achieves three important mathematical properties of k-regular random graphs (i.e., random graphs in which each node has exactly k neighbors) with N nodes: (i) its diameter grows logarithmically with N; (ii) it is generally k-connected; and (iii) it remains highly connected following random removal of linear-size subsets of edges or nodes. The overlay is constructed at a very low cost: each join, leave, or failure is handled locally, and entails the sending of only about 3k messages in total. Given this overlay, Araneola disseminates multicast messages by gossiping over the overlay's links.We show that compared to a standard gossip-based multicast protocol, Araneola achieves substantial improvements in load, reliability, and latency.Finally, we present an extension to Araneola in which the basic overlay is enhanced with additional links chosen according to geographic proximity and available bandwidth.We show that this approach reduces the number of physical hops messages traverse without hurting the overlay's robustness.