A reliable dissemination protocol for interactive collaborative applications
Proceedings of the third ACM international conference on Multimedia
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Scaling End-to-End Multicast Transports with a Topologically-Sensitive Group Formation Protocol
ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
IEEE Communications Magazine
Concast: design and implementation of an active network service
IEEE Journal on Selected Areas in Communications
Designing Service-Specific Execution Environments
IWAN '02 Proceedings of the IFIP-TC6 4th International Working Conference on Active Networks
Building layered active services
Computer Networks: The International Journal of Computer and Telecommunications Networking - Active networks
| Hi-index | 0.00 |
We present a scalable and flexible grouping service based on concast and best-effort single-source multicast. The service assigns participating end systems to specific groups based on application-supplied criteria. Example uses of such a service include peer-to-peer applications that want to group machines that are "near" each other, and reliable multicast services that need to assign receivers to repair groups. Our generic grouping framework relies on concast's many-to-one transport service to efficiently collect and apply the application-specific grouping criteria to the group members' information, and it relies on single-source multicast (i.e., one-to-many communication) to distribute the results to the nodes being grouped. The service can easily be customized to meet the grouping requirements of the application. We present simulation data showing the convergence properties of our grouping service and its effectiveness when applied to the problem of constructing overlay networks.