Efficient Any Source Overlay Multicast In CRT-Based P2P Networks - A Capacity-Constrained Approach

In this work, we have considered designing a highly efficient capacity-constrained overlay multicast protocol; it is designed specifically for an existing Chinese Remainder Theorem (CRT) - based structured P2P architecture [9]. Such an architecture has been the choice for its structural advantages over DHT-based architectures. It is worth mentioning its most important advantage from the viewpoint of speed of communication, that is its diameter, which is only 3 overlay hops. The protocol is not restricted to a single data source and it incorporates peer heterogeneity as well. We have also designed another any source capacity-constrained multicast protocol that incorporates the unique idea of transforming the multicast problem to a broadcast one [10]. We have compared analytically the performance of the two protocols; it has led to the observation that use of this unique idea [10] cannot take advantage of all structural advantages of a CRT-based system resulting in decrease in performance. However, the proposed multicast source discovery protocol has used this unique idea offering good performance.