bufferbloat造句

• The bufferbloat phenomenon was initially described as far back as in 1985.
• CoDel is less prone to the effects of bufferbloat than the common tail drop disciplines.
• Failing to drop packets, choosing instead to buffer an ever-increasing number of them, produces bufferbloat.
• A new and emergent behavior called bufferbloat can also cause increased latency that is an order of magnitude or more.
• In January 2015 David P . Reed reported that Gogo service exhibited multiple seconds of latency under load, due to bufferbloat.
• Since 2010 Gettys has been a core member of the group investigating Bufferbloat and the effect it has on the performance of the Internet.
• Regarding the recognition of an unwanted situation, Van Jacobson asserted in 2006 that existing algorithms have been using incorrect means of recognizing bufferbloat.
• Dave T鋒t back-ported CoDel to Linux kernel 3.3 for project CeroWrt, which concerns itself among other things with bufferbloat, where it was exhaustively tested.
• The overall size of all buffers has been the point of critique by the Bufferbloat project, which provided a partial solution with CoDel that has been primarily tested in OpenWrt.
• When the bufferbloat phenomenon is present and the network is under load, even normal web page loads can take many seconds to complete, or simple DNS queries can fail due to timeouts.
• In practice, though, this may help mitigate, for example as a result of one large buffer being split into multiple smaller buffers, or isolation of bufferbloat queues combined with prioritisation.
• By providing endpoints with congestion indication before the queue is full, AQM disciplines are able to maintain a shorter queue length than drop-tail queues, which combats bufferbloat and reduces network latency.
• Having a big and constantly full buffer which causes increased transmission delays and reduced interactivity, especially when looking at two or more simultaneous transmissions over the same channel, is called " bufferbloat ".
• In an attempt to recognize the telltale standing queue of bufferbloat, algorithms like RED measure the average queue length ( in packets or stored bytes ) and consider it a case of bufferbloat if the average grows too large.
• In an attempt to recognize the telltale standing queue of bufferbloat, algorithms like RED measure the average queue length ( in packets or stored bytes ) and consider it a case of bufferbloat if the average grows too large.
• In order to be effective against bufferbloat, a solution in form of an Active queue management ( AQM ) algorithm must be able to " recognize " an occurrence of bufferbloat and " react " with deploying effective countermeasures.
• In order to be effective against bufferbloat, a solution in form of an Active queue management ( AQM ) algorithm must be able to " recognize " an occurrence of bufferbloat and " react " with deploying effective countermeasures.
• There are several other queuing disciplines available for active queue management, used in general for traffic shaping, but none of them fundamentally changes the situation, as although HTTP and VoIP may be buffered independently, each buffer will still be independently susceptible to bufferbloat.