TY - GEN
T1 - A generic set-formation service
AU - Sehgal, A.
AU - Calvert, K. L.
AU - Griffioen, J.
N1 - Publisher Copyright:
© 2003 IEEE.
PY - 2003
Y1 - 2003
N2 - Dynamic group formation and discovery is an important component of several emerging end system applications and network services including peer-to-peer and overlay systems, network storage/caching systems, and reliable multicast/distribution services. In our previous work, we proposed a programmable, scalable grouping service based on multicast and concast. In this paper, we present a generalized abstraction that subsumes the earlier service and can be implemented using other forms of network support in addition to (or apart from) multicast/concast. In designing the new grouping abstraction, we have attempted to separate the policies governing set formation from the network mechanisms (multicast, concast, distributed hash tables, etc.) used to implement those policies. In addition, we allow policies to be specified in terms of both application-specific criteria and network-based criteria. We describe how the service can be used to solve grouping problems from different application areas, and give an example showing how it can leverage different network support mechanisms, including ephemeral state processing.
AB - Dynamic group formation and discovery is an important component of several emerging end system applications and network services including peer-to-peer and overlay systems, network storage/caching systems, and reliable multicast/distribution services. In our previous work, we proposed a programmable, scalable grouping service based on multicast and concast. In this paper, we present a generalized abstraction that subsumes the earlier service and can be implemented using other forms of network support in addition to (or apart from) multicast/concast. In designing the new grouping abstraction, we have attempted to separate the policies governing set formation from the network mechanisms (multicast, concast, distributed hash tables, etc.) used to implement those policies. In addition, we allow policies to be specified in terms of both application-specific criteria and network-based criteria. We describe how the service can be used to solve grouping problems from different application areas, and give an example showing how it can leverage different network support mechanisms, including ephemeral state processing.
KW - Delay
KW - Laboratories
KW - Multicast protocols
KW - Network servers
KW - Network topology
KW - Peer to peer computing
KW - Routing
KW - Scalability
UR - https://www.scopus.com/pages/publications/84943532439
UR - https://www.scopus.com/pages/publications/84943532439#tab=citedBy
U2 - 10.1109/OPNARC.2003.1196378
DO - 10.1109/OPNARC.2003.1196378
M3 - Conference contribution
AN - SCOPUS:84943532439
T3 - 2003 IEEE Conference on Open Architectures and Network Programming Proceedings, OPENARCH 2003
SP - 109
EP - 119
BT - 2003 IEEE Conference on Open Architectures and Network Programming Proceedings, OPENARCH 2003
T2 - 2003 IEEE Conference on Open Architectures and Network Programming Proceedings, OPENARCH 2003
Y2 - 4 April 2003 through 5 April 2003
ER -