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
Publication date1/01/2002
Host publicationNETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications
EditorsEnrico Gregori, Marco Conti, Guy Omidyar, Moshe Zukerman, Andrew T. Campbell
PublisherIEEE
Pages1172-1177
Number of pages6
ISBN (print)3540437096, 9783540437093
<mark>Original language</mark>English
Event2nd International IFIP-TC6 Networking Conference, NETWORKING 2002 - Pisa, Italy
Duration: 19/05/200224/05/2002

Conference

Conference2nd International IFIP-TC6 Networking Conference, NETWORKING 2002
Country/TerritoryItaly
CityPisa
Period19/05/0224/05/02

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2345
ISSN (Print)0302-9743
ISSN (electronic)1611-3349

Conference

Conference2nd International IFIP-TC6 Networking Conference, NETWORKING 2002
Country/TerritoryItaly
CityPisa
Period19/05/0224/05/02

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).