A comment on "A total ordering multicast protocol using propagation trees"

Shiuh-Pyng Shieh; Fu Shen Ho

doi:10.1109/71.629490

A comment on "A total ordering multicast protocol using propagation trees"

Shiuh-Pyng Shieh^*, Fu Shen Ho

^*Corresponding author for this work

Department of Computer Science

Research output: Contribution to journal › Review article › peer-review

3 Scopus citations

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 depth of the subtree and k is the number of metagroups containing the destination multicast group.

Original language	English
Article number	629490
Pages (from-to)	1084-1084
Number of pages	1
Journal	IEEE Transactions on Parallel and Distributed Systems
Volume	8
Issue number	10
DOIs	https://doi.org/10.1109/71.629490
State	Published - Oct 1997

Keywords

Distributed systems
Group communication
Message ordering
Multicast protocols
Process synchronization

Access to Document

10.1109/71.629490

Cite this

@article{f6796f1d38e94541a09ffc75fb14507f,

title = "A comment on {"}A total ordering multicast protocol using propagation trees{"}",

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 depth of the subtree and k is the number of metagroups containing the destination multicast group.",

keywords = "Distributed systems, Group communication, Message ordering, Multicast protocols, Process synchronization",

author = "Shiuh-Pyng Shieh and Ho, {Fu Shen}",

year = "1997",

month = oct,

doi = "10.1109/71.629490",

language = "English",

volume = "8",

pages = "1084--1084",

journal = "IEEE Transactions on Parallel and Distributed Systems",

issn = "1045-9219",

publisher = "IEEE Computer Society",

number = "10",

}

TY - JOUR

T1 - A comment on "A total ordering multicast protocol using propagation trees"

AU - Shieh, Shiuh-Pyng

AU - Ho, Fu Shen

PY - 1997/10

Y1 - 1997/10

N2 - 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 depth of the subtree and k is the number of metagroups containing the destination multicast group.

AB - 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 depth of the subtree and k is the number of metagroups containing the destination multicast group.

KW - Distributed systems

KW - Group communication

KW - Message ordering

KW - Multicast protocols

KW - Process synchronization

UR - http://www.scopus.com/inward/record.url?scp=0031247408&partnerID=8YFLogxK

U2 - 10.1109/71.629490

DO - 10.1109/71.629490

M3 - Review article

AN - SCOPUS:0031247408

SN - 1045-9219

VL - 8

SP - 1084

EP - 1084

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

IS - 10

M1 - 629490

ER -

A comment on "A total ordering multicast protocol using propagation trees"

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this