Abstract
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.
Original language | English (US) |
---|---|
Pages | 670-679 |
Number of pages | 10 |
DOIs | |
State | Published - 2004 |
Externally published | Yes |
Event | Proceedings - 24th International Conference on Distributed Computing Systems - Hachioji, Tokyo, Japan Duration: Mar 24 2004 → Mar 26 2004 |
Other
Other | Proceedings - 24th International Conference on Distributed Computing Systems |
---|---|
Country/Territory | Japan |
City | Hachioji, Tokyo |
Period | 3/24/04 → 3/26/04 |
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Networks and Communications