enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. CUBIC TCP - Wikipedia

    en.wikipedia.org/wiki/CUBIC_TCP

    CUBIC is a less aggressive and more systematic derivative of BIC TCP, in which the window size is a cubic function of time since the last congestion event, with the inflection point set to the window size prior to the event. Because it is a cubic function, there are two components to window growth.

  3. TCP tuning - Wikipedia

    en.wikipedia.org/wiki/TCP_tuning

    If the sender has not received acknowledgement for the first packet it sent, it will stop and wait and if this wait exceeds a certain limit, it may even retransmit. This is how TCP achieves reliable data transmission. Even if there is no packet loss in the network, windowing can limit throughput. Because TCP transmits data up to the window size ...

  4. Maximum transmission unit - Wikipedia

    en.wikipedia.org/wiki/Maximum_transmission_unit

    Large packets occupy a link for more time than a smaller packet, causing greater delays to subsequent packets, and increasing network delay and delay variation. For example, a 1500-byte packet, the largest allowed by Ethernet at the network layer, ties up a 14.4k modem for about one second.

  5. TCP window scale option - Wikipedia

    en.wikipedia.org/wiki/TCP_window_scale_option

    TCP window scale option is needed for efficient transfer of data when the bandwidth-delay product (BDP) is greater than 64 KB [1].For instance, if a T1 transmission line of 1.5 Mbit/s was used over a satellite link with a 513 millisecond round-trip time (RTT), the bandwidth-delay product is ,, =, bits or about 96,187 bytes.

  6. Jumbo frame - Wikipedia

    en.wikipedia.org/wiki/Jumbo_frame

    The relative scalability of network data throughput as a function of packet transfer rates is related in a complex manner to payload size per packet. [17] Theoretically, as line bit rate increases, the packet payload size should increase in direct proportion to maintain equivalent timing parameters.

  7. Nagle's algorithm - Wikipedia

    en.wikipedia.org/wiki/Nagle's_algorithm

    Nagle's algorithm works by combining a number of small outgoing messages and sending them all at once. Specifically, as long as there is a sent packet for which the sender has received no acknowledgment, the sender should keep buffering its output until it has a full packet's worth of output, thus allowing output to be sent all at once.

  8. Link aggregation - Wikipedia

    en.wikipedia.org/wiki/Link_aggregation

    Link aggregation also allows the network's backbone speed to grow incrementally as demand on the network increases, without having to replace everything and deploy new hardware. Most backbone installations install more cabling or fiber optic pairs than is initially necessary.

  9. Additive increase/multiplicative decrease - Wikipedia

    en.wikipedia.org/wiki/Additive_increase/...

    The approach taken is to increase the transmission rate (window size), probing for usable bandwidth, until loss occurs. The policy of additive increase may, for instance, increase the congestion window by a fixed amount every round-trip time. When congestion is detected, the transmitter decreases the transmission rate by a multiplicative factor ...