Abstract

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).

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call