Abstract-We study the inipaet of cheating nodes in application-level niulticast overlay trees. We focus on selfish nodes acting independently. cheating ahout their distance measurements during the control phase huilding or maintaining the tree. More precisely, we study, through simulations, the impact of simple cheating strategies in four protocols. representatives of different application-level multicast protoml "faniilies": HBM (a protoeol hased on a centralized approach), TBCP (a distributed, tree fin1 protncnl), NICE (a distrihuted. tree first protocol hased on clustering) and NARADA (a mesh first protocol). We evaluate the impact of cheats on the performance of the overlay trees as perceived hy their nodes and the underlying network.
Authors in REF discussed the impacts of cheating nodes in four representative tree-based ALM protocols and mainly focused on selfish nodes acting independently, cheating about their distance vectors when constructing the tree.
Impact of simple cheating in application-level multicast
IEEE INFOCOM 2004
IEEE INFOCOM 2004
Computer Science