Home > Research > Publications & Outputs > Impact of simple cheating in application-level ...

Research

Electronic data

Links

Text available via DOI:

View graph of relations

Impact of simple cheating in application-level multicast.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Published

Standard

Impact of simple cheating in application-level multicast. / Mathy, Laurent M. J.; Blundell, Nick; Roca, Vincent et al.
INFOCOM 2004. Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies. 2004. p. 1318- 1328.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Harvard

Mathy, LMJ, Blundell, N, Roca, V & El-Sayed, A 2004, Impact of simple cheating in application-level multicast. in INFOCOM 2004. Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies. pp. 1318- 1328, INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, 7/03/04. https://doi.org/10.1109/INFCOM.2004.1357017

APA

Mathy, L. M. J., Blundell, N., Roca, V., & El-Sayed, A. (2004). Impact of simple cheating in application-level multicast. In INFOCOM 2004. Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies (pp. 1318- 1328) https://doi.org/10.1109/INFCOM.2004.1357017

Vancouver

Mathy LMJ, Blundell N, Roca V, El-Sayed A. Impact of simple cheating in application-level multicast. In INFOCOM 2004. Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies. 2004. p. 1318- 1328 doi: 10.1109/INFCOM.2004.1357017

Author

Mathy, Laurent M. J. ; Blundell, Nick ; Roca, Vincent et al. / Impact of simple cheating in application-level multicast. INFOCOM 2004. Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies. 2004. pp. 1318- 1328

Bibtex

@inproceedings{652097fdf1334f758a1cb46756a38451,
title = "Impact of simple cheating in application-level multicast.",
abstract = "We study the impact of cheating nodes in application-level multicast overlay trees. We focus on selfish nodes acting independently, cheating about their distance measurements during the control phase building 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 protocol {"}families{"}: HBM (a protocol based on a centralized approach), TBCP (a distributed, tree first protocol), NICE (a distributed, tree first protocol based on clustering) and NARADA (a mesh first protocol). We evaluate the impact of cheats on the performance of the overlay trees as perceived by their nodes and the underlying network.",
author = "Mathy, {Laurent M. J.} and Nick Blundell and Vincent Roca and Ayman El-Sayed",
note = "This paper presents the first quantitative study of the impact of cheating on the structure of application-level multicast trees. Our research shows that in all cases, ALM protocols are very susceptible to structural attacks, with trees quickly exhibiting performance that is worse than if they had been randomly constructed. The evidence, as published work, is that this paper has triggered further research in the community, being the motivational basis of part of the work of Mike Afergan (PhD at MIT and Akamai CTO, USA), Dan Li (Tsinghua University, China) and Jiangchuan Liu (Simon Fraser University, Canada). Acceptance rate = 18%. RAE_import_type : Conference contribution RAE_uoa_type : Computer Science and Informatics; INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies ; Conference date: 07-03-2004 Through 11-03-2004",
year = "2004",
month = mar,
day = "7",
doi = "10.1109/INFCOM.2004.1357017",
language = "English",
pages = "1318-- 1328",
booktitle = "INFOCOM 2004. Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies",

}

RIS

TY - GEN

T1 - Impact of simple cheating in application-level multicast.

AU - Mathy, Laurent M. J.

AU - Blundell, Nick

AU - Roca, Vincent

AU - El-Sayed, Ayman

N1 - This paper presents the first quantitative study of the impact of cheating on the structure of application-level multicast trees. Our research shows that in all cases, ALM protocols are very susceptible to structural attacks, with trees quickly exhibiting performance that is worse than if they had been randomly constructed. The evidence, as published work, is that this paper has triggered further research in the community, being the motivational basis of part of the work of Mike Afergan (PhD at MIT and Akamai CTO, USA), Dan Li (Tsinghua University, China) and Jiangchuan Liu (Simon Fraser University, Canada). Acceptance rate = 18%. RAE_import_type : Conference contribution RAE_uoa_type : Computer Science and Informatics

PY - 2004/3/7

Y1 - 2004/3/7

N2 - We study the impact of cheating nodes in application-level multicast overlay trees. We focus on selfish nodes acting independently, cheating about their distance measurements during the control phase building 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 protocol "families": HBM (a protocol based on a centralized approach), TBCP (a distributed, tree first protocol), NICE (a distributed, tree first protocol based on clustering) and NARADA (a mesh first protocol). We evaluate the impact of cheats on the performance of the overlay trees as perceived by their nodes and the underlying network.

AB - We study the impact of cheating nodes in application-level multicast overlay trees. We focus on selfish nodes acting independently, cheating about their distance measurements during the control phase building 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 protocol "families": HBM (a protocol based on a centralized approach), TBCP (a distributed, tree first protocol), NICE (a distributed, tree first protocol based on clustering) and NARADA (a mesh first protocol). We evaluate the impact of cheats on the performance of the overlay trees as perceived by their nodes and the underlying network.

U2 - 10.1109/INFCOM.2004.1357017

DO - 10.1109/INFCOM.2004.1357017

M3 - Conference contribution/Paper

SP - 1318

EP - 1328

BT - INFOCOM 2004. Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies

T2 - INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies

Y2 - 7 March 2004 through 11 March 2004

ER -