Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

A name model for nested group communication

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Liang, L. ; BNR, Ottawa, Ont., Canada ; Neufeld, G.W. ; Chanson, S.T.

Group communication permits a single sender to communicate with multiple receivers. A nested group permits one or more of the receivers to be itself a group. Nested groups are particularly useful for reducing communication traffic on internetwork links and supporting subnetwork autonomy. A name graph model is used to characterize nested groups and formalize the problems of loops and duplications. The authors design and analyze a spanning shadow tree algorithm that detects potential loops and duplication. The algorithm is considered static because loops and duplicates are detected at the time of group membership modification rather than at the time a message is sent. The algorithm changes the system-level representation of the name graph in a transparent manner to avoid infinite loops and to suppress duplicated messages. The worst-case message complexity of name graph update operations is on the order of O(|N|2), where |N| is the number of groups in the system. The complexity of updates can be justified, since run-time overhead for actual message communication is reduced

Published in:

Networking, IEEE/ACM Transactions on  (Volume:1 ,  Issue: 4 )