Performance, Computing, and Communications Conference, 2002. 21st IEEE International (2006)
Phoenix, AZ, USA
Apr. 10, 2006 to Apr. 12, 2006
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/.2006.1629387
M. Baysan , Dept. of Comput. Sci., Texas Univ., Dallas, TX, USA
K. Sarac , Dept. of Comput. Sci., Texas Univ., Dallas, TX, USA
In this paper we study the end-to-end complete feedback collection (ECFC) problem in large scale multi-cast applications. We consider the case where each receiver is expected to send feedback in a timely manner without causing implosion at the source site. To address the scalability problem and improve timely feedback collection, we introduce the use of clustering algorithms for feedback collection. Our simulation based comparisons show that the clustering based approaches outperform the existing pure (without clustering) multi-round probabilistic and pure (without clustering) delayed feedback collection approaches both in terms of collection delay and message overhead.
clustering algorithm, end-to-end complete feedback collection problem, ECFC, large scale multicast application, receiver, scalability
K. Sarac and M. Baysan, "Cluster based approaches for end-to-end complete feedback collection in multicast," Performance, Computing, and Communications Conference, 2002. 21st IEEE International(PCC), Phoenix, AZ, USA, 2006, pp. 9.