Path Shortening Schema for Minimum Delay Spanning Tree on Overlay Multicast

Overlay networks are expected to play a significant role in interactive group applications in the Internet. In these applications, since the applications require broadcast communication, application layer multicast under the overlay networks involving all active participants is a reasonable solution. Therefore, considering that the applications are generally delay sensitive, minimizing delay on an overlay multicast tree becomes important issue. In this paper, we propose a novel schema that allows us to minimize delay in overlay multicast tree. Our schema consist two-phase procedure: join procedure and refinement procedure. The join procedure performs which node on multicast tree to select and to connect it when a new node joins multicast tree. The refinement procedure corrects imbalance of multicast tree, and restructures it