With the emerging diverse applications in data centers,the demands on quality of service in data centers also become diverse,such as high throughput of elephant flows and low latency of deadline-sensitive flows.Howeve...With the emerging diverse applications in data centers,the demands on quality of service in data centers also become diverse,such as high throughput of elephant flows and low latency of deadline-sensitive flows.However,traditional TCPs are ill-suited to such situations and always result in the inefficiency(e.g.missing the flow deadline,inevitable throughput collapse)of data transfers.This further degrades the user-perceived quality of service(QoS)in data centers.To reduce the flow completion time of mice and deadline-sensitive flows along with promoting the throughput of elephant flows,an efficient and deadline-aware priority-driven congestion control(PCC)protocol,which grants mice and deadline-sensitive flows the highest priority,is proposed in this paper.Specifically,PCC computes the priority of different flows according to the size of transmitted data,the remaining data volume,and the flows’deadline.Then PCC adjusts the congestion window according to the flow priority and the degree of network congestion.Furthermore,switches in data centers control the input/output of packets based on the flow priority and the queue length.Different from existing TCPs,to speed up the data transfers of mice and deadline-sensitive flows,PCC provides an effective method to compute and encode the flow priority explicitly.According to the flow priority,switches can manage packets efficiently and ensure the data transfers of high priority flows through a weighted priority scheduling with minor modification.The experimental results prove that PCC can improve the data transfer performance of mice and deadline-sensitive flows while guaranting the throughput of elephant flows.展开更多
The 6th generation mobile networks(6G)network is a kind of multi-network interconnection and multi-scenario coexistence network,where multiple network domains break the original fixed boundaries to form connections an...The 6th generation mobile networks(6G)network is a kind of multi-network interconnection and multi-scenario coexistence network,where multiple network domains break the original fixed boundaries to form connections and convergence.In this paper,with the optimization objective of maximizing network utility while ensuring flows performance-centric weighted fairness,this paper designs a reinforcement learning-based cloud-edge autonomous multi-domain data center network architecture that achieves single-domain autonomy and multi-domain collaboration.Due to the conflict between the utility of different flows,the bandwidth fairness allocation problem for various types of flows is formulated by considering different defined reward functions.Regarding the tradeoff between fairness and utility,this paper deals with the corresponding reward functions for the cases where the flows undergo abrupt changes and smooth changes in the flows.In addition,to accommodate the Quality of Service(QoS)requirements for multiple types of flows,this paper proposes a multi-domain autonomous routing algorithm called LSTM+MADDPG.Introducing a Long Short-Term Memory(LSTM)layer in the actor and critic networks,more information about temporal continuity is added,further enhancing the adaptive ability changes in the dynamic network environment.The LSTM+MADDPG algorithm is compared with the latest reinforcement learning algorithm by conducting experiments on real network topology and traffic traces,and the experimental results show that LSTM+MADDPG improves the delay convergence speed by 14.6%and delays the start moment of packet loss by 18.2%compared with other algorithms.展开更多
1 Introduction The history of data centers can be traced back to the 1960s. Early data centers were deployed on main- frames that were time-shared by users via remote terminals. The boom in data centers came duringthe...1 Introduction The history of data centers can be traced back to the 1960s. Early data centers were deployed on main- frames that were time-shared by users via remote terminals. The boom in data centers came duringthe internet era. Many companies started building large inter- net-connected facililies,展开更多
Data center networks may comprise tens or hundreds of thousands of nodes,and,naturally,suffer from frequent software and hardware failures as well as link congestions.Packets are routed along the shortest paths with s...Data center networks may comprise tens or hundreds of thousands of nodes,and,naturally,suffer from frequent software and hardware failures as well as link congestions.Packets are routed along the shortest paths with sufficient resources to facilitate efficient network utilization and minimize delays.In such dynamic networks,links frequently fail or get congested,making the recalculation of the shortest paths a computationally intensive problem.Various routing protocols were proposed to overcome this problem by focusing on network utilization rather than speed.Surprisingly,the design of fast shortest-path algorithms for data centers was largely neglected,though they are universal components of routing protocols.Moreover,parallelization techniques were mostly deployed for random network topologies,and not for regular topologies that are often found in data centers.The aim of this paper is to improve scalability and reduce the time required for the shortest-path calculation in data center networks by parallelization on general-purpose hardware.We propose a novel algorithm that parallelizes edge relaxations as a faster and more scalable solution for popular data center topologies.展开更多
Cloud Datacenter Network(CDN)providers usually have the option to scale their network structures to allow for far more resource capacities,though such scaling options may come with exponential costs that contradict th...Cloud Datacenter Network(CDN)providers usually have the option to scale their network structures to allow for far more resource capacities,though such scaling options may come with exponential costs that contradict their utility objectives.Yet,besides the cost of the physical assets and network resources,such scaling may also imposemore loads on the electricity power grids to feed the added nodes with the required energy to run and cool,which comes with extra costs too.Thus,those CDNproviders who utilize their resources better can certainly afford their services at lower price-units when compared to others who simply choose the scaling solutions.Resource utilization is a quite challenging process;indeed,clients of CDNs usually tend to exaggerate their true resource requirements when they lease their resources.Service providers are committed to their clients with Service Level Agreements(SLAs).Therefore,any amendment to the resource allocations needs to be approved by the clients first.In this work,we propose deploying a Stackelberg leadership framework to formulate a negotiation game between the cloud service providers and their client tenants.Through this,the providers seek to retrieve those leased unused resources from their clients.Cooperation is not expected from the clients,and they may ask high price units to return their extra resources to the provider’s premises.Hence,to motivate cooperation in such a non-cooperative game,as an extension to theVickery auctions,we developed an incentive-compatible pricingmodel for the returned resources.Moreover,we also proposed building a behavior belief function that shapes the way of negotiation and compensation for each client.Compared to other benchmark models,the assessment results showthat our proposed models provide for timely negotiation schemes,allowing for better resource utilization rates,higher utilities,and grid-friend CDNs.展开更多
According to the high operating costs and a large number of energy waste in the current data center network architectures, we propose a kind of trusted flow preemption scheduling combining the energy-saving routing me...According to the high operating costs and a large number of energy waste in the current data center network architectures, we propose a kind of trusted flow preemption scheduling combining the energy-saving routing mechanism based on typical data center network architecture. The mechanism can make the network flow in its exclusive network link bandwidth and transmission path, which can improve the link utilization and the use of the network energy efficiency. Meanwhile, we apply trusted computing to guarantee the high security, high performance and high fault-tolerant routing forwarding service, which helps improving the average completion time of network flow.展开更多
In data centers, the transmission control protocol(TCP) incast causes catastrophic goodput degradation to applications with a many-to-one traffic pattern. In this paper, we intend to tame incast at the receiver-side a...In data centers, the transmission control protocol(TCP) incast causes catastrophic goodput degradation to applications with a many-to-one traffic pattern. In this paper, we intend to tame incast at the receiver-side application. Towards this goal, we first develop an analytical model that formulates the incast probability as a function of connection variables and network environment settings. We combine the model with the optimization theory and derive some insights into minimizing the incast probability through tuning connection variables related to applications. Then,enlightened by the analytical results, we propose an adaptive application-layer solution to the TCP incast.The solution equally allocates advertised windows to concurrent connections, and dynamically adapts the number of concurrent connections to the varying conditions. Simulation results show that our solution consistently eludes incast and achieves high goodput in various scenarios including the ones with multiple bottleneck links and background TCP traffic.展开更多
As a critical infrastructure of cloud computing,data center networks(DCNs)directly determine the service performance of data centers,which provide computing services for various applications such as big data processin...As a critical infrastructure of cloud computing,data center networks(DCNs)directly determine the service performance of data centers,which provide computing services for various applications such as big data processing and artificial intelligence.However,current architectures of data center networks suffer from a long routing path and a low fault tolerance between source and destination servers,which is hard to satisfy the requirements of high-performance data center networks.Based on dual-port servers and Clos network structure,this paper proposed a novel architecture RClos to construct high-performance data center networks.Logically,the proposed architecture is constructed by inserting a dual-port server into each pair of adjacent switches in the fabric of switches,where switches are connected in the form of a ring Clos structure.We describe the structural properties of RClos in terms of network scale,bisection bandwidth,and network diameter.RClos architecture inherits characteristics of its embedded Clos network,which can accommodate a large number of servers with a small average path length.The proposed architecture embraces a high fault tolerance,which adapts to the construction of various data center networks.For example,the average path length between servers is 3.44,and the standardized bisection bandwidth is 0.8 in RClos(32,5).The result of numerical experiments shows that RClos enjoys a small average path length and a high network fault tolerance,which is essential in the construction of high-performance data center networks.展开更多
Many ＂rich - connected＂ topologies with multiple parallel paths between smwers have been proposed for data center networks recently to provide high bisection bandwidth, but it re mains challenging to fully utilize t...Many ＂rich - connected＂ topologies with multiple parallel paths between smwers have been proposed for data center networks recently to provide high bisection bandwidth, but it re mains challenging to fully utilize the high network capacity by appropriate multi- path routing algorithms. As flow-level path splitting may lead to trafl＇ic imbalance between paths due to flow- size difference, packet-level path splitting attracts more attention lately, which spreads packets from flows into multiple available paths and significantly improves link utilizations. However, it may cause packet reordering, confusing the TCP congestion control algorithm and lowering the throughput of flows. In this paper, we design a novel packetlevel multi-path routing scheme called SOPA, which leverag- es OpenFlow to perform packet-level path splitting in a round- robin fashion, and hence significantly mitigates the packet reordering problem and improves the network throughput. Moreover, SOPA leverages the topological feature of data center networks to encode a very small number of switches along the path into the packet header, resulting in very light overhead. Compared with random packet spraying （RPS）, Hedera and equal-cost multi-path routing （ECMP）, our simulations demonstrate that SOPA achieves 29.87%, 50.41% and 77.74% higher network throughput respectively under permutation workload, and reduces average data transfer completion time by 53.65%, 343.31% and 348.25% respectively under production workload.展开更多
In a data center network （DCN）, load balancing is required when servers transfer data on the same path. This is necessary to avoid congestion. Load balancing is challenged by the dynamic transferral of demands and c...In a data center network （DCN）, load balancing is required when servers transfer data on the same path. This is necessary to avoid congestion. Load balancing is challenged by the dynamic transferral of demands and complex routing control. Because of the distributed nature of a traditional network, previous research on load balancing has mostly focused on improving the performance of the local network; thus, the load has not been optimally balanced across the entire network. In this paper, we propose a novel dynamic load-balancing algorithm for fat-tree. This algorithm avoids congestions to the great possible extent by searching for non-conflicting paths in a centralized way. We implement the algorithm in the popular software-defined networking architecture and evaluate the algorithm＇ s performance on the Mininet platform. The results show that our algorithm has higher bisection band- width than the traditional equal-cost multi-path load-balancing algorithm and thus more effectively avoids congestion.展开更多
The increasing globalization of the Chinese economy has been enabled by both Chinese financial institutions operating globally as well as international firms operating within China. In geographical terms, this has bee...The increasing globalization of the Chinese economy has been enabled by both Chinese financial institutions operating globally as well as international firms operating within China. In geographical terms, this has been organized through a number of strategic cities serving as gateways for the exchange of financial functions, products and practices between China and the global economy. Drawing on location data of financial service firms in China listed on stock exchanges in Shenzhen, Shanghai and Hong Kong, this paper shows that Chinese financial firms are expanding globally and how Chinese financial centers are positioned and connected in the urban networks shaped by these financial service firms. It is found that Hong Kong, China, holds strategic positions in the integration of Chinese cities into global financial center networks, and that establishing a foothold in global financial centers such as New York and London has been a priority for Chinese financial institutions. The increasing capital flows directed by Chinese financial institutionssuggests a shifting global financial geography, with numerous Chinese cities playing increasingly important roles within global financial center networks.展开更多
In recent years,dual-homed topologies have appeared in data centers in order to offer higher aggregate bandwidth by using multiple paths simultaneously.Multipath TCP(MPTCP) has been proposed as a replacement for TCP i...In recent years,dual-homed topologies have appeared in data centers in order to offer higher aggregate bandwidth by using multiple paths simultaneously.Multipath TCP(MPTCP) has been proposed as a replacement for TCP in those topologies as it can efficiently offer improved throughput and better fairness.However,we have found that MPTCP has a problem in terms of incast collapse where the receiver suffers a drastic goodput drop when it simultaneously requests data over multiple servers.In this paper,we investigate why the goodput collapses even if MPTCP is able to actively relieve hot spots.In order to address the problem,we propose an equally-weighted congestion control algorithm for MPTCP,namely EW-MPTCP,without need for centralized control,additional infrastructure and a hardware upgrade.In our scheme,in addition to the coupled congestion control performed on each subflow of an MPTCP connection,we allow each subflow to perform an additional congestion control operation by weighting the congestion window in reverse proportion to the number of servers.The goal is to mitigate incast collapse by allowing multiple MPTCP subflows to compete fairly with a single-TCP flow at the shared bottleneck.The simulation results show that our solution mitigates the incast problem and noticeably improves goodput in data centers.展开更多
We experimentally demonstrate the multiple signal modulation on a single class 10 G vertical cavity surface emitting laser(VCSEL) carrier at 1 310 nm for next generation multicast-enabled data center networks. A 10 Gb...We experimentally demonstrate the multiple signal modulation on a single class 10 G vertical cavity surface emitting laser(VCSEL) carrier at 1 310 nm for next generation multicast-enabled data center networks. A 10 Gbit/s data signal is directly modulated onto a single mode VCSEL carrier. To maximize carrier spectral efficiency, a 2 GHz reference frequency(RF) clock tone is simultaneously modulated on the VCSEL phase attribute. The inherent VCSEL orthogonal polarization bistability with changing bias current is further exploited in transmission of a polarization based pulse per second(PPS) timing clock signal. Therefore, we simultaneously transmit a 10 Gbit/s directly modulated data, 2 GHz phase modulated RF and a polarization-based PPS clock signals using a single mode 10 GHz bandwidth VCSEL carrier. It is the first time that a single class 10 G VCSEL carrier is reported to transmit a directly modulated data, phase modulated RF clock and polarization based PPS timing signal simultaneously in a single wavelength. A of G.652 single mode fibre(SMF) transmission over 3.21 km is experimentally attained. A receiver sensitivity of-15.60 dBm is experimentally obtained for the directly modulated 10 Gbit/s data signal. A 3.21-km-long SMF transmission introduces a penalty of 0.23 dB to the data signal. The contribution of a 2 GHz phase modulated RF and a polarization-based PPS clock signal to this penalty is found to be 0.03 dB. An RF single-side band(SSB) phase noise values of -82.36 dBc/Hz and -77.97 dBc/Hz are attained without and with simultaneous directly modulated data and polarization-based PPS clock signals respectively for a 3.21-km-long SMF transmission. This work provides an alternative efficient and cost effective technique for simultaneous high-speed multiple information transmission to different network nodes within a data center network through shared network infrastructure.展开更多
This paper investigates autonomic cloud data center networks, which is the solution with the increasingly complex computing environment, in terms of the management and cost issues to meet users’ growing demand. The v...This paper investigates autonomic cloud data center networks, which is the solution with the increasingly complex computing environment, in terms of the management and cost issues to meet users’ growing demand. The virtualized cloud networking is to provide a plethora of rich online applications, including self-configuration, self-healing, self-optimization and self-protection. In addition, we draw on the intelligent subject and multi-agent system, concerning system model, strategy, autonomic cloud computing, involving independent computing system development and implementation. Then, combining the architecture with the autonomous unit, we propose the MCDN (Model of Autonomic Cloud Data Center Networks). This model can define intelligent state, elaborate the composition structure, and complete life cycle. Finally, our proposed public infrastructure can be provided with the autonomous unit in the supported interaction model.展开更多
The heterogeneity of applications and their divergent resource requirements lead to uneven traffic distribution and imbalanced resource utilization across data center networks(DCNs).We propose a fine-grained baseband ...The heterogeneity of applications and their divergent resource requirements lead to uneven traffic distribution and imbalanced resource utilization across data center networks(DCNs).We propose a fine-grained baseband function reallocation scheme in heterogeneous optical switching-based DCNs.A deep reinforcement learning-based functional split and resource mapping approach(DRL-BFM)is proposed to maximize throughput in high-load server racks by implementing load balancing in DCNs.The results demonstrate that DRL-BFM improves the throughput by 20.8%,22.8%,and 29.8%on average compared to existing algorithms under different computational capacities,bandwidth constraints,and latency conditions,respectively.展开更多
With the expansion and increasing complexity of data center networks(DCNs),network fault-tolerance has become increasingly important.RRect is a server-centered DCN with a good interconnection structure.In this paper,w...With the expansion and increasing complexity of data center networks(DCNs),network fault-tolerance has become increasingly important.RRect is a server-centered DCN with a good interconnection structure.In this paper,we propose a fault-tolerant routing algorithm RRFP under a conditional fault pattern of RRect,which can find a fault-free path between any two fault-free vertices.Firstly,we study a fault pattern of RRect in the case of restricted faulty vertex sets,{1,2}-restricted connectivity.It is about{2,3}times RRect’s traditional connectivity,indicating that{1,2}-restricted connectivity better evaluates the fault-tolerant capability.Secondly,we design an effective fault-tolerant routing algorithm RRFP under the conditional fault pattern of RRect,and RRFP can accommodate more faulty vertices.Finally,we conduct experiments on RRFP to evaluate its performance.The experimental results show that in terms of the running time,as parameters n and k change,RRFP outperforms Dijkstra’s algorithm by 64%–84%and Breadth-First-Search(BFS)by 56%–71%.The running time of all the three algorithms is very short as parameter m changes.In terms of the constructing path length,as parameters change,RRFP outperforms BFS by 12%–19%.Moreover,the path constructed by RRFP approaches the shortest path of Dijkstra’s algorithm.Moreover,RRFP still maintains a low transmission failure rate(TFR)and high reliability even with an increase in the number of fault elements.展开更多
This paper presents a compact broadband antenna that overcomes bandwidth limitations in a diamond nitrogenvacancy(NV)center-based quantum magnetic sensor.Conventional antennas struggle to achieve both broadband operat...This paper presents a compact broadband antenna that overcomes bandwidth limitations in a diamond nitrogenvacancy(NV)center-based quantum magnetic sensor.Conventional antennas struggle to achieve both broadband operation and compact integration,restricting the sensitivity and dynamic range of the sensor.The broadband antenna based on a dualfrequency monopole structure achieves a bandwidth extension of 777 MHz at the Zeeman splitting frequency of 2.87 GHz,with the dual resonant points positioned near 2.87 GHz.Additionally,high-resolution imaging of the microwave magnetic field on the antenna surface was performed using a diamond optical fiber probe,which verified the dual-frequency design principle.Experimental results using the proposed antenna demonstrate the outstanding performance of the NV centerbased magnetic sensor:a sensitivity of 55 nT/Hz^(1/2)and a dynamic range of up to 54.0 dB.Compared to sensors using conventional antennas,the performance has been significantly improved.展开更多
The effect of gradient exhaust strategy and blind plate installation on the inhibition of backflow and thermal stratification in data center cabinets is systematically investigated in this study through numericalmetho...The effect of gradient exhaust strategy and blind plate installation on the inhibition of backflow and thermal stratification in data center cabinets is systematically investigated in this study through numericalmethods.The validated Re-Normalization Group(RNG)k-ε turbulence model was used to analyze airflow patterns within cabinet structures equipped with backplane air conditioning.Key findings reveal that server-generated thermal plumes induce hot air accumulation at the cabinet apex,creating a 0.8℃ temperature elevation at the top server’s inlet compared to the ideal situation(23℃).Strategic increases in backplane fan exhaust airflow rates reduce server 1’s inlet temperature from 26.1℃(0%redundancy case)to 23.1℃(40%redundancy case).Gradient exhaust strategies achieve equivalent server temperature performance to uniform exhaust distributions while requiring 25%less redundant airflow.This approach decreases the recirculation ratio from1.52%(uniformexhaust at 15%redundancy)to 0.57%(gradient exhaust at equivalent redundancy).Comparative analyses demonstrate divergent thermal behaviors:in bottom-server-absent configurations,gradient exhaust reduces top server inlet temperatures by 1.6℃vs.uniformexhaust,whereas top-serverabsent configurations exhibit a 1.8℃ temperature increase under gradient conditions.The blind plate implementation achieves a 0.4℃ top server temperature reduction compared to 15%-redundancy uniform exhaust systems without requiring additional airflow redundancy.Partially installed server arrangements with blind plates maintain thermal characteristics comparable to fully populated cabinets.This study validates gradient exhaust and blind plate technologies as effective countermeasures against cabinet-scale thermal recirculation,providing actionable insights for optimizing backplane air conditioning systems in mission-critical data center environments.展开更多
With the advent of the digital economy,there has been a rapid proliferation of small-scale Internet data centers(SIDCs).By leveraging their spatiotemporal load regulation potential through data workload balancing,aggr...With the advent of the digital economy,there has been a rapid proliferation of small-scale Internet data centers(SIDCs).By leveraging their spatiotemporal load regulation potential through data workload balancing,aggregated SIDCs have emerged as promising demand response(DR)resources for future power distribution systems.This paper presents an innovative framework for assessing capacity value(CV)by aggregating SIDCs participating in DR programs(SIDC-DR).Initially,we delineate the concept of CV tailored for aggregated SIDC scenarios and establish a metric for the assessment.Considering the effects of the data load dynamics,equipment constraints,and user behavior,we developed a sophisticated DR model for aggregated SIDCs using a data network aggregation method.Unlike existing studies,the proposed model captures the uncertainties associated with end tenant decisions to opt into an SIDC-DR program by utilizing a novel uncertainty modeling approach called Z-number formulation.This approach accounts for both the uncertainty in user participation intentions and the reliability of basic information during the DR process,enabling high-resolution profiling of the SIDC-DR potential in the CV evaluation.Simulation results from numerical studies conducted on a modified IEEE-33 node distribution system confirmed the effectiveness of the proposed approach and highlighted the potential benefits of SIDC-DR utilization in the efficient operation of future power systems.展开更多
Propelled by the rise of artificial intelligence,cloud services,and data center applications,next-generation,low-power,local-oscillator-less,digital signal processing(DSP)-free,and short-reach coherent optical communi...Propelled by the rise of artificial intelligence,cloud services,and data center applications,next-generation,low-power,local-oscillator-less,digital signal processing(DSP)-free,and short-reach coherent optical communication has evolved into an increasingly prominent area of research in recent years.Here,we demonstrate DSP-free coherent optical transmission by analog signal processing in frequency synchronous optical network(FSON)architecture,which supports polarization multiplexing and higher-order modulation formats.The FSON architecture that allows the numerous laser sources of optical transceivers within a data center can be quasi-synchronized by means of a tree-distributed homology architecture.In conjunction with our proposed pilot-tone assisted Costas loop for an analog coherent receiver,we achieve a record dual-polarization 224-Gb/s 16-QAM 5-km mismatch transmission with reset-free carrier phase recovery in the optical domain.Our proposed DSP-free analog coherent detection system based on the FSON makes it a promising solution for next-generation,low-power,and high-capacity coherent data center interconnects.展开更多
基金supported part by the National Natural Science Foundation of China(61601252,61801254)Public Technology Projects of Zhejiang Province(LG-G18F020007)+1 种基金Zhejiang Provincial Natural Science Foundation of China(LY20F020008,LY18F020011,LY20F010004)K.C.Wong Magna Fund in Ningbo University。
文摘With the emerging diverse applications in data centers,the demands on quality of service in data centers also become diverse,such as high throughput of elephant flows and low latency of deadline-sensitive flows.However,traditional TCPs are ill-suited to such situations and always result in the inefficiency(e.g.missing the flow deadline,inevitable throughput collapse)of data transfers.This further degrades the user-perceived quality of service(QoS)in data centers.To reduce the flow completion time of mice and deadline-sensitive flows along with promoting the throughput of elephant flows,an efficient and deadline-aware priority-driven congestion control(PCC)protocol,which grants mice and deadline-sensitive flows the highest priority,is proposed in this paper.Specifically,PCC computes the priority of different flows according to the size of transmitted data,the remaining data volume,and the flows’deadline.Then PCC adjusts the congestion window according to the flow priority and the degree of network congestion.Furthermore,switches in data centers control the input/output of packets based on the flow priority and the queue length.Different from existing TCPs,to speed up the data transfers of mice and deadline-sensitive flows,PCC provides an effective method to compute and encode the flow priority explicitly.According to the flow priority,switches can manage packets efficiently and ensure the data transfers of high priority flows through a weighted priority scheduling with minor modification.The experimental results prove that PCC can improve the data transfer performance of mice and deadline-sensitive flows while guaranting the throughput of elephant flows.
文摘The 6th generation mobile networks(6G)network is a kind of multi-network interconnection and multi-scenario coexistence network,where multiple network domains break the original fixed boundaries to form connections and convergence.In this paper,with the optimization objective of maximizing network utility while ensuring flows performance-centric weighted fairness,this paper designs a reinforcement learning-based cloud-edge autonomous multi-domain data center network architecture that achieves single-domain autonomy and multi-domain collaboration.Due to the conflict between the utility of different flows,the bandwidth fairness allocation problem for various types of flows is formulated by considering different defined reward functions.Regarding the tradeoff between fairness and utility,this paper deals with the corresponding reward functions for the cases where the flows undergo abrupt changes and smooth changes in the flows.In addition,to accommodate the Quality of Service(QoS)requirements for multiple types of flows,this paper proposes a multi-domain autonomous routing algorithm called LSTM+MADDPG.Introducing a Long Short-Term Memory(LSTM)layer in the actor and critic networks,more information about temporal continuity is added,further enhancing the adaptive ability changes in the dynamic network environment.The LSTM+MADDPG algorithm is compared with the latest reinforcement learning algorithm by conducting experiments on real network topology and traffic traces,and the experimental results show that LSTM+MADDPG improves the delay convergence speed by 14.6%and delays the start moment of packet loss by 18.2%compared with other algorithms.
基金supported by the ZTE-BJTU Collaborative Research Program under Grant No. K11L00190the Fundamental Research Funds for the Central Universities under Grant No. K12JB00060
文摘1 Introduction The history of data centers can be traced back to the 1960s. Early data centers were deployed on main- frames that were time-shared by users via remote terminals. The boom in data centers came duringthe internet era. Many companies started building large inter- net-connected facililies,
基金This work was supported by the Serbian Ministry of Science and Education(project TR-32022)by companies Telekom Srbija and Informatika.
文摘Data center networks may comprise tens or hundreds of thousands of nodes,and,naturally,suffer from frequent software and hardware failures as well as link congestions.Packets are routed along the shortest paths with sufficient resources to facilitate efficient network utilization and minimize delays.In such dynamic networks,links frequently fail or get congested,making the recalculation of the shortest paths a computationally intensive problem.Various routing protocols were proposed to overcome this problem by focusing on network utilization rather than speed.Surprisingly,the design of fast shortest-path algorithms for data centers was largely neglected,though they are universal components of routing protocols.Moreover,parallelization techniques were mostly deployed for random network topologies,and not for regular topologies that are often found in data centers.The aim of this paper is to improve scalability and reduce the time required for the shortest-path calculation in data center networks by parallelization on general-purpose hardware.We propose a novel algorithm that parallelizes edge relaxations as a faster and more scalable solution for popular data center topologies.
基金The Deanship of Scientific Research at Hashemite University partially funds this workDeanship of Scientific Research at the Northern Border University,Arar,KSA for funding this research work through the project number“NBU-FFR-2024-1580-08”.
文摘Cloud Datacenter Network(CDN)providers usually have the option to scale their network structures to allow for far more resource capacities,though such scaling options may come with exponential costs that contradict their utility objectives.Yet,besides the cost of the physical assets and network resources,such scaling may also imposemore loads on the electricity power grids to feed the added nodes with the required energy to run and cool,which comes with extra costs too.Thus,those CDNproviders who utilize their resources better can certainly afford their services at lower price-units when compared to others who simply choose the scaling solutions.Resource utilization is a quite challenging process;indeed,clients of CDNs usually tend to exaggerate their true resource requirements when they lease their resources.Service providers are committed to their clients with Service Level Agreements(SLAs).Therefore,any amendment to the resource allocations needs to be approved by the clients first.In this work,we propose deploying a Stackelberg leadership framework to formulate a negotiation game between the cloud service providers and their client tenants.Through this,the providers seek to retrieve those leased unused resources from their clients.Cooperation is not expected from the clients,and they may ask high price units to return their extra resources to the provider’s premises.Hence,to motivate cooperation in such a non-cooperative game,as an extension to theVickery auctions,we developed an incentive-compatible pricingmodel for the returned resources.Moreover,we also proposed building a behavior belief function that shapes the way of negotiation and compensation for each client.Compared to other benchmark models,the assessment results showthat our proposed models provide for timely negotiation schemes,allowing for better resource utilization rates,higher utilities,and grid-friend CDNs.
基金supported by the National Natural Science Foundation of China(The key trusted running technologies for the sensing nodes in Internet of things: 61501007The outstanding personnel training program of Beijing municipal Party Committee Organization Department (The Research of Trusted Computing environment for Internet of things in Smart City: 2014000020124G041
文摘According to the high operating costs and a large number of energy waste in the current data center network architectures, we propose a kind of trusted flow preemption scheduling combining the energy-saving routing mechanism based on typical data center network architecture. The mechanism can make the network flow in its exclusive network link bandwidth and transmission path, which can improve the link utilization and the use of the network energy efficiency. Meanwhile, we apply trusted computing to guarantee the high security, high performance and high fault-tolerant routing forwarding service, which helps improving the average completion time of network flow.
基金supported by the Fundamental Research Fundsfor the Central Universities under Grant No.ZYGX2015J009the Sichuan Province Scientific and Technological Support Project under Grants No.2014GZ0017 and No.2016GZ0093
文摘In data centers, the transmission control protocol(TCP) incast causes catastrophic goodput degradation to applications with a many-to-one traffic pattern. In this paper, we intend to tame incast at the receiver-side application. Towards this goal, we first develop an analytical model that formulates the incast probability as a function of connection variables and network environment settings. We combine the model with the optimization theory and derive some insights into minimizing the incast probability through tuning connection variables related to applications. Then,enlightened by the analytical results, we propose an adaptive application-layer solution to the TCP incast.The solution equally allocates advertised windows to concurrent connections, and dynamically adapts the number of concurrent connections to the varying conditions. Simulation results show that our solution consistently eludes incast and achieves high goodput in various scenarios including the ones with multiple bottleneck links and background TCP traffic.
基金This work was supported by the Hainan Provincial Natural Science Foundation of China(620RC560,2019RC096,620RC562)the Scientific Research Setup Fund of Hainan University(KYQD(ZR)1877)+2 种基金the National Natural Science Foundation of China(62162021,82160345,61802092)the key research and development program of Hainan province(ZDYF2020199,ZDYF2021GXJS017)the key science and technology plan project of Haikou(2011-016).
文摘As a critical infrastructure of cloud computing,data center networks(DCNs)directly determine the service performance of data centers,which provide computing services for various applications such as big data processing and artificial intelligence.However,current architectures of data center networks suffer from a long routing path and a low fault tolerance between source and destination servers,which is hard to satisfy the requirements of high-performance data center networks.Based on dual-port servers and Clos network structure,this paper proposed a novel architecture RClos to construct high-performance data center networks.Logically,the proposed architecture is constructed by inserting a dual-port server into each pair of adjacent switches in the fabric of switches,where switches are connected in the form of a ring Clos structure.We describe the structural properties of RClos in terms of network scale,bisection bandwidth,and network diameter.RClos architecture inherits characteristics of its embedded Clos network,which can accommodate a large number of servers with a small average path length.The proposed architecture embraces a high fault tolerance,which adapts to the construction of various data center networks.For example,the average path length between servers is 3.44,and the standardized bisection bandwidth is 0.8 in RClos(32,5).The result of numerical experiments shows that RClos enjoys a small average path length and a high network fault tolerance,which is essential in the construction of high-performance data center networks.
基金supported by the National Basic Research Program of China(973 program)under Grant No.2014CB347800 and No.2012CB315803the National High-Tech R&D Program of China(863 program)under Grant No.2013AA013303+1 种基金the Natural Science Foundation of China under Grant No.61170291,No.61133006,and No.61161140454ZTE IndustryAcademia-Research Cooperation Funds
文摘Many ＂rich - connected＂ topologies with multiple parallel paths between smwers have been proposed for data center networks recently to provide high bisection bandwidth, but it re mains challenging to fully utilize the high network capacity by appropriate multi- path routing algorithms. As flow-level path splitting may lead to trafl＇ic imbalance between paths due to flow- size difference, packet-level path splitting attracts more attention lately, which spreads packets from flows into multiple available paths and significantly improves link utilizations. However, it may cause packet reordering, confusing the TCP congestion control algorithm and lowering the throughput of flows. In this paper, we design a novel packetlevel multi-path routing scheme called SOPA, which leverag- es OpenFlow to perform packet-level path splitting in a round- robin fashion, and hence significantly mitigates the packet reordering problem and improves the network throughput. Moreover, SOPA leverages the topological feature of data center networks to encode a very small number of switches along the path into the packet header, resulting in very light overhead. Compared with random packet spraying （RPS）, Hedera and equal-cost multi-path routing （ECMP）, our simulations demonstrate that SOPA achieves 29.87%, 50.41% and 77.74% higher network throughput respectively under permutation workload, and reduces average data transfer completion time by 53.65%, 343.31% and 348.25% respectively under production workload.
基金supported by the National Basic Research Program of China(973 Program)(2012CB315903)the Key Science and Technology Innovation Team Project of Zhejiang Province(2011R50010-05)+3 种基金the National Science and Technology Support Program(2014BAH24F01)863 Program of China(2012AA01A507)the National Natural Science Foundation of China(61379118 and 61103200)sponsored by the Research Fund of ZTE Corporation
文摘In a data center network （DCN）, load balancing is required when servers transfer data on the same path. This is necessary to avoid congestion. Load balancing is challenged by the dynamic transferral of demands and complex routing control. Because of the distributed nature of a traditional network, previous research on load balancing has mostly focused on improving the performance of the local network; thus, the load has not been optimally balanced across the entire network. In this paper, we propose a novel dynamic load-balancing algorithm for fat-tree. This algorithm avoids congestions to the great possible extent by searching for non-conflicting paths in a centralized way. We implement the algorithm in the popular software-defined networking architecture and evaluate the algorithm＇ s performance on the Mininet platform. The results show that our algorithm has higher bisection band- width than the traditional equal-cost multi-path load-balancing algorithm and thus more effectively avoids congestion.
基金Under the auspices of the National Natural Science Foundation of China(No.41201107)the Fundamental Research Funds for the Central Universities(No.2015KJJCB30)
文摘The increasing globalization of the Chinese economy has been enabled by both Chinese financial institutions operating globally as well as international firms operating within China. In geographical terms, this has been organized through a number of strategic cities serving as gateways for the exchange of financial functions, products and practices between China and the global economy. Drawing on location data of financial service firms in China listed on stock exchanges in Shenzhen, Shanghai and Hong Kong, this paper shows that Chinese financial firms are expanding globally and how Chinese financial centers are positioned and connected in the urban networks shaped by these financial service firms. It is found that Hong Kong, China, holds strategic positions in the integration of Chinese cities into global financial center networks, and that establishing a foothold in global financial centers such as New York and London has been a priority for Chinese financial institutions. The increasing capital flows directed by Chinese financial institutionssuggests a shifting global financial geography, with numerous Chinese cities playing increasingly important roles within global financial center networks.
基金supported in part by the HUT Distributed and Mobile Cloud Systems research project and Tekes within the ITEA2 project 10014 EASI-CLOUDS
文摘In recent years,dual-homed topologies have appeared in data centers in order to offer higher aggregate bandwidth by using multiple paths simultaneously.Multipath TCP(MPTCP) has been proposed as a replacement for TCP in those topologies as it can efficiently offer improved throughput and better fairness.However,we have found that MPTCP has a problem in terms of incast collapse where the receiver suffers a drastic goodput drop when it simultaneously requests data over multiple servers.In this paper,we investigate why the goodput collapses even if MPTCP is able to actively relieve hot spots.In order to address the problem,we propose an equally-weighted congestion control algorithm for MPTCP,namely EW-MPTCP,without need for centralized control,additional infrastructure and a hardware upgrade.In our scheme,in addition to the coupled congestion control performed on each subflow of an MPTCP connection,we allow each subflow to perform an additional congestion control operation by weighting the congestion window in reverse proportion to the number of servers.The goal is to mitigate incast collapse by allowing multiple MPTCP subflows to compete fairly with a single-TCP flow at the shared bottleneck.The simulation results show that our solution mitigates the incast problem and noticeably improves goodput in data centers.
文摘We experimentally demonstrate the multiple signal modulation on a single class 10 G vertical cavity surface emitting laser(VCSEL) carrier at 1 310 nm for next generation multicast-enabled data center networks. A 10 Gbit/s data signal is directly modulated onto a single mode VCSEL carrier. To maximize carrier spectral efficiency, a 2 GHz reference frequency(RF) clock tone is simultaneously modulated on the VCSEL phase attribute. The inherent VCSEL orthogonal polarization bistability with changing bias current is further exploited in transmission of a polarization based pulse per second(PPS) timing clock signal. Therefore, we simultaneously transmit a 10 Gbit/s directly modulated data, 2 GHz phase modulated RF and a polarization-based PPS clock signals using a single mode 10 GHz bandwidth VCSEL carrier. It is the first time that a single class 10 G VCSEL carrier is reported to transmit a directly modulated data, phase modulated RF clock and polarization based PPS timing signal simultaneously in a single wavelength. A of G.652 single mode fibre(SMF) transmission over 3.21 km is experimentally attained. A receiver sensitivity of-15.60 dBm is experimentally obtained for the directly modulated 10 Gbit/s data signal. A 3.21-km-long SMF transmission introduces a penalty of 0.23 dB to the data signal. The contribution of a 2 GHz phase modulated RF and a polarization-based PPS clock signal to this penalty is found to be 0.03 dB. An RF single-side band(SSB) phase noise values of -82.36 dBc/Hz and -77.97 dBc/Hz are attained without and with simultaneous directly modulated data and polarization-based PPS clock signals respectively for a 3.21-km-long SMF transmission. This work provides an alternative efficient and cost effective technique for simultaneous high-speed multiple information transmission to different network nodes within a data center network through shared network infrastructure.
文摘This paper investigates autonomic cloud data center networks, which is the solution with the increasingly complex computing environment, in terms of the management and cost issues to meet users’ growing demand. The virtualized cloud networking is to provide a plethora of rich online applications, including self-configuration, self-healing, self-optimization and self-protection. In addition, we draw on the intelligent subject and multi-agent system, concerning system model, strategy, autonomic cloud computing, involving independent computing system development and implementation. Then, combining the architecture with the autonomous unit, we propose the MCDN (Model of Autonomic Cloud Data Center Networks). This model can define intelligent state, elaborate the composition structure, and complete life cycle. Finally, our proposed public infrastructure can be provided with the autonomous unit in the supported interaction model.
基金supported by the National Key R&D Program of China(Nos.2023YFB2905500 and 2023YFB2805302)the National Natural Science Foundation of China(No.62205026)the Beijing Institute of Technology Research Fund Program for Young Scholars,and the Open Fund of IPOC(BUPT)。
文摘The heterogeneity of applications and their divergent resource requirements lead to uneven traffic distribution and imbalanced resource utilization across data center networks(DCNs).We propose a fine-grained baseband function reallocation scheme in heterogeneous optical switching-based DCNs.A deep reinforcement learning-based functional split and resource mapping approach(DRL-BFM)is proposed to maximize throughput in high-load server racks by implementing load balancing in DCNs.The results demonstrate that DRL-BFM improves the throughput by 20.8%,22.8%,and 29.8%on average compared to existing algorithms under different computational capacities,bandwidth constraints,and latency conditions,respectively.
基金supported by the National Natural Science Fund for Distinguished Young Scholars of China under Grant No.62125203the National Natural Science Foundation of China under Grant Nos.61932013,62102196,62372248,and 62302235+1 种基金the Natural Science Fund for Colleges and Universities in Jiangsu Province of China under Grant No.24KJA520006the Postgraduate Research and Practice Innovation Program of Jiangsu Province of China under Grant No.SJCX23_0275.
文摘With the expansion and increasing complexity of data center networks(DCNs),network fault-tolerance has become increasingly important.RRect is a server-centered DCN with a good interconnection structure.In this paper,we propose a fault-tolerant routing algorithm RRFP under a conditional fault pattern of RRect,which can find a fault-free path between any two fault-free vertices.Firstly,we study a fault pattern of RRect in the case of restricted faulty vertex sets,{1,2}-restricted connectivity.It is about{2,3}times RRect’s traditional connectivity,indicating that{1,2}-restricted connectivity better evaluates the fault-tolerant capability.Secondly,we design an effective fault-tolerant routing algorithm RRFP under the conditional fault pattern of RRect,and RRFP can accommodate more faulty vertices.Finally,we conduct experiments on RRFP to evaluate its performance.The experimental results show that in terms of the running time,as parameters n and k change,RRFP outperforms Dijkstra’s algorithm by 64%–84%and Breadth-First-Search(BFS)by 56%–71%.The running time of all the three algorithms is very short as parameter m changes.In terms of the constructing path length,as parameters change,RRFP outperforms BFS by 12%–19%.Moreover,the path constructed by RRFP approaches the shortest path of Dijkstra’s algorithm.Moreover,RRFP still maintains a low transmission failure rate(TFR)and high reliability even with an increase in the number of fault elements.
基金Project supported by the National Key Research and Development Program of China(Grant No.2021YFB2012600)the Science and Technology Plan Project of the State Administration of Market Regulation,China(Grant No.2021MK039)the Suqian Talent Elite Program(Grant No.SQQN202414)。
文摘This paper presents a compact broadband antenna that overcomes bandwidth limitations in a diamond nitrogenvacancy(NV)center-based quantum magnetic sensor.Conventional antennas struggle to achieve both broadband operation and compact integration,restricting the sensitivity and dynamic range of the sensor.The broadband antenna based on a dualfrequency monopole structure achieves a bandwidth extension of 777 MHz at the Zeeman splitting frequency of 2.87 GHz,with the dual resonant points positioned near 2.87 GHz.Additionally,high-resolution imaging of the microwave magnetic field on the antenna surface was performed using a diamond optical fiber probe,which verified the dual-frequency design principle.Experimental results using the proposed antenna demonstrate the outstanding performance of the NV centerbased magnetic sensor:a sensitivity of 55 nT/Hz^(1/2)and a dynamic range of up to 54.0 dB.Compared to sensors using conventional antennas,the performance has been significantly improved.
基金financially supported by the Basic Research Funds for the Central Government“Innovative Team of Zhejiang University”under contract number(2022FZZX01-09).
文摘The effect of gradient exhaust strategy and blind plate installation on the inhibition of backflow and thermal stratification in data center cabinets is systematically investigated in this study through numericalmethods.The validated Re-Normalization Group(RNG)k-ε turbulence model was used to analyze airflow patterns within cabinet structures equipped with backplane air conditioning.Key findings reveal that server-generated thermal plumes induce hot air accumulation at the cabinet apex,creating a 0.8℃ temperature elevation at the top server’s inlet compared to the ideal situation(23℃).Strategic increases in backplane fan exhaust airflow rates reduce server 1’s inlet temperature from 26.1℃(0%redundancy case)to 23.1℃(40%redundancy case).Gradient exhaust strategies achieve equivalent server temperature performance to uniform exhaust distributions while requiring 25%less redundant airflow.This approach decreases the recirculation ratio from1.52%(uniformexhaust at 15%redundancy)to 0.57%(gradient exhaust at equivalent redundancy).Comparative analyses demonstrate divergent thermal behaviors:in bottom-server-absent configurations,gradient exhaust reduces top server inlet temperatures by 1.6℃vs.uniformexhaust,whereas top-serverabsent configurations exhibit a 1.8℃ temperature increase under gradient conditions.The blind plate implementation achieves a 0.4℃ top server temperature reduction compared to 15%-redundancy uniform exhaust systems without requiring additional airflow redundancy.Partially installed server arrangements with blind plates maintain thermal characteristics comparable to fully populated cabinets.This study validates gradient exhaust and blind plate technologies as effective countermeasures against cabinet-scale thermal recirculation,providing actionable insights for optimizing backplane air conditioning systems in mission-critical data center environments.
基金supported in part by the National Natural Science Foundation of China under Grant 52177082in part by the Beijing Nova Program under Grant 20220484007.
文摘With the advent of the digital economy,there has been a rapid proliferation of small-scale Internet data centers(SIDCs).By leveraging their spatiotemporal load regulation potential through data workload balancing,aggregated SIDCs have emerged as promising demand response(DR)resources for future power distribution systems.This paper presents an innovative framework for assessing capacity value(CV)by aggregating SIDCs participating in DR programs(SIDC-DR).Initially,we delineate the concept of CV tailored for aggregated SIDC scenarios and establish a metric for the assessment.Considering the effects of the data load dynamics,equipment constraints,and user behavior,we developed a sophisticated DR model for aggregated SIDCs using a data network aggregation method.Unlike existing studies,the proposed model captures the uncertainties associated with end tenant decisions to opt into an SIDC-DR program by utilizing a novel uncertainty modeling approach called Z-number formulation.This approach accounts for both the uncertainty in user participation intentions and the reliability of basic information during the DR process,enabling high-resolution profiling of the SIDC-DR potential in the CV evaluation.Simulation results from numerical studies conducted on a modified IEEE-33 node distribution system confirmed the effectiveness of the proposed approach and highlighted the potential benefits of SIDC-DR utilization in the efficient operation of future power systems.
基金supported by the National Natural Science Foundation of China(Grant Nos.62405250 and 62471404)the China Postdoctoral Science Foundation(Grant No.2024M762955)+1 种基金the Key Project of Westlake Institute for Optoelectronics(Grant No.2023GD003)the Optical Com-munication and Sensing Laboratory,School of Engineering,Westlake University.
文摘Propelled by the rise of artificial intelligence,cloud services,and data center applications,next-generation,low-power,local-oscillator-less,digital signal processing(DSP)-free,and short-reach coherent optical communication has evolved into an increasingly prominent area of research in recent years.Here,we demonstrate DSP-free coherent optical transmission by analog signal processing in frequency synchronous optical network(FSON)architecture,which supports polarization multiplexing and higher-order modulation formats.The FSON architecture that allows the numerous laser sources of optical transceivers within a data center can be quasi-synchronized by means of a tree-distributed homology architecture.In conjunction with our proposed pilot-tone assisted Costas loop for an analog coherent receiver,we achieve a record dual-polarization 224-Gb/s 16-QAM 5-km mismatch transmission with reset-free carrier phase recovery in the optical domain.Our proposed DSP-free analog coherent detection system based on the FSON makes it a promising solution for next-generation,low-power,and high-capacity coherent data center interconnects.
