Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3488660.3493805acmconferencesArticle/Chapter ViewAbstractPublication PagesconextConference Proceedingsconference-collections
research-article

The search of the path MTU with QUIC

Published: 07 December 2021 Publication History

Abstract

A data sender in an IP based network is only capable to efficiently use a network path if it knows the packet size limit of the path, i.e., the Path Maximum Transmission Unit (PMTU). The IETF recently specified a PMTU discovery framework for transport protocols like QUIC. This paper complements this specification by presenting a search algorithm. In addition, it defines several metrics and shows results of analyses for the algorithm with various PMTU candidate sequences using these metrics. We integrated the PMTU discovery with our algorithm into a QUIC simulation model. This paper describes the integration and presents measurements obtained by simulations.

References

[1]
Shane Alcock and Richard Nelson. 2010. An Analysis of TCP Maximum Segment Sizes. Technical Report. Retrieved October 20, 2021 from https://wand.net.nz/sites/default/files/mss_ict11.pdf
[2]
Zoltan Bojthe, Levente Meszaros, György Szászkő, Rudolf Hornig, Andras Varga, and Attila Török. 2021. INET Framework. Retrieved June 26, 2021 from https://inet.omnetpp.org/
[3]
Ron Bonica, Fred Baker, Geoff Huston, Bob Hinden, Ole Trøan, and Fernando Gont. 2020. IP Fragmentation Considered Fragile. RFC 8900.
[4]
David A. Borman, Dr. Steve E. Deering, and Bob Hinden. 1999. IPv6 Jumbograms. RFC 2675.
[5]
Ana Custura, Gorry Fairhurst, and Iain Learmonth. 2018. Exploring Usable Path MTU in the Internet. In 2018 Network Traffic Measurement and Analysis Conference (TMA) (Vienna, Austria) (TMA '18). IEEE, 1--8.
[6]
Maikel de Boer and Jeffrey Bosma. 2012. Discovering Path MTU Black Holes on the Internet Using the RIPE Atlas. Technical Report. Retrieved October 21, 2021 from https://www.nlnetlabs.nl/downloads/publications/pmtu-black-holes-msc-thesis.pdf
[7]
Dr. Steve E. Deering and Bob Hinden. 2017. Internet Protocol, Version 6 (IPv6) Specification. RFC 8200.
[8]
Dr. Steve E. Deering and Jeffrey Mogul. 1990. Path MTU discovery. RFC 1191.
[9]
Ralph Droms and Steve Alexander. 1997. DHCP Options and BOOTP Vendor Extensions. RFC 2132.
[10]
Gorry Fairhurst, Tom Jones, Michael Tüxen, Irene Rüngeler, and Timo Völker. 2020. Packetization Layer Path MTU Discovery for Datagram Transports. RFC 8899.
[11]
Matthias Göhring, Haya Shulman, and Michael Waidner. 2018. Path MTU Discovery Considered Harmful. In 2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS). 866--874.
[12]
IEEE. 2018. IEEE Standard for Ethernet. IEEE Std 802.3-2018 (Revision of IEEE Std 802.3-2015 (August 2018).
[13]
Jana Iyengar and Ian Swett. 2021. QUIC Loss Detection and Congestion Control. RFC 9002.
[14]
Jana Iyengar and Martin Thomson. 2021. QUIC: A UDP-Based Multiplexed and Secure Transport. RFC 9000.
[15]
Christopher A. Kent and Jeffrey C. Mogul. 1987. Fragmentation Considered Harmful. In Proceedings of the ACM Workshop on Frontiers in Computer Communications Technology (Stowe, Vermont, USA) (SIGCOMM '87). Association for Computing Machinery, New York, NY, USA, 390--401.
[16]
OpenSim Ltd. 2021. OMNeT++. Retrieved June 26, 2021 from https://omnetpp.org/
[17]
Matthew Luckie, Kenjiro Cho, and Bill Owens. 2005. Inferring and Debugging Path MTU Discovery Failures. In Internet Measurement Conference 2005 (IMC 05). USENIX Association, Berkeley, CA. https://www.usenix.org/conference/imc-05/inferring-and-debugging-path-mtu-discovery-failures
[18]
Matthew Luckie and Ben Stasiewicz. 2010. Measuring Path MTU Discovery Behaviour. In Proceedings of the 10th ACM SIGCOMM Conference on Internet Measurement (Melbourne, Australia) (IMC '10). Association for Computing Machinery, New York, NY, USA, 102--108.
[19]
Matt Mathis and John Heffner. 2007. Packetization Layer Path MTU Discovery. RFC 4821.
[20]
Jack McCann, Stephen E. Deering, Jeffrey Mogul, and Bob Hinden. 2017. Path MTU Discovery for IP version 6. RFC 8201.
[21]
Alberto Medina, Mark Allman, and Sally Floyd. 2005. Measuring the Evolution of Transport Protocols in the Internet. SIGCOMM Comput. Commun. Rev. 35, 2 (April 2005), 37--52.
[22]
Kazuho Oku and Jana Iyengar. 2020. Can QUIC match TCP's computational efficiency? Retrieved September 23, 2021 from https://www.fastly.com/blog/measuring-quic-vs-tcp-computational-efficiency
[23]
Jon Postel. 1981. Internet Protocol. RFC 791.
[24]
William A. Simpson, Dr. Thomas Narten, Erik Nordmark, and Hesham Soliman. 2007. Neighbor Discovery for IP version 6 (IPv6). RFC 4861.
[25]
Timo Völker, Ekaterina Volodina, Michael Tüxen, and Erwin P. Rathgeb. 2020. A QUIC Simulation Model for INET and its Application to the Acknowledgment Ratio Issue. In 2020 IFIP Networking Conference (Networking) (Paris, France) (IFIP '20). IEEE, 737--742.

Cited By

View all
  • (2024)ATVITSC: A Novel Encrypted Traffic Classification Method Based on Deep LearningIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.343344619(9374-9389)Online publication date: 1-Jan-2024
  • (2024)Impact of PTB Message Usage on Path MTU Discovery for QUIC2024 IEEE 49th Conference on Local Computer Networks (LCN)10.1109/LCN60385.2024.10639721(1-7)Online publication date: 8-Oct-2024
  • (2023)Packet Too Big Detection and its Integration into QUIC2023 16th International Conference on Signal Processing and Communication System (ICSPCS)10.1109/ICSPCS58109.2023.10261130(1-10)Online publication date: 6-Sep-2023

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
EPIQ '21: Proceedings of the 2021 Workshop on Evolution, Performance and Interoperability of QUIC
December 2021
45 pages
ISBN:9781450391351
DOI:10.1145/3488660
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 December 2021

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. QUIC
  2. evaluation
  3. path MTU discovery
  4. search algorithm
  5. simulation
  6. transport protocol

Qualifiers

  • Research-article

Conference

CoNEXT '21
Sponsor:

Acceptance Rates

EPIQ '21 Paper Acceptance Rate 6 of 8 submissions, 75%;
Overall Acceptance Rate 6 of 8 submissions, 75%

Upcoming Conference

CoNEXT '24

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)31
  • Downloads (Last 6 weeks)2
Reflects downloads up to 09 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2024)ATVITSC: A Novel Encrypted Traffic Classification Method Based on Deep LearningIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.343344619(9374-9389)Online publication date: 1-Jan-2024
  • (2024)Impact of PTB Message Usage on Path MTU Discovery for QUIC2024 IEEE 49th Conference on Local Computer Networks (LCN)10.1109/LCN60385.2024.10639721(1-7)Online publication date: 8-Oct-2024
  • (2023)Packet Too Big Detection and its Integration into QUIC2023 16th International Conference on Signal Processing and Communication System (ICSPCS)10.1109/ICSPCS58109.2023.10261130(1-10)Online publication date: 6-Sep-2023

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media