How Bad Are Overlay Networks
Stephen Cogdon, Ian Wakeman · 2002
This paper assesses the incorporating of candidate nodes into overlay multicast trees. Overlay networks attempt to compensate for the awkwardness and inefficiencies that can exist across the Internet for group communication. This work uses a network simulation application to assess the feasibility of overlay networks and presents the results found. Results show that there are persistent improvements using the metric of cost between the optimal KMB tree and the minimum path spanning tree and that there are significant improvements, again using the metric of cost, between n-way distribution without a centroid node and nway distribution with a centroid node of approximately twenty per cent in each instance. This is to provide an application layer active networking infrastructure for distributed virtual reality.