Name
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. |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1145/99508.99556 | SIGCOMM |
Keywords | Field | DocType |
name graph,name resolution loop,nested group name resolution,nested group,resolution duplication,name graph model,resolution loop,group membership,paper generalizes group communication,group structure change,communication complexity,upper bound,structural change,group communication | Graph,Group structure,Name resolution,Topology information,Upper and lower bounds,Computer science,Algorithm,Communication complexity,Voltage graph,The Internet | Conference |
Volume | Issue | ISSN |
20 | 4 | 0146-4833 |
ISBN | Citations | PageRank |
0-89791-405-8 | 1 | 0.37 |
References | Authors | |
6 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| L. Liang | 1 | 10 | 2.14 |
| Gerald Neufeld | 2 | 394 | 80.81 |
| S. T. Chanson | 3 | 90 | 12.58 |