Message Reordering
Message Reordering is a message ordering mechanism in distributed systems that belongs to the class of causal ordering protocols and specifically ensures that messages are delivered to receivers in an order that preserves causality by reordering messages upon arrival based on their logical timestamps or dependencies.
25
Publications
1.4K
Citations
66
Authors
33
Institutions
Publications per year
2017–2026
3
Parents
25
The Totem single-ring ordering and membership protocol
Yair Amir, L.E. Moser, P. M. Melliar‐Smith et al. · ACM Transactions on Computer Systems · 1995 · 282 citations · Full text
RR-TCP: a reordering-robust TCP with DSACK
Ming Zhang, Brad Karp, Sally Floyd et al. · 2004 · 192 citations
Fast message ordering and membership using a logical token-passing ring
Yair Amir, L.E. Moser, P. M. Melliar‐Smith et al. · 2002 · 93 citations
1–5 of 25
66
3
h-index
University of California, Santa Barbara, United States
3 publications · 443 citations
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 66
33
University of California, Santa Barbara
Santa Barbara, United States
3 h-index
14 publications
2.1K citations
University of South Carolina
Columbia, United States
2 h-index
3 publications
113 citations
Duke University
Durham, United States
2 h-index
9 publications
337 citations
AT&T (United States)
Bedminster, United States
1 h-index
1 publications
54 citations
Nanyang Technological University
Singapore, Singapore
1 h-index
3 publications
39 citations
University of Oxford
Oxford, United Kingdom
1 h-index
1 publications
59 citations
Université Paris-Sud
Orsay, France
1 h-index
2 publications
76 citations
University of Michigan
Ann Arbor, United States
1 h-index
1 publications
221 citations
1–8 of 33
TOCS · 2 publications · 350 citations
2
h-index
JACIC · 1 publications · 38 citations
1
h-index
1 publications · 59 citations
1
h-index
JSA · 1 publications · 13 citations
1
h-index
1 publications · 25 citations
1
h-index
1–5