Resilient data delivery in delay bounded overlay multicast

Overlay multicast has been proposed as an alternative scheme to provide one-to-many or many-to-many data delivery on Internet. However, since data delivery is entirely dependent on replications on each group member, if one member node fails, none of its children receives data. Furthermore, the higher the failed node´s level is, the more the dead nodes occur. In this paper, we give a detailed framework for resilience in overlay multicast. Unlike previous efforts in providing reliable data delivery, our scheme constructs reliable overlay data delivery tree (DDT) and adaptively reconstructs it based on the number of missed packets while guaranteeing end-to-end delay bound. Through practical simulation results, we analyzed packet delivery ratio, control overhead, end-to-end delay and number of replicated packets