A fast delivery protocol for total order broadcasting

Li Ou; Xubin He; Christian Engelmann; Stephen L. Scott

doi:10.1109/ICCCN.2007.4317904

A fast delivery protocol for total order broadcasting

Li Ou, Xubin He, Christian Engelmann, Stephen L. Scott

Intelligent Systems and Facilities

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

Abstract

Sequencer, privilege-based, and communication history algorithms are popular approaches to implement total ordering, where communication history algorithms are most suitable for parallel computing systems, because they provide best performance under heavy work load. Unfortunately, post-transmission delay of communication history algorithms is most apparent when a system is idle. In this paper, we propose a fast delivery protocol to reduce the latency of message ordering. The protocol optimizes the total ordering process by waiting for messages only from a subset of the machines in the group, and by fast acknowledging messages on behalf of other machines. Our test results indicate that the fast delivery protocol is suitable for both idle and heavy load systems, while reducing the latency of message ordering.

Original language	English
Title of host publication	Proceedings of 16th International Conference on Computer Communications and Networks 2007, ICCCN 2007
Pages	730-734
Number of pages	5
DOIs	https://doi.org/10.1109/ICCCN.2007.4317904
State	Published - 2007
Event	16th International Conference on Computer Communications and Networks 2007, ICCCN 2007 - Honolulu, HI, United States Duration: Aug 13 2007 → Aug 16 2007

Publication series

Name	Proceedings - International Conference on Computer Communications and Networks, ICCCN
ISSN (Print)	1095-2055

Conference

Conference	16th International Conference on Computer Communications and Networks 2007, ICCCN 2007
Country/Territory	United States
City	Honolulu, HI,
Period	08/13/07 → 08/16/07

Access to Document

10.1109/ICCCN.2007.4317904

Cite this

Ou, L., He, X., Engelmann, C., & Scott, S. L. (2007). A fast delivery protocol for total order broadcasting. In Proceedings of 16th International Conference on Computer Communications and Networks 2007, ICCCN 2007 (pp. 730-734). Article 4317904 (Proceedings - International Conference on Computer Communications and Networks, ICCCN). https://doi.org/10.1109/ICCCN.2007.4317904

@inproceedings{751e87e813ec4ff195e68bb6f794dccc,

title = "A fast delivery protocol for total order broadcasting",

abstract = "Sequencer, privilege-based, and communication history algorithms are popular approaches to implement total ordering, where communication history algorithms are most suitable for parallel computing systems, because they provide best performance under heavy work load. Unfortunately, post-transmission delay of communication history algorithms is most apparent when a system is idle. In this paper, we propose a fast delivery protocol to reduce the latency of message ordering. The protocol optimizes the total ordering process by waiting for messages only from a subset of the machines in the group, and by fast acknowledging messages on behalf of other machines. Our test results indicate that the fast delivery protocol is suitable for both idle and heavy load systems, while reducing the latency of message ordering.",

author = "Li Ou and Xubin He and Christian Engelmann and Scott, {Stephen L.}",

year = "2007",

doi = "10.1109/ICCCN.2007.4317904",

language = "English",

isbn = "9781424412518",

series = "Proceedings - International Conference on Computer Communications and Networks, ICCCN",

pages = "730--734",

booktitle = "Proceedings of 16th International Conference on Computer Communications and Networks 2007, ICCCN 2007",

note = "16th International Conference on Computer Communications and Networks 2007, ICCCN 2007 ; Conference date: 13-08-2007 Through 16-08-2007",

}

Ou, L, He, X, Engelmann, C & Scott, SL 2007, A fast delivery protocol for total order broadcasting. in Proceedings of 16th International Conference on Computer Communications and Networks 2007, ICCCN 2007., 4317904, Proceedings - International Conference on Computer Communications and Networks, ICCCN, pp. 730-734, 16th International Conference on Computer Communications and Networks 2007, ICCCN 2007, Honolulu, HI, United States, 08/13/07. https://doi.org/10.1109/ICCCN.2007.4317904

A fast delivery protocol for total order broadcasting. / Ou, Li; He, Xubin; Engelmann, Christian et al.
Proceedings of 16th International Conference on Computer Communications and Networks 2007, ICCCN 2007. 2007. p. 730-734 4317904 (Proceedings - International Conference on Computer Communications and Networks, ICCCN).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A fast delivery protocol for total order broadcasting

AU - Ou, Li

AU - He, Xubin

AU - Engelmann, Christian

AU - Scott, Stephen L.

PY - 2007

Y1 - 2007

N2 - Sequencer, privilege-based, and communication history algorithms are popular approaches to implement total ordering, where communication history algorithms are most suitable for parallel computing systems, because they provide best performance under heavy work load. Unfortunately, post-transmission delay of communication history algorithms is most apparent when a system is idle. In this paper, we propose a fast delivery protocol to reduce the latency of message ordering. The protocol optimizes the total ordering process by waiting for messages only from a subset of the machines in the group, and by fast acknowledging messages on behalf of other machines. Our test results indicate that the fast delivery protocol is suitable for both idle and heavy load systems, while reducing the latency of message ordering.

AB - Sequencer, privilege-based, and communication history algorithms are popular approaches to implement total ordering, where communication history algorithms are most suitable for parallel computing systems, because they provide best performance under heavy work load. Unfortunately, post-transmission delay of communication history algorithms is most apparent when a system is idle. In this paper, we propose a fast delivery protocol to reduce the latency of message ordering. The protocol optimizes the total ordering process by waiting for messages only from a subset of the machines in the group, and by fast acknowledging messages on behalf of other machines. Our test results indicate that the fast delivery protocol is suitable for both idle and heavy load systems, while reducing the latency of message ordering.

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

U2 - 10.1109/ICCCN.2007.4317904

DO - 10.1109/ICCCN.2007.4317904

M3 - Conference contribution

AN - SCOPUS:40949146242

SN - 9781424412518

T3 - Proceedings - International Conference on Computer Communications and Networks, ICCCN

SP - 730

EP - 734

BT - Proceedings of 16th International Conference on Computer Communications and Networks 2007, ICCCN 2007

T2 - 16th International Conference on Computer Communications and Networks 2007, ICCCN 2007

Y2 - 13 August 2007 through 16 August 2007

ER -

A fast delivery protocol for total order broadcasting

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this