296:
that merges virtual synchrony with Paxos in this way. The original idea of doing so was from a suggestion by
Lamport and Malkhi, but they never took this further than a sketch of how one might replace the Paxos management model with a black box (they called it "Vertical Paxos") for tracking joins and leaves and for synchronizing those relative to updates and multicasts, using the virtual synchrony model for that aspect. So in this sense Vertical Paxos was a general template for "Paxos plus your favorite way of managing membership", and then virtual synchrony is one such way, and Derecho is a software library implementing all of this. This is just one aspect of Derecho, though -- it also has a storage (file system) layer, and a mapping to "RDMA" networks.
292:. I've added a mention of Derecho to the Ken Birman wiki page (someone else created one about my work, many years ago), and to the Paxos Protocol wiki page, on which many creators of Paxos protocols have described their variations. That particular page also was originally created many years ago by someone with no particular agenda, and these edits by others and myself have mostly (not entirely) been focused on the lists of systems using Paxos or the lists of Paxos protocols available for download.
80:
53:
22:
148:
180:
283:
This wiki page will be merged with others as noted in the discussion on the proposal to delete. In that discussion, I mentioned that
Derecho, a new Cornell system that combines virtual synchrony as a membership model with Paxos for doing updates to persistent data or for atomic multicast, would be
295:
The reason I mention all this is that
Derecho is provably optimal for Paxos and virtual synchrony, so anyone who tackles the editing task to delete this page and merge it with others might want to point that out. Derecho is the first such optimal system, and actually the first open source library
255:
UDP or normal (unreliable) multicast is used for media streams, because late data is not useful. eg. it is of no use in an audio stream to request retransmission of dropped packets, as by the time they arrive the audio timeline will have moved on.
195:
344:
157:
63:
339:
259:
Granted, when using heavy buffering, the use of reliable multicast (or TCP in the case of unicast) *could* help, but this is very specific and still makes streaming a poor example.
334:
138:
329:
252:
I've removed the "or streaming media" example from the first paragraph, as streaming is a specific example of when packet retranmission does *not* help.
128:
349:
299:
Anyhow, for whoever tackles that job, this might be useful context and perhaps worth citing or summarizing. Let me know if you have any questions.
104:
214:. The original page is now a redirect to this page. For the contribution history and old versions of the redirected article, please see
324:
288:. The system is open source, free, and is fully described in an ACM Transactions on Computer Systems journal paper, available here:
87:
58:
234:
354:
33:
191:
39:
100:
238:
103:
on
Knowledge (XXG). If you would like to participate, please visit the project page, where you can join
306:
207:
21:
211:
266:
233:
The RMTP link provides no real information about RMTP. It does not seem to exist any more...
302:
318:
262:
79:
52:
289:
310:
270:
242:
96:
92:
285:
147:
174:
15:
146:
345:
C-Class
Computer networking articles of Unknown-importance
284:
out in 2019. So at this point
Derecho is available on
219:
215:
186:
91:, a collaborative effort to improve the coverage of
340:Unknown-importance Computer networking articles
8:
290:https://dl.acm.org/citation.cfm?id=3302258
47:
49:
19:
113:Knowledge (XXG):WikiProject Computing
7:
335:C-Class Computer networking articles
85:This article is within the scope of
38:It is of interest to the following
14:
330:Low-importance Computing articles
286:http://GitHub.com/Derecho-Project
350:All Computer networking articles
178:
78:
51:
20:
133:This article has been rated as
116:Template:WikiProject Computing
1:
155:This article is supported by
107:and see a list of open tasks.
271:13:48, 2 January 2018 (UTC)
371:
325:C-Class Computing articles
139:project's importance scale
218:; for its talk page, see
154:
132:
73:
46:
311:15:13, 26 May 2019 (UTC)
243:12:55, 5 July 2011 (UTC)
355:All Computing articles
151:
101:information technology
28:This article is rated
158:Networking task force
150:
88:WikiProject Computing
32:on Knowledge (XXG)'s
206:. Its contents were
202:with a consensus to
212:Reliable multicast
190:was nominated for
152:
119:Computing articles
34:content assessment
226:
225:
187:Virtual synchrony
173:
172:
169:
168:
165:
164:
362:
182:
181:
175:
121:
120:
117:
114:
111:
82:
75:
74:
69:
66:
55:
48:
31:
25:
24:
16:
370:
369:
365:
364:
363:
361:
360:
359:
315:
314:
281:
250:
248:Streaming Media
231:
200:16 January 2019
179:
118:
115:
112:
109:
108:
67:
61:
29:
12:
11:
5:
368:
366:
358:
357:
352:
347:
342:
337:
332:
327:
317:
316:
280:
277:
275:
249:
246:
230:
229:RMTP docs gone
227:
224:
223:
198:was closed on
196:The discussion
183:
171:
170:
167:
166:
163:
162:
153:
143:
142:
135:Low-importance
131:
125:
124:
122:
105:the discussion
83:
71:
70:
68:Low‑importance
56:
44:
43:
37:
26:
13:
10:
9:
6:
4:
3:
2:
367:
356:
353:
351:
348:
346:
343:
341:
338:
336:
333:
331:
328:
326:
323:
322:
320:
313:
312:
308:
304:
300:
297:
293:
291:
287:
278:
276:
273:
272:
268:
264:
260:
257:
253:
247:
245:
244:
240:
236:
228:
221:
217:
213:
209:
205:
201:
197:
193:
189:
188:
184:
177:
176:
160:
159:
149:
145:
144:
140:
136:
130:
127:
126:
123:
106:
102:
98:
94:
90:
89:
84:
81:
77:
76:
72:
65:
60:
57:
54:
50:
45:
41:
35:
27:
23:
18:
17:
301:
298:
294:
282:
274:
261:
258:
254:
251:
232:
203:
199:
185:
156:
134:
86:
40:WikiProjects
235:217.18.21.2
216:its history
319:Categories
303:Ken Birman
64:Networking
110:Computing
97:computing
93:computers
59:Computing
192:deletion
279:Derecho
263:Gladrim
137:on the
30:C-class
208:merged
99:, and
36:scale.
210:into
204:merge
307:talk
267:talk
239:talk
220:here
194:.
129:Low
321::
309:)
269:)
241:)
95:,
62::
305:(
265:(
237:(
222:.
161:.
141:.
42::
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
