World Library  
Flag as Inappropriate
Email this Article

Goodput

Article Id: WHEBN0005582803
Reproduction Date:

Title: Goodput  
Author: World Heritage Encyclopedia
Language: English
Subject: Throughput, Bandwidth (computing), Bit rate, Overhead bit, Bufferbloat
Collection:
Publisher: World Heritage Encyclopedia
Publication
Date:
 

Goodput

In computer networks, goodput is the application level throughput, i.e. the number of useful information bits delivered by the network to a certain destination per unit of time. The amount of data considered excludes protocol overhead bits as well as retransmitted data packets. This is related to the amount of time from the first bit of the first packet sent (or delivered) until the last bit of the last packet is delivered, see below.

For example, if a file is transferred, the goodput that the user experiences corresponds to the file size in bits divided by the file transfer time. The goodput is always lower than the throughput (the gross bit rate that is transferred physically), which generally is lower than network access connection speed (the channel capacity or bandwidth).

Examples of factors that cause lower goodput than throughput are:

  • Protocol overhead; Typically, transport layer, network layer and sometimes datalink layer protocol overhead is included in the throughput, but is excluded from the goodput.
  • Transport layer flow control and congestion avoidance, for example TCP slow start, may cause a lower goodput than the maximum throughput.
  • Retransmission of lost or corrupt packets due to transport layer automatic repeat request (ARQ), caused by bit errors or packet dropping in congested switches and routers, is included in the datalink layer or network layer throughput but not in the goodput.

Contents

  • Example 1
  • Data delivery time 2
  • See also 3
  • Sources 4
  • References 5

Example

Imagine that a file is being transferred using HTTP over a switched Ethernet connection with a total channel capacity of 100 megabits per second. The file cannot be transferred over Ethernet as a single continuous stream; instead, it must be broken down into individual chunks. These chunks must be no larger than the maximum transmission unit of Ethernet, which is 1500 bytes. Each packet requires 20 bytes of IPv4 header information and 20 bytes of TCP header information, so only 1460 bytes are available per packet for the file transfer data itself (Unix systems, Linux, and Mac OS X[1] are further limited to 1448 bytes as they also carry a 12-byte time stamp). Furthermore, the data is transmitted over Ethernet in a frame, which imposes a 26 byte overhead per packet. Given these overheads, the maximum goodput is 1460/1526 × 100 Mbit/s which is 95.67 megabits per second or 11.959 megabytes per second.

Note that this example doesn't consider some additional Ethernet overhead, such as the interframe gap (a minimum of 96 bit times), or collisions (which have a variable impact, depending on the network load). TCP itself also adds the overhead of acknowledgements (which along with the round-trip delay time and the TCP window size in effect will rate-limit each individual TCP connection, see bandwidth-delay product). This example also does not consider the overhead of the HTTP protocol itself, which becomes relevant when transferring small files.

Data delivery time

The goodput is a ratio between delivered amount of information, and the total delivery time. This delivery time includes:

See also

Sources

  1. Goodput calculation
  2. An Empirical Characterization of Instantaneous Throughput in 802.11b WLANs
  3. Energy-Efficient Power and Rate Control with QoS Constraints: A Game-Theoretic Approach
  4. RFC 2647 — Benchmarking Terminology for Firewall Performance

References

  1. ^ Stuart Cheshire. "TCP Performance problems caused by interaction between Nagle's Algorithm and Delayed ACK". Retrieved 2010-01-13. 
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 


Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.