A total ordering multicast protocol using propagation trees - Comment

檔案

日期

1997-10-01

期刊名稱

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS

摘要

In this paper, we reevaluate the message cost of Jia's multicast mechanism. Our analysis shows that its message cost should be (D+k+1) instead of (D+2), where D is the the depth of the subtree and k is the number of metagroups containing the destination multicast group.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料