Scalable Tree Aggregation for Multicast
type: Dataset
description: IP multicast is not widely deployed yet over Internet. This is mainly due to the forwarding entries scalability and control explosion problems. In this paper, we propose an algorithm called STA (Scalable Tree Aggregation) which reduces the number of trees by allowing several groups to be aggregated to the same tree: the less trees, the less forwarding entries and the less control messages to maintain trees. STA performs faster aggregations than previous aggregation algorithms by evaluating fewer trees for each group, while keeping the same performance. We show the scalability and the fastness of STA by extensive simulations and we compare its performance to the previous algorithm.
landing page: ConTEL
keyword: conference-papers
keyword: infoeu-reposemanticsconferenceobject
keyword: infoinfo-nicomputer-science-csnetworking-and-internet-architecture-csni
keyword: ip-networks
keyword: multicast-tree-aggregation
keyword: number-of-forwarding-states
keyword: scalability
issued: 2026-05-10T05:48:12.919661
modified: 2026-05-10T05:48:12.919665
language: en
contact point: Organization
  fn: CCSD

test_moissonnage_selune
type: Agent

Scalable Tree Aggregation for Multicast
type: Distribution
format: HTML
access URL: https://inria.hal.science/inria-00084802
issued: 2026-05-10T05:48:12.926067
modified: 2026-05-10T05:48:12.909716