A total ordering multicast protocol using propagation trees - Comment

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Shieh, SP	en_US
dc.contributor.author	Ho, FS	en_US
dc.date.accessioned	2014-12-08T15:01:26Z	-
dc.date.available	2014-12-08T15:01:26Z	-
dc.date.issued	1997-10-01	en_US
dc.identifier.issn	1045-9219	en_US
dc.identifier.uri	http://dx.doi.org/10.1109/71.629490	en_US
dc.identifier.uri	http://hdl.handle.net/11536/289	-
dc.description.abstract	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.	en_US
dc.language.iso	en_US	en_US
dc.subject	multicast protocols	en_US
dc.subject	group communication	en_US
dc.subject	message ordering	en_US
dc.subject	distributed systems	en_US
dc.subject	process synchronization	en_US
dc.title	A total ordering multicast protocol using propagation trees - Comment	en_US
dc.type	Letter	en_US
dc.identifier.doi	10.1109/71.629490	en_US
dc.identifier.journal	IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS	en_US
dc.citation.volume	8	en_US
dc.citation.issue	10	en_US
dc.citation.spage	1084	en_US
dc.citation.epage	1084	en_US
dc.contributor.department	交大名義發表	zh_TW
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	National Chiao Tung University	en_US
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:A1997YC54200008	-
dc.citation.woscount	2	-
顯示於類別：	期刊論文

文件中的檔案：

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。