Optimal selection of multicast groups for resource location in a distributed system
- 1 January 1989
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A protocol is presented to locate (or find) named resources in a distributed system which uses the multicast capabilities of the underlying network. Each node in the network uses a sequence of node groups, and each node group is associated with a unique multicast address. To locate a resource, the searching node sequentially polls each one of the groups until the resource is found; this scheme is a generalization of both pure polling and broadcast. To obtain an optimal division of the nodes into multicast groups, the protocol is analyzed and an efficient algorithm is given that provides a group division minimizing the expected cost per location operation.Keywords
This publication has 6 references indexed in Scilit:
- Using hint tables to locate resources in distributed systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Using multicast communication to locate resources in LAN-based distributed systemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Caching Hints in Distributed SystemsIEEE Transactions on Software Engineering, 1987
- The clearinghouseACM Transactions on Information Systems, 1983
- GrapevineCommunications of the ACM, 1982
- A carrier sense multiple access protocol for local networksComputer Networks (1976), 1980