[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/166237.166248acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
Article
Free access

Causal ordering in reliable group communications

Published: 01 October 1993 Publication History

Abstract

In this paper we present a solution to the causal reliable multicast problem. User processes generate separate sequences of messages and specify the causal relation among them according to some application need; the algorithm ensures that the messages within the same sequence are delivered to all active, i.e. both correct and faulty, processes in the group, or to none of them, and are processed according to their causal order. Messages belonging to different sequences can be concurrently processed.This problem has few solutions presented in literature; in common with a part of them, the algorithm we describe has the centralized approach and the use of history buffers to recover from omission failures. The differences mainly concern the mechanism we devised to recover from crash failures, that avoids resorting to specialized protocols. As a consequence, under failure conditions, the algorithm performs better than other proposals in terms of both network load and throughput without affecting the performances under reliable conditions. Further, it allows to implement the most general interpretation of causality and it does not require any particular service to the underlying transport protocol.

References

[1]
R. Aiello, E. Pagani, G. P. Rossi, "Design of a Reliable Multicast Protocol". Proc. of IEEE INFOCOM '93, San Francisco, March 1993, pp. 75-81.
[2]
K. P. Birman and T. A. Joseph, "Reliable Communication in the Presence of Failures'. A CM Transaction on Computer Systems. Vol.5, N.1, pp. 47-76, (February 1987).
[3]
K. Birman, A. Schiper, P. Stephenson, " Lightweight Causal and Atomic Group Multicasl'. A CM Transaction on Computer Systems. Vol.9, N.3, pp. 272-314, (August 1991).
[4]
Crowcroft J., Paliwoda K., ".4 Multicasl Transport Protocol", A CM Computer Communication Review, Vol. 18, N. 4, pp. 247-256, (1988).
[5]
T.D. Chandra and S.Toueg, "Time and Message EjO~cient Reliable Broadcast". Proceeding of the 4th International Workshop on Distributed Algorithms. Vol. 486 of Lecture Notes on Computer Science pp. 289-304, (September 1990).
[6]
L. Lamport, "Time, Clocks, and the Ordering of Events in a Distributed System'. Commun. A CM. Vol.21, N.7, pp. 558-565, (July 1978).
[7]
R. Ladin, B. Liskov, S. Ghemawat, "Providing High Availability Using Lazy Replication". A CM Transaction on Computer $yslem. Vol.10, N.4, pp. 360-391, (November 1992).
[8]
L.L. Peterson, N. C. Buchholz, R. D. Schlichting, "Preserving and Using Conie~t Information in Interprocess Communicaiion'.ACM Transaction on Computer Systems. Vol.7, N.3, pp. 217-246, (August 1989).

Cited By

View all
  • (2006)Multipoint communicationIEEE Journal on Selected Areas in Communications10.1109/49.56412815:3(277-290)Online publication date: 1-Sep-2006
  • (2005)A high performance totally ordered multicast protocolTheory and Practice in Distributed Systems10.1007/3-540-60042-6_3(33-57)Online publication date: 5-Jun-2005
  • (2001)Auditing Causal Relationships of Group Multicast Communications in Group-Oriented Distributed SystemsThe Journal of Supercomputing10.1023/A:100815890766218:1(25-45)Online publication date: 1-Jan-2001
  • Show More Cited By

Recommendations

Reviews

Arvid G. Larson

…we present a solution to the causal reliable multicast problem. User processes generate separate sequences of messages and specify the causal relation among them according to some application need; the algorithm ensures that the messages within the same sequence are delivered to all active, i.e., both correct and faulty, processes in the group, or to none of them, and are processed according to their causal order. Messages belonging to different sequences can be concurrently processed. This problem has few solutions presented in literature; in common with a part of them, this algorithm uses a centralized approach and history buffers to recover from omission failures. …Further, it allows implementation using the most general interpretation of causality and it does not require any particular service to the underlying transport protocol. (From the authors' abstract). The authors have developed a new algorithm for application within real-time distributed control environments in which the provision of multimedia spaces for simultaneous multiuser collaborative efforts and conferencing requires a form of communication that reflects the causal relation among the messages. This approach, known as the uniform reliable causal group communications (URCGC) algorithm, uses embedded mechanisms to provide for the normal processing of messages together with the recovery actions that are required when failures occur. The authors claim that, under multiprocessing failure conditions, this new algorithm performs better than currently used algorithms in terms of network overhead loading, throughput, and tolerance of general omission failures, while providing comparable network performance under reliable conditions. The URCGC algorithm is outlined in the context of a system model and a defined implementation protocol architecture. An analysis is presented as the basis for the network performance improvements attributed to this algorithm. This algorithm has apparently yet to be implemented on an actual multiprocessor network. Judgment as to its ultimate efficacy in improving network throughput and error tolerance is perhaps best left to such an implementation and subsequent network performance measurements.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGCOMM '93: Conference proceedings on Communications architectures, protocols and applications
October 1993
299 pages
ISBN:0897916190
DOI:10.1145/166237
  • cover image ACM SIGCOMM Computer Communication Review
    ACM SIGCOMM Computer Communication Review  Volume 23, Issue 4
    Oct. 1993
    288 pages
    ISSN:0146-4833
    DOI:10.1145/167954
    • Editor:
    • David Oran
    Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1993

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

SIGCOMM93
Sponsor:
SIGCOMM93: Symposium, Communication, Architectures and Protocols
September 13 - 17, 1993
California, San Francisco, USA

Acceptance Rates

Overall Acceptance Rate 462 of 3,389 submissions, 14%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)130
  • Downloads (Last 6 weeks)19
Reflects downloads up to 20 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2006)Multipoint communicationIEEE Journal on Selected Areas in Communications10.1109/49.56412815:3(277-290)Online publication date: 1-Sep-2006
  • (2005)A high performance totally ordered multicast protocolTheory and Practice in Distributed Systems10.1007/3-540-60042-6_3(33-57)Online publication date: 5-Jun-2005
  • (2001)Auditing Causal Relationships of Group Multicast Communications in Group-Oriented Distributed SystemsThe Journal of Supercomputing10.1023/A:100815890766218:1(25-45)Online publication date: 1-Jan-2001
  • (2000)Ordered end-to-end multicast for distributed multimedia systemsProceedings of the 33rd Annual Hawaii International Conference on System Sciences10.1109/HICSS.2000.927003(10)Online publication date: 2000
  • (1998)Flexible wide-area group communication protocols-international experimentsProceedings of the 1998 ICPP Workshop on Architectural and OS Support for Multimedia Applications Flexible Communication Systems. Wireless Networks and Mobile Computing (Cat. No.98EX206)10.1109/ICPPW.1998.721879(105-112)Online publication date: 1998
  • (1998)Wide-area group communication protocols-international experimentProceedings Twelfth International Conference on Information Networking (ICOIN-12)10.1109/ICOIN.1998.648408(356-361)Online publication date: 1998
  • (1998)Group communication protocol for real-time applicationsProceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)10.1109/ICDCS.1998.679485(40-47)Online publication date: 1998
  • (1997)Reliable multicast protocol design choicesMILCOM 97 MILCOM 97 Proceedings10.1109/MILCOM.1997.648710(242-246)Online publication date: 1997
  • (1997)Δ-causality in wide-area group communicationsProceedings 1997 International Conference on Parallel and Distributed Systems10.1109/ICPADS.1997.652559(260-267)Online publication date: 1997
  • (1995)A Set of Multicast Primitives for Fault Tolerant Distributed SystemsJournal of High Speed Networks10.5555/2692255.26922614:3(299-316)Online publication date: 1-Jul-1995
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media