๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the scaling of feedback algorithms for very large multicast groups

โœ Scribed by T.T. Fuhrmann; J. Widmer


Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
274 KB
Volume
24
Category
Article
ISSN
0140-3664

No coin nor oath required. For personal study only.

โœฆ Synopsis


Feedback from multicast group members is vital for many multicast protocols. In order to avoid feedback implosion in very large groups feedback algorithms with well-behaved scaling-properties must be chosen. In this paper, we analyse the performance of three typical feedback algorithms described in the literature. Apart from the basic trade-off between feedback latency and response duplicates we especially focus on the algorithms' sensitivity to the quality of the group size estimation. Based on this analysis we propose a generalised framework for feedback algorithms and especially give recommendations for the choice of well-behaved feedback mechanisms that are suitable for very large groups.


๐Ÿ“œ SIMILAR VOLUMES


An algorithm for the computer simulation
โœ E.J. Davison ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 835 KB

A fast efficient algorithm may be used for integrating very large (n >> 10) stiffdifferential equations of the type R = Ax + Bu + f(x, t), x(t0) = x0, wh ere f(x, t) has a small Lipschitz constant. Summary--An algorithm for integrating high dimensional stiff nonlinear differential equations of the

A submatrix algorithm for the matrix-vec
โœ Roland Lindh; Per-ร…rke Malmquist ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 179 KB

In self-consistent field (SCF) calculations the construction of the Fock matrix is most time-consuming step. The Fock matrix construction may formally be seen as a matrix-vector multiplication, where the matrix is the supermatrix, Tikl, and the vector is the first-order density matrix, yi. This form