25:
435:
Langley, Adam; Riddoch, Alistair; Wilk, Alyssa; Vicente, Antonio; Krasic, Charles; Zhang, Dan; Yang, Fan; Kouranov, Fedor; Swett, Ian; Iyengar, Janardhan; Bailey, Jeff; Dorfman, Jeremy; Roskind, Jim; Kulik, Joanna; Westin, Patrik; Tenneti, Raman; Shade, Robbie; Hamilton, Ryan; Vasiliev, Victor;
234:
and need to be retransmitted (and thus arrive out-of-order), data from sequentially later parts of the stream may be received before sequentially earlier parts of the stream; however, the later data cannot typically be used until the earlier data has been received, incurring
214:
is used; one is computed at the sender for each block of data before it is sent and checked at the receiver. Erroneous or missing data are reported to the sender, in order that it may retransmit the same. Any duplicated data items are discarded.
382:
Briscoe, Bob; Brunstrom, Anna; Petlund, Andreas; Hayes, David; Ros, David; Tsang, Ing-Jyh; Gjessing, Stein; Fairhurst, Gorry; Griwodz, Carsten; Welzl, Michael (2016). "Reducing
Internet Latency: A Survey of Techniques and Their Merits".
272:, with higher losses producing worse latency. Without changing the stream abstraction, reducing packet loss can reduce the harm from head-of-line blocking; an alternative is to implement the reliable byte stream using
247:
onto a single reliable byte stream, then head-of-line blocking can cause processing of a fully-received message that was sent later to wait for delivery of a message that was sent earlier. This affects, for example,
186:, which is used both to make sure that the data are delivered to the entity at the other end in the correct order, and to check for lost data items. The receiver sends back
175:
Communication protocols that implement reliable byte streams, generally over some unreliable lower level, use a number of mechanisms to provide that reliability.
167:) provide a reliable message stream, i.e. the data is divided up into distinct units, which are provided to the consumer of the data as discrete objects.
385:
268:
rather than stream transport, avoids this problem. The latency degradation from head-of-line blocking depends on the underlying packet loss rate and
507:
42:
141:
channel at the recipient are exactly the same, and in exactly the same order, as they were when the sender inserted them into the channel.
367:
Larry L. Peterson and Bruce S. Davie, Computer networks: a systems approach, 3rd edition, Morgan
Kaufmann Publishers, 1996, Section 6.2.
455:
160:
108:
474:
89:
61:
204:
46:
68:
149:
75:
545:
244:
240:
261:
57:
526:
285:
273:
176:
276:
to send redundant data so that a certain amount of loss can be tolerated without incurring retransmissions.
35:
145:
223:
425:
126:
82:
513:
461:
412:
253:
503:
451:
227:
493:
485:
441:
402:
394:
269:
236:
163:
which computer network communication protocols provide, however; other protocols (e.g.
539:
438:
Proceedings of the
Conference of the ACM Special Interest Group on Data Communication
416:
138:
517:
484:. Lecture Notes in Business Information Processing. Vol. 322. pp. 87–114.
465:
489:
231:
130:
24:
398:
303:
301:
473:
Marx, Robin; Wijnants, Maarten; Quax, Peter; Faes, Axel; Lamotte, Wim (2018).
446:
265:
210:
153:
531:. 3rd USENIX Workshop on Free and Open Communications on the Internet.
498:
475:"Web Performance Characteristics of HTTP/2 and Comparison to HTTP/1.1"
407:
257:
249:
436:
Chang, Wan-Teh; Shi, Zhongyi (2017). "The QUIC Transport
Protocol".
179:(ARQ) protocols have an important role for achieving reliability.
164:
134:
18:
307:
256:
multiple request–response pairs onto a single stream;
370:
Steve
Steinke, Network Tutorial, Elsevier, 2000, page 163.
198:
if an acknowledgement is not received within a reasonable
525:
Nowlan, Michael F.; Wolinsky, David; Ford, Bryan (2013).
319:
528:
Reducing
Latency in Tor Circuits with Unordered Delivery
190:
for data items that have been successfully received; a
331:
239:. If multiple independent higher-level messages are
49:. Unsourced material may be challenged and removed.
343:
16:In order and reliable delivery of bytewise data
202:, and the (presumably lost) data will then be
144:The classic example of a reliable byte stream
208:. To check that no data items are damaged, a
8:
386:IEEE Communications Surveys & Tutorials
355:
152:, one of the major building blocks of the
497:
445:
406:
109:Learn how and when to remove this message
482:Web Information Systems and Technologies
297:
226:can occur in reliable byte streams: if
159:A reliable byte stream is not the only
182:All data items are identified with a
7:
47:adding citations to reliable sources
14:
344:Nowlan, Wolinsky & Ford 2013
125:is a common service paradigm in
23:
34:needs additional citations for
1:
150:Transmission Control Protocol
490:10.1007/978-3-319-93527-0_5
194:at the sender will cause a
562:
399:10.1109/COMST.2014.2375213
424:Heijligers, Jaap (2021).
262:application-layer framing
161:reliable service paradigm
286:Automatic repeat request
274:forward error correction
177:Automatic repeat request
447:10.1145/3098822.3098842
146:communication protocol
137:which emerge from the
58:"Reliable byte stream"
228:packets are reordered
224:Head-of-line blocking
219:Head-of-line blocking
440:. pp. 183–196.
322:, pp. 184, 186.
123:reliable byte stream
43:improve this article
320:Langley et al. 2017
308:Briscoe et al. 2016
127:computer networking
546:Data transmission
509:978-3-319-93526-3
334:, pp. 22–23.
310:, pp. 29–30.
129:; it refers to a
119:
118:
111:
93:
553:
532:
521:
501:
479:
469:
449:
431:
420:
410:
393:(3): 2149–2196.
359:
353:
347:
341:
335:
332:Marx et al. 2018
329:
323:
317:
311:
305:
264:design and uses
188:acknowledgements
114:
107:
103:
100:
94:
92:
51:
27:
19:
561:
560:
556:
555:
554:
552:
551:
550:
536:
535:
524:
510:
477:
472:
458:
434:
423:
381:
378:
373:
363:
362:
356:Heijligers 2021
354:
350:
342:
338:
330:
326:
318:
314:
306:
299:
294:
282:
270:round-trip time
260:, which has an
237:network latency
221:
200:round trip time
184:sequence number
173:
115:
104:
98:
95:
52:
50:
40:
28:
17:
12:
11:
5:
559:
557:
549:
548:
538:
537:
534:
533:
522:
508:
470:
456:
432:
421:
377:
374:
372:
371:
368:
364:
361:
360:
348:
336:
324:
312:
296:
295:
293:
290:
289:
288:
281:
278:
220:
217:
205:re-transmitted
172:
169:
117:
116:
99:September 2007
31:
29:
22:
15:
13:
10:
9:
6:
4:
3:
2:
558:
547:
544:
543:
541:
530:
529:
523:
519:
515:
511:
505:
500:
495:
491:
487:
483:
476:
471:
467:
463:
459:
457:9781450346535
453:
448:
443:
439:
433:
429:
428:
427:Tor over QUIC
422:
418:
414:
409:
404:
400:
396:
392:
388:
387:
380:
379:
375:
369:
366:
365:
358:, p. 65.
357:
352:
349:
345:
340:
337:
333:
328:
325:
321:
316:
313:
309:
304:
302:
298:
291:
287:
284:
283:
279:
277:
275:
271:
267:
263:
259:
255:
251:
246:
242:
238:
233:
229:
225:
218:
216:
213:
212:
207:
206:
201:
197:
193:
189:
185:
180:
178:
170:
168:
166:
162:
157:
155:
151:
147:
142:
140:
139:communication
136:
133:in which the
132:
128:
124:
113:
110:
102:
91:
88:
84:
81:
77:
74:
70:
67:
63:
60: –
59:
55:
54:Find sources:
48:
44:
38:
37:
32:This article
30:
26:
21:
20:
527:
481:
437:
426:
390:
384:
376:Bibliography
351:
346:, p. 6.
339:
327:
315:
241:encapsulated
222:
209:
203:
199:
195:
191:
187:
183:
181:
174:
158:
143:
122:
120:
105:
96:
86:
79:
72:
65:
53:
41:Please help
36:verification
33:
245:multiplexed
131:byte stream
499:1942/26146
292:References
69:newspapers
430:(Thesis).
417:206576469
408:2164/8018
171:Mechanism
540:Category
518:52009597
280:See also
266:datagram
252:, which
211:checksum
154:Internet
466:2768765
196:timeout
148:is the
83:scholar
516:
506:
464:
454:
415:
258:HTTP/3
254:frames
250:HTTP/2
85:
78:
71:
64:
56:
514:S2CID
478:(PDF)
462:S2CID
413:S2CID
192:timer
135:bytes
90:JSTOR
76:books
504:ISBN
452:ISBN
243:and
232:lost
165:SCTP
62:news
494:hdl
486:doi
442:doi
403:hdl
395:doi
230:or
45:by
542::
512:.
502:.
492:.
480:.
460:.
450:.
411:.
401:.
391:18
389:.
300:^
156:.
121:A
520:.
496::
488::
468:.
444::
419:.
405::
397::
112:)
106:(
101:)
97:(
87:·
80:·
73:·
66:·
39:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
