TY - GEN

T1 - An Overlay Tree Building Control Protocol.

AU - Mathy, Laurent;

AU - Canonico, Roberto;

AU - Hutchison, David

N1 - This paper presents a distributed algorithm for overlay multicast tree building. The particularities of the proposed tree building method are scalability and fast convergence times, achieved through a novel strategy known as ""tree-first, split-horizon"" approach. It was published at NGC (Networked Group Communications), a special interest workshop that was well supported and attended by the computer networking research community. This paper has had a significant impact on the research community as testified by the 80 references reported by Google Scholar. RAE_import_type : Conference contribution RAE_uoa_type : Computer Science and Informatics

PY - 2001/1/1

Y1 - 2001/1/1

N2 - TBCP is a generic Tree Building Control Protocol designed to build overlay spanning trees among participants of a multicast session, without any specific help from the network routers. TBCP therefore falls into the general category of protocols and mechanisms often referred to as Application-Level Multicasting. TBCP is an efficient, distributed protocol that operates with partial knowledge of the group membership and restricted network topology information. One of the major strategies in TBCP is to reduce convergence time by building as good a tree as possible early on, given the restricted membership/topology information available at the different nodes of the tree. We analyse our TBCP protocol by means of simulations, which shows its suitability for purpose.

AB - TBCP is a generic Tree Building Control Protocol designed to build overlay spanning trees among participants of a multicast session, without any specific help from the network routers. TBCP therefore falls into the general category of protocols and mechanisms often referred to as Application-Level Multicasting. TBCP is an efficient, distributed protocol that operates with partial knowledge of the group membership and restricted network topology information. One of the major strategies in TBCP is to reduce convergence time by building as good a tree as possible early on, given the restricted membership/topology information available at the different nodes of the tree. We analyse our TBCP protocol by means of simulations, which shows its suitability for purpose.

U2 - 10.1007/3-540-45546-9_6

DO - 10.1007/3-540-45546-9_6

M3 - Conference contribution/Paper

SN - 978-3-540-42824-4

VL - 2233/2

T3 - Lecture Notes in Computer Science

SP - 76

EP - 87

BT - Networked Group Communication

PB - Springer Berlin

CY - Heidelberg

ER -