scholarly journals P4QCN: Congestion Control Using P4-Capable Device in Data Center Networks

Electronics ◽  
2019 ◽  
Vol 8 (3) ◽  
pp. 280
Author(s):  
Junjie Geng ◽  
Jinyao Yan ◽  
Yuan Zhang
Keyword(s):  
Congestion Control ◽  
Data Center ◽  
Control Mechanism ◽  
Direct Memory Access ◽  
Coarse Grained ◽  
Transport Protocol ◽  
Expected Performance ◽  
Control Scheme ◽  
Congestion Control Mechanism ◽  
Very High

Modern data centers aim to offer very high throughput and ultra-low latency to meet the demands of applications such as online intensive services. Traditional TCP/IP stacks cannot meet these requirements due to their high CPU overhead and high-latency. Remote Direct Memory Access (RDMA) is an approach that can be designed to meet this demand. The mainstream transport protocol of RDMA over Ethernet is RoCE (RDMA over Converged Ethernet), which relies on Priority Flow Control (PFC) within the network to enable a lossless network. However, PFC is a coarse-grained protocol which can lead to problems such as congestion spreading, head-of-the-line blocking. A congestion control protocol that can alleviate these problems of PFC is needed. We propose a protocol, called P4QCN for this purpose. P4QCN is a congestion control scheme for RoCE and it is an improved Quantized Congestion Notification (QCN) design based on P4, which is a flow-level, rate-based congestion control mechanism. P4QCN extends the QCN protocol to make it compatible with IP-routed networks based on a framework of P4 and adopts a two-point algorithm architecture which is more effective than the three-point architecture used in QCN and Data Center QCN(DCQCN). Experiments show that our proposed P4QCN algorithm achieves the expected performance in terms of latency and throughput.

scholarly journals Buffer Occupancy-Based Transport to Reduce Flow Completion Time of Short Flows in Data Center Networks

Symmetry ◽  
2019 ◽  
Vol 11 (5) ◽  
pp. 646 ◽  
Author(s):  
Hasnain Ahmed ◽  
Muhammad Junaid Arshad
Keyword(s):  
Congestion Control ◽  
Data Center ◽  
Completion Time ◽  
Current Data ◽  
Transport Protocol ◽  
Transport Protocols ◽  
Data Center Networks ◽  
Buffer Occupancy ◽  
Control Scheme ◽  
Precise Measure

Today’s data centers host a variety of different applications that impose specific requirements for their flows. Applications that generate short flows are usually latency sensitive; they require their flows to be completed as fast as possible. Short flows suffer to quickly increase their sending rate due to the existing long flows occupying most of the available capacity. This problem is caused due to the slow convergence of the current data center transport protocols. In this paper, we present a buffer occupancy-based transport protocol (BOTCP) to reduce flow completion time of short flows. BOTCP consists of two parts: (i) A novel buffer occupancy-based congestion signal, and (ii) a congestion control scheme that uses the congestion signal to reduce flow completion time of short flows. The proposed buffer occupancy-based congestion signal gives a precise measure of congestion. The congestion control scheme makes a differentiated treatment of short and long flows to reduce flow completion time of short flows. The results show that BOTCP significantly improves flow completion time of short flows over the existing transport protocols in data center networks.

Congestion Control in Data Center Networks: A Survey and New Perspectives

2013 ◽  
Vol 462-463 ◽  
pp. 1028-1035
Author(s):  
Hang Xing Wu ◽  
Xiao Long Yang ◽  
Min Zhang
Keyword(s):  
Congestion Control ◽  
Data Center ◽  
Data Centers ◽  
Web Applications ◽  
Control Mechanism ◽  
Control Mechanisms ◽  
Data Center Networks ◽  
Huge Amount ◽  
Advantages And Disadvantages ◽  
Congestion Control Mechanism

Nowadays data centers have been becoming increasingly important for various web applications, huge amount of cost is invested to maintain good performance of data center. Whereas some studies indicated that TCP Incast phenomenon was widely observed in most of data centers, which results in congestion in data centers and damages the performance of data center greatly. Thus some congestion control mechanisms for data center have been proposed to solve the problems. These mechanisms are categorized and described in this paper, and the advantages and disadvantages of these mechanisms are analyzed. Subsequently, some new interesting topics which may be worthy of further study in congestion control mechanism on data center are presented.

A Congestion Control Protocol in P2P Networks

2010 ◽  
Vol 29-32 ◽  
pp. 1241-1245
Author(s):  
Yong Xiang Zhao ◽  
Chang Jia Chen
Keyword(s):  
Congestion Control ◽  
Control Mechanism ◽  
Transport Protocol ◽  
P2p Networks ◽  
Control Protocol ◽  
Congestion Control Mechanism

Many of current P2P application tend to use UDP as their transport protocol. Since UDP does not provide congestion control mechanism, the developers of these applications have to decide how frequently to send UDP packet individually. It is necessary to provide a common congestion control protocol specially design for P2P networks. This paper proposes a protocol for such propose and use simulation to valid it

An Improved Congestion Control Mechanism Based on Mobile Agent for Wireless Sensor Networks

2014 ◽  
Vol 519-520 ◽  
pp. 1239-1242
Author(s):  
Xiao Hu Yu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Congestion Control ◽  
Mobile Agent ◽  
Mobile Agents ◽  
Control Mechanism ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Routing Table ◽  
Congestion Control Mechanism

An improved congestion control mechanism based on mobile agent for wireless sensor networks is proposed, which includes node-level congestion and link-level congestion control. The formers congestion information is collected and distributed by mobile agents (MA). When mobile agent travels through the networks, it can select a less-loaded neighbor node as its next hop and update the routing table according to the nodes congestion status. Minimum package of node outgoing traffic was preferentially transmitted in the link-level congestion. Simulation result shows that proposed mechanism attains high delivery ratio and throughput with reduced delay when compared with the existing technique.

An Extended Throughput Model of SCTP with Scalab Congestion Control

2011 ◽  
Vol 219-220 ◽  
pp. 1656-1659
Author(s):  
Chang Hua Liu ◽  
Cao Yuan
Keyword(s):  
Congestion Control ◽  
Analytical Model ◽  
Control Mechanism ◽  
Transmission Protocol ◽  
Local Networks ◽  
Ip Address ◽  
Stream Control Transmission Protocol ◽  
Throughput Model ◽  
Stream Control ◽  
Congestion Control Mechanism

The technologies of Wireless local networks and cellular network are very popular and more and more service under the integrated heterogeneous environment. Stream Control Transmission Protocol (SCTP) is considered as an ideal to support the communication between them by enabling a mobile client to freely switch the IP address in different networks. In this paper, we propose an extended analytical model for SCTP which consider the congestion window and scalable of congestion control mechanism. A great advantage of our model is that establishing a relationship between the throughput and congestion control mechanism. Furthermore, the analytical model provides a useful tool to improve congestion control mechanism of SCTP.

Sign in / Sign up

Export Citation Format

Share Document