FlowDyn: Towards a Dynamic Flowlet Gap Detection using Programmable Data Planes

Benet, Cristian Hernandez; Kassler, Andreas

doi:10.1109/cloudnet47604.2019.9064146

Cited by 3 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In summary, most per-flowlet load-balancing schemes depend on a proper static setting of the flowlet gap, which decides when new flowlets are detected. While a too small gap may result in reordering, a too large gap leads to missed load-balancing opportunities [31]. FlowDyn [31] and Flex [9] can dynamically adapt the flowlet gap.…”

Section: ) Load Balancing At Traditional Switchmentioning

confidence: 99%

“…While a too small gap may result in reordering, a too large gap leads to missed load-balancing opportunities [31]. FlowDyn [31] and Flex [9] can dynamically adapt the flowlet gap. Under a switch-host collaborative paradigm, Flex [9] split the flow into flowlets at the host based on the adaptive timeout., and then tell the flowlet results to switches by marking the adjacent flowlets of the same flow.…”

Section: ) Load Balancing At Traditional Switchmentioning

confidence: 99%

See 1 more Smart Citation

QALL: Distributed Queue-Behavior-Aware Load Balancing Using Programmable Data Planes

Liu,

Cai,

Ling

et al. 2024

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

Existing load-balancing methods used in data center networks involve some shortcomings such as excessively large decision delays during reactions to microbursts and large overheads involved in active probing. Programmable data planes have provided new opportunities for local decision-making on switches to address these issues. We observe that queue behavior (i.e., queue occupancy, queuing trend, and dequeue time interval) in switches can reflect the current or future congestion degree on a network. Furthermore, following data-driven experiments, we found an accurate fitting function of congestion degree to queue behavior. Thus, we propose an in-network load-balancing scheme based on a programmable switch, called queue-behavior-aware localized load balancing (QALL). In QALL, each switch independently selects egress ports probabilistically according to fine-grained-measured local queue behavior. The key concept of QALL is to take account the evolutionary process of reaching the current queue state into its decision basis for load balancing. Experimental results under actual DCN workloads (including web search and data mining workloads) demonstrate the effectiveness of QALL. In terms of flow completion time, decision delay, network shock, load sharing accuracy, and packet reordering, QALL outperformed recent perpacket (DRILL), per-flowlet (LetFlow and CONGA), and per-flow (ECMP) load balancers, particularly under heavy load. For example, under asymmetrical topology with 90% load level, the flow completion time of QALL was lower than that of ECMP, LetFlow, CONGA, and DRILL by up to 54.7%, 46.5%, 38.9%, and 18.9%, respectively.

show abstract

Section: ) Load Balancing At Traditional Switchmentioning

confidence: 99%