scholarly journals Trade-off queuing delay and link utilization for solving bufferbloat

ICT Express ◽  
2020 ◽  
Vol 6 (4) ◽  
pp. 269-272
Author(s):  
Hao Wang
2011 ◽  
Vol 403-408 ◽  
pp. 3946-3952
Author(s):  
K. Chitra ◽  
G. Padmavathi

Routers in Internet face the problem of congestion due to the increased use of Internet. AQM algorithm is a solution to the problem of congestion control in the Internet routers. As data traffic is bursty in routers, burstiness must be handled without comprising the high link utilization and low queuing delay. Congested link causes many problems such as large delay, unfairness among flows, underutilization of the link and packet drops in burst. There are various existing algorithms that have been evolved over the past few years to solve these problems of congestion in routers. RED based algorithms only use queue length as congestion indicator to indicate congestion. In this paper, we propose an AQM scheme that considers only the advantages of these queue length based and uses the flow information and satisfies the QOS requirements of the network. This proposed scheme aims to provide good service under unresponsive load and shields the responsive flows from unresponsive flows to offer a good QOS to all users.


Author(s):  
Tao Zhang ◽  
Yasi Lei ◽  
Qianqiang Zhang ◽  
Shaojun Zou ◽  
Juan Huang ◽  
...  

AbstractModern datacenters provide a wide variety of application services, which generate a mix of delay-sensitive short flows and throughput-oriented long flows, transmitting in the multi-path datacenter network. Though the existing load balancing designs successfully make full use of available parallel paths and attain high bisection network bandwidth, they reroute flows regardless of their dissimilar performance requirements. The short flows suffer from the problems of large queuing delay and packet reordering, while the long flows fail to obtain high throughput due to low link utilization and packet reordering. To address these inefficiency, we design a fine-grained load balancing scheme, namely TR (Traffic-aware Rerouting), which identifies flow types and executes flexible and traffic-aware rerouting to balance the performances of both short and long flows. Besides, to avoid packet reordering, TR leverages the reverse ACKs to estimate the switch-to-switch delay, thus excluding paths that potentially cause packet reordering. Moreover, TR is only deployed on the switch without any modification on end-hosts. The experimental results of large-scale NS2 simulations show that TR reduces the average and tail flow completion time for short flows by up to 60% and 80%, as well as provides up to 3.02x gain in throughput of long flows compared to the state-of-the-art load balancing schemes.


2021 ◽  
Author(s):  
Tao Zhang ◽  
Yasi Lei ◽  
Qianqiang Zhang ◽  
Shaojun Zou ◽  
Juan Huang ◽  
...  

Abstract Modern datacenters provide a wide variety of application services, which generate a mix of delay-sensitive short flows and throughput-oriented long flows, transmitting in the multi-path datacenter network. Though the existing load balancing designs successfully make full use of available parallel paths and attain high bisection network bandwidth, they reroute flows regardless of their dissimilar performance requirements. The short flows suffer from the problems of large queuing delay and packet reordering, while the long flows fail to obtain high throughput due to low link utilization and packet reordering. To address these inefficiency, we design a fine-grained load balancing scheme, namely TR (Traffic-aware Rerouting), which identifies flow types and executes flexible and traffic-aware rerouting to balance the performances of both short and long flows. Besides, to avoid packet reordering, TR leverages the reverse ACKs to estimate the switch-to-switch delay, thus excluding paths that potentially cause packet reordering. Moreover, TR is only deployed on the switch without any modification on end-hosts. The experimental results of large-scale NS2 simulations show that TR reduces the average and tail flow completion time for short flows by up to 60% and 80%, as well as provides up to 3.02x gain in throughput of long flows compared to the state-of-the-art load balancing schemes.


1982 ◽  
Vol 14 (2) ◽  
pp. 109-113 ◽  
Author(s):  
Suleyman Tufekci
Keyword(s):  

2012 ◽  
Vol 11 (3) ◽  
pp. 118-126 ◽  
Author(s):  
Olive Emil Wetter ◽  
Jürgen Wegge ◽  
Klaus Jonas ◽  
Klaus-Helmut Schmidt

In most work contexts, several performance goals coexist, and conflicts between them and trade-offs can occur. Our paper is the first to contrast a dual goal for speed and accuracy with a single goal for speed on the same task. The Sternberg paradigm (Experiment 1, n = 57) and the d2 test (Experiment 2, n = 19) were used as performance tasks. Speed measures and errors revealed in both experiments that dual as well as single goals increase performance by enhancing memory scanning. However, the single speed goal triggered a speed-accuracy trade-off, favoring speed over accuracy, whereas this was not the case with the dual goal. In difficult trials, dual goals slowed down scanning processes again so that errors could be prevented. This new finding is particularly relevant for security domains, where both aspects have to be managed simultaneously.


Sign in / Sign up

Export Citation Format

Share Document