Home > Research > Publications & Outputs > Scalable adaptive hierarchical clustering
View graph of relations

Scalable adaptive hierarchical clustering

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published

Standard

Scalable adaptive hierarchical clustering. / Mathy, Laurent; Canonico, Roberto; Simpson, Steven et al.
NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications . ed. / Enrico Gregori; Marco Conti; Guy Omidyar; Moshe Zukerman; Andrew T. Campbell. IEEE, 2002. p. 1172-1177 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2345).

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Harvard

Mathy, L, Canonico, R, Simpson, S & Hutchison, D 2002, Scalable adaptive hierarchical clustering. in E Gregori, M Conti, G Omidyar, M Zukerman & AT Campbell (eds), NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications . Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2345, IEEE, pp. 1172-1177, 2nd International IFIP-TC6 Networking Conference, NETWORKING 2002, Pisa, Italy, 19/05/02. <https://link.springer.com/chapter/10.1007/3-540-47906-6_103>

APA

Mathy, L., Canonico, R., Simpson, S., & Hutchison, D. (2002). Scalable adaptive hierarchical clustering. In E. Gregori, M. Conti, G. Omidyar, M. Zukerman, & A. T. Campbell (Eds.), NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications (pp. 1172-1177). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2345). IEEE. https://link.springer.com/chapter/10.1007/3-540-47906-6_103

Vancouver

Mathy L, Canonico R, Simpson S, Hutchison D. Scalable adaptive hierarchical clustering. In Gregori E, Conti M, Omidyar G, Zukerman M, Campbell AT, editors, NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications . IEEE. 2002. p. 1172-1177. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

Author

Mathy, Laurent ; Canonico, Roberto ; Simpson, Steven et al. / Scalable adaptive hierarchical clustering. NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications . editor / Enrico Gregori ; Marco Conti ; Guy Omidyar ; Moshe Zukerman ; Andrew T. Campbell. IEEE, 2002. pp. 1172-1177 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

Bibtex

@inproceedings{0736d11912ab4df887ff05442c770e86,
title = "Scalable adaptive hierarchical clustering",
abstract = "We propose a new application-level clustering algorithm capable of building an overlay spanning tree among participants of large multicast sessions, without any specific help from the networkrouters. This algorithm is based on a unique definition of zones around nodes and an innovative adaptive cluster size distribution. The proposed method finds application in many context where large-scale overlay trees can be usefull: application-level multicasting, peer-to-peer networks and content distribution networks (among other things).",
author = "Laurent Mathy and Roberto Canonico and Steven Simpson and David Hutchison",
year = "2002",
month = jan,
day = "1",
language = "English",
isbn = "3540437096",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "IEEE",
pages = "1172--1177",
editor = "Enrico Gregori and Marco Conti and Guy Omidyar and Moshe Zukerman and Campbell, {Andrew T.}",
booktitle = "NETWORKING 2002",
note = "2nd International IFIP-TC6 Networking Conference, NETWORKING 2002 ; Conference date: 19-05-2002 Through 24-05-2002",

}

RIS

TY - GEN

T1 - Scalable adaptive hierarchical clustering

AU - Mathy, Laurent

AU - Canonico, Roberto

AU - Simpson, Steven

AU - Hutchison, David

PY - 2002/1/1

Y1 - 2002/1/1

N2 - We propose a new application-level clustering algorithm capable of building an overlay spanning tree among participants of large multicast sessions, without any specific help from the networkrouters. This algorithm is based on a unique definition of zones around nodes and an innovative adaptive cluster size distribution. The proposed method finds application in many context where large-scale overlay trees can be usefull: application-level multicasting, peer-to-peer networks and content distribution networks (among other things).

AB - We propose a new application-level clustering algorithm capable of building an overlay spanning tree among participants of large multicast sessions, without any specific help from the networkrouters. This algorithm is based on a unique definition of zones around nodes and an innovative adaptive cluster size distribution. The proposed method finds application in many context where large-scale overlay trees can be usefull: application-level multicasting, peer-to-peer networks and content distribution networks (among other things).

M3 - Conference contribution/Paper

AN - SCOPUS:47349114377

SN - 3540437096

SN - 9783540437093

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1172

EP - 1177

BT - NETWORKING 2002

A2 - Gregori, Enrico

A2 - Conti, Marco

A2 - Omidyar, Guy

A2 - Zukerman, Moshe

A2 - Campbell, Andrew T.

PB - IEEE

T2 - 2nd International IFIP-TC6 Networking Conference, NETWORKING 2002

Y2 - 19 May 2002 through 24 May 2002

ER -