Queue length feedback-based solution of TCP Incast in data center networks

Many applications in public clouds require a high fan-in, many-to-one type of data communication (known as TCP incast) in modern Data Center Networks (DCNs). Such communication could cause severe incast congestion in switches and result in TCP throughput collapse, substantially degrading the application performance. The root cause of throughput collapse is the Retransmission Timeouts (RTO) due to packet losses in congested switches. Tenants in public clouds can opt to use a variety of TCP versions. However, the existing solutions rely on modifications of TCP protocols and specific techniques from switches, and thus these existing solutions are not always feasible for public clouds. In this paper, we are inspired by the emerging virtualization and network softwarization technologies to develop a novel scheme called Retransmission timeout Avoidance by Packet Intelligent Discarding (RAPID) using software switches. RAPID considers the number of packets of each incast flow, buffered in the switch to selectively discard some packets, and ensures that the Fast Retransmission/Fast Recovery rather than RTO is invoked at the sender(s) in response to packet loss. Thus, the long idle period of a timeout and the throughput drop are avoided. We prove that, given a predetermined minimum switch buffer space, dedicated to the incast application, RAPID can prevent RTO in all the incast senders. We also present a low-complexity heuristic version of RAPID named RAPID-ED, which combines the principles of RAPID and early detection and is extremely easy to implement on today's software switches. We evaluate the two proposed schemes in a data center network testbed built on NS-3 simulator. The simulation results confirm the theoretical expectation, and show that the RAPID and RAPID-ED perform very well to prevent RTO of TCP incast flows and hence the throughput collapse. Compared with other incast solutions, RAPID and RAPID-ED do not modify TCP protocols and therefore are more suitable in public clouds.

The problem of TCP incast in data centers attracts a lot of attention in our research community. TCP incast is a catastrophic throughput collapse that occurs when multiple senders transmitting TCP data simultaneously to a single aggregator. Based on several experiments, researchers found that TCP timeouts are the primary cause of incast problem. Particularly, timeouts due to insufficient duplicate acknowledgments is unavoidable when at least one of the last three segments is lost from the tail of a window. As a result, this type of timeouts should be avoided to improve the goodput of TCP in data center networks. A few attempts have been made to reduce timeouts, but still the problem is not completely solved especially in the case of timeouts due to insufficient duplicate acknowledgments. In this paper, we present an efficient TCP fast retransmission approach, called TCP-EFR, which is capable to reduce TCP timeouts due to lack of duplicate acknowledgments which is caused by the loss of packets from the tail of a window in data center networks. TCP-EFR makes changes in the fast retransmission and recovery algorithm of TCP by using the congestion signal mechanism of DCTCP based on instantaneous queue length. In addition, TCP-EFR controls the sending rate for avoiding the overflow of switch buffer in order to reduce the loss of packets. The results of a series of simulations in single as well as multiple bottleneck topologies using qualnet 4.5 demonstrates that TCP-EFR can significantly reduce the timeouts due to inadequate duplicate acknowledgments and noticeably improves the performance compared to DCTCP, ICTCP and TCP in terms of goodput, accuracy and stability under various network conditions.

Nowadays, TCP has been used as the de facto transport layer protocol on the Internet. However, TCP incast happens inevitably in data centers, where exist massive concurrent flows, leading to packets loss, unacceptable long transmission time, and throughput collapse. Furthermore, DCTCP is widely used to solve these problems. Unfortunately, DCTCP cannot work well under a high concurrency environment. To this end, in this paper, we introduce a two-stage congestion control algorithm (TS-TCP) for high concurrency flows. The first step is to reduce the congestion window of long-lived flows aggressively to release bandwidth for short-lived flows. The second step is to decline the sending rate by adjusting the sending interval. Through the above steps, the proposed algorithm can mitigate the TCP incast effectively. The results, by using extensive ns3 simulation, show that TS-TCP can significantly outperform the DCTCP and TCP NewReno in terms of throughput and flow completion time. Moreover, TS-TCP can support hundreds of concurrent flows while maintaining about 85\% link utilization.

This paper presents large-scale analysis of traffic patterns in eighteen data centres (DCs). Data centre network (DCN) design emerges with improved architecture, as very little real information is available on existing DC traffic and characteristics. We analyzed traffic patterns of different organizations operating diverse applications. Data gathered for this analysis is over a time span of one year to observe the traffic patterns and present future predictability in network behavior. The paper presents traffic patterns and application behaviours of different applications for the observed time frames. Time frame as long-range dependence (LRD) that is maximum time span of one complete year and minimum of second time frame in small time scale (STC). The goal is to propose a traffic pattern oriented efficient bandwidth utilization and load balance by minimizing energy consumption. Our proposed framework is based on precise analysis of traffic parameters for large DCN. To improve bandwidth consumption and efficient link utilization of a network by defining a baseline threshold value that manages load balance for DC internal Traffic Engineering (TE).

Today, there is a generalized standard usage of internet for all.The devices via multiple technologies that facilitates to provide few communication methods to scholars to work with. By forming multiple paths in the data center network, latest generation data centers offer maximum bandwidth with robustness. To utilize this bandwidth, it is necessary that different data flows take separate paths. In brief, a single-path transport seems inappropriate for such networks. By using Multipath TCP, we must reconsider data center networks, with a diverse approach as to the association between topology, transport protocols, routing. Multipath TCP allows certain topologies that single path TCP cannot use. In newer generation data centers, Multipath TCP is already deployable using extensively deployed technologies such as Equal-cost multipath routing. But, major benefits will come when data centers are specifically designed for multipath transports. Due to manifold of technologies like Cloud computing, social networking, and information networks there is a need to deploy the number of large data centers. While Transport Control Protocol is the leading Layer-3 transport protocol in data center networks, the operating conditions like high bandwidth, small-buffered switches, and traffic patterns causes poor performance of TCP. Data Center TCP algorithm has newly been anticipated as a TCP option for data centers which address these limitations. It is worth noting that traditional TCP protocol.

Data centers (DCs), owing to the exponential growth of Internet services, have emerged as an irreplaceable and crucial infrastructure to power this ever-growing trend. A DC typically houses a large number of computing and storage nodes, interconnected by a specially designed network, namely, DC network (DCN). The DCN serves as a communication backbone and plays a pivotal role in optimizing DC operations. However, compared to the traditional network, the unique requirements in the DCN, for example, large scale, vast application diversity, high power density, and high reliability, pose significant challenges to its infrastructure and operations. We have observed from the premium publication venues (e.g., journals and system conferences) that increasing research efforts are being devoted to optimize the design and operations of the DCN. In this paper, we aim to present a systematic taxonomy and survey of recent research efforts on the DCN. Specifically, we propose to classify these research efforts into two areas: 1) DCN infrastructure and 2) DCN operations. For the former aspect, we review and compare the list of transmission technologies and network topologies used or proposed in the DCN infrastructure. For the latter aspect, we summarize the existing traffic control techniques in the DCN operations, and survey optimization methods to achieve diverse operational objectives, including high network utilization, fair bandwidth sharing, low service latency, low energy consumption, high resiliency, and etc., for efficient DC operations. We finally conclude this survey by envisioning a few open research opportunities in DCN infrastructure and operations.

Data center networks, using a reliable, high speed communication network, is a core component of cloud computing. Recently, optical networks using Space Division Multiplexing has been proposed as a solution to the speed bottleneck anticipated in data center networks. To our knowledge the new challenges of designing such communication systems have not been addressed yet. In this paper we have proposed an optimal approach to the problem of developing a path-protection scheme to handle communication requests in data center (DC) networks using elastic optical networking and space division multiplexing. We have formulated our problem as an Integer Linear Program (ILP). We have also proposed a heuristic that can handle problems of practical size. Our simulations explore important features of our approach.

The information and communication technology nowadays more than ever depends on the Internet and cloud computing, so that the data centers (DCs) have been converted to a constitutive unit of the cloud computing. A DC is composed of two primary parts: servers and Data Center Networks (DCNs). Robustness and scalability are two major challenges of the DCNs that are expanded based on two strategies, scale-out, and scale-up. This paper is distinctive from the related studies in two aspects. The first one is to simultaneously focus on both the scalability and the robustness challenges of the DCNs. For this purpose, we will concentrate on the comparison of robustness in the scalable models of these networks. The second one is, despite the previous work that only evaluated the DCN robustness under topological changes, we evaluated the robustness and fault tolerance against three types of unexpected changes in topology, traffic, and COI (community of interest) in the present work. Hence, we have chosen the network criticality (NC) as a graph-theoretic metric for analyzing DCN robustness. Afterward, we compare some structural and spectral graph metrics with NC among some well-known DCNs, and their scale-out and scale-up. Our results are useful to select the appropriate scaling strategy with the goal of maximizing the robustness of existing DCNs and provide a guideline for designing the new robust and scalable DCN.

Data center networks (DCNs) are at the forefront of a radical transformation, fueled by the rapid rise of artificial intelligence (AI), cloud-native adoption, and enterprise digitalization, which together place unprecedented demands on their design and performance. From healthcare AI and intelligent transportation to business analytics, modern DCNs are expected to support a diverse and evolving mix of bandwidth-demanding applications, each with distinct quality of service (QoS) requirements. Yet, most state-of-the-art DCN solutions rely on oversimplified DCN data traffic models, failing to address the required application-level differentiation in terms of end-to-end (E2E) latency demands. In response, we propose ALAS-DCN, a novel, to our knowledge, application-aware, low-latency, scalable DCN architecture, based on optical packet switching in the intra-rack and inter-rack domains that is both designed and rigorously evaluated using commercial QoS specifications and realistic traffic patterns of different applications coexisting within the same DCN. ALAS-DCN integrates three hierarchical optical sub-networks: intra-rack, inter-rack, and bridge, each governed by a custom wavelength division multiplexing (WDM) medium access control (MAC) protocol that dynamically prioritizes critical traffic packets, according to the specific application E2E latency demands. Unlike prior approaches, our evaluation leverages realistic workload traces generated by established traffic generators, capturing the application diversity within modern data center (DC) environments. Extensive experimental simulations across five representative DC categories, each hosting a different mix of modern applications, demonstrate that ALAS-DCN consistently achieves up to 95% throughput efficiency and sub-µs latency for high priority traffic across a variety of applications, consistently meeting their differentiated latency constraints. Scalable up to 20,000 servers, ALAS-DCN redefines the DCN as not just a transport layer but an intelligent enabler of next-generation application performance.

The number of data centers has been increased for various reasons such as cloud computing, big-data analysis, multimedia service, etc. With public interests on data center, many novel technologies for data center networks have been proposed and deployed to support data center operations more efficiently and effectively. However, the construction of data center network incurs significant costs. Moreover, various technologies interplay each other to achieve multiple objectives, and it makes difficult to validate and/or verify characteristics of data center network. In addition, it difficult to perform experiments with a number of hosts and switches. Therefore, it is necessary to observe the characteristics of target data center network before building it. A common approach to evaluate data center is to run simulations that should be similar with real-world data center environment. However, generating traffic with the characteristics of data center networks is not matured yet. People still employ a traffic generator based on the characteristics of Internet traffic. We design a traffic generator that shows more accurate characteristics of data center network traffic. Various traffic characteristics exploited explored by several studies are considered. The proposed method generates flow-level network traffic matrix based on Poisson Shot-Noise model. We implemented the traffic generator using Python programming language to create traffic matrix. To evaluate the proposed method, we compare the results with real data center network traffic. Our results show that the generated traffic owns similar characteristics with the real network traffic in terms of flow size, duration, and the mean and variance of total traffic rate.

Given the current expansion of cloud computing, the expected advent of the Internet of Things, and the requirements of future fifth‐generation network infrastructures, significantly larger pools of computational and storage resources will soon be required. This emphasizes the need for more scalable data centers that are capable of providing such an amount of resources in a cost‐effective way. A quick look into today's commercial data centers shows that they tend to rely on variations of well‐defined leaf‐spine/Clos data center network (DCN) topologies, offering low latency, ultrahigh bisectional bandwidth, and enhanced reliability against concurrent failures. However, DCNs are typically restricted by the use of the Transmission Control Protocol/Internet Protocol (TCP/IP) suite, thus suffering limited routing scalability. In this work, we study the benefits that replacing TCP/IP with the recursive internetwork architecture (RINA) can bring into commercial DCNs, focusing on forwarding and routing scalability. We quantitatively evaluate the benefits that RINA solutions can yield against those based on TCP/IP and highlight how, by deploying RINA, topological routing solutions can improve even more the efficiency of the network. To this goal, we propose a rule‐and‐exception forwarding policy tailored to the characteristics of several DCN variants, enabling fast forwarding decisions with merely neighbors' information. Upon failures, few exceptions are necessary, whose computation can also profit from the known topology. Extensive numerical results show that the proposed policy requirements depend mainly on the number of neighbors and concurrent failures in the DCN rather than its size, dramatically reducing the amount of forwarding and routing information stored at DCN nodes.

Data centre networks widely uses TCP for communication between the servers as it provides reliability and congestion control. However, TCP does not work well for certain type of communication patterns. One such a pattern is barrier synchronized many to one communication. During this type of data transmissions, multiple servers simultaneously transmits data to a single client and also the client cannot issues its next request until it receives all the data from current transmission. This will leads to severe throughput collapse in the networks which is called as TCP Incast. The major causes of TCP Incast are the basic TCP which is used as a transport protocol and the congestion that happens at switch. In this paper, we use TCP Lite as transport protocol instead of basic TCP and also an active queue management scheme called Random early detection Input/Output with Coupled average queue (RIO-C) is incorporated to the incast scenario. This controls the congestion that occurs due to barrier synchronized transmission. The performance analysis of RIO-C mechanism is done on the basis of metrics such as bytes received, throughput, packet loss and number of retransmissions.

CoMap: An efficient virtual network re-mapping strategy based on coalitional matching theory

A survey on architectures and energy efficiency in Data Center Networks

The Visible Light Communication (VLC) has the potential to provide dense and fast connectivity at low cost. In this paper, we propose WSWDC, a novel VLC enabled wireless small-world data center. It employs VLC links to achieve a fully wireless data center network (DCN) across racks for the first time. The using of VLC links eliminates hierarchical switches and inter-rack cables, and thus reducing hardware investment, as well as maintenance cost. More precisely, to simplify the configuration and control operations, we propose three DCN design rationales: (1) fully-wireless, all inter-rack links are wireless; (2) easy-deployable, it is not necessary to change the existing infrastructure inside data center; (3) plug-and-play, no extra centralized control operations are required. Previous proposals, however, cannot achieve the three rationales simultaneously. To this end, we first use regular VLC links to interconnect racks as a regular grid DCN. To further exploiting the benefits of VLC links, a few random VLC links are carefully introduced to update the wireless grid DCN as a wireless small-world DCN. To avoid the potential interference among VLC links, we deploy VLC transceivers at different height on the top of each rack. In this way, VLC links would not interfere with others at each height level. Moreover, we design a greedy but efficient routing method for any pair of racks using their identifiers as inputs. Comprehensive evaluation results indicate that our WSWDC exhibits good network performance.