Bandwidth-delay product

In data communications, bandwidth-delay product refers to the product of a data link's capacity (in bits per second) and its round-trip delay time (in seconds).[1][2] The result, an amount of data measured in bits (or bytes), is equivalent to the maximum amount of data on the network circuit at any given time, i.e., data that has been transmitted but not yet acknowledged.

A network with a large bandwidth-delay product is commonly known as a long fat network (shortened to LFN and often pronounced "elephan"). As defined in RFC 1072, a network is considered an LFN if its bandwidth-delay product is significantly larger than 105 bits (12500 bytes).

Ultra-high speed LANs may fall into this category, where protocol tuning is critical for achieving peak throughput, on account of their extremely high bandwidth, even though their delay is not great.

An important example of a system where the bandwidth-delay product is large is that of GEO satellite connections, where end-to-end delivery time is very high and link throughput may also be high. The high end-to-end delivery time makes life difficult for stop-and-wait protocols and applications that assume rapid end-to-end response.

A high bandwidth-delay product is an important problem case in the design of protocols such as TCP in respect of performance tuning, because the protocol can only achieve optimum throughput if a sender sends a sufficiently large quantity of data before being required to stop and wait until a confirming message is received from the receiver, acknowledging successful receipt of that data. If the quantity of data sent is insufficient compared with the bandwidth-delay product, then the link is not being kept busy and the protocol is operating below peak efficiency for the link. Protocols that hope to succeed in this respect need carefully designed self-monitoring, self-tuning algorithms.[3] The TCP window scale option may be used to solve this problem caused by insufficient window size, which is limited to 65535 bytes without scaling.

Examples

B×D = 512×103 b/s × 900×10−3 s = 460,800 b., / 8 = 57,600 B (or / 1,000 = 57.6 kB, or / 1,024 = 56.25 KiB)
B×D = 2×106 b/s × 50×10−3 s = 100×103 b, or 100 kb, or 12.5 kB.
B×D = 6×106 b/s × 10−1 s = 6×105 b, or 600 kb, or 75 kB.
B×D = 20×106 b/s × 50×10−3 s = 106 b, or 1 Mb, or 125 kB.
B×D = 109 b/s × 10−3 s = 106 b, or 1 Mb, or 125 kB.

References

  1. ↑ RFC 1072: Introduction
  2. ↑ Understanding Bandwidth-Delay Product in Mobile Ad Hoc Networks
  3. ↑ Enabling High Performance Data Transfers, Pittsburgh Supercomputing Center

See also

This article is issued from Wikipedia - version of the Wednesday, February 03, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.