|
Abstract : |
Multi-party applications are of great importance, and perhaps the greatest challenge is achieving both a) robustness in the presence of adaptation to dynamic topology and group membership, and b) scalability in terms of bandwidth, state, and processing, as the size of a group grows. Scalable Reliable Multicast (SRM) [1] is a rich example of a robust design intended to work across a wide range of group sizes and dynamic topologies. However, the adaptation mechanisms in SRM rely on shared group state achieved via exchange of session messages. Similar synchronization is important in other multiparty applications and services [2, 3]. Various mechanisms have been proposed to reduce the overhead of this loose group synchronization. This paper uses a self-configuring hierarchy to reduce the overhead of session messages in SRM. Unlike previous proposals, our mechanism uses a stochastic algorithm for self-configuration based on randomized timers and local appropriateness measures. We present initial evaluations of the impact of this mechanism on SRM performance, and evaluate the hierarchical structure formed by the protocol participants. Many interesting questions remain for future work, such as dynamics and stability of the self-configuration process and its applicability to other multiparty protocols., |
