arXiv subjects

Aymen Hasan Alawadi

Publications and source records attributed to Aymen Hasan Alawadi.

2 recordsLinked to original sources

arXiv2026

Streamlined Pathway (SP) Approach: An Efficient Load Balancer to Enhance Quality of Service

Efficient load-balancing mechanisms are critical for maximizing performance and increasing the quality of service (QoS) of data center networks (DCNs). Obtaining the optimal QoS while minimizing resource consumption remains a significant challenge. This paper proposes the streamlined pathway (SP) model, which is a flow scheduling solution that requires minimal statistical knowledge of the DCN data plane. The SP model utilizes the software-defined networks (SDN) paradigm with less information gathered from the DCN data plane, besides the traditional hash-based flow scheduling mechanism, the Equal Cost Multi-Path (ECMP). In SDN, the proposed methodology harnesses a minimal yet powerful set of statistical data extracted from the DCN data plane, including port throughput and elephant flow information on the aggregate switches of the DCN fat-tree topology. Several experiments, in addition to theoretical analysis, have been conducted to demonstrate the efficiency of the proposed SP model in terms of QoS enhancement. These results confirm that SP outperforms leading techniques such as Sieve, Hedera, and ECMP, concerning bisection bandwidth, DCN link utilization, packet loss, and packet delivery latency.

cs.NI↗

arXiv2019

Methods for Predicting Behavior of Elephant Flows in Data Center Networks

Several Traffic Engineering (TE) techniques based on SDN (Software-defined networking) proposed to resolve flow competitions for network resources. However, there is no comprehensive study on the probability distribution of their throughput. Moreover, there is no study on predicting the future of elephant flows. To address these issues, we propose a new stochastic performance evaluation model to estimate the loss rate of two state-of-art flow scheduling algorithms including Equalcost multi-path routing (ECMP), Hedera besides a flow congestion control algorithm which is Data Center TCP (DCTCP). Although these algorithms have theoretical and practical benefits, their effectiveness has not been statistically investigated and analyzed in conserving the elephant flows. Therefore, we conducted extensive experiments on the fat-tree data center network to examine the efficiency of the algorithms under different network circumstances based on Monte Carlo risk analysis. The results show that Hedera is still risky to be used to handle the elephant flows due to its unstable throughput achieved under stochastic network congestion. On the other hand, DCTCP found suffering under high load scenarios. These outcomes might apply to all data center applications, in particular, the applications that demand high stability and productivity.

cs.NI↗