Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Transmission Control Protocol
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Other documents=== * {{ cite journal | doi = 10.1145/316194.316230 | doi-access = free | title = On estimating end-to-end network path properties | date = October 1999 | last1 = Allman | first1 = Mark | last2 = Paxson | first2 = Vern | author2link = Vern Paxson | journal = ACM SIGCOMM Computer Communication Review | volume = 29 | issue = 4 | pages = 263โ274 | hdl = 2060/20000004338 | hdl-access = free }} * {{ cite book | doi = 10.1145/3083165.3083175 | chapter = Not so QUIC: A Performance Study of DASH over QUIC | date = June 2017 | title = NOSSDAV'17: Proceedings of the 27th Workshop on Network and Operating Systems Support for Digital Audio and Video | pages = 13โ18 | last1 = Bhat | first1 = Divyashri | last2 = Rizk | first2 = Amr | last3 = Zink | first3 = Michael | s2cid = 32671949 }} * {{ cite journal | doi = 10.1145/510726.510728 | url = https://www.icir.org/mallman/pubs/BA02/BA02.pdf | title = On making TCP more robust to packet reordering | date = January 2002 | journal = ACM SIGCOMM Computer Communication Review | last1 = Blanton | first1 = Ethan | last2 = Allman | first2 = Mark | volume = 32 | pages = 20โ30 | s2cid = 15305731 }} * {{ cite journal | doi = 10.1109/COMST.2014.2375213 | title = Reducing Internet Latency: A Survey of Techniques and Their Merits | year = 2016 | last1 = Briscoe | first1 = Bob | last2 = Brunstrom | first2 = Anna | last3 = Petlund | first3 = Andreas | last4 = Hayes | first4 = David | last5 = Ros | first5 = David | last6 = Tsang | first6 = Ing-Jyh | last7 = Gjessing | first7 = Stein | last8 = Fairhurst | first8 = Gorry | last9 = Griwodz | first9 = Carsten | last10 = Welzl | first10 = Michael | journal = [[IEEE Communications Surveys & Tutorials]] | volume = 18 | issue = 3 | pages = 2149โ2196 | hdl = 2164/8018 | hdl-access = free | s2cid = 206576469 }} * {{ cite journal | doi = 10.1145/279345.279350 | doi-access = | journal = ACM SIGCOMM Computer Communication Review | title = Experimentations with TCP selective acknowledgment | date = April 1998 | last1 = Bruyeron | first1 = Renaud | last2 = Hemon | first2 = Bruno | last3 = Zhang | first3 = Lixa | volume = 28 | issue = 2 | pages = 54โ77 | s2cid = 15954837}} * {{ cite journal | doi = 10.1007/s00145-021-09389-w | doi-access = free | title = Secure Communication Channel Establishment: TLS 1.3 (Over TCP Fast Open) versus QUIC | year = 2021 | last1 = Chen | first1 = Shan | last2 = Jero | first2 = Samuel | last3 = Jagielski | first3 = Matthew | last4 = Boldyreva | first4 = Alexandra | last5 = Nita-Rotaru | first5 = Cristina | journal = [[Journal of Cryptology]] | volume = 34 | issue = 3 | s2cid = 235174220 }} * {{ cite web | url = https://lwn.net/Articles/667059/ | title = Checksum offloads and protocol ossification | date = 8 December 2015 | last = Corbet | first = Jonathan | work = [[LWN.net]] }} * {{ cite web | url = https://lwn.net/Articles/745590/ | title = QUIC as a solution to protocol ossification | work = [[LWN.net]] | date = 29 January 2018 | last = Corbet | first = Jonathan }} * {{ cite conference | doi = 10.23919/TMA.2019.8784690 | title = A Bottom-Up Investigation of the Transport-Layer Ossification | date = 2019 | conference = 2019 Network Traffic Measurement and Analysis Conference (TMA) | last1 = Edeline | first1 = Korian | last2 = Donnet | first2 = Benoit }} * {{ cite web | url = https://blog.cloudflare.com/the-road-to-quic/ | title = The Road to QUIC | date = 26 July 2018 | publisher = [[Cloudflare]] | last = Ghedini | first = Alessandro | work = The Cloudflare Blog }} * {{ cite conference | url = https://www.cs.helsinki.fi/u/gurtov/papers/heuristics.pdf | title = Resolving Acknowledgment Ambiguity in non-SACK TCP | last1 = Gurtov | first1 = Andrei | last2 = Floyd | first2 = Sally | author2link = Sally Floyd | date = February 2004 | conference = Next Generation Teletraffic and Wired/Wireless Advanced Networking (NEW2AN'04) }} * {{ cite conference | url = https://www.cs.helsinki.fi/u/gurtov/papers/infocom03.pdf | title = Responding to Spurious Timeouts in TCP | last1 = Gurtov | first1 = Andrei | last2 = Ludwig | first2 = Reiner | doi = 10.1109/INFCOM.2003.1209251 | date = 2003 | conference = IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies }} * {{ cite conference | doi = 10.1145/2535828.2535830 | title = Are TCP extensions middlebox-proof? | date = 2013 | conference = HotMiddlebox '13 | last1 = Hesmans | first1 = Benjamin | last2 = Duchene | first2 = Fabien | last3 = Paasch | first3 = Christoph | last4 = Detal | first4 = Gregory | last5 = Bonaventure | first5 = Olivier | citeseerx = 10.1.1.679.6364 }} * {{ cite web | url = https://http2.github.io/faq/ | title = HTTP/2 Frequently Asked Questions |author = IETF HTTP Working Group }} * {{ cite journal | doi = 10.1145/118544.118549 | doi-access = free | title = Improving round-trip time estimates in reliable transport protocols | last1 = Karn | first1 = Phil | author1link = Phil Karn | last2 = Partridge | first2 = Craig | author2link = Craig Partridge | date = November 1991 | journal = ACM Transactions on Computer Systems | volume = 9 | issue = 4 | pages = 364โ373 }} * {{ cite journal | doi = 10.1145/505688.505692 | doi-access = free | title = The Eifel algorithm: making TCP robust against spurious retransmissions | date = January 2000 | last1 = Ludwig | first1 = Reiner | last2 = Katz | first2 = Randy Howard | author2link = Randy Katz | journal = ACM SIGCOMM Computer Communication Review }} * {{ cite web | url = https://calendar.perfplanet.com/2020/head-of-line-blocking-in-quic-and-http-3-the-details/ | title = Head-of-Line Blocking in QUIC and HTTP/3: The Details | last = Marx | first = Robin | date = 3 December 2020 }} * {{ cite journal | doi = 10.1145/2578901 | title = Multipath TCP | last1 = Paasch | first1 = Christoph | last2 = Bonaventure | first2 = Olivier | date = 1 April 2014 | journal = [[Communications of the ACM]] | volume = 57 | issue = 4 | pages = 51โ57 | s2cid = 17581886 }} * {{ cite journal | doi = 10.1109/COMST.2016.2626780 | title = De-Ossifying the Internet Transport Layer: A Survey and Future Perspectives | date = 2017 | journal = [[IEEE Communications Surveys & Tutorials]] | last1 = Papastergiou | first1 = Giorgos | last2 = Fairhurst | first2 = Gorry | last3 = Ros | first3 = David | last4 = Brunstrom | first4 = Anna | last5 = Grinnemo | first5 = Karl-Johan | last6 = Hurtig | first6 = Per | last7 = Khademi | first7 = Naeem | last8 = Tรผxen | first8 = Michael | last9 = Welzl | first9 = Michael | last10 = Damjanovic | first10 = Dragana | last11 = Mangiante | first11 = Simone | volume = 19 | pages = 619โ639 | hdl = 2164/8317 | s2cid = 1846371 | hdl-access = free }} * {{ cite web | url = https://lwn.net/Articles/814522/ | title = A QUIC look at HTTP/3 | date = 13 March 2020 | last = Rybczyลska | first = Marta | work = [[LWN.net]] }} * {{ Cite journal | arxiv = 1905.03518 | last1 = Sy | first1 = Erik | last2 = Mueller | first2 = Tobias | last3 = Burkert | first3 = Christian | last4 = Federrath | first4 = Hannes | last5 = Fischer | first5 = Mathias | title = Enhanced Performance and Privacy for TLS over TCP Fast Open | journal = Proceedings on Privacy Enhancing Technologies | year = 2020 | volume = 2020 | issue = 2 | pages = 271โ287 | doi = 10.2478/popets-2020-0027 | doi-access = free }} * {{ cite journal | doi = 10.1145/1013812.18216 | doi-access = | title = Why TCP timers don't work well | last = Zhang | first = Lixia | authorlink = Lixia Zhang | date = 5 August 1986 | journal = ACM SIGCOMM Computer Communication Review | volume = 16 | issue = 3 | pages = 397โ405 }}
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)