Home > Research > Publications & Outputs > Scalable adaptive hierarchical clustering

Research

Associated organisational units

Keywords

View graph of relations

Scalable adaptive hierarchical clustering

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

Scalable adaptive hierarchical clustering. / Mathy, L.; Canonico, R.; Simpson, Steven et al.
In: IEEE Communications Letters, Vol. 6, No. 3, 01.03.2002, p. 117-119.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Mathy, L, Canonico, R, Simpson, S & Hutchison, D 2002, 'Scalable adaptive hierarchical clustering', IEEE Communications Letters, vol. 6, no. 3, pp. 117-119.

APA

Mathy, L., Canonico, R., Simpson, S., & Hutchison, D. (2002). Scalable adaptive hierarchical clustering. IEEE Communications Letters, 6(3), 117-119.

Vancouver

Mathy L, Canonico R, Simpson S, Hutchison D. Scalable adaptive hierarchical clustering. IEEE Communications Letters. 2002 Mar 1;6(3):117-119.

Author

Mathy, L. ; Canonico, R. ; Simpson, Steven et al. / Scalable adaptive hierarchical clustering. In: IEEE Communications Letters. 2002 ; Vol. 6, No. 3. pp. 117-119.

Bibtex

@article{27012dafa41d4118b24146299820302c,
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 network routers. The algorithm and associated protocols are shown to exhibit scalable properties.",
keywords = "cs_eprint_id, 595 cs_uid, 1",
author = "L. Mathy and R. Canonico and Steven Simpson and David Hutchison",
year = "2002",
month = mar,
day = "1",
language = "English",
volume = "6",
pages = "117--119",
journal = "IEEE Communications Letters",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

RIS

TY - JOUR

T1 - Scalable adaptive hierarchical clustering

AU - Mathy, L.

AU - Canonico, R.

AU - Simpson, Steven

AU - Hutchison, David

PY - 2002/3/1

Y1 - 2002/3/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 network routers. The algorithm and associated protocols are shown to exhibit scalable properties.

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 network routers. The algorithm and associated protocols are shown to exhibit scalable properties.

KW - cs_eprint_id

KW - 595 cs_uid

KW - 1

M3 - Journal article

VL - 6

SP - 117

EP - 119

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 3

ER -