Space-filling curves and their use in the design of geometric data structures
Theoretical Computer Science - Special issue: Latin American theoretical informatics
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Scalable application layer multicast
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Application-Level Multicast Using Content-Addressable Networks
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
Probabilistic Reliable Dissemination in Large-Scale Systems
IEEE Transactions on Parallel and Distributed Systems
Building Topology-Aware Overlays Using Global Soft-State
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
The impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
SplitStream: high-bandwidth multicast in cooperative environments
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
An analysis of live streaming workloads on the internet
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Capacity-Aware Multicast Algorithms on Heterogeneous Overlay Networks
IEEE Transactions on Parallel and Distributed Systems
Locality-Aware and Churn-Resilient Load-Balancing Algorithms in Structured Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
ACOM: Any-source Capacity-constrained Overlay Multicast in Non-DHT P2P Networks
IEEE Transactions on Parallel and Distributed Systems
Chunkyspread: Heterogeneous Unstructured Tree-Based Peer-to-Peer Multicast
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Efficient and Scalable Consistency Maintenance for Heterogeneous Peer-to-Peer Systems
IEEE Transactions on Parallel and Distributed Systems
Efficient multi-source data dissemination in peer-to-peer networks
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Hash-based proximity clustering for load balancing in heterogeneous DHT networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Chainsaw: eliminating trees from overlay multicast
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Hybrid overlay structure based on random walks
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
A case for end system multicast
IEEE Journal on Selected Areas in Communications
An overlay multicast protocol for live streaming and delay-guaranteed interactive media
Journal of Network and Computer Applications
| Hi-index | 0.24 |
Overlay multicast has been considered as one of the most important developments for the next generation Internet infrastructure. In this paper, we consider overlay multicast in the scenarios where any participant node is a potential data source. Existing multicast algorithms for single-source always require a long time to deliver messages or have high maintenance overhead when multiple data sources are allowed. There are other algorithms that are designed for multi-source scenarios. But they consume too much network resources and have a long convergence time because of proximity ignorance. To address the issues, we present FPCast, which leverages node heterogeneity and proximity information at the same time. Physically close nodes are grouped into clusters and each cluster selects a powerful, stable node as its rendezvous point. The rendezvous nodes form a DHT-based structure. Data messages are replicated and forwarded along implicit, source specific, and heterogeneity-aware multicast trees. We further reduce the delivery delay by introducing probabilistic forwarding scheme. We show the average delivery path length converges to O(logn) automatically (n is the number of nodes in the overlay). The simulation results demonstrate the superiority of our algorithm in terms of message delivery time and network resource consumption, in comparison with the previous randomized algorithms. The algorithm is also resilient to node failures.