Avoiding name resolution loops and duplications in group communications

Authors:
L. Liang;G. W. Neufeld;S. T. Chanson
Affiliations:
Distributed Systems Research Group, Department of Computer Science, The University of British Columbia, Vancouver, B.C., Canada, V6T lW5;Distributed Systems Research Group, Department of Computer Science, The University of British Columbia, Vancouver, B.C., Canada, V6T lW5;Distributed Systems Research Group, Department of Computer Science, The University of British Columbia, Vancouver, B.C., Canada, V6T lW5
Venue:
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Year:
1990

Citing 6
Cited 1

Implementing distribution lists in computer-based message systems

Proc. of the IFIP WG 6.5 working conference on Computer-based message services
Reliable communication in the presence of failures

ACM Transactions on Computer Systems (TOCS)
Process Groups and Group Communications: Classifications and Requirements

Computer
Distributed process groups in the V Kernel

ACM Transactions on Computer Systems (TOCS)
Host groups: a multicast extension for datagram internetworks

SIGCOMM '85 Proceedings of the ninth symposium on Data communications
The use of broadcast techniques on the universe network

SIGCOMM '84 Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium

A name model for nested group communication

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper generalizes group communications into nested groups for the internet environment. By using a name graph model, two problems in nested group name resolution are identified — resolution loops and resolution duplications. Existing approaches of solving these problems are surveyed and their shortcomings analyzed. The research contribution of this paper is the design and analysis of an algorithm which uses statically saved topology information of the name graph to detect and handle resolution and duplication loops at the time when group membership and/or group structure change. While preserving some necessary properties of loops, the algorithm transforms the name graph into one which avoids resolution loops and controls duplications. The communication complexity of the algorithm has an upper bound of &Ogr;(|A|) in the worst case, where |A| is the number of arcs in the name graph.