See this document in CiteSeerX!

Total Ordering of Messages in Broadcast Domains (1992)  (Make Corrections)  (5 citations)
Danny Dolev, Shlomo Kramer, Dalia Malki



  Home/Search   Context   Related

 
View or download:
att.com/~dalia/./pubs/TR929.ps.gz
att.com/~dalia/././pubs/TR929.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  att.com/~dalia/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: This paper presents the construction of a multicast service, called agreed multicast, that guarantees that messages arrive reliably and in the same total-order to all their destinations. ToTo, a novel family of protocols, implement the agreed multicast service of Transis, a communication sub-system for the High Availability project, currently developed at the Hebrew University of Jerusalem. This service is desired in distributed systems, and supports high level coordination among groups of... (Update)

Similar documents based on text:   More   All
0.4:   Early Delivery Totally Ordered Multicast in Asynchronous.. - Danny Dolev (1993)   (Correct)
0.3:   Resume - Malki   (Correct)
0.2:   New Rules for Early Delivery in an Atomic Multicast System - Johnson, Maugis (1994)   (Correct)

BibTeX entry:   (Update)

D. Dolev, S. Kramer, and D. Malki. Total ordering of messages in broadcast domains. Technical report, The Hebrew University of Jerusalem, November 1992. http://citeseer.ist.psu.edu/dolev92total.html   More

@misc{ dolev92total,
  author = "D. Dolev and S. Kramer and D. Malki",
  title = "Total ordering of messages in broadcast domains",
  text = "D. Dolev, S. Kramer, and D. Malki. Total ordering of messages in broadcast
    domains. Technical report, The Hebrew University of Jerusalem, November
    1992.",
  year = "1992",
  url = "citeseer.ist.psu.edu/dolev92total.html" }
Citations (may not include all citations):
1749   An Introduction to Probability Theory and Its Applications (context) - Feller - 1966
917   and the ordering of events in a distributed system (context) - Lamport, clocks
739   Impossibility of distributed consensus with one faulty proce.. (context) - Fischer, Lynch et al. - 1985
470   Lightweight causal and atomic group multicast (context) - Birman, Schiper et al. - 1991
310   Transis: A communication sub-system for high availability - Amir, Dolev et al. - 1992
216   Exploiting virtual synchrony in distributed systems (context) - Birman, Joseph
214   Preserving and using context information in interprocess com.. - Peterson, Buchholz et al.
144   Atomic broadcast: From simple message diffusion to byzantine.. - Cristian, Aghili et al. - 1985
132   Reaching agreement on processor group membership in synchron.. - Cristian - 1988
131   Distributed process groups in the v kernel (context) - Cheriton, Zwaenepoel - 1985
123   An efficient reliable broadcast protocol - Kaashoek, Tanenbaum et al. - 1989
102   Broadcast protocols for distributed systems (context) - Melliar-Smith, Moser et al. - 1990
73   Randomized byzantine generals (context) - Rabin - 1983
72   Authenticated algorithms for byzantine agreement (context) - Dolev, Strong - 1983
71   Membership algorithms for multicast communication groups - Amir, Dolev et al. - 1992

[Article contains additional citations not shown here]



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.research.att.com/~dalia/):   More
Uniform Actions in Asynchronous Distributed Systems.. - Malki, Birman.. (1994)   (Correct)
Secure Reliable Multicast Protocols in a WAN - Dahlia Malkhi (1997)   (Correct)
Uniform Actions in Asynchronous Distributed Systems - Malki, Birman, Ricciardi.. (1994)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC