Low-delay low-cost data center network topology structure and construction method

By adopting a recursive data center network topology composed of switches and two-port servers, the deficiencies in scalability of traditional networks are solved and a low-latency and low-cost data center network is achieved.

CN119363598AActive Publication Date: 2025-01-24QILU UNIVERSITY OF TECHNOLOGY (SHANDONG ACADEMY OF SCIENCES)
View PDF 5 Cites 0 Cited by

Patent Information

Application Number
CN202411463390.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-10-21
Publication Date
2025-01-24
Estimated Expiration
2044-10-21

AI Technical Summary

Technical Problem

Traditional server-centric data center networks have poor scalability and are difficult to meet the growing demand for low latency and low cost.

Method used

The data center network topology is a recursive structure consisting of switches and two-port servers. By defining the communication methods of servers within and between elements, the topology is recursively defined to ensure the addresses and connection principles of servers and switches.

Benefits of technology

A data center network topology with good performance in terms of diameter, scalability, fault tolerance and network scale is achieved, reducing construction and maintenance costs and improving the low-latency performance of the network.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119363598A_ABST
    Figure CN119363598A_ABST
Patent Text Reader

Abstract

The invention discloses a low-delay and low-cost data center network topology structure and a construction method, belongs to data center construction, and aims to solve the technical problem of how to design a more efficient network topology so as to meet the increasing requirements of low delay and low cost. Comprising the following steps: defining elements as basic structure blocks of a data center network topology structure, and defining communication modes of servers in the elements and among the elements; defining a recursion mode of a data center network topology structure; defining addresses of the server and the switch and a connection principle between the server and the switch; and constructing a data center network topology structure based on the definition. The elements comprise m servers with two ports and a switch with m ports, in the same element, the servers communicate with each other through the first ports of the servers, and for the servers located in different elements, the servers communicate with each other through the second ports of the servers.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of data center construction, and in particular to a low-latency and low-cost data center network topology structure and construction method. Background Art

[0002] With the widespread application of technologies such as 5G, Internet of Things and artificial intelligence, network equipment has reached a scale of billions of dollars. These devices continuously generate large amounts of data. The massive accumulation of data contains huge value and brings new opportunities for intelligent development.

[0003] As the core node for information processing and storage, the low-latency performance of the data center network topology has become the key to improving user experience and ensuring business continuity. The explosive growth of data has made the network latency challenge faced by data centers increasingly severe. Therefore, studying low-latency data center network topology is of great significance for optimizing resource allocation, improving data processing speed and enhancing network stability. This not only helps to promote the advancement of data center technology, but also provides solid technical support for the digital transformation of various industries.

[0004] The existing data center network topology is mainly divided into two types: switch-centric topology and server-centric topology. The server-centric topology has more advantages in terms of construction cost and network update and upgrade. Therefore, researchers pay more and more attention to the research of server-centric data center networks. However, the traditional server-centric data center network has poor scalability, which hinders the update and upgrade of the data center.

[0005] How to design a more efficient network topology to meet the growing demand for low latency and low cost is a technical problem that needs to be solved. Summary of the invention

[0006] The technical task of the present invention is to address the above shortcomings and provide a low-latency and low-cost data center network topology structure and construction method to solve the technical problem of how to design a more efficient network topology to meet the growing demand for low latency and low cost.

[0007] In a first aspect, the present invention provides a method for constructing a low-latency and low-cost data center network topology structure, wherein the data center network topology structure is a recursive structure composed of a switch and a two-port server, and the construction method comprises the following steps:

[0008] S100, defining elements as basic structural blocks of a data center network topology, and defining communication methods of servers within and between elements;

[0009] S200, defining a recursive method of a data center network topology structure based on a communication method of servers within an element and between elements;

[0010] S300, defining the addresses of servers and switches and the connection principle between servers and switches in a recursive manner based on the data center network topology structure;

[0011] S400, constructing a data center network topology structure based on the definitions of steps S100 to S300;

[0012] The data center network topology is represented as MBDC, where the elements include m servers with two ports and a switch with m ports, represented by the symbol represents an MBDC with n levels, t represents the type of MBDC, n and t are both integers, n≥1, t∈{0,1}, t=0 represents type 0 MBDC, and t=1 represents type 1 MBDC;

[0013] In MBDC, servers in the same element communicate with each other through their first ports, and servers in different elements communicate with each other through their second ports. For each element, the first ports of servers in the same element are connected through a switch, and for servers connected to the switch, the second ports of the servers are connected to servers in different elements.

[0014] Preferably, for MBDC, the recursive method includes the following two cases:

[0015] When n=1, It consists of two basic elements;

[0016] When n ≥ 2, By 1 and 1 composition.

[0017] Preferably, for MBDC, the addresses of the server and the switch are defined as follows:

[0018] The server address is represented as [x0x1x2…x n ; a], where x i ∈{0,1}, i∈[0,n], a∈[1,m], x0=0 represents type 0 MBDC, and x0=1 represents type 1 MBDC;

[0019] The address of the switch is expressed as [x0x1x2…x n ; 0], where x i ∈{0,1}, i∈[0,n].

[0020] Preferably, the address changes of the server and the switch are defined as follows:

[0021] for For each server and switch, set the value of the 0th address of each server and each switch to t, and the values ​​of the 1st to nth addresses of each server to The values ​​of the server addresses from 0 to n-1 and the values ​​of the switches from 1 to n are respectively The value of the address from 0th to n-1th bit of the switch.

[0022] Preferably, the connection rules between the server and the switch include the following:

[0023] For the addresses [x0x1x2…x n ; a] and the address is [x0′x1′x2′…x n ′; a′], the two servers are currently connected through a switch only when the following conditions are met:

[0024] x j =x j ′, j∈[0,n];

[0025] For the addresses [x0x1x2…x n ; a] and the address is [x0′x1′x2′…x n ′; a′], the two servers are connected through a switch when the following conditions are met:

[0026] When x i-1 = 0,

[0027] When x i-1 =1, And x0=x0′, a=a′;

[0028] i∈[1,n].

[0029] In a second aspect, the present invention provides a low-latency and low-cost data center network topology structure, which is a data center network topology structure constructed by a method for constructing a low-latency and low-cost data center network topology structure as described in any one of the first aspects, wherein the data center network topology structure is a recursive structure composed of a switch and a two-port server;

[0030] The data center network topology is represented as MBDC, and the elements include m servers with two ports and a switch with m ports, represented by the symbol represents an MBDC with n levels, t represents the type of MBDC, n and t are both integers, n≥1, t∈{0,1}, t=0 represents type 0 MBDC, and t=1 represents type 1 MBDC;

[0031] In MBDC, servers in the same element communicate with each other through their first ports, and servers in different elements communicate with each other through their second ports. For each element, the first ports of servers in the same element are connected through a switch, and for servers connected to the switch, the second ports of the servers are connected to servers in different elements.

[0032] Preferably, for MBDC, the recursive method includes the following two cases:

[0033] When n=1, It consists of two basic elements;

[0034] When n ≥ 2, By 1 and 1 composition.

[0035] Preferably, for MBDC, the addresses of the server and the switch are defined as follows:

[0036] The server address is represented as [x0x1x2…x n ; a], where x i ∈{0,1}, i∈[0,n], a∈[1,m], x0=0 represents type 0 MBDC, and x0=1 represents type 1 MBDC;

[0037] The address of the switch is expressed as [x0x1x2…x n ; 0], where x i ∈{0,1}, i∈[0,n].

[0038] Preferably, the address changes of the server and the switch are defined as follows:

[0039] for For each server and switch, set the value of the 0th address of each server and each switch to t, and the values ​​of the 1st to nth addresses of each server to The values ​​of the server addresses from 0 to n-1 and the values ​​of the switches from 1 to n are respectively The value of the address from 0th to n-1th bit of the switch.

[0040] Preferably, the connection rules between the server and the switch include the following:

[0041] For the addresses [x0x1x2…x n ; a] and the address is [x0′x1′x2′…x n ′; a′], the two servers are currently connected through a switch only when the following conditions are met:

[0042] x j =x j ′, j∈[0,n];

[0043] For the addresses [x0x1x2…x n ; a] and the address is [x0′x1′x2′…x n ′; a′], the two servers are connected through a switch when the following conditions are met:

[0044] When x i-1 = 0,

[0045] When x i-1 =1, And x0=x0′, a=a′

[0046] i∈[1,n].

[0047] The low-latency and low-cost data center network topology structure and construction method of the present invention have the following advantages: a recursive data center network topology structure consisting of a switch and m two-port servers connected to it is constructed, and the network topology structure retains the advantages of the traditional server-centric topology structure and overcomes the disadvantages of the traditional server-centric topology structure, and has good performance in terms of diameter, scalability, fault tolerance and network scale. BRIEF DESCRIPTION OF THE DRAWINGS

[0048] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0049] The present invention is further described below in conjunction with the accompanying drawings.

[0050] Figure 1 This is a flowchart of a method for constructing a low-latency and low-cost data center network topology structure according to Example 1;

[0051] Figure 2 A method for constructing a low-latency and low-cost data center network topology structure is constructed as follows: The structural diagram of

[0052] Figure 3 A method for constructing a low-latency and low-cost data center network topology structure is constructed as follows: The structural diagram of

[0053] Figure 4 A method for constructing a low-latency and low-cost data center network topology structure is constructed as follows: The structural diagram of

[0054] Figure 5 This is the network diameter corresponding to each structure under the same network scale in the construction method of a low-latency and low-cost data center network topology structure in Example 1. DETAILED DESCRIPTION

[0055] The present invention is further described below in conjunction with the accompanying drawings and specific embodiments so that those skilled in the art can better understand the present invention and implement it. However, the embodiments are not intended to limit the present invention. In the absence of conflict, the embodiments of the present invention and the technical features in the embodiments may be combined with each other.

[0056] The embodiments of the present invention provide a low-latency and low-cost data center network topology structure, which is used to solve the technical problem of how to design a more efficient network topology to meet the growing demand for low latency and low cost.

[0057] Embodiment 1:

[0058] The present invention provides a method for constructing a low-latency and low-cost data center network topology structure, wherein the data center network topology structure is a recursive structure composed of a switch and a two-port server, and the construction method comprises the following steps:

[0059] Step S100: define elements as basic structural blocks of the data center network topology, and define communication methods of servers within the elements and between the elements;

[0060] Step S200, defining a recursive method of a data center network topology structure based on the communication method of servers within an element and between elements;

[0061] Step S300: defining the addresses of servers and switches and the connection principle between the servers and switches in a recursive manner based on the data center network topology structure;

[0062] Step S400: construct a data center network topology structure based on the definitions of steps S100 to S300.

[0063] The basic structure block of the data center network topology structure in step S100 has the following definition:

[0064] Definition 1: The data center network topology is represented as MBDC, which consists of m servers with two ports and a switch with m ports, represented by represents an MBDC with n levels, t represents the type of MBDC, n and t are both integers, n≥1, t∈{0,1}, t=0 represents type 0 MBDC, and t=1 represents type 1 MBDC;

[0065] In MBDC, servers in the same element communicate with each other through their first ports, and servers in different elements communicate with each other through their second ports. For each element, the first ports of servers in the same element are connected through a switch, and for servers connected to the switch, the second ports of the servers are connected to servers in different elements.

[0066] In step S200, the recursive method of MBDC has the following definition:

[0067] Definition 2: The recursive method includes the following two cases:

[0068] (1) When n = 1, It consists of two basic elements;

[0069] (2) When n ≥ 2, By 1 and 1 composition.

[0070] In step S300, the addresses of the server and the switch are defined as follows:

[0071] Definition 3: The server address is expressed as [x0x1x2…x n ; a], where x i ∈{0,1}, i∈[0,n], a∈[1,m], x0=0 represents type 0 MBDC, and x0=1 represents type 1 MBDC;

[0072] The address of the switch is expressed as [x0x1x2…x n ; 0], where x i ∈{0,1}, i∈[0,n].

[0073] Correspondingly, the address changes of the server and switch are defined as follows: For each server and switch, set the value of the 0th address of each server and each switch to t, and the values ​​of the 1st to nth addresses of each server to The values ​​of the server addresses from 0 to n-1 and the values ​​of the switches from 1 to n are respectively The value of the address from 0th to n-1th bit of the switch.

[0074] Correspondingly, the connection rules between the server and the switch include the following:

[0075] Connection rule 1: For the addresses [x0x1x2…x n ; a] and the address is [x0′x1′x2′…x n ′; a′], the two servers are currently connected through a switch only when the following conditions are met:

[0076] x j =x j ′, j∈[0,n];

[0077] Connection rule 2: For the addresses [x0x1x2…x n ; a] and the address is [x0′x1′x2′…x n ′; a′], the two servers are connected through a switch when the following conditions are met:

[0078] When x i-1 = 0,

[0079] When x i-1 =1, And x0=x0′, a=a′;

[0080] i∈[1,n].

[0081] According to the method disclosed in this embodiment, Figure 4 shown Structure, according to definition one The elements in the are composed of six two-port servers and one six-port switch. In , for each element, the first port of the server in the same element is connected through the switch, and for the server connected to the switch, the second port of the server is connected to the server in a different element. According to definition 3, the server address can be expressed as [0x1x2x3; a], where x i ∈{0,1}, i∈[1,3], a∈[1,6], the address of the switch is expressed as [0x1x2x3; 0], where x i ∈{0,1}, i∈[1,3], The addresses of the servers and switches are shown as follows: Figure 2 As shown. According to Definition 3, the server address can be expressed as [1x1x2x3; a], where x i∈{0,1}, i∈[1,3], a∈[1,6]; the address of the switch is expressed as [1x1x2x3; 0], where x i ∈{0,1}, i∈[1,3], The addresses of the servers and switches are shown as follows: Figure 3 As shown. hour, The 0th bit of each switch and server address is 1, and the 1st to nth bits of each switch and server address are and The 0th to n-1th bits of the switch and server addresses.

[0082] exist Figure 4 of According to the connection rule (1) between switches and servers, servers in the same element, for example, in element

[0000] , servers [1 / 0000; 1] and [1 / 0000; 1] are connected through a switch. According to the connection rule (2) between switches and servers, servers [1 / 0000; 1] and [1 / 1111; 1], servers [1 / 0101; 1] and [1 / 1010; 1], and servers [1 / 1000; 2] and [1 / 1111; 2] are directly connected to each other.

[0083] In order to evaluate the performance of the MBDC network, this embodiment conducts comprehensive simulation experiments and compares them with other topologies.

[0084] First, this embodiment studies the network diameters corresponding to different topologies and simulates BCube, DCell, HSDC, CSDC, HS-DCell, Hyper-BCube, 0-MBDC, and 1-MBDC. When each network contains the same number of servers, their diameters are compared. Figure 5 It can be seen that when the number of servers is small, the diameter of Hyper-BCube is the smallest among these topologies; although the diameter of 1-MBDC is slightly smaller than that of BCube, it is smaller than that of HSDC, DCell, and HS-DCell; as the number of servers increases to 1024, the diameter of 1-MBDC is almost half of that of HSDC; compared with 1-MBDC, the diameter of 0-MBDC is slightly larger.

[0085] Finally, the cost and energy consumption of MBDC networks are studied. This example compares BCube, DCell, HSDC, and MBDC. For convenience, MBDC is collectively compared because 0-MBDC and 1-MBDC have the same number of switches, servers, and links. The overall cost and energy consumption of servers in all networks are the same because the servers in each network are compared using the same number of costs and energy consumption. Therefore, this example only evaluates the price and energy usage of network cards and switches. In order to clearly monitor the cost and energy utilization, this example builds a data center network containing 1024, 2048, and 4096 servers, respectively. The cost and energy usage of network cards and switches in the data center. Table 1 summarizes the cost and energy consumption of five different network topologies. Table 1 shows that MBDC and HSDC have the same cost and energy consumption, both of which are lower than DCell, BCube, and Hyper-BCube. This example also points out the number of links used in these network architectures because data center networks need to be configured with wires and cables. Table 1 shows that MBDC and HSDC have the same number of links, although DCell and BCube have more links. Based on the above data, the cost, energy usage and number of links of MBDC and HSDC are much lower than DCell, BCube and Hyper-BCube. The MBDC architecture constructed in this embodiment is more suitable for building a low-cost data center network with low latency because it has better latency than HSDC.

[0086] Table 1: Cost and energy usage of five different network topologies

[0087]

[0088] Through comprehensive analysis and comparison of MBDC and other common network topologies, it is found that MBDC has good performance in key indicators such as network scale, network diameter, cost and energy consumption. The combination of these ideal characteristics makes MBDC a promising choice for data center network communications.

[0089] Embodiment 2:

[0090] The present invention provides a low-latency and low-cost data center network topology structure, which is a data center network topology structure constructed by the method disclosed in Example 1. The data center network topology structure is a recursive structure composed of a switch and a two-port server.

[0091] The data center network topology of this embodiment meets the following definitions:

[0092] Definition 1: The data center network topology is represented as MBDC. The element is the basic structural block of the data center network topology. The element includes m servers with two ports and a switch with m ports. represents an MBDC with n levels, t represents the type of MBDC, n and t are both integers, n≥1, t∈{0,1}, t=0 represents type 0 MBDC, and t=1 represents type 1 MBDC;

[0093] In MBDC, servers in the same element communicate with each other through their first ports, and servers in different elements communicate with each other through their second ports. For each element, the first ports of servers in the same element are connected through a switch, and for servers connected to the switch, the second ports of the servers are connected to servers in different elements.

[0094] The MBDC of this embodiment recursively satisfies the following definition 2:

[0095] (1) When n = 1, It consists of two basic elements;

[0096] (2) When n ≥ 2, By 1 and 1 composition.

[0097] In this embodiment, in MBDC, the addresses of the server and the switch satisfy the following definition three:

[0098] (1) The server address is expressed as [x0x1x2…x n ; a], where x i ∈{0,1}, i∈[0,n], a∈[1,m], x0=0 represents type 0 MBDC, and x0=1 represents type 1 MBDC;

[0099] (2) The address of the switch is expressed as [x0x1x2…x n ; 0], where x i ∈{0,1}, i∈[0,n].

[0100] At the same time, the address changes of the server and the switch meet the following definition: For each server and switch, set the value of the 0th address of each server and each switch to t, and the values ​​of the 1st to nth addresses of each server to The values ​​of the server addresses from 0 to n-1 and the values ​​of the switches from 1 to n are respectively The value of the address from 0th to n-1th bit of the switch.

[0101] Correspondingly, the connection rules between the server and the switch include the following:

[0102] Connection rule 1: For the addresses [x0x1x2…x n ; a] and the address is [x0′x1′x2′…x n ′; a′], the two servers are currently connected through a switch only when the following conditions are met:

[0103] x j =x j ′, j∈[0,n];

[0104] Connection rule 2: For the addresses [x0x1x2…x n ; a] and the address is [x0′x1′x2′…x n ′; a′], the two servers are connected through a switch when the following conditions are met:

[0105] When x i-1 = 0,

[0106] When x i-1 =1, And x0=x0′, a=a′;

[0107] i∈[1,n].

[0108] The present invention has been shown and described in detail above through the accompanying drawings and preferred embodiments. However, the present invention is not limited to these disclosed embodiments. Based on the above multiple embodiments, those skilled in the art can know that the means in the above different embodiments can be combined to obtain more embodiments of the present invention, and these embodiments are also within the protection scope of the present invention.

Claims

1. A method for constructing a low-latency and low-cost data center network topology structure, characterized in that: The data center network topology is a recursive structure consisting of a switch and a two-port server, and the construction method includes the following steps: S100, defining elements as basic structural blocks of a data center network topology, and defining communication methods of servers within and between elements; S200, defining a recursive method of a data center network topology structure based on a communication method of servers within an element and between elements; S300, defining the addresses of servers and switches and the connection principle between servers and switches in a recursive manner based on the data center network topology structure; S400, constructing a data center network topology structure based on the definitions of steps S100 to S300; The data center network topology is represented as MBDC, where the elements include m servers with two ports and a switch with m ports, represented by the symbol represents an MBDC with n levels, t represents the type of MBDC, n and t are both integers, n≥1, t∈{0,1}, t=0 represents type 0 MBDC, and t=1 represents type 1 MBDC; In MBDC, servers in the same element communicate with each other through their first ports, and servers in different elements communicate with each other through their second ports. For each element, the first ports of servers in the same element are connected through a switch, and for servers connected to the switch, the second ports of the servers are connected to servers in different elements.

2. The method for constructing a low-latency and low-cost data center network topology structure according to claim 1, characterized in that: For MBDC, the recursive method includes the following two cases: When n=1, It consists of two basic elements; When n ≥ 2, By 1 and 1 composition.

3. The method for constructing a low-latency and low-cost data center network topology structure according to claim 1 or 2, characterized in that: For MBDC, the addresses of servers and switches are defined as follows: The server address is represented as [x0x1x2…x n ; a], where x i ∈{0,1}, i∈[0,n], a∈[1,m], x0=0 represents type 0 MBDC, and x0=1 represents type 1 MBDC; The address of the switch is expressed as [x0x1x2…x n ; 0], where x i ∈{0,1}, i∈[0,n].

4. The method for constructing a low-latency and low-cost data center network topology structure according to claim 3, characterized in that: The address changes for servers and switches are defined as follows: for For each server and switch, set the value of the 0th address of each server and each switch to t, and the values ​​of the 1st to nth addresses of each server to The values ​​of the server addresses from 0 to n-1 and the values ​​of the switches from 1 to n are respectively The value of the address from 0th to n-1th bit of the switch.

5. The method for constructing a low-latency and low-cost data center network topology structure according to claim 3, characterized in that: The connection rules between the server and the switch include the following: For the addresses [x0x1x2…x n ; a] and the address is [x0′x1′x2′…x n ′; a′], the two servers are currently connected through a switch only when the following conditions are met: x j =x j ′,j∈[0,n]; For the addresses [x0x1x2…x n ; a] and the address is [x0′x1′x2′…x n ′; a′], the two servers are connected through a switch when the following conditions are met: When x i-1 = 0, When x i-1 =1, And x0=x0′, a=a′; i∈[1,n].

6. A low-latency and low-cost data center network topology, characterized in that: A data center network topology structure constructed by a method for constructing a low-latency and low-cost data center network topology structure according to any one of claims 1 to 5, wherein the data center network topology structure is a recursive structure consisting of a switch and a two-port server; The data center network topology is represented as MBDC, and the elements include m servers with two ports and a switch with m ports, represented by the symbol represents an MBDC with n levels, t represents the type of MBDC, n and t are both integers, n≥1, t∈{0,1}, t=0 represents type 0 MBDC, and t=1 represents type 1 MBDC; In MBDC, servers in the same element communicate with each other through their first ports, and servers in different elements communicate with each other through their second ports. For each element, the first ports of servers in the same element are connected through a switch, and for servers connected to the switch, the second ports of the servers are connected to servers in different elements.

7. The low-latency and low-cost data center network topology structure according to claim 6, characterized in that: For MBDC, the recursive method includes the following two cases: When n=1, It consists of two basic elements; When n ≥ 2, By 1 and 1 composition.

8. The low-latency and low-cost data center network topology structure according to claim 6 or 7, characterized in that: For MBDC, the addresses of servers and switches are defined as follows: The server address is represented as [x0x1x2…x n ; a], where x i ∈{0,1}, i∈[0,n], a∈[1,m], x0=0 represents type 0 MBDC, and x0=1 represents type 1 MBDC; The address of the switch is expressed as [x0x1x2…x n ; 0], where x i ∈{0,1}, i∈[0,n].

9. The low-latency and low-cost data center network topology structure according to claim 8, characterized in that: The address changes for servers and switches are defined as follows: for For each server and switch, set the value of the 0th address of each server and each switch to t, and the values ​​of the 1st to nth addresses of each server to The values ​​of the server addresses from 0 to n-1 and the values ​​of the switches from 1 to n are respectively The value of the address from 0th to n-1th bit of the switch.

10. The low-latency and low-cost data center network topology structure according to claim 8, characterized in that: The connection rules between the server and the switch include the following: For the addresses [x0x1x2…x n ; a] and the address is [x0′x1′x2′…x n ′; a′], the two servers are currently connected through a switch only when the following conditions are met: x j =x j ′,j∈[0,n]; For the addresses [x0x1x2…x n ; a] and the address is [x0′x1′x2′…x n ′; a′], the two servers are connected through a switch when the following conditions are met: When x i-1 = 0, When x i-1 =1, And x0=x0′, a=a′; i∈[1,n].

Citation Information

Patent Citations

  • Data center network topology structure and routing method thereof

    CN103346967A

  • Copy management method for BCube network in cloud computing data center

    CN111756839A

  • Construction method and construction system of highly extensible data center network topology structure

    CN117221129A

  • Method and server for assigning topological addresses to network switches, corresponding computer program and server cluster

    IN201844046594A

  • Method and server for assigning topological addresses to network switches, corresponding computer program and server cluster

    US20190215242A1