By Topic

A comment on “A total ordering multicast protocol using propagation trees”

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

2 Author(s)
Shiuh-Pyng Shieh ; Dept. of Comput. Sci. & Inf. Eng., Nat. Chiao Tung Univ., Hsinchu ; Fu-Shen Ho

In this paper, we reevaluate the message cost of X. Jia's multicast mechanism (see ibid., vol. 6, no. 6, p. 617-27 (1995)). Our analysis shows that its message cost should be (D+k+1) instead of (D+2), where D is the depth of the subtree and k is the number of metagroups containing the destination multicast group

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:8 ,  Issue: 10 )