QoS scalable tree aggregation

9Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Some of the main reasons which prevents the deployment of IP multicast are forwarding state scalability and control explosion problems. In this paper, we propose an algorithm called Q-STA (QoS Scalable Tree Aggregation) which reduces the number of forwarding states by allowing several groups to share the same tree. Q-STA accepts groups only if there is enough available bandwidth. Q-STA accepts much more groups and performs faster aggregations than previous algorithms. © IFIP International Federation for Information Processing 2005.

Cite

CITATION STYLE

APA

Moulierac, J., & Guitton, A. (2005). QoS scalable tree aggregation. In Lecture Notes in Computer Science (Vol. 3462, pp. 1405–1408). Springer Verlag. https://doi.org/10.1007/11422778_125

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free