avoidance algorithm

20 examples (0.03 sec)
  • For another example, a popular area of research is new improvements to the TCP congestion avoidance algorithm.
  • The behaviour upon packet loss depends on the TCP congestion avoidance algorithm that is used.
  • The TCP congestion-avoidance algorithm is the primary basis for congestion control in the Internet.
  • The TCP congestion avoidance algorithm is the primary basis for congestion control in the Internet.
  • By design, the TCP congestion avoidance algorithm rapidly fills up the bottleneck on the route.
  • As a result, there are a number of TCP congestion avoidance algorithm variations.
  • Unlike most TCP congestion avoidance algorithms, FAST TCP is protected by several patents.
  • Taxonomy of congestion control refers to grouping TCP congestion avoidance algorithms according to their characteristics.
  • Histogramic intensity switching (HIS) is a vision-based obstacle avoidance algorithm developed in the lab.
  • Unlike other obstacle avoidance algorithms, VFH takes into account the dynamics and shape of the robot, and returns steering commands specific to the platform.
  • Compound TCP is a modified TCP congestion avoidance algorithm, meant to improve networking performance in all applications.
  • For instance, Zeta-TCP provides more accurate loss detection and heuristic download acceleration in addition to its congestion avoidance algorithm.
  • The TCP congestion avoidance algorithm relies on packet drops to determine the available bandwidth.
  • TCP Vegas is one of several "flavors" of TCP congestion avoidance algorithms.
  • TCP Vegas is a TCP congestion avoidance algorithm that emphasizes packet delay, rather than packet loss, as a signal to help determine the rate at which to send packets.
  • Second, is a transport layer cause which theorizes that the feedback between multiple TCP streams due to TCP's congestion avoidance algorithm in moderate to high packet loss situations causes self-similar traffic or at least allows it to propagate.
  • While TCP uses congestion windows to avoid congestion (see: TCP congestion avoidance algorithm), which are unforgiving to multiplexed connections, QUIC has a set of modern techniques under review.
  • While most of the improvements, such as FAST TCP, Zeta-TCP, etc., are focused on the TCP congestion avoidance algorithm, some also attempt to promote the performance of other aspects of the protocol.
  • 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.
  • Such sizing of the buffers can lead to TCP's congestion-avoidance algorithms breaking, causing problems such as high and variable latency, and choking network bottlenecks for all other flows as the buffer becomes full of the packets of one TCP stream and other packets are then dropped.