Clique: A Transparent, Peer-to-Peer Replicated File System
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Transience of peers & streaming media
ACM SIGCOMM Computer Communication Review
Robust distributed estimation in sensor networks using the embedded polygons algorithm
Proceedings of the 3rd international symposium on Information processing in sensor networks
A Placement Scheme for Peer-to-Peer Networks Based on Principles from Geometry
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
End-host controlled multicast routing
Computer Networks: The International Journal of Computer and Telecommunications Networking - Overlay distribution structures and their applications
Appcast: a low stress and high stretch overlay protocol
International Journal of Grid and Utility Computing
Single-step creation of localized Delaunay triangulations
Wireless Networks
Long range contacts in overlay networks
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Fast localized delaunay triangulation
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
| Hi-index | 0.00 |
Application-layer multicast supports group applications without the need for a network-layer multicast protocol. Here, applications arrange themselves in a logical overlay network and transfer data within the overlay. In this paper, we present an application-layer multicast solutionthat uses a Delaunay triangulation as an overlay network topology. An advantage of using a Delaunay triangulation is that it allows each application to locally derive next-hop routing information without requiring a routing protocol in the overlay. A disadvantage of using a Delaunay triangulation is that the mapping of the overlay to the network topology at the network and data link layer may be suboptimal. We present a protocol, called "Delaunay Triangulation (DT)" protocol, which constructs Delaunay triangulation overlay networks. We present measurement experiments of the DT protocol for overlay networks with up to 10,000 members, that are running on a local PC cluster with 100 Linux PCs. The results show that the protocol stabilizes quickly, e.g., an overlay network with 10,000 nodes can be built in just over 30 seconds. The traffic measurements indicate that the average overhead of a node is only a few kilobits per second if the overlay network is in a steady state. Results of throughput experiments of multicast transmissions (using TCP unicast connections between neighbors in the overlay network) show an achievable throughput of approximately 15 Mbps in an overlay with 100 nodes and 2 Mbps in an overlay with 1,000 nodes.