Processing Time Analysis of Loss-Collected Retransmission over Hierarchical Reliable Multicast Networks

Tree based multicast protocols often use hierarchical loss recovery where some special routers called proxy are assigned for retransmission handling. This leads to traffic redundancy and latency. The existing approaches of loss collected retransmission based on X-OR selective principle, which minimizes the number of packets to be retransmitted. However, the receivers send NACKs to the source expecting the retransmission from the source. This overwhelms the source affecting the throughput and processing time. In this paper we analyze the processing time of sender in loss collected retransmission by placing proxies at the intermediate router. The simulation results reveal that our framework minimizes the processing time of sender than simple loss collected retransmission model.