Study Of Application-Layer Multicast Protocol Based On K-Ary Tree

The internet has become an important method for the exchange of information nowadays. With the improvement of network computing ability and the rapid development of communication technologies, new applications are emerged which need support for more networking capabilities, such as multimedia conference, distance education, internet broadcasting, data replication, network broadcast, online games, and so on. The emergence of those application means to the increase in demand for groups communication mode. Application layer multicast techniques is proposed to adapt to those new practical applications, which can inherit multicast transmission characteristics, such as saving bandwidth, transmission speed, be able to reduce the dependence on underlying network upgrading. The application layer multicast can achieve large-scale multicast communication.Firstly, streaming media, as the main application of application layer multicast, requests that the information of the receiver arrive within a certain extent delay. While the key to assure the lower delay of media streaming is to build an algorithm of minimum delay application layer multicast. Secondly, the similarity of a certain scope network and the allocation of node degree balance are considered, the degree of nodes should be constrained, and the complexity of heterogeneous network is simplified. A single source of the spanning tree multicast model and the application layer multicast protocol based on k-ary tree is put forward which consider the two factors above, the algorithm is based on the delay and degree constraint.