Approaches for latency reduction in multicast overlay network
Yousef Alipour, Amir Massoud Bidgoli, Mohsen Moradi · 2010
Efforts to take service of multicast IP is very slow and is facing problems such as lack of address polling places, lack of reliable data transfer, crowd control, etc. To implement multi-broadcast in the network, new access router mechanisms are needed to send forward the data in addition to the existing methods of broadcast. In recent years, the overlay multicast has been put forward as a practical solution to resolve these problems. We present a systematic approach to reducing host multicast group. Latency reduction is achieved by adding links to an existing overlay network. To reduce latency in the overlay tree, adding some links to the tree is an effective method, but how a group decides to add the middle links to the overlay tree? It is an important question in this regard. For this purpose we try to find out a dependence on the characteristics of a considerable measurement site and a delay reduction calculations to any middle link between the pair nodes. A protocol based on these heuristics called Overlay Multicast Tree Protocol (OMTP) has been developed. The OMTP protocol can be used to make the overlay tree, and our tests show that the OMTP can reduce the latency between pair nodes with selected shortcuts by using the new useful function that makes use of the standard deviation.