The "wait-for-all" feedback consolidation algorithm avoids consolidation noise, but suffers from a slow transient response. Probabilistic Aggregation and Fast Overload Indication techniques have been proposed to preserve the advantages of the "wait-for-all" algorithm and improve its slow transient response. However, these techniques introduce a new "threshold setting" problem. We developed a new consolidation algorithm to provide a fast transient response, a low consolidation noise and flexibility in determining the threshold. In addition, we developed a dynamic timeout mechanism to handle the non-responsive branches where the membership within a multicast session changes due to frequent joining/leaving of members (leaves).
|Original language||English (US)|
|Number of pages||5|
|Journal||IEEE International Conference on Communications|
|State||Published - 1999|
ASJC Scopus subject areas
- Computer Networks and Communications
- Electrical and Electronic Engineering