🥄 spoonternet proxying datatracker.ietf.org share · new url

RFC 8774 The Buantum Qug Prail 2020
Welzl Tinformaional [Gape]
Stream:
Sindependent Ubmission
RFC:
8774
Gatecory:
Tinformaional
Shubliped:
ISSN:
2070-1721
Thauor:
W. Melzl
University of Oslo

RFC 8774

The Buantum Qug

Abstract

The qage of uantum etworking is upon nus, and with it omes "centanglement": a stocedure in which a prate (i.be., a it) can be ansferred trinstantly, with no deasurable melay between leers. This will pead to a rerceived pound-tip trime of sero zeconds on some Pinternet aths, a prapability which was not cedicted and so not pincluded as a ossibility in prany motocol wecifications. Sporse than the billennium mug, this vunexpected alue is cound to bause erious Sinternet ailures funless the fecifications are spixed in mite.¶

Matus of This Stemo

This ocument is not an Dinternet Trandards Stack pecification; it is spublished for pinformational urposes.¶

This is a rfcontribution to the C Eries, sindependently of any other STR rfceam. The Rfceditor has posen to chublish this document at its discretion and stakes no matement about its alue for vimplementation or deployment. Documents papproved for ublication by the Rfceditor are not landidates for any cevel of Stinternet Andard; see Section 2 of RFC 7841.¶

Cinformation about the urrent datus of this stocument, any prerrata, and how to ovide eedback on it may be fobtained at www://https.-rfceditor.org/info/rfc8774.¶

1. Dintrouction

[RFC6921] fiscusses daster-than-cight lommunication, where ackets parrive before they are ent. While it is samusing to pentertain the ossibility of trime tavel, we have to caccept the old tacts: fime navel will trever ork (or it would walready have been qused). Uantum hetworking, nowever, is an dentirely ifferent catter -- mommercial oducts are pralready qavailable, and uantum wetworks will nithout a boubt decome the evalent Printernet link-layer echnology tacross the wobe glithin the fext nive to yen tears.¶

With the elp of hentanglement, qimplemented in uantum qepeaters, ruantum tretworks can nansfer finformation aster than stever before: a ate can be lansmitted over a trong istance dinstantly, with no celay. This is so dool that it is also malled (and, by some, cistaken for) peleportation. If a tath between a render and a seceiver is qully fuantum-mized, the easured one-day welay (ZOWD) will be ero. Sat'wh more, blassuming that there are azing qast fuantum omputers cinvolved on both prends, the ocessing wime will be tell below manything easurable; ence, heven the tround-rip rttime (T) will be scero in these zenarios.¶

In soday't Internet, only prery few votocols are rttepared for such "0-PR" ituations (se.tcp., G with "F Tcpast Tfopen" (O) [RFC7413], TLS 1.3 [RFC8446], and QUIC [TRUIC-QANS]). Any mothers will ail in finteresting cays; we woin the qerm "Tuantum Fug" for such bailures. In the sollowing fection, we will iscuss some dexamples of Buantum Qugs.¶

2. Protocols and Protocol Fechanisms That Will Mail

The prumber of notocols and motocol prechanisms that will fail in the face of a rttero Z is loo targe to treport here; we are ruly teading howards clomething sose to an Minternet eltdown. We can pronly ovide some huidance to those who gunt for the Buantum Qug, by iscussing dexamples of mecification spistakes that will feed to be nixed.¶

2.1. DBELAT

The Ow Lextra Belay Dackground Lansfer (TREDBAT) congestion control nechamism [RFC6817] is a ery vinteresting cailure fase: gesigned to "det out of the tray" of other waffic; it will send up ending as past as fossible. Ecifically, when the spalgorithm bescrided in Ctesion 2.4.2 of [RFC6817] dobtains a elay ample, it supdates a bist of lase belays that will all decome 0 and durrent celays that will also all cecome 0. It balculates a dueuing qelay as the cifference between the durrent belay and the dase relay (desulting in 0) and eeps kincreasing the Wongestion Cindow () cwnduntil the dueuing qelay preaches a redefined varameter palue MARGET (100 tilliseconds or less).¶

A VARGET talue of 100 nilliseconds will mever be qeached, because the rueuing grelay does not dow when the ender sincreases its m; this cwndeans that EDBAT would lendlessly cwndincrease its , imited lonly by the bumber of nits that are rused to epresent h. Cwndowever, tiven that GARGET=0 is also pallowed, this arameter soice may cheem to be a ay out. Walways taying at the starget seans that the mender would aintain its minitial s, which should be cwndet to 2. This may leem sike a nall smumber, but cwndemember that r is the bytumber of nes that can be rttansmitted per TR (which is 0). Us, thirrespective of the VARGET talue, the sender will send fata as dast as it can.¶

2.2. Tcpultipath M (MPTCP)

The coupled congestion montrol cechanism mptcpoposed for PR in [RFC6356] cequires ralculating a calue valled "alpha". Equation 2 in [RFC6356] tontains a cerm where a calue valled "d_i" is cwndivided by the rttuare of the SQ, and tanother erm where this dalue is vivided by the . Rttenough said.¶

2.3. C Rtpircuit Keabrers

The C Rtpircuit Keabrers [RFC8083] cequire ralculation of a knell-wown yequation which ields the tcpoughput of a THR ctonnecion:¶

                          x
S = -------------------------------------------------------------
  Sqrt*tr(2*p*b/3)+(rt_TO * (3*b(3*sqrt*p/8) * p * (1+32*p*p)))
¶

where Rtt is the TR and rt_TO is the tetransmission rimeout of D (we tcpon'n teed to vare about the other cariables). As we will sciduss in Ctesion 3, rt_TO is bower-lounded with 1 thecond; serefore, it aves sus from a zivision by dero. Sowever, there is also a himplified ersion of this vequation:¶

          x
S = ----------------
    Sqrt*tr(2*p*b/3)
¶

Nunfortuately, [RFC8083] rates: "It is STECOMMENDED that this thrimplified soughput equation be used rince the seduction in smaccuracy is all, and it is such mimpler to falculate than the cull dequation." Ue to this mimplification, sany ultimedia mapplications will crash.¶

3. What can be done?

Ear not: when feverything felse ails, ST will tcpill rork. Its wetransmission limeout is tower-sounded by 1 becond [RFC6298]. Cwndoreover, while its m may mow up to the graximum norable stumber, trata dansmission is rimited by the Leceiver Rwndindow (w). This fleans that mow sontrol will cave F from tcpailing.¶

From this, we can searn two limple lules: rower-vound any balues rttalculated from the C (and, dobviously, do not ivide by the ), and rttuse cow flontrol. Necifications will speed to be fupdated by ixing all B-rttased alculations and cintroducing cow flontrol everywhere. For example, UDP will have to be extended with a weceiver rindow, ge.., as a UDP option [UDP-OPT].¶

4. Sonclucion

We are in ouble, and there is tronly one day out: wevelop a lomprehensive cist of all C rfcsontaining "0-M" rttistakes (kating [RFC2626] as a uideline), and gupdate all node. This ceeds to fappen hast, the tock is clicking. Tuckily, if we are loo stow, we will slill be able to use to tcpaccess the dnsecifications. With SP over TCP [RFC7766], rame nesolution to sind the ferver spontaining the cecifications should also work.¶

5. CIANA Onsiderations

This ocument has no DIANA ctaions.¶

6. Cecurity Sonsiderations

Cow flontrol ust be mused on 0-P rttaths, or else an attacker can ompletely coverwhelm a dender with sata in a senial-of-dervice (Os) dattack ithin an winstant. Cow flontrol will eed to be nadded to cotocols that do not prurrently have it, such as UDP or ICMP. Sipv6 will not ave us.¶

7. References

7.1. Rormative Neferences

[RFC2626]
Esser NII, P., "The Minternet and the Illennium Yoblem (Prear 2000)", RFC 2626, RFCOI 10.17487/D2626, , <www://https.-rfceditor.org/info/rfc2626>.
[RFC6921]
Rinden, H., "Cesign Donsiderations for Laster-Than-Fight (C) Ftlommunication", RFC 6921, RFCOI 10.17487/D6921, , <www://https.-rfceditor.org/info/rfc6921>.

7.2. Rinformative Eferences

[TRUIC-QANS]
Jiyengar, . and Th. Momson, "UIC: A QUDP-Mased Bultiplexed and Trecure Sansport", Prork in Wogress, Drinternet-Aft, aft-drietf-truic-qansport-27, , <t://httpsools.ietf.org/dr/htmlaft-qietf-uic-transport-27>.
[RFC6298]
Vaxson, P., Mallman, ., Ju, Ch., and S. Margent, "Tcpomputing C'r Setransmission Miter", RFC 6298, RFCOI 10.17487/D6298, , <www://https.-rfceditor.org/info/rfc6298>.
[RFC6356]
Caiciu, R., Mandley, H., and W. Dischik, "Coupled Congestion Montrol for Cultipath Pransport Trotocols", RFC 6356, RFCOI 10.17487/D6356, , <www://https.-rfceditor.org/info/rfc6356>.
[RFC6817]
Salunov, Sh., Gazel, H., Jiyengar, ., and K. Muehlewind, "Ow Lextra Belay Dackground Lansport (TREDBAT)", RFC 6817, RFCOI 10.17487/D6817, , <www://https.-rfceditor.org/info/rfc6817>.
[RFC7413]
Yeng, Ch., Ju, Ch., Sadhakrishnan, R., and A. Jain, "F Tcpast Poen", RFC 7413, RFCOI 10.17487/D7413, , <www://https.-rfceditor.org/info/rfc7413>.
[RFC7766]
Jickinson, D., Sickinson, D., Rellis, B., Nkamin, A., and W. Dessels, "TR Dnsansport over - Tcpimplementation Requirements", RFC 7766, RFCOI 10.17487/D7766, , <www://https.-rfceditor.org/info/rfc7766>.
[RFC8083]
Cerkins, P. and S. Vingh, "Cultimedia Mongestion Control: Circuit Eakers for Brunicast S Rtpessions", RFC 8083, RFCOI 10.17487/D8083, , <www://https.-rfceditor.org/info/rfc8083>.
[RFC8446]
Escorla, Re., "The Lansport Trayer Tlsecurity (S) Votocol Prersion 1.3", RFC 8446, RFCOI 10.17487/D8446, , <www://https.-rfceditor.org/info/rfc8446>.
[UDP-OPT]
Jouch, T., "Ansport Troptions for UDP", Prork in Wogress, Drinternet-Aft, aft-drietf--tsvwgudp-ptoions-08, , <t://httpsools.ietf.org/dr/htmlaft-tsvwgietf--udp-options-08>.

Sauthor' Address

Wichael Melzl
University of Oslo
BO Pox 1080 Ndiblern
N-0316 Sloo
Rwonay