When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. BIC TCP - Wikipedia

    en.wikipedia.org/wiki/BIC_TCP

    BIC TCP (Binary Increase Congestion control) is one of the congestion control algorithms that can be used for Transmission Control Protocol (TCP). BIC is optimized for high-speed networks with high latency: so-called long fat networks. For these networks, BIC has significant advantage over previous congestion control schemes in correcting for ...

  3. TCP congestion control - Wikipedia

    en.wikipedia.org/wiki/TCP_congestion_control

    BIC TCP (Binary Increase Congestion Control Protocol) uses a concave increase of the sources rate after each congestion event until the window is equal to that before the event, in order to maximize the time that the network is fully utilized. After that, it probes aggressively.

  4. 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.

  5. Category:TCP congestion control - Wikipedia

    en.wikipedia.org/.../Category:TCP_congestion_control

    Main page; Contents; Current events; Random article; About Wikipedia; Contact us; Pages for logged out editors learn more

  6. H-TCP - Wikipedia

    en.wikipedia.org/wiki/H-TCP

    H-TCP is another implementation of TCP with an optimized congestion control algorithm for high-speed networks with high latency (LFN: Long Fat Networks). It was created by researchers at the Hamilton Institute in Ireland.

  7. Bandwidth-delay product - Wikipedia

    en.wikipedia.org/wiki/Bandwidth-delay_product

    In data communications, the bandwidth-delay product is the product of a data link's capacity (in bits per second) and its round-trip delay time (in seconds). [1] 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.

  8. FAST TCP - Wikipedia

    en.wikipedia.org/wiki/Fast_TCP

    This has two drawbacks. First, low loss probabilities are required to sustain high data rates; in the case of TCP Reno, very low loss probabilities are required, but even new congestion avoidance algorithms such as H-TCP, BIC TCP and HSTCP require loss rates lower than those provided by most wireless wide area networks. Moreover, packet loss ...

  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.