Fact-checked by Grok 2 weeks ago

Network packet

A network packet is a formatted unit of that serves as the basic unit of transmission in packet-switched computer networks, such as the , consisting of a header containing control and a payload carrying the actual user . These packets enable efficient transfer by breaking larger messages into smaller, independently routable units, which are then reassembled at the destination. The structure of a network packet typically includes a header with fields for and destination addresses, identifiers, sequence numbers, error-checking codes, and sometimes options for or fragmentation control, followed by the variable-length that encapsulates higher-layer data such as segments from transport protocols like or . For example, in the (IP), the header is 20 bytes long in its basic form (IPv4) and includes fields like the 32-bit and destination addresses, a time-to-live () value to prevent infinite looping, and a for header integrity. Payload sizes are constrained by the network's (MTU), often 1500 bytes for Ethernet, leading to fragmentation if larger data units are needed. Network packets operate within packet-switched networks by being forwarded hop-by-hop through routers or switches based on their header information, allowing multiple communication streams to share efficiently without dedicated circuits. This process introduces potential delays from (packet size divided by link ), (distance over signal speed), and queuing at congested nodes, but it provides through alternate if paths fail. In the TCP/IP suite, packets form the core of internetwork communication, with higher layers adding reliability or atop this unreliable, mechanism.

Basic Concepts

Definition and Purpose

A network packet is a formatted unit of data that serves as the fundamental building block in packet-switched networks, consisting of a containing the actual and control information for and delivery. This structure allows each packet to be transmitted independently from the origin to the destination, potentially taking different paths through the network without requiring a pre-established end-to-end . The primary purpose of network packets is to enable efficient of multiple communications over shared network links, where is dynamically allocated among users as needed rather than reserved exclusively. Packets also recovery mechanisms, such as retransmission of lost or corrupted units at higher layers, enhancing reliability in unreliable transmission media. Furthermore, this approach facilitates in large networks like the by allowing incremental expansion and handling variable traffic loads without dedicated infrastructure for each session. In contrast to circuit-switched networks, which establish a fixed, dedicated path for the duration of a communication and thus allocate resources statically even during idle periods, packet switching provides dynamic resource allocation, reducing waste and improving utilization. This innovation was first conceptualized in the 1960s for resilient military communications; Paul Baran proposed distributed adaptive message block switching in 1964 as part of RAND Corporation research, while Donald Davies independently developed the idea of packet switching in 1965 at the National Physical Laboratory in the UK. These concepts were pivotal in the design of ARPANET, the precursor to the modern Internet, launched in the late 1960s.

Types of Packets

Network packets are primarily categorized by their transmission semantics into and stream-oriented types, each suited to different reliability and ordering requirements in network communication. Datagram packets operate in a connectionless manner, where each packet is transmitted independently without prior setup or ongoing state management between sender and receiver. This independence means , such as those used by over , offer no guarantees for delivery, ordering, or error correction, allowing for low-latency transmission in scenarios where occasional loss is tolerable. The connectionless nature of datagrams enables , which minimizes protocol overhead by avoiding acknowledgments and retransmissions but introduces the risk of or reordering during transit. In contrast, stream-oriented packets form part of a , establishing a logical that ensures sequenced, reliable through mechanisms like acknowledgments and retransmissions. For example, TCP segments encapsulated within IP packets provide this stream-oriented service, treating data as a continuous byte rather than discrete units. This approach adds sequencing and reliability features, making it ideal for applications such as file transfers where is paramount. Packets can also be distinguished by their length characteristics, with fixed-length and variable-length designs balancing efficiency and adaptability. Fixed-length packets, like ATM cells consisting of exactly 53 bytes (5-byte header and 48-byte ), facilitate predictable processing and reduced in switches due to their uniform size. This fixed structure enhances efficiency in high-speed environments by simplifying buffering and scheduling, though it may require for smaller payloads. Variable-length packets, on the other hand, offer greater flexibility to accommodate diverse data sizes without unnecessary , as seen in Ethernet frames with payloads up to 1500 bytes under the standard MTU. This variability supports efficient use of bandwidth for varied application needs, though it can complicate switch processing compared to fixed formats.

Packet Structure

Header Components

The header of a network packet contains essential control information that enables routing, delivery, and processing across networks. This metadata precedes the payload and includes fields specifying the packet's origin, destination, protocol version, and handling instructions, ensuring packets can be independently forwarded without relying on the underlying data content. Key fields in packet headers include source and destination addresses, which identify the sender and intended receiver; for example, in the Internet Protocol version 4 (IPv4), these are 32-bit addresses, while in version 6 (IPv6), they are 128-bit addresses to support a larger address space. The protocol identifier field, known as the "Protocol" field in IPv4 or "Next Header" in IPv6, demultiplexes the packet to the appropriate upper-layer protocol, such as TCP or UDP, by assigning numeric values to indicate the encapsulated protocol. A length field specifies the packet's size: IPv4 uses a 16-bit "Total Length" for the entire datagram in octets, while IPv6 employs a 16-bit "Payload Length" for the data portion excluding the header. To prevent infinite loops in , headers incorporate a time-to-live () field in IPv4, an 8-bit value decremented at each hop and set to zero to discard the packet, or a hop limit in serving the same purpose. Priority and type of service (TOS) fields support (QoS) mechanisms; in IPv4, the 8-bit TOS octet has been repurposed as the Differentiated Services (DS) field, where the 6-bit Differentiated Services Code Point (DSCP) encodes per-hop behaviors for traffic prioritization, such as low delay or high throughput. integrates similar functionality in its 8-bit "Traffic Class" field, which includes DSCP for QoS differentiation. The version field, a 4-bit indicator, specifies the protocol version—value 4 for and 6 for —allowing nodes to parse the correct header format, as headers are fixed at 40 octets unlike the variable 20-60 octets in IPv4. For packets that may require fragmentation, an offset field in IPv4 (13 bits, in 8-octet units) indicates the fragment's position relative to the original , aiding reassembly at the destination. Headers introduce overhead, typically 20-60 bytes depending on the and options, which supports independent but increases costs for small payloads. In layered protocols, outer headers from encapsulation add further control fields atop inner ones, enhancing modularity.

Payload and Fragmentation

The payload of a network packet refers to the data portion that carries the actual , such as an application-layer message or content from higher protocols, positioned immediately after the header. This section is variable in length and constrained by the Maximum Transmission Unit (MTU) of the underlying link, which defines the largest packet size that can be transmitted without fragmentation; for instance, standard Ethernet networks support an MTU of 1500 bytes. The payload excludes any control information in the header, ensuring efficient data transport while adhering to -specific formats. Fragmentation occurs when a packet's total size, including payload, exceeds the MTU of an outgoing link, necessitating the division of the original packet into smaller fragments for transmission. In IPv4, this process involves splitting the data on 8-octet boundaries, with each fragment receiving a copy of the original header modified to include an identification field for matching, a more-fragments (MF) flag set to 1 for all but the last fragment, and a 13-bit fragment offset field indicating the position of the fragment's data in the original datagram, measured in units of 8 octets. Reassembly at the destination host combines fragments sharing the same identification, source and destination addresses, and protocol, using the offsets to reconstruct the full datagram once the final fragment (MF=0) arrives, typically within a 15-second timer to discard incomplete sets. IPv6 modifies this approach to minimize fragmentation by design, restricting it to the source host via a dedicated Fragment Header rather than intermediate routers, and employing 8-octet alignment with a 13-bit offset and 1-bit M flag similar to IPv4 but with a 32-bit field. To avoid fragmentation altogether, IPv6 mandates the use of (PMTUD), where the source initially assumes the first-hop MTU and adjusts packet sizes downward upon receiving "Packet Too Big" messages, probing for increases periodically while maintaining a minimum link MTU of 1280 octets. Fragmentation introduces performance overhead by requiring additional header processing per fragment and delaying delivery until reassembly completes, which can increase especially on high-speed or lossy links where even a single lost fragment triggers retransmission of the entire original packet. It also heightens to attacks, such as overlapping fragment exploits where subsequent fragments overwrite prior data to evade filters or exhaust resources, as seen in tiny fragment or reassembly scenarios that manipulate offsets and flags to cause system crashes or bypass .

Trailer and Error Detection

In network packets, the trailer consists of optional fields appended after the payload to facilitate integrity verification during transmission. These elements primarily include error-detecting codes that allow the receiver to identify corruption without correcting it. A prominent example is the Frame Check Sequence (FCS) in Ethernet frames, which employs a 32-bit Cyclic Redundancy Check (CRC-32) computed using the polynomial x^{32} + x^{26} + x^{23} + x^{22} + x^{16} + x^{12} + x^{11} + x^{10} + x^{8} + x^{7} + x^{5} + x^{4} + x^{2} + x + 1. This CRC is generated by the sender over the entire frame (excluding the FCS itself) and recalculated by the receiver; a mismatch indicates errors from noise, interference, or hardware faults. Common error detection methods in trailers leverage mathematical to detect alterations. bits provide a basic approach, adding a single bit to make the total number of 1s in a even (even ) or odd (odd ), enabling detection of single-bit errors but vulnerable to multiple flips. The , used in protocols like and , computes a 16-bit one's complement of 16-bit words in the , with the result inverted and appended; the performs the same summation, and any non-zero outcome signals errors. This method is efficient for software implementation but detects fewer burst errors compared to . In contrast, (FEC) integrates parity-like in some high-speed links, such as optical or , to not only detect but also correct limited errors by reconstructing from redundant bits, though it increases overhead. Trailers focus on detection rather than correction, prompting retransmission via higher-layer protocols if errors are found; they do not inherently repair data. For well-maintained links, such as fiber optic cables, bit error rates (BER) are typically around $10^{-12}, meaning undetected errors—those slipping past CRC or checksums—occur at rates bounded by $2^{-32} (approximately $2.3 \times 10^{-10}) per frame for Ethernet's CRC-32 under random error assumptions, though real-world undetected probabilities can be lower due to link quality. Notably, protocols like IPv4 and IPv6 omit trailers entirely, placing checksums within headers instead to verify only the header or segment integrity, as end-to-end reliability is handled by transport layers.

Framing and Encapsulation

Layered Encapsulation

In layered encapsulation, data from higher protocol layers is progressively wrapped by lower layers to form complete transmission units suitable for network traversal. This process begins at the (Layer 4 of the ), where application is segmented into transport protocol units, such as segments or datagrams, each prefixed with a header containing source and destination port numbers for end-to-end delivery. These segments then serve as the for the network layer (Layer 3), where an is added to create a packet, incorporating logical addressing like source and destination addresses to enable across interconnected networks. At the data link layer (Layer 2), the network packet becomes the payload of a frame, with the addition of a header (e.g., Ethernet header including source and destination MAC addresses) and often a trailer for local link transmission between directly connected devices. This encapsulation ensures that each layer handles its specific responsibilities—end-to-end reliability at Layer 4, routing at Layer 3, and error-free hop-by-hop delivery at Layer 2—without interfering with others. For instance, an is encapsulated within an by inserting the packet into the frame's payload field and appending MAC addresses to direct it to the next . The standardizes this modular approach, allowing interoperability across diverse network technologies. De-encapsulation occurs in reverse at the receiving end: the removes the frame header and trailer, passing the intact packet to the network layer, which strips the before delivering the to the for reassembly into the original data. Each layer adds and removes its own headers and trailers during this bidirectional process, contributing to protocol overhead. In a common / over Ethernet stack, the combined headers from Layers 2, 3, and 4 total 54 bytes (14 bytes for Ethernet, 20 bytes for IPv4, and 20 bytes for TCP), which can exceed 50 bytes and represents a significant portion of in short-packet scenarios. This overhead underscores the efficiency trade-offs in multi-layer designs, as defined in the OSI model's encapsulation principles.

Framing Methods

Framing methods are essential techniques used in network protocols to delineate the boundaries of packets within a continuous , enabling receivers to accurately parse and reconstruct individual frames without ambiguity. These methods ensure between sender and receiver, particularly in transmissions where bitstreams lack inherent structure. By inserting delimiters, flags, or structural indicators, framing prevents misinterpretation of data and maintains reliable communication across various . Common framing conventions include byte-oriented, bit-oriented, and length-based approaches. In byte-oriented framing, such as that employed by the Point-to-Point Protocol (PPP), frames are delimited using a specific flag octet, 0x7E (binary 01111110), which marks the start and end of each frame. To maintain transparency and avoid false flags within the payload, byte stuffing is applied: any occurrence of 0x7E or the escape octet 0x7D in the data is escaped by prefixing it with 0x7D and XORing the original byte with 0x20. This method operates on octet boundaries, making it suitable for asynchronous and octet-synchronous links. Bit-oriented framing, exemplified by High-Level Data Link Control (HDLC), treats the frame as a stream of bits rather than bytes, using the same flag sequence 01111110 for boundaries. Transparency is achieved through bit stuffing, where a 0 is inserted after every five consecutive 1s in the payload to prevent accidental flag emulation, ensuring at least one transition every six bits for clock recovery. Length-based framing, as used in Ethernet per IEEE 802.3, relies on a length field in the header (following the preamble and start frame delimiter) to specify the exact number of bytes in the payload, allowing the receiver to extract the precise frame size without searching for end flags; the minimum frame size of 64 bytes further aids in collision detection and boundary resolution. Self-synchronizing frames employ alternative mechanisms to achieve boundary detection without explicit flags, often leveraging properties. One such method involves violations of the , as in (SONET), where the receiver scans for specific framing patterns in the A1 and A2 bytes (all 0xF6 and 0x28, respectively) that violate the expected scrambled , enabling rapid resynchronization even in high-speed optical links. Time-based framing, common in Time Division Multiplexing (TDM) systems, assigns fixed time slots within repeating frames to each channel, with synchronization maintained via a master clock; for instance, in synchronous TDM, each frame consists of a constant number of slots, ensuring predictable delineation regardless of data presence. These approaches are particularly robust in deterministic environments like circuit-switched networks. Framing is critical for preventing ambiguity in continuous streams, as the absence of clear boundaries could lead to cascading errors where the receiver misaligns subsequent packets; such desynchronization is especially prevalent in links due to signal , , and variable delays, potentially causing frame slips or loss of multiple packets. In modern networks, New Radio (NR) introduces flexible framing through multiple numerologies, defined by subcarrier spacing (Δf = 15 × 2^μ kHz, where μ ranges from 0 to 4), which allow variable slot durations and frame structures to accommodate diverse use cases like low-latency URLLC or high-throughput eMBB; for example, μ=0 yields 15 kHz spacing with 10 slots per frame, while μ=4 provides 240 kHz for mmWave bands, enabling adaptive synchronization in dynamic radio environments.

Applications and Examples

Internet Protocol Suite

In the , also known as the TCP/IP model, network packets are fundamental units for data transmission across the internet, with the (IP) layer handling routing and delivery. IPv4 packets, defined in RFC 791, feature a minimum 20-byte header that includes key fields such as the version (set to 4), Internet Header Length (IHL) indicating header size in 32-bit words, (TOS) for quality-of-service prioritization, total length (up to 65,535 bytes encompassing header and ), identification (ID) for fragment grouping, (TTL) with a common default of 64 hops to prevent infinite looping, protocol field specifying the upper-layer protocol, and a header for integrity verification. The of an IPv4 packet can reach up to 65,515 bytes in the maximum case, carrying data from protocols like or . IPv4 supports fragmentation to handle packets exceeding link MTUs, where the ID field uniquely identifies fragments from the same original , and the 13-bit fragment offset field specifies the position of the fragment's data relative to the original start, calculated as the offset value multiplied by 8 bytes to align with 64-bit boundaries. Routers can fragment IPv4 packets as needed, decrementing the by 1 per hop and discarding packets when TTL reaches zero, with the offset ensuring proper reassembly at the destination. In contrast, packets, specified in RFC 8200, use a streamlined 40-byte fixed header without variable-length options in the base structure, featuring fields like version (6), traffic class for prioritization, a 20-bit flow label for packet grouping in quality-of-service flows, length excluding the header, next header indicating the subsequent header or , and hop limit analogous to with a typical default of 64. introduces extension headers for optional features like or , inserted between the base header and to maintain simplicity. Unlike IPv4, deprecates fragmentation by routers, relying instead on by the sender to avoid mid-path splitting, with any necessary source fragmentation using a dedicated extension header. Higher-layer protocols in the suite often form the payload of packets; for instance, segments, outlined in 793, include a minimum 20-byte header with fields for source and destination ports, sequence numbers, acknowledgment numbers, flags for connection control, window size for flow control, checksum, and urgent pointer, encapsulating application data within packets for reliable delivery. As of late 2025, adoption has surpassed 40% globally, with Google's metrics indicating around 45% of traffic over , driven by address exhaustion in and broader deployment in regions like the and . A notable evolution is the protocol, standardized in 9000, which multiplexes semantics over packets as defined in 9114, integrating TLS encryption directly into the for reduced and improved without separate handshakes.

Space and Specialized Networks

In space communications, the (DSN) employs the Consultative Committee for Space Data Systems (CCSDS) Space Packet Protocol, defined in CCSDS 133.0-B-2, to handle and telecommand exchange with . This protocol structures into variable-length packets ranging from 7 to 65,542 octets, comprising a mandatory 6-octet primary header and an optional secondary header, followed by a field of 1 to 65,536 octets. The primary header includes fields for packet version, type ( or command), an 11-bit Application Process ID (APID) for multiple streams within a single , sequence control for ordering, and length. These packets are encapsulated within transfer frames for transmission over deep-space links, enabling efficient and demultiplexing at ground stations. Designed for the challenges of interplanetary distances, the protocol accommodates light-time delays of several minutes to hours in one-way propagation, with packets potentially including an optional time code in the secondary header to support ordering and latency accounting in deep-space environments. Error correction is provided at the channel coding layer using Reed-Solomon codes, typically RS(255,223), concatenated with convolutional or low-density parity-check codes to combat noise in long-haul transmissions. Unlike terrestrial () packets, space packets feature no time-to-live () field, relying instead on 14-bit sequence counts in the primary header for loss detection and ordering. This design prioritizes reliability over routing, as paths are preconfigured for specific missions. The DSN supports extremely low data rates on legacy missions, such as the Voyager spacecraft operating at approximately 160 bits per second to 2.8 kilobits per second, where weak signals are detected using tone-based beacon services and advanced error correction to extract packets from noisy channels. For nearer-space operations, the CCSDS Proximity-1 Space Link Protocol (211.0-B-6) facilitates short-range, bidirectional links between spacecraft, such as orbiters and landers, with data rates up to several megabits per second over distances of tens to hundreds of kilometers. This protocol includes services for framing, synchronization, and flow control tailored to low-latency environments like planetary relays. Recent DSN enhancements incorporate Ka-band (26-40 GHz) frequencies for improved throughput, achieving telemetry rates exceeding 100 megabits per second on modern missions through cryogenic receivers and high-gain antennas, while maintaining compatibility with Space Packet Protocol encapsulation. These upgrades address growing data volumes from instruments, enabling efficient packet handling in delay-tolerant networks without altering core protocol structures.

Multimedia and Audio Streams

Multimedia and audio streams require specialized packetization to support real-time transmission over packet-switched networks, where continuous data flows are segmented into discrete units to accommodate variable delays, potential losses, and efficient . In the , the (RTP) encapsulates audio and video payloads within packets, adding headers for sequencing, timing, and synchronization to reconstruct the stream at the receiver. RTP packets typically carry 10-30 milliseconds of media data per packet to minimize while fitting within sizes, such as 1500 bytes for Ethernet. This approach ensures low-overhead delivery for applications like VoIP and video conferencing, where must remain under 150-400 milliseconds for acceptable quality. For audio streams, are defined in profiles like RFC 3551, which specify how samples from codecs are packed into packets. Common strategies include octet-aligned packetization for (PCM) audio, such as (also known as PCMU or PCMA), where 8-bit samples are grouped into frames with a reflecting the first sample's instant. Frame-based codecs like , operating at 8 kbit/s with 10 ms frames, insert entire frames into payloads, using the marker bit to signal the start of talkspurts and enable silence suppression for bandwidth efficiency. Sequence numbers in the RTP header detect lost packets, while s facilitate buffering at the receiver to smooth variable network delays, critical for maintaining audio continuity. RTCP companion packets provide feedback on rates and inter-arrival , allowing adaptive adjustments like . Multimedia streams, encompassing synchronized audio and video, extend these principles to handle larger, more complex payloads. Video codecs such as H.264 are packetized using (NAL) units, which are fragmented into RTP packets if exceeding the path MTU, with start/end flags in fragmentation units (FUs) ensuring reassembly. Aggregation modes combine multiple NAL units into single-time aggregation packets (STAPs) to reduce header overhead, particularly useful for low-latency modes where decoding order matches transmission order. In interleaved modes, packets may arrive out-of-order, requiring decoding order numbers for reconstruction, while timestamps across audio and video RTP streams enable lip-sync via RTCP reports. These mechanisms address multimedia-specific challenges, such as variable bit rates and error resilience.

References

  1. [1]
    7 Packets - An Introduction to Computer Networks
    This is simply the packet size divided by the bandwidth, after everything has been converted to common units (either all bits or all bytes). For a 1500-byte ...
  2. [2]
    [PDF] Packet Switching and Computer Networks
    Any message exceeding a network-defined maximum length is broken up into shorter units, known as packets, for transmission; the packets, each with an ...
  3. [3]
    RFC 791 - Internet Protocol - IETF Datatracker
    The internet protocol is designed for use in interconnected systems of packet-switched computer communication networks. Such a system has been called a catenet.
  4. [4]
    What are Network Packets and How Do They Work? - TechTarget
    Feb 21, 2025 · A network packet is a basic unit of data that is transferred over a computer network, typically a packet-switched network, such as the internet.
  5. [5]
    [PDF] Switched Networks
    Rather than treating messages as indivisible units, a packet switched network takes the liberty of dividing user messages into smaller units called packets as ...
  6. [6]
    Circuit Switching vs Packet Switching: An Overview - NinjaOne
    Aug 15, 2025 · Shares network resources among multiple users, dynamically allocating resources based on current traffic. This makes packet switching more ...
  7. [7]
    1.2 Requirements - Computer Networks: A Systems Approach
    First, as a packet is transmitted over a physical link, bit errors may be introduced into the data; that is, a 1 is turned into a 0 or vice versa. Sometimes ...1.2. 2 Scalable Connectivity · 1.2. 4 Support For Common... · Reliable Message Delivery
  8. [8]
    https://www.lenovo.com/us/en/glossary/multiplex/
  9. [9]
    Packet-Switched Network vs. Circuit-Switched Network - Spiceworks
    Aug 8, 2022 · Resource reservation is a unique feature of circuit switching, whereas, in packet switching, there is no resource allocation for any user.
  10. [10]
    Packet Switching - Engineering and Technology History Wiki
    Feb 17, 2024 · Packet switching was invented independently by Paul Baran and Donald Davies in the early and mid 1960s and then developed by a series of scientists and ...
  11. [11]
    Internet History of 1960s
    From Davies, the word 'packet' is adopted and the proposed line speed in ARPANET is increased from 2.4 Kbps to 50 Kbps.
  12. [12]
    RFC 768 - User Datagram Protocol (UDP) - IETF
    The pseudo header conceptually prefixed to the UDP header contains the source address, the destination address, the protocol, and the UDP length. This ...Missing: connectionless | Show results with:connectionless
  13. [13]
    User Datagram Protocol - UDP - GeeksforGeeks
    Oct 14, 2025 · User Datagram Protocol (UDP) is a Transport Layer protocol of the Internet Protocol (IP) that provides fast, connectionless, and lightweight ...
  14. [14]
    Socket Types - IBM
    A datagram socket supports the bidirectional flow of data, which is not sequenced, reliable, or unduplicated. A process receiving messages on a datagram socket ...
  15. [15]
    What Are the Differences Between Streams and Datagrams in ...
    Feb 14, 2025 · Streams allow for the sequential transmission and reception of data, processing one byte at a time. Datagrams are independent data packets ...
  16. [16]
    RFC 793 - Transmission Control Protocol (TCP) - IETF
    The term packet is used generically here to mean the data of one transaction between a host and its network. The format of data blocks exchanged within the a ...
  17. [17]
    5.2 Reliable Byte Stream (TCP) — Computer Networks
    It is a full-duplex protocol, meaning that each TCP connection supports a pair of byte streams, one flowing in each direction. It also includes a flow-control ...
  18. [18]
    [PDF] TCP: Transmission Control Protocol
    Service provided by TCP is. – Reliable. – Connection-oriented -- virtual circuit. – Stream-oriented -- users exchange streams of.
  19. [19]
    Asynchronous Transfer Mode (ATM) in Computer Network
    Nov 2, 2021 · Each cell is 53 bytes long - 5 bytes header and 48 bytes payload. ... ATM Cells: Fixed or small size and Tradeoff is between voice or data.
  20. [20]
    ATM Cell - IP Packet Format - Huawei Technical Support
    Aug 12, 2025 · In ATM switching, packets are called cells and have a fixed length of 53 bytes. As defined by ITU-T, ATM uses cells as basic units for ...
  21. [21]
    Understanding Asynchronous Transfer Mode (ATM)
    Why does ATM use fixed-size cells? The 53-byte fixed-size cells cut jitter and delay. This structure lets hardware switches process traffic rapidly. ATM ...
  22. [22]
    What is MTU (maximum transmission unit)? - Cloudflare
    a "byte" is equal to 8 bits of information, meaning 8 ones and zeroes. 1,500 bytes is the maximum MTU size. What is a packet? All ...
  23. [23]
    MTU size issues, fragmentation, and jumbo frames - Network World
    For most Ethernet networks this is 1500 bytes, and this size is used almost universally on access networks. Ethernet II networks have a standard frame size of ...
  24. [24]
    None
    ### Summary of IPv4 Header Fields (RFC 791)
  25. [25]
    None
    ### Summary of IPv6 Header Fields (RFC 8200)
  26. [26]
    None
    ### Summary of DS Field, TOS in IPv4, and DSCP for QoS from RFC 2474
  27. [27]
    None
    ### Summary of Differentiated Services Architecture (RFC 2475)
  28. [28]
    RFC 791: Internet Protocol
    For example, one could implement a fragmentation procedure that repeatly divided large datagrams in half until the resulting fragments were less than the ...
  29. [29]
    RFC 8200 - Internet Protocol, Version 6 (IPv6) Specification
    This document specifies version 6 of the Internet Protocol (IPv6). It obsoletes RFC 2460. Status of This Memo This is an Internet Standards Track document.
  30. [30]
    RFC 8201: Path MTU Discovery for IP version 6
    This document describes Path MTU Discovery (PMTUD) for IP version 6. It is largely derived from RFC 1191, which describes Path MTU Discovery for IP version 4.Missing: avoidance | Show results with:avoidance<|separator|>
  31. [31]
    RFC 8900 - IP Fragmentation Considered Fragile - IETF Datatracker
    This document describes IP fragmentation and explains the fragility it introduces. It also proposes alternatives to IP fragmentation and provides ...Table of Contents · Introduction · IP Fragmentation · Alternatives to IP Fragmentation
  32. [32]
    RFC 1858: Security Considerations for IP Fragment Filtering
    RFC 1858 Security Considerations - IP Fragment Filtering October 1995 ; 5. Security Considerations ; 6. Acknowledgements ; 7. References ...
  33. [33]
    [PDF] 32-Bit Cyclic Redundancy Codes for Internet Applications
    For example, the 802.3 CRC can detect up to three independent bit errors (Hamming Distance HD=4) in an Ethernet Maximum Transmission Unit (MTU) having a 1500 ...Missing: trailer | Show results with:trailer
  34. [34]
    [PDF] Error rates and testability - IEEE 802
    undetected error, due to operation of the conveying MAC and Physical Layer entities, shall be less than. 5*10-14 per octet of MSDU length. 5.6.3 Hamming ...
  35. [35]
    [PDF] Study of Undetected Error Probability of IEEE 802.3 CRC-32 code ...
    The study focuses on the Undetected Error Probability (Pue) of the 802.3 CRC, which is bounded by Pue ≤ 2-32 for 0 < p ≤ 0.5 and frame length ≥ 64 bytes.Missing: packet trailer
  36. [36]
    What is OSI Model | 7 Layers Explained - Imperva
    The OSI model describes seven layers that computer systems use to communicate over a network. Learn about it and how it compares to TCP/IP model.Transmission Control Protocol · What is Broken Object Level... · What is HTTP/2
  37. [37]
    OSI Model - Practical Networking .net
    The Network layer of the OSI model is responsible for packet delivery from end to end. It does this by using another addressing scheme that can logically ...
  38. [38]
    [PDF] Understanding Data Encapsulation
    The data is encapsulated with protocol information at each OSI reference model layer when a host transmits data to another device across a network. Each layer ...
  39. [39]
    Encapsulation and overheads - Documentation - Evolving Networks
    Jul 8, 2024 · An Ethernet header on a packet consists of what is needed to transmit that packet to its destination while saying where its from.Traversing Isp Networks · Ipsec - The Clunky But... · Intelligent Network Fabric
  40. [40]
    What is Time to Live (TTL) | TTL Best Practices | CDN Guide - Imperva
    TTL is a fundamental network parameter that controls the lifespan of packets. It prevents congestion and improves reliability by eliminating infinite packet ...How Does TTL Work? · How TTL Works in Different... · TTL Values
  41. [41]
    IP Fragmentation in Detail - Packet Pushers
    May 20, 2020 · This means it is broken into pieces carried within new packets (fragments) that are equal to or smaller than the lower MTU. This is called Fragmentation.
  42. [42]
    IPv6 packet - Wikipedia
    Fixed header. The fixed header starts an IPv6 packet and has a size of 40 octets (320 bits). The bytes of the multi-byte fields are in the network byte order. ...
  43. [43]
    IPv6 Adoption - Google
    IPv6 Adoption ... The graph shows the percentage of users that access Google over IPv6. Native: 45.26% 6to4/Teredo: 0.00% Total IPv6: 45.26% | Oct 30, 2025.
  44. [44]
    RFC 9114 - HTTP/3 - IETF Datatracker
    This document defines HTTP/3: a mapping of HTTP semantics over the QUIC transport protocol, drawing heavily on the design of HTTP/2.Table of Contents · HTTP/3 Protocol Overview · Expressing HTTP Semantics in...
  45. [45]
    [PDF] 102 Telemetry Services - What is the Deep Space Network?
    Nov 17, 2021 · CCSDS Space Packet Protocol 133.0-B-2. This CCSDS Recommendation describes the concept of the Space Packet Protocol and documents the fields ...<|control11|><|separator|>
  46. [46]
    [PDF] TM Synchronization and Channel Coding - CCSDS.org
    Sep 5, 2023 · – UK Space Agency/United Kingdom. CCSDS 131.0-B-5 TM Synchronization and Channel Coding, Recommended Standard, Issue 5 September 2023 Current ...Missing: Packet | Show results with:Packet
  47. [47]
    [PDF] Voyager Telecommunications
    The table shows telemetry data rate limits for two Deep Space Station sizes at Goldstone, California for. Voyager 1 and near Canberra, Australia for Voyager 2.
  48. [48]
    [PDF] Proximity-1 Space Link Protocol—Data Link Layer - CCSDS.org
    Sep 1, 2024 · The Proximity-1 Space Link Protocol is a recommended standard (CCSDS 211.0-B-6) for the data link layer, representing a consensus of CCSDS ...Missing: DSN | Show results with:DSN
  49. [49]
    Ka-band high-rate telemetry system upgrade for the NASA deep ...
    The new Ka-band system combines the use of proven DSN cryogenic designs, for low system temperature, and high-data-rate capability using commercial telemetry ...
  50. [50]
    [PDF] Deep Space Network Services Catalog
    May 31, 2022 · The CCSDS Space Link Extension (SLE) CLTU is the standard interface protocol in stream mode, with the DSN Command Radiation. Table 3.2 contains ...
  51. [51]
    RFC 3550: RTP: A Transport Protocol for Real-Time Applications
    Summary of each segment:
  52. [52]
    https://datatracker.ietf.org/doc/html/rfc3550#section-2
  53. [53]
    https://datatracker.ietf.org/doc/html/rfc3551#section-4.5.14
  54. [54]
    https://datatracker.ietf.org/doc/html/rfc3551#section-4.5.6
  55. [55]
    https://datatracker.ietf.org/doc/html/rfc3550#section-6.4
  56. [56]
    https://datatracker.ietf.org/doc/html/rfc6184#section-5.8
  57. [57]
    https://datatracker.ietf.org/doc/html/rfc6184#section-5.7
  58. [58]
    https://datatracker.ietf.org/doc/html/rfc6184#section-5.5
  59. [59]
    https://datatracker.ietf.org/doc/html/rfc6184#section-5.5
  60. [60]
    https://datatracker.ietf.org/doc/html/rfc3550#section-6.4.1