Scalable topological forwarding and routing policies in RINA‐enabled programmable data centers

Named data networking (NDN) is a new and promising Internet architecture, which aims to replace the current transmission control protocol/Internet protocol (TCP/IP)-based Internet. The NDN internet architecture has introduced several benefits in numerous applications. An NDN-based indoor positioning and navigation system can further optimize existing localization technologies with reduced the server load and faster response time. In this study, an NDN-based approach for the existing Wi-Fi fingerprinting-based indoor positioning and navigation was investigated. Among the many features of NDN, the network-level caching can reduce the computational load and response time of the localization and navigation server. The theoretical analysis of the runtime complexity shows that the NDN's network-level caching performance is better than those of the conventional algorithms. In this paper, naming methods for different services and a server-side algorithm for handling the NDN requests are proposed. The real-world implantation and testing results show a better overall performance than that of TCP/IP. This network-level optimization for indoor positioning and navigation opens new opportunities because it can be combined with other application-level optimization techniques for more efficient indoor positioning and navigation in the future.

Maintaining high-performance operation under dynamic and nonuniform network traffic has been a technical challenge in current data center networks (DCNs). With the aim to provide better quality of service (QoS) for diverse applications, this work presents a dynamic and adaptive DCN reconfiguration framework based on deep reinforcement learning (DCR2L). The proposed framework is integrated into the SDN control plane of the DCN, implementing real-time and automatic DCN reconfiguration. Performance of the DCR2L framework is experimentally demonstrated in our DCN lab, including 4 racks and 16 servers. Experimental results show a network latency improvement of 6.9% based on the DCR2L at an average network bandwidth of 2.3 Gb/s. Based on measured traffic and physical parameters in the experiment, performance of the DCR2L framework is numerically assessed with the realistic traffic of diverse QoS requirements for both electrical and optical DCNs and for different data center scales. Leaf–spine electrical and OPSquare optical networks are set up in an OMNeT++ simulator. For a data plane network consisting of 16 racks and 320 servers, results indicate that the DCR2L framework improves the network latency of up to 16.4% under leaf–spine and up to 24.6% under OPSquare for the overall traffic with respect to the classical heuristic method. For a DCN scale of 10,240 servers, the DCR2L framework provides up to 12.5% lower latency for the leaf–spine electrical network and up to 17.8% latency improvement for the OPSquare optical network.

An expandable and cost-effective data center network

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.

Today's data centers tend to have tens to hundreds of thousands of servers to provide massive and sophisticated services. Statistically, data center and data center networks (DCNs) remain highly underutilized which can be exploited for energy-saving. In this paper, we have studied energy-saving problem for network and server sides of the data center. The problem was formulated as a Mixed Integer Linear Program (MILP) that is solvable by an optimization software to jointly minimize the energy consumed by the servers and DCN. To overcome the optimization software high computational time, a heuristic algorithm to provide practical and efficient solution is introduced. The heuristic algorithm has two stages: first, it uses the virtual machines (VM) and the predicted servers resource utilization to provide VM consolidation algorithm and turn-off unused servers. The second stage uses an abstract performance-aware network flow consolidation that focused the traffic on subset of the network and turn-off the unused network devices. Simulation experiments using CloudsimSDN were conducted to validate the heuristic using real traces from Wikipedia in terms of energy consumption and average response time. The results show that the heuristic can save servers and network energy while maintaining performance.

To solve the bandwidth and latency issues in current hierarchical data center network (DCN) architectures based on electrical switches, we propose a novel hybrid DCN architecture based on distributed flow-controlled fast optical switches (FOS) and modified top-of-the-rack (TOR) switches (HiFOST). The intra-cluster interconnection of HiFOST is built by FOS with wavelength switching in nanoseconds’ time for an efficient statistical multiplexing operation, while the inter-cluster interconnection is connected by the TOR interfaces directly. Due to the lack of practical optical buffers, optical flow control is implemented to retransmit packets in case of contention. We investigate the performance of HiFOST DCN with different TOR buffer sizes, optical link capacities, elastic allocation of transceivers, and network scales under realistic data center (DC) traffic. The results show an average server-to-server latency of less than 2.8 μs, a packet loss <5.6×10−6 at load of 0.5 for a DC size of 94,080 servers with limited 50 KB TOR buffer. In addition, for scaling out the servers’ number and scaling up the data rate of connected servers, the cost and power consumption of the HiFOST DCN have been investigated and compared with the electrical Fat-Tree and Leaf-Spine DCN architectures, as well as with the optical H-LION and OPSquare DCN architectures. Results indicate that, for 94,080 servers operating at 10 Gb/s, HiFOST has a 48.2% and 34.1% savings of the cost and 46.3% and 32.5% savings of the power consumption with respect to the Fat-Tree and Leaf-Spine, respectively. For a HiFOST DCN supporting a 10880 server, scaling up the operating data rate of the server to 100 Gb/s, the HiFOST solution has a cost savings of 35.6% and 34.1% and power consumption of 56.5% and 59.2% as compared to the Fat-Tree and Leaf-Spine, respectively.

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.

Bandwidth-hungry applications such as Cloud computing, video sharing and social networking drive the creation of more powerful Data Centers (DCs) to manage the large amount of packetized traffic. Data center network (DCN) topologies rely on thousands of servers that exchange data via the switching backbone. Cluster switches and routers are employed to provide interconnectivity between elements of the same DC and inter DCs and must be able to handle the continuously variable loads. Hence, robust and scalable switching modules are needed. Conventional DCNs adopt multistage switches that are crossbar or/and memory based. However, current multistage packet switch architectures, with their space-memory variants, are either too complex to implement, have poor performance, or not cost effective. In this paper, we propose a novel and highly scalable multistage packet- switch design based on Network-on-Chip (NoC) fabrics for DCNs. In particular, we describe a novel three-stage packet-switch fabric with a Round-Robin packets dispatching scheme where each central stage module is based on a multihop Unidirectional NoC (UDN), instead of a classic singlehop crossbar fabric. The proposed design, referred to as Clos-UDN, overcomes all the shortcomings of conventional multistage architectures. In particular, as we shall demonstrate, the proposed Clos-UDN architecture: (i) Obviates the need for a complex and costly input modules, by means of few, yet simple, input FIFO queues. (ii) Avoids the need for a complex and synchronized scheduling process over a high number of input- output modules and/or port pairs. (iii) Provides speedup, load balancing and path- diversity thanks to a dynamic dispatching scheme as well as the NoC based fabric nature. Extensive simulation studies are conducted to compare the proposed Clos-UDN switch to traditional multistage switches. Simulation results show that the Clos-UDN outperforms previous designs under a wide range of input traffic scenarios, making it highly appealing for ultra-high capacity DC networks.

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.

Chapter 13 - Data Center Networks

As the scale of data centers and cloud computing applications increases, data center networks play a critical role in meeting the huge communication bandwidth requirement of such applications. The scalability of conventional electronic data center networks is limited by wiring complexity and reaching distance of links under fixed power budget. To overcome this problem, in this paper we propose a nonblocking hybrid switch architecture, called NEO (Nonblocking Electronic and Optical), which is able to provide nonblocking interconnections for as many as 1,000,000 servers in a data center. NEO maintains electronic interconnections for intra-pod networks, while providing interpod interconnections by optical core switches, which not only increases the scalability of the switch architecture, but also lowers the switch cost and power consumption compared to other existing optical switch architectures. We also design a packet scheduler for NEO, which adopts a credit flow control mechanism and a parallel scheduling algorithm to avoid packet loss, and provide low communication latency. Our simulation results demonstrate that NEO achieves very low average packet delay compared to other existing optical switching architectures under various traffic patterns.

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 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.

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

A survey on architectures and energy efficiency in Data Center Networks