Algorithms for faster overlay creation under high growth rate in query network based overlaid multicasting

Live Streaming Multicast Systems supporting applications like Live Lecture Delivery, face a problem called flash crowd. In this problem, a very large number of subscribers join the session in a very short duration. The result of flash crowd is that most of the subscribers do not get the desired feed in first attempt and thus waiting time increases excessively. We consider this problem in query network based overlaid multicasting [1] systems, where the information about available feeders is stored distributively using Distributed Hash Tables (DHTs). At normal growth rate, maintaining a list of only a few available feeders is sufficient; however, during flash crowd, a list of large number of feed forwarders needs to be maintained. Two different algorithms are proposed in this paper; one to alleviate the load of root nodes and the other to guarantee with high probability the provisioning of feed to any new arriving node even at very high growth rate. Simulation results verify the effectiveness of these algorithms in sustaining high growth rate in the network.