27 December 2019 in IEEE Access
Due to the asynchronous and distributed nature of the data plane, the transition from the initial to final state may result in serious transient congestion in software-defined networking (SDN). Moreover, with the rapid development of ultra-low latency network in data-centers, the control loop between the control and data plane becomes much longer than the ultra-low latency communication in the data plane. In this case, traffic surges significantly in the data plane during the network reconfiguration process, and it becomes harder for the SDN controllers to manipulate the update operations as they expect. In this paper, we consider the traffic variation during the network update and model it as a novel minimum demand violation problem (MDVP). Later, we prove its hardness, and propose a heuristic approximation algorithm to approach the optimal result. Our method brings flexibility for network operators to make a trade-off between the network congestion and update speed. Experiments show that our method can halve the intermediate network states and reduce the demand violation ratio by 36.7 % compared to the state-of-the-art.
22 August 2024 in IEEE/ACM Transactions on Networking
RDMA over Converged Ethernet (RoCEv2) has been widely deployed to data centers (DCs) for its better compatibility with Ethernet/IP than Infiniband (IB). As cross-DC applications emerge, they also demand high throughput, low latency, and lossless network for cross-DC data transmission. However, RoCEv2’s underlying lossless mechanism Priority-based Flow Control (PFC) cannot fit into the long-haul transmission scenario and degrades the performance of RoCEv2. PFC is myopic and only considers queue length to pause upstream senders, which leads to large queueing delay. This paper proposes Bifrost, a downstream-driven lossless flow control that supports long distance cross-DC data transmission. Bifrost uses virtual incoming packets, which indicates the upper bound of in-flight packets, together with buffered packets to control the flow rate. It minimizes the buffer space requirement to one-hop bandwidth delay product (BDP) and achieves low one-way latency. Moreover, we extend Bifrost and propose BifrostX, to accommodate the multi-priority queue of the current switch implementation. BifrostX enables flow control for each queue separately while maintaining low buffer reservation, no throughput loss, and no packet loss. Real-world experiments are conducted with prototype switches and 80 kilometers cables. Evaluations demonstrate that compared to PFC, Bifrost reduces average/tail flow completion time (FCT) of inter-DC flows by up to 22.5%/42.0%, respectively. Bifrost is compatible with existing infrastructure and can support distance of thousands of kilometers.
4 February 2025 in Computer Networks
16 November 2022 in IEEE Transactions on Network and Service Management
Network performance guarantee in the cloud is one of the hottest research topics recently. However, current approaches either lack scalability or fail to achieve high performance. To avoid the hard tradeoff between the scalability and performance, we adopt a hybrid approach to get the best of both worlds. In this paper, we follow the stateless design principle and propose SLIT, which provides fast VM-level network performance isolation and maintains core-stateless characteristics. Specifically, at the end host, we develop a novel network-adaptive labeling mechanism and it computes the correct scheduling priority for each hop. At the switch, packets are scheduled based on their labels and we develop a novel straggler detection algorithm to find the new incoming flow. Our evaluation results show that SLIT can approximate the optimal performance of Weighted Fair Queuing (WFQ) effectively.