article

Fragmentation considered harmful

Authors:

C. A. Kent and

J. C. MogulAuthors Info & Claims

ACM SIGCOMM Computer Communication Review, Volume 17, Issue 5

Pages 390 - 401

https://doi.org/10.1145/55483.55524

Published: 01 August 1987 Publication History

Abstract

Internetworks can be built from many different kinds of networks, with varying limits on maximum packet size. Throughput is usually maximized when the largest possible packet is sent; unfortunately, some routes can carry only very small packets. The IP protocol allows a gateway to fragment a packet if it is too large to be transmitted. Fragmentation is at best a necessary evil; it can lead to poor performance or complete communication failure. There are a variety of ways to reduce the likelihood of fragmentation; some can be incorporated into existing IP implementations without changes in protocol specifications. Others require new protocols, or modifications to existing protocols.

Cited By

View all

Behnke IBlumschein CDanicki RWiesner PThamsen LKao O(2023)Towards a real-time IoT: Approaches for incoming packet processing in cyber–physical systemsJournal of Systems Architecture10.1016/j.sysarc.2023.102891140(102891)Online publication date: Jul-2023
https://doi.org/10.1016/j.sysarc.2023.102891
Blumschein CBehnke IThamsen LKao O(2022)Differentiating Network Flows for Priority-Aware Scheduling of Incoming Packets in Real-Time IoT Systems2022 IEEE 25th International Symposium On Real-Time Distributed Computing (ISORC)10.1109/ISORC52572.2022.9812841(1-8)Online publication date: 17-May-2022
https://doi.org/10.1109/ISORC52572.2022.9812841
Hussain MJamwal SMirza THassan M(2021)Taxonomy of Computer Network Congestion Control/Avoidance MethodsManaging Resources for Futuristic Wireless Networks10.4018/978-1-5225-9493-2.ch008(178-212)Online publication date: 2021
https://doi.org/10.4018/978-1-5225-9493-2.ch008
Show More Cited By

Index Terms

Fragmentation considered harmful
1. Networks
  1. Network architectures
  2. Network protocols

Recommendations

Fragmentation Considered Vulnerable

We show that fragmented IPv4 and IPv6 traffic is vulnerable to effective interception and denial-of-service (DoS) attacks by an off-path attacker. Specifically, we demonstrate a weak attacker intercepting more than 80% of the data between peers and ...
Read More
Fragmentation considered harmful
Special twenty-fifth anniversary issue. Highlights from 25 years of the Computer Communication Review

Internetworks can be built from many different kinds of networks, with varying limits on maximum packet size. Throughput is usually maximized when the largest possible packet is sent; unfortunately, some routes can carry only very small packets. The IP ...
Read More
Fragmentation considered harmful
SIGCOMM '87: Proceedings of the ACM workshop on Frontiers in computer communications technology

Internetworks can be built from many different kinds of networks, with varying limits on maximum packet size. Throughput is usually maximized when the largest possible packet is sent; unfortunately, some routes can carry only very small packets. The IP ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM SIGCOMM Computer Communication Review

ACM SIGCOMM Computer Communication Review Volume 17, Issue 5

Oct./Nov. 1987

397 pages

ISSN:0146-4833

DOI:10.1145/55483

Editor:
J. J. Garcia-Luna-Aceves
SRI International, Menlo Park, CA

Issue’s Table of Contents

SIGCOMM '87: Proceedings of the ACM workshop on Frontiers in computer communications technology
August 1987
409 pages
ISBN:0897912454
DOI:10.1145/55482
Editor:
J. J. Garcia-Luna-Aceves
SRI International, Menlo Park, CA

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1987

Published in SIGCOMM-CCR Volume 17, Issue 5

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

129
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

View all

Behnke IBlumschein CDanicki RWiesner PThamsen LKao O(2023)Towards a real-time IoT: Approaches for incoming packet processing in cyber–physical systemsJournal of Systems Architecture10.1016/j.sysarc.2023.102891140(102891)Online publication date: Jul-2023
https://doi.org/10.1016/j.sysarc.2023.102891
Blumschein CBehnke IThamsen LKao O(2022)Differentiating Network Flows for Priority-Aware Scheduling of Incoming Packets in Real-Time IoT Systems2022 IEEE 25th International Symposium On Real-Time Distributed Computing (ISORC)10.1109/ISORC52572.2022.9812841(1-8)Online publication date: 17-May-2022
https://doi.org/10.1109/ISORC52572.2022.9812841
Hussain MJamwal SMirza THassan M(2021)Taxonomy of Computer Network Congestion Control/Avoidance MethodsManaging Resources for Futuristic Wireless Networks10.4018/978-1-5225-9493-2.ch008(178-212)Online publication date: 2021
https://doi.org/10.4018/978-1-5225-9493-2.ch008
Völker TTüxen MRathgeb E(2021)The search of the path MTU with QUICProceedings of the 2021 Workshop on Evolution, Performance and Interoperability of QUIC10.1145/3488660.3493805(22-28)Online publication date: 7-Dec-2021
https://dl.acm.org/doi/10.1145/3488660.3493805
Zheng XLu CPeng JYang QZhou DLiu BMan KHao SDuan HQian ZCapkun SRoesner F(2020)Poison over troubled forwardersProceedings of the 29th USENIX Conference on Security Symposium10.5555/3489212.3489245(577-593)Online publication date: 12-Aug-2020
https://dl.acm.org/doi/10.5555/3489212.3489245
Subbaraman R(2019)Rate limitable and efficient discovery of path maximum transmission unitsInternational Journal of Communication Systems10.1002/dac.390532:6Online publication date: 5-Feb-2019
https://doi.org/10.1002/dac.3905
Gohring MShulman HWaidner M(2018)Path MTU Discovery Considered Harmful2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS.2018.00088(866-874)Online publication date: Jul-2018
https://doi.org/10.1109/ICDCS.2018.00088
Handley MRaiciu CAgache AVoinescu AMoore AAntichi GWójcik M(2017)Re-architecting datacenter networks and stacks for low latency and high performanceProceedings of the Conference of the ACM Special Interest Group on Data Communication10.1145/3098822.3098825(29-42)Online publication date: 7-Aug-2017
https://dl.acm.org/doi/10.1145/3098822.3098825
Zhu LHu ZHeidemann JWessels DMankin ASomaiya N(2015)Connection-Oriented DNS to Improve Privacy and SecurityProceedings of the 2015 IEEE Symposium on Security and Privacy10.1109/SP.2015.18(171-186)Online publication date: 17-May-2015
https://dl.acm.org/doi/10.1109/SP.2015.18
Ok SKim JKim JChoi J(2014)Optimum resource allocation with fairness using opportunistic channel gain for LMS channel32nd AIAA International Communications Satellite Systems Conference10.2514/6.2014-4479Online publication date: 1-Aug-2014
https://doi.org/10.2514/6.2014-4479
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

Fragmentation Considered Vulnerable