Application-layer multicast with Delaunay triangulations
نویسندگان
چکیده
Recently, application-layer multicast has emerged as an attempt to support group applications without the need for a network-layer multicast protocol, such as IP multicast. In application-layer multicast, applications arrange themselves as a logical overlay network and transfer data within the overlay network. In this paper, Delaunay triangulations are investigated as an overlay network topology for application-layer multicast. An advantage of Delaunay triangulations is that each application can locally derive next-hop routing information without the need for a routing protocol in the overlay. A disadvantage of a Delaunay triangulation as an overlay topology is that the mapping of the overlay to the network-layer infrastructure may be suboptimal. It is shown that this disadvantage can be partially addressed with a hierarchical organization of Delaunay triangulations. Using network topology generators, the Delaunay triangulation is compared to other proposed overlay topologies for application-layer multicast.
منابع مشابه
Application-layer multicasting with Delaunay triangulation overlays
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 solution that uses a Delaunay triangulation as an overlay network topology. An advantage of using a Delaunay triangulation...
متن کاملThe Stability of Delaunay Triangulations
We introduce a parametrized notion of genericity for Delaunay triangulations which, in particular, implies that the Delaunay simplices of δ-generic point sets are thick. Equipped with this notion, we study the stability of Delaunay triangulations under perturbations of the metric and of the vertex positions. We quantify the magnitude of the perturbations under which the Delaunay triangulation r...
متن کاملTowards a Definition of Higher Order Constrained Delaunay Triangulations
When a triangulation of a set of points and edges is required, the constrained Delaunay triangulation is often the preferred choice because of its well-shaped triangles. However, in applications like terrain modeling, it is sometimes necessary to have flexibility to optimize some other aspect of the triangulation, while still having nicely-shaped triangles and including a set of constraints. Hi...
متن کاملTriangulations for Rubber-sheeting
This paper focuses on the application of triangulation and rubber-sheeting techniques to the problem of merging two digitized map files. The Census Bureau is currently developing a map merging procedure called conflation. Reproducibility, quality control, and a desire for mathematical consistency in conflation lead to a need for well-defined procedures. The Delaunay triangulation is well-define...
متن کاملA Variational Principle for Weighted Delaunay Triangulations and Hyperideal Polyhedra
We use a variational principle to prove an existence and uniqueness theorem for planar weighted Delaunay triangulations (with non-intersecting site-circles) with prescribed combinatorial type and circle intersection angles. Such weighted Delaunay triangulations may be interpreted as images of hyperbolic polyhedra with one vertex on and the remaining vertices beyond the infinite boundary of hype...
متن کامل