SpiderCast: a scalable interest-aware overlay for topic-based pub/sub communication
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
Decentralized detection of global threshold crossings using aggregation trees
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic Overlay Node Activation Algorithms for Large-Scale Service Deployments
DSOM '08 Proceedings of the 19th IFIP/IEEE international workshop on Distributed Systems: Operations and Management: Managing Large-Scale Service Deployment
IEEE/ACM Transactions on Networking (TON)
Decentralized real-time monitoring of network-wide aggregates
LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware
Gossiping for threshold detection
IM'09 Proceedings of the 11th IFIP/IEEE international conference on Symposium on Integrated Network Management
A latency-aware algorithm for dynamic service placement in large-scale overlays
IM'09 Proceedings of the 11th IFIP/IEEE international conference on Symposium on Integrated Network Management
Dynamic Transmission Scheduling for Streaming Applications via P2P Overlay
Journal of Signal Processing Systems
ACM SIGOPS Operating Systems Review
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
Hyphen: a hybrid protocol for generic overlay construction in P2P environments
Proceedings of the 28th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
We study dependable group communication for large-scale and delay-sensitive mission critical applications. The goal is to design a protocol that imposes low loads on bottleneck network links and provides both stable throughput and fast delivery of multicast messages even in the presence of frequent node and link failures. To this end, we propose our GoCast protocol. GoCast builds a resilient overlay network that is proximity aware and has balanced node degrees. Multicast messages propagate rapidly through an efficient tree embedded in the overlay. In the background, nodes exchange message summaries (gossips) with their overlay neighbors and pick up missing messages due to disruptions in the tree-based multicast. Our simulation based on real Internet data shows that, compared with a traditional gossip-based multicast protocol, GoCast can reduce the delivery delay of multicast messages by a factor of 8.9 when no node fails or a factor of 2.3 when 20% nodes fail.