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
Transport layer
(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!
=== <span class="anchor" id="COMPARISON1"></span><span class="anchor" id="Comparison of transport layer protocols"></span>Comparison of Internet transport layer protocols === {| class="wikitable" style="text-align:center" |- ! scope="col" | Feature ! scope="col" | [[User Datagram Protocol|UDP]] ! scope="col" | [[UDP-Lite]] ! scope="col" | [[Transmission Control Protocol|TCP]] ! scope="col" | [[Multipath TCP]] ! scope="col" | [[SCTP]] ! scope="col" | [[DCCP]] ! scope="col" | [[RUDP]]{{efn|RUDP is not officially standardized. There have been no standard-related developments since 1999.}} |- | style="text-align:left" | Packet header size | 8 bytes | 8 bytes | 20β60 bytes | 50β90 bytes | 12 bytes{{efn|Excluding data chunk headers and overhead chunks. Without embedded chunks, an SCTP packet is essentially useless.}} | 12 or 16 bytes | 14+ bytes<!--Including 8-byte UDP header--> |- | style="text-align:left" | Typical data-packet overhead | 8 bytes | 8 bytes | 20 bytes | ?? bytes | 44β48+ bytes{{efn|Counted as follows: 12 bytes SCTP header + 16 bytes DATA chunk header or 20 bytes I-DATA chunk header + 16+ bytes SACK chunk. Additional non-data chunks (e.g. AUTH) and/or headers for additional data chunks, which might easily increase the overhead with 50 bytes or more, not counted.}} | 12 or 16 bytes | 14 bytes |- | style="text-align:left" | Transport-layer packet entity | Datagram | Datagram | Segment | Segment | Datagram | Datagram | Datagram |- | style="text-align:left" | Connection-oriented | {{No}} | {{No}} | {{Yes}} | {{Yes}} | {{Yes}} | {{Yes}} | {{Yes}} |- | style="text-align:left" | Reliable transport | {{No}} | {{No}} | {{Yes}} | {{Yes}} | {{Yes}} | {{No}} | {{Yes}} |- | style="text-align:left" | Unreliable transport | {{Yes}} | {{Yes}} | {{No}} | {{No}} | {{Yes}} | {{Yes}} | {{Yes}} |- | style="text-align:left" | Preserve message boundary | {{Yes}} | {{Yes}} | {{No}} | {{No}} | {{Yes}} | {{Yes}} | {{Yes}} |- | style="text-align:left" | Delivery | Unordered | Unordered | Ordered | Ordered | Ordered / Unordered | Unordered | Unordered |- | style="text-align:left" | Data [[checksum]] | {{Optional}} | {{Yes}} | {{Yes}} | {{Yes}} | {{Yes}} | {{Yes}} | {{Optional}} |- | style="text-align:left" | Checksum size | 16 bits | 16 bits | 16 bits | 16 bits | 32 bits | 16 bits | 16 bits |- | style="text-align:left" | Partial [[checksum]] | {{No}} | {{Yes}} | {{No}} | {{No}} | {{No}} | {{Yes}} | {{No}} |- | style="text-align:left" | Path [[Maximum transmission unit|MTU]] | {{No}} | {{No}} | {{Yes}} | {{Yes}} | {{Yes}} | {{Yes}} | {{dunno}} |- | style="text-align:left" | [[Flow control (data)|Flow control]] | {{No}} | {{No}} | {{Yes}} | {{Yes}} | {{Yes}} | {{No}} | {{Yes}} |- | style="text-align:left" | [[Congestion control]] | {{No}} | {{No}} | {{Yes}} | {{Yes}} | {{Yes}} | {{Yes}} | {{dunno}} |- | style="text-align:left" | [[Explicit Congestion Notification]] | {{No}} | {{No}} | {{Yes}} | {{Yes}} | {{Yes}} | {{Yes}} | {{dunno}} |- | style="text-align:left" | Multiple [[Stream (computing)|streams]] | {{No}} | {{No}} | {{No}} | {{No}} | {{Yes}} | {{No}} | {{No}} |- | style="text-align:left" | [[Multi-homing]] | {{No}} | {{No}} | {{No}} | {{Yes}} | {{Yes}} | {{No}} | {{No}} |- | style="text-align:left" | Bundling / [[Nagle's algorithm|Nagle]] | {{No}} | {{No}} | {{Yes}} | {{Yes}} | {{Yes}} | {{No}} | {{dunno}} |} {{notelist}}
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)