Capacity-Aware Multicast Algorithms on Heterogeneous Overlay 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
Overlay routing under geographically correlated failures in distributed event-based systems
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems: Part II
Low delay multiflow block interleavers for real-time audio streaming
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
Fine-grain diagnosis of overlay performance anomalies using end-point network experiences
Proceedings of the 8th International Conference on Network and Service Management
Hi-index | 0.00 |
Overlay networks represent an emerging technology for rapid deployment of novel network services and applications. However, since public overlay networks are built out of loosely coupled end-hosts, individual nodes are less trustworthy than Internet routers in carrying out the data forwarding function. In this paper we describe a set of mechanisms designed to detect and repair errors in the data stream. Utilizing the highly redundant connectivity in overlay networks, our design splits each data stream to multiple sub-streams which are delivered over disjoint paths. Each sub-stream carries additional information that enables receivers to detect damaged or lost packets. Furthermore, each node can verify the validity of data by periodically exchanging Bloom filters, the digests of recently received packets, with other nodes in the overlay. We have evaluated our design through both simulations and experiments over a network testbed. The results show that most nodes can effectively detect corrupted data streams even in the presence of multiple tampering nodes.