BBBrahim Bensaou

Brahim Bensaou

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Brahim Bensaou has a total of 20 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Alleviating Congestion via Switch Design for Fair Buffer Allocation in Datacenters

    by Ahmed M. Abdelmoniem, Brahim Bensaou

    In data-centers, the composite origin and bursty nature of traffic, the small bandwidth-delay product and the tiny switch buffers lead to unusual congestion patterns that are not handled well by traditional end-to-end congestion control mechanisms such as TCP. Existing works address the problem by modifying TCP to adapt it to the idiosyncrasies of data-centers. While this is feasible in private environments, it remains almost impossible to achieve practically in public multi-tenant clouds where a multitude of operating systems and thus congestion control protocols coexist. In this work, we design a simple switch-based active queue management scheme to deal with such congestion issues adequately. Our approach requires no modification to TCP which enables easy and seamless deployment in public data-centers via switch software/firmware updates. We present a simple analysis to show its stability and effectiveness, then discuss three different real implementations in software and hardware switches on the NetFPGA platform. Numerical results from NS-2 simulation and experimental results from a small testbed cluster demonstrate the effectiveness of our approach in achieving high overall throughput, good fairness, smaller flow completion times (FCT) for short-lived flows, and reduction in the tail of the FCT distribution by as much as two orders of magnitude.


  • Open Access

    Enhancing TCP via Hysteresis Switching: Theoretical Analysis and Empirical Evaluation

    by Ahmed M. Abdelmoniem, Brahim Bensaou

    In this paper we study the relationship between the TCP packet loss cycle and the performance of time-sensitive traffic in data centers. Using real traffic measurements and analysis, we find that such loss cycles are not long enough to enable most partition-aggregate time-sensitive TCP applications to recover their packet losses via the TCP 3-dup ACKs mechanism. As a result, the Timeout (RTO) mechanism is frequently triggered, leading to the expansion of the flow completion times (FCT) of such applications by orders of magnitude. Hence, we seek an alternative method that does not change the virtual machines and that can effectively expand the loss cycle duration to enable short flows to finish their transfer without incurring the cost of the RTO. To this end, we propose a novel TCP-AQM mechanism that alternates between a slow constant bitrate (CBR) mode and a fast TCP rate via hysteresis switching to expand the loss cycle. We prove the stability of the proposed TCP-AQM via a control theoretic model, then evaluate its performance gains via small and large scale NS2 simulation and by real FPGA implementation of a prototype on the NetFPGA platform. The results show considerable improvements in FCT distribution and reduction of missed deadlines in simulation and real experiments.


  • Joint Content-Prefetching, Transmission Scheduling, and Rate Adaptation in Vehicular Networks

    by Sara Berri, Jun Zhang, Brahim Bensaou, Houda Labiod

    Content prefetching at road side units (RSUs) in vehicular networks can improve users’ experience by reducing the average data access latency. Prefetching algorithms proposed in the literature usually rely on a fixed modulation scheme, that corresponds to the lowest possible data rate for RSU-to-vehicles transmission. As a consequence, the network bandwidth is often inefficiently used. In this article, we propose to study the problem of efficient content broadcasting in vehicular networks and express it as a joint data-prefetching and broadcast transmission scheduling optimization problem, subject to cache size constraints and transmission rate adaptation constraints. In our study we consider a highway scenario covered by several RSUs, and take into account the deadline requirement of interactive applications. We express the problem as an integer linear programming problem, and solve it using a heuristic algorithm that determines: the content prefetching schedule, the broadcast transmission schedule and the rate adaptation schedule sequentially. Simulation results show that, i) it is beneficial to use adaptive rates to broadcast data instead of relying on single-rate with unicast transmissions; ii) using vehicular trajectories and content popularity in conjunction yields better results than simply relying on content popularity for content prefetching and caching; and iii) this holds even with inaccurately predicted vehicle locations and with delay-sensitive contents.


  • On Network Systems Design: Pushing the Performance Envelope via FPGA Prototyping

    by Ahmed M. Abdelmoniem, Yomna M. Abdelmoniem, Brahim Bensaou

    Performance studies of computer network systems traditionally relied on mathematical modelling. Then, to deal with the increasingly complex systems in a meaningful manner, simulation and emulation tools have been developed to circumvent the intractability or the oversimplification that comes with mathematical methods. However, such emulation methods still make many simplifying assumptions as they are incapable of capturing the real system in its totality. Recently, Field Programmable Gate Array (FPGA) based prototyping systems have become an affordable option for researchers as an easy and quick tool for network system prototyping. In this paper, we motivate system prototyping based research via FPGA in conducting research experiments as well as facilitating new system designs where some traditional software functions are offloaded to the FPGA. We present a new switch prototype and preliminary results from its deployment in a real testbed.

  • Mitigating incast-TCP congestion in data centers with SDN

    by Ahmed M. Abdelmoniem, Brahim Bensaou, Amuda James Abu


  • Energy Efficient Virtual Cluster Embedding in Public Data Centers

    by Xiangming Dai, Ying Wang, Jason Min Wang, Brahim Bensaou

    To improve their profits, it is crucial for cloud service providers to fulfil their tenants target QoS requirements in an energy efficient way. The services provided in many modern public clouds have graduated to include more sophisticated and flexible virtual clusters, encompassing not only the resource requirement of the virtual machines (VMs) but also the virtual topology between VMs. In this paper, we study the energy efficiency of virtual cluster embedding in data centers. We carefully develop a mathematical model, aiming to minimize the energy consumption of a data center, and given the NP- hardness of the problem, we propose an approximate algorithm MinE-VCE to solve the problem efficiently. We show via numerical experiments how MinE-VCE consistently outperforms other alternative algorithms.


  • Open Access

    Energy Efficient Medium Access with Interference Mitigation in LTE Femtocell Networks

    by Ying Wang, Xiangming Dai, Jason Min Wang, Brahim Bensaou

    With the rapidly increasing number of deployed LTE femtocell base stations (FBS), energy consumption of femtocell networks has become a serious environmental issue. Therefore, energy-efficient protocols are needed to balance the trade-off between energy saving and bandwidth utilization. The key component of the desired protocol to prevent both energy and bandwidth waste is interference mitigation, which, nevertheless, most previous work has failed to properly consider. To this end, in this paper, we manipulate user equipment (UE) association and OFDMA scheduling with a combination of interference mitigation. Recognizing the NP-hardness of the problem, we propose two distributed algorithms with guaranteed convergence. Extensive simulations show that our algorithms outperform the alternative algorithms in multiple metrics such as utility, power consumption, and convergence speed.

  • Congestion Control in the Wired Cum Wireless Internet

    by Shan Chen, Xiaojun Hei, Junhua Zhu, Brahim Bensaou

  • On Estimating the Bandwidth Share of TCP Connections in Presence of Reverse Traffic

    by Shan Chen, Brahim Bensaou, Junhua Zhu

    To improve the performance of TCP under different network scenarios, the idea of adjusting congestion window according to the bandwidth share estimation has been widely used. Various estimators are proposed in the literature. Some estimate the acquired bandwidth share, and some estimate the volume of traffic or packets queued in the buffers along the end-to-end path. We evaluate these estimation techniques with a common and effective performance metric, the number of DATA packets queued in the buffers and notice that because most estimators do not distinguish explicitly between the queuing delay on the forward path and that on the reverse path, in presence of large volumes of traffic on the reverse path these estimators become fragile. To address this problem, we propose a one-way queuing delay estimation scheme which only requires simple modifications to current TCP implementation (through a TCP option). With this estimation scheme, a one-way packet in queue estimator (OPQE) is proposed to provide a more robust and accurate estimation of the number of DATA packets queued along the forward path of a TCP connection. Simulation results show that OPQE has a good performance under different scenarios, even in the presence of reverse traffic.


  • Maximum Data Collection Least-Cost Routing in Energy Constrained Wireless Sensor Networks

    by Ka-Lok Hung, Brahim Bensaou, Junhua Zhu, Farid Nait-Abdesselam

    Sensor networks are deployed to gather some useful data from a field and forward it toward a set of base stations or sinks for data analysis and decision making. Each sensor node is endowed with a finite amount of energy, and each byte transmission or reception costs a certain fixed fraction of energy as well as a variable fraction that depends on the distance between sender and receiver. Maximizing the volume of data collected at the sinks until some particular set of nodes exhaust their battery and partition the network is a very desirable trait in sensor networks, as it equates with a high level of energy efficiency. In this paper we formulate the problem of maximum data collection routing for sensor networks as a utility maximization problem subject to energy constraints, and invoke lagrange relaxation, duality and sub-gradient technique to solve the problem. We then focus on the problem of path oscillation, which is well known to happen in routing algorithms where link costs are function of the traffic load and propose heuristic solutions to address this oscillation problem