A fault-tolerant 2-dpc construction method and system based on a PEF model

Abstract

The application relates to the technical field of digital information transmission, and provides a fault-tolerant 2-DPC construction method and system based on a PEF model, which comprises the following steps: determining a BCube logical graph and a fault edge set; verifying whether the fault edge set satisfies a fault partition edge fault condition, and dividing a subgraph according to the most fault edge number dimension; selecting a start point pair and an end point pair; constructing an initial 2-DPC path and a Hamilton path according to the distribution of the start point and the end point in the subgraph, and splicing the initial 2-DPC path and the Hamilton path to obtain a final 2-DPC path. The application utilizes the recursive characteristics of BCube, divides the BCube into multiple different subgraphs, connects the Hamilton path and the fault-free edges between the subgraphs, and finally constructs two non-intersecting paths from the start point to the end point, covering all the points in the graph. The application realizes exponential edge fault tolerance, improves the fault tolerance of the BCube data center network, and has important research significance and application value.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of digital information transmission, and in particular to a fault-tolerant 2-DPC construction method and system based on a PEF model. BACKGROUND

[0002] Data center network (DCN) has become the core infrastructure supporting modern information technology. To meet the demand of large-scale computing and storage, the scale of DCN is expanding, the number of servers and switches is increasing, and the complexity of DCN topology is also increasing. Its reliability has become a key challenge.

[0003] Server-centric data center network (BCube) is a DCN architecture centered on servers, which has the advantages of low delay, load balancing, high bandwidth, etc. The construction of BCube adopts a recursive method, using small switches with low cost to connect servers. In data transmission, paired 2-DPC (2-disjoint path covers) is an extension of Hamiltonian path, which can connect two groups of start-end pairs through two disjoint paths and cover all nodes in the network, significantly improving the transmission efficiency of tasks such as broadcast and information collection, and is widely used in software testing, sensor network topology control, etc. However, link and switch failures occur frequently during DCN operation, and high-robust fault-tolerant algorithms are needed to ensure communication. The existing technology has limited fault-tolerant boundaries: the traditional random fault model (REF) assumes that all edges around a node may fail simultaneously, and the 2-DPC fault-tolerant boundary of BCube, balanced hypercube (BH) and other topologies based on this model grows linearly with the size of the graph, which cannot cope with the exponential edge failures of large-scale DCN; the generality of path construction is insufficient: existing 2-DPC algorithms do not consider the partition characteristics of BCube subgraphs, and cannot dynamically adapt to different distributions of start-end subgraphs. SUMMARY

[0004] The present application aims to at least solve one of the technical problems in the related art. To this end, the present application provides a fault-tolerant 2-DPC construction method and system based on a PEF (Partitioned Edge Fault) model, which divides BCube into multiple different subgraphs using the recursive characteristics of BCube, connects Hamiltonian paths and fault-free edges between subgraphs, and finally constructs two disjoint paths from the start point to the end point, covering all points in the graph. The present application realizes exponential edge fault tolerance, improves the fault tolerance of BCube data center network, and has important research significance and application value.

[0005] The present application provides a fault-tolerant 2-DPC construction method based on a PEF model, comprising:

[0006] S1: Real-time acquisition of switch port status and server connection status, and determination of BCube logic diagram and fault edge set of BCube logic diagram based on switch port status and server connection status;

[0007] S2: Construct fault partitioning edge fault conditions based on the number of switch ports;

[0008] S3: Verify whether the set of fault edges in the BCube logic graph satisfies the fault partition edge fault condition;

[0009] If the fault partition edge fault condition is met, then obtain the dimension with the most fault edges in the fault edge set of the BCube logical graph.

[0010] If the fault condition of the fault partition edge is not met, the fault edge set of the BCube logic graph is re-determined according to step S1.

[0011] S4: Divide the BCube logic graph into multiple BCube logic subgraphs based on the dimension with the most fault edges.

[0012] S5: Select the start pair and end pair in the BCube logic diagram;

[0013] S6: Construct the initial 2-DPC path and Hamiltonian path based on the distribution of the start-point pair and end-point pair in the BCube logic subgraph, and concatenate the initial 2-DPC path and Hamiltonian path to obtain the final 2-DPC path.

[0014] Furthermore, the BCube logical graph includes a set of nodes and a set of edges;

[0015] The node set is Each node is represented by a string of numbers, and the range of values ​​for each dimension number is determined by... Sure, ,in, This is a BCube logic diagram. For the dimensions of BCube, This refers to the number of ports on the switch. For node number Numbers in multiple dimensions;

[0016] edge set is , Satisfy the first node With the second node Connected, and Connected if and only if a unique dimension exists. Make And the other dimensions , Make ,in, for No. Numbers in multiple dimensions for No. Numbers in multiple dimensions for No. Numbers in multiple dimensions for No. Numbers in multiple dimensions for No. Numbers in multiple dimensions for No. Numbers in multiple dimensions.

[0017] Furthermore, the fault conditions for the fault partition edge include:

[0018] when , hour, ;

[0019] when , hour, ;

[0020] in, For dimension The number of faulty edges, for The number of faulty edges at that time;

[0021] when hour, , ;

[0022] when hour, , , This is for rounding up.

[0023] Furthermore, if the fault edge set of BCube satisfies the fault partitioning edge fault condition, then the fault edge set of the BCube subgraph also satisfies the fault partitioning edge fault condition, and is determined by the nodes. Induced subgraph and isomorphism, where, For the node's Fixed value of dimension For the first Dimension is The nodes formed Subgraph, For dimension The BCube logic diagram.

[0024] Furthermore, both the initial 2-DPC path and the final 2-DPC path are two non-intersecting paths, and these two non-intersecting paths cover all nodes of the data center network.

[0025] Furthermore, when all points at the start and end points belong to the first subgraph, the construction process includes:

[0026] Construct an initial 2-DPC path within the first subgraph. The initial 2-DPC path includes a first path and a second path. The first path is formed by connecting the first starting point to the first ending point, and the second path is formed by connecting the second starting point to the second ending point.

[0027] In the second path, select the first intermediate edge, select the first intermediate node in the second subgraph, and select the second intermediate node in the third subgraph. Connect the first intermediate node to the first node of the first intermediate edge to form the first fault-free edge, and connect the second intermediate node to the second node of the first intermediate edge to form the second fault-free edge.

[0028] Construct Hamiltonian paths connecting the first intermediate node and the second intermediate node in all subgraphs except the first subgraph.

[0029] By concatenating the second path, the Hamiltonian path of the first intermediate node and the second intermediate node, the first fault-free edge and the second fault-free edge, and simultaneously deleting the first intermediate edge, the final second path is obtained.

[0030] Finally, the second path is combined with the first path to obtain the final 2-DPC path.

[0031] Furthermore, when three points at the start and end points belong to the first subgraph, and the other point belongs to the third subgraph, the construction process includes:

[0032] Construct an initial 2-DPC path within the first subgraph; the initial 2-DPC path includes a third path and a fourth path. Select a third intermediate node in the first subgraph, connect the first starting point to the first ending point to form the third path, and connect the second starting point to the third intermediate node to form the fourth path.

[0033] In the second subgraph, select the fourth intermediate node, and the third and fourth intermediate nodes form a fault-free edge;

[0034] Construct Hamiltonian paths connecting the fourth intermediate node and the second endpoint in all subgraphs except the first subgraph;

[0035] The final fourth path is obtained by concatenating the Hamiltonian path, the fault-free edge, and the fourth path.

[0036] Finally, the fourth path is combined with the third path to obtain the final 2-DPC path.

[0037] Furthermore, when the two starting points belong to the first subgraph and the two ending points belong to the third subgraph, the construction process includes:

[0038] Construct an initial 2-DPC path within the first subgraph. The initial 2-DPC path includes the fifth path and the sixth path. Select the fifth intermediate node and the sixth intermediate node within the first subgraph. Connect the first starting point to the fifth intermediate node to form the fifth path, and connect the second starting point to the sixth intermediate node to form the sixth path.

[0039] In the second subgraph, select the seventh intermediate node; in the fourth subgraph, select the eighth intermediate node; connect the fifth and eighth intermediate nodes to form the third fault-free edge; connect the sixth and seventh intermediate nodes to form the fourth fault-free edge.

[0040] Construct Hamiltonian paths connecting the seventh and eighth intermediate nodes within the second and fourth subgraphs;

[0041] By splicing the fifth path, the sixth path, the third fault-free edge, the fourth fault-free edge, and the Hamiltonian path connecting the seventh intermediate node and the eighth intermediate node, the first spliced ​​path is obtained.

[0042] Select the second intermediate edge on the first splicing path, and select the ninth and tenth intermediate nodes in the third subgraph; connect the first node of the second intermediate edge to the ninth intermediate node to form the fifth fault-free edge; connect the second node of the second intermediate edge to the tenth intermediate node to form the sixth fault-free edge.

[0043] Construct intermediate 2-DPC paths within the third subgraph. The intermediate 2-DPC paths include the seventh path and the eighth path. The seventh path connects the ninth intermediate node and the first endpoint, and the eighth path connects the tenth intermediate node and the second endpoint.

[0044] Delete the middle edge, and concatenate the Hamiltonian path from the eighth middle node to the first node of the second middle edge, the fifth path, the seventh path, the third fault-free edge, and the fifth fault-free edge to obtain the first concatenated path.

[0045] By splicing the Hamiltonian path from the seventh intermediate node to the second node of the second intermediate edge, the sixth path, the eighth path, the fourth fault-free edge, and the sixth fault-free edge, the second spliced ​​path is obtained.

[0046] The first and second splicing paths are combined to obtain the final 2-DPC path.

[0047] Furthermore, when the two starting points and two ending points belong to different subgraphs, the construction process includes:

[0048] Compress the subgraph corresponding to each point into a single point;

[0049] Connect the compression points of the subgraph corresponding to the first starting point and the compression points of the subgraph corresponding to the first ending point to form the first compression path;

[0050] Connect the compression points of the subgraph corresponding to the second starting point and the compression points of the subgraph corresponding to the second ending point to form the second compression path;

[0051] Construct a Hamiltonian path within each subgraph of the first compressed path to obtain the ninth path;

[0052] Construct a Hamiltonian path within each subgraph of the second compressed path to obtain the tenth path;

[0053] The ninth and tenth paths are combined to obtain the final 2-DPC path.

[0054] This invention also provides a fault-tolerant 2-DPC construction system based on the PEF model, for executing the aforementioned fault-tolerant 2-DPC construction method based on the PEF model, comprising:

[0055] The acquisition module collects the switch port status and server connection status in real time, and determines the BCube logic diagram and the fault edge set of the BCube logic diagram based on the switch port status and server connection status.

[0056] The first construction module constructs fault partition edge fault conditions based on the number of switch ports;

[0057] The verification module verifies whether the fault edge set of the BCube logic graph satisfies the fault partition edge fault condition.

[0058] If the fault partition edge fault condition is met, then obtain the dimension with the most fault edges in the fault edge set of the BCube logical graph.

[0059] If the fault conditions of the fault partition edge are not met, redetermine the fault edge set of the BCube logic graph;

[0060] A partitioning module, which divides the BCube logic graph into multiple BCube logic subgraphs based on the dimension with the most fault edges.

[0061] The selection module selects a start pair and an end pair in the BCube logic diagram.

[0062] The second building module constructs an initial 2-DPC path and a Hamiltonian path based on the distribution of the start point pair and the end point pair in the BCube logic subgraph, and then concatenates the initial 2-DPC path and the Hamiltonian path to obtain the final 2-DPC path.

[0063] The above-described one or more technical solutions in the embodiments of the present invention have at least one of the following technical effects:

[0064] This invention utilizes the recursive nature of BCube to divide the BCube into multiple subgraphs, connecting Hamiltonian paths and fault-free edges between subgraphs, ultimately constructing two disjoint paths from the starting point to the ending point, covering all points in the graph. This invention achieves exponential edge fault tolerance, improving the fault tolerance of BCube data center networks, and has significant research and application value.

[0065] Additional aspects and advantages of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. Attached Figure Description

[0066] To more clearly illustrate the technical solutions in this invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of this invention. For those skilled in the art, other drawings can be obtained from these drawings without creative effort.

[0067] Figure 1 This is a flowchart illustrating a fault-tolerant 2-DPC construction method based on the PEF model provided by the present invention.

[0068] Figure 2 This is a schematic diagram of a 2-DPC construction where the starting point and the ending point are both in the same subgraph, as provided by the present invention.

[0069] Figure 3 This invention provides a schematic diagram of a 2-DPC construction with three starting and ending points in a subgraph.

[0070] Figure 4 This is a schematic diagram of the 2-DPC construction with the start and end points in two subgraphs provided by the present invention.

[0071] Figure 5 This is a schematic diagram of the 2-DPC construction provided by the present invention, in which the starting point and the ending point are in different subgraphs.

[0072] Figure 6 This is a schematic diagram of the structure of a fault-tolerant 2-DPC construction system based on the PEF model provided by the present invention.

[0073] Figure label:

[0074] 101. Data Acquisition Module; 102. First Construction Module; 103. Verification Module; 104. Segmentation Module; 105. Selection Module; 106. Second Construction Module. Detailed Implementation

[0075] To make the objectives, technical solutions, and advantages of this invention clearer, the technical solutions of this invention will be clearly and completely described below. Obviously, the described embodiments are only some, not all, of the embodiments of this invention. Based on the embodiments of this invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this invention. The following embodiments are used to illustrate this invention but cannot be used to limit the scope of this invention.

[0076] In the description of this specification, the references to terms such as "one embodiment," "some embodiments," "example," "specific example," or "some examples," etc., refer to specific features, structures, materials, or characteristics described in connection with that embodiment or example, which are included in at least one embodiment or example of the present invention. In this specification, the illustrative expressions of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the specific features, structures, materials, or characteristics described may be combined in any suitable manner in one or more embodiments or examples. Moreover, without contradiction, those skilled in the art can combine and integrate the different embodiments or examples described in this specification, as well as the features of different embodiments or examples.

[0077] The following is combined with Figures 1 to 6 This invention describes a fault-tolerant 2-DPC construction method and system based on the PEF model.

[0078] like Figure 1 As shown, a fault-tolerant 2-DPC construction method based on the PEF model includes:

[0079] S1: Real-time acquisition of switch port status and server connection status, and determination of BCube logic diagram and fault edge set of BCube logic diagram based on switch port status and server connection status;

[0080] Switches and servers are interconnected according to a BCube structure to achieve communication transmission. However, high-temperature aging of a switch port in one dimension can lead to mass link failures. In 3D NoC (Three-Dimensional NoCs) topologies, manufacturing defects can cause partial link loss in the vertical dimension's Through Silicon Via (TSV) links.

[0081] BCube is a data center network with a recursive structure. The logical graph of BCube includes a set of nodes and a set of edges.

[0082] The node set is Each node is represented by a string of numbers, and the range of values ​​for each dimension number is determined by... Sure, ,in, For the dimensions of BCube, This refers to the number of ports on the switch. For node number Numbers in multiple dimensions;

[0083] The edge set is , Satisfy the first node With the second node Connected, that is and Connected if and only if a unique dimension exists. Make And the other dimensions , Make ,in, for No. Numbers in multiple dimensions for No. Numbers in multiple dimensions for No. Numbers in multiple dimensions for No. Numbers in multiple dimensions for No. Numbers in multiple dimensions for No. Numbers in multiple dimensions.

[0084] The link fault detection module deployed on each switch collects the fault status of links in various dimensions in real time and generates a dimensional distribution table of the fault edge set F, which includes the number of fault edges in each dimension.

[0085] S2: Construct fault partitioning edge fault conditions based on the number of switch ports;

[0086] Fault conditions for the faulty partition edge include:

[0087] when , hour, ;

[0088] when , hour, ;

[0089] in, For dimension The number of faulty edges, for The number of faulty edges at that time;

[0090] when hour, , ;

[0091] when hour, , , This is for rounding up.

[0092] S3: Verify whether the set of fault edges in the BCube logic graph satisfies the fault partition edge fault condition;

[0093] If the fault partition edge fault condition is met, then obtain the dimension with the most fault edges in the fault edge set of the BCube logical graph.

[0094] If the fault condition of the fault partition edge is not met, the fault edge set of the BCube logic graph is re-determined according to step S1.

[0095] If the set of fault edges in BCube satisfies the fault partitioning edge fault condition, then the set of fault edges in the BCube subgraph also satisfies the fault partitioning edge fault condition, and is determined by the nodes. Induced subgraph and isomorphism, where, For the node's Fixed value of dimension For the first Dimension is Node formation subgraph, For dimension The BCube logic diagram.

[0096] according to The edge set of the partition is denoted as By dimension Division The edge set is , , by node Induced subgraph and Isomorphism, abbreviated as ,in, To remove.

[0097] set up for The fault edge set, dimension Fault edge subset The calculation expression is: , .

[0098] Faulty edges are divided by dimension and sorted by the number of faulty edges in ascending order. It represents the number of faulty edges generated in the dimension with the fewest faulty edges. It is the first A smaller number of faulty edges, then .

[0099] when hour, The number of faulty edges is , ,

[0100] The number of faulty edges is , ;

[0101] when hour, , ;

[0102] when hour, ; .

[0103] S4: Divide the BCube logic graph into multiple BCube logic subgraphs based on the dimension with the most faulty edges.

[0104] Divide the BCube's logical graph into subgraphs based on the dimension with the most fault edges, and determine the subgraph to which each node belongs.

[0105] S5: Select the start pair and end pair in the BCube logic diagram;

[0106] In the BCube network, arbitrarily select four distinct nodes, each serving as a pair of starting points. , and a pair of endpoints , , , As the first starting point As the second starting point For the first destination, The second endpoint, , , , All nodes are fault-free.

[0107] S6: Construct an initial 2-DPC path and Hamiltonian paths for the remaining subgraphs based on the distribution of the starting point pair and the ending point pair in the BCube logic subgraph. Concatenate the initial 2-DPC path and Hamiltonian paths to obtain the final 2-DPC path.

[0108] When fault edge set When the f-PEF conditions are satisfied, there are exactly three conditions: all points at the start and end points belong to the first subgraph; three points at the start and end points belong to the first subgraph and the other point belongs to the third subgraph; two start points belong to the first subgraph and two end points belong to the third subgraph; and two start points and two end points belong to different subgraphs. Figure 4 This is one of the situations.

[0109] by To illustrate the construction process of the 2-DPC of this invention, let's take an example. There are 11 faulty edges in the data, and these 11 faulty edges happen to come from... The maximum number of faulty edges is 2. The subgraph is then divided based on the second dimension. Divided into , , , .

[0110] Verify fault edge set Does the f-PEF condition satisfy: when hour, Number of faulty edges in dimension 0 Dimension The formula for the number of faulty edges is: ;when hour, , ;when hour, ; .

[0111] like A set is called an f-PEF set if it meets the following conditions:

[0112] when hour, ;when or hour, ;

[0113] right :

[0114] like ,but ;

[0115] like ,but .

[0116] exist middle, , , It satisfies the f-PEF condition.

[0117] Case 1: When all points at the start and end points belong to the first subgraph, the construction process includes:

[0118] Construct an initial 2-DPC path within the first subgraph. The initial 2-DPC path includes a first path and a second path. The first path is formed by connecting the first starting point to the first ending point, and the second path is formed by connecting the second starting point to the second ending point.

[0119] In the second path, select the first intermediate edge, select the first intermediate node in the second subgraph, and select the second intermediate node in the third subgraph. Connect the first intermediate node to the first node of the first intermediate edge to form the first fault-free edge; connect the second intermediate node to the second node of the first intermediate edge to form the second fault-free edge.

[0120] Construct Hamiltonian paths connecting the first intermediate node and the second intermediate node in all subgraphs except the first subgraph.

[0121] By concatenating the second path, the Hamiltonian path of the first intermediate node and the second intermediate node, the first fault-free edge and the second fault-free edge, and simultaneously deleting the first intermediate edge, the final second path is obtained.

[0122] Finally, the second path is combined with the first path to obtain the final 2-DPC path.

[0123] like Figure 2 As shown, For 000, For 011, For 021, It is 032. , , , They all belong to the same subgraph The construction process includes:

[0124] exist The initial 2-DPC path is built in-house, and the initial 2-DPC path includes the first path. Second path , connect form , connect form ; (000,010,020,030,031,021); (011,001,002,003,013,012,022,023,033,032);

[0125] exist Select the first middle edge , It is 003. The first middle edge is connected to 003, which is 013. 103, the first middle edge 013 is connected 213, (003,103) forms the first fault-free edge, and (013,213) forms the second fault-free edge;

[0126] exist , , Construct a Hamiltonian path connecting 103 and 213; the Hamiltonian path H is (103,102,101,100,110,111,112,113,123,122,121,120,130,131,132,133,230,231,232,233,223,222,221,220,200,201,202,203,300,301,302,303,313,323,333,332,331,330,320,321,322,312,311,310,210,211,212,213); splice. The Hamiltonian path, the first fault-free edge, and the second fault-free edge are all used to simultaneously delete the first intermediate edge to obtain the final second path. The final second path and the first path are then compared. Combined, the final 2-DPC path is obtained.

[0127] Both the initial 2-DPC path and the final 2-DPC path are two non-intersecting paths, and these two non-intersecting paths cover all nodes of the data center network.

[0128] Case 2: When three points at the start and end points belong to the first subgraph, and the other point belongs to the third subgraph, the construction process includes:

[0129] Construct an initial 2-DPC path within the first subgraph; the initial 2-DPC path includes a third path and a fourth path. Select a third intermediate node in the first subgraph, connect the first starting point to the first ending point to form the third path, and connect the second starting point to the third intermediate node to form the fourth path.

[0130] In the second subgraph, select the fourth intermediate node, and the third and fourth intermediate nodes form a fault-free edge;

[0131] Construct Hamiltonian paths connecting the fourth intermediate node and the second endpoint in all subgraphs except the first subgraph;

[0132] The final fourth path is obtained by concatenating the Hamiltonian path, the fault-free edge, and the fourth path.

[0133] Finally, the fourth path is combined with the third path to obtain the final 2-DPC path.

[0134] like Figure 3 As shown, For 000, For 011, For 021, It is 213. , , They all belong to the same subgraph , Subgraph The 2-DPC construction process includes:

[0135] exist Select the third intermediate node , It is 032, according to , , , Construct the initial 2-DPC path; the initial 2-DPC path includes the third path. and the fourth path , connect form , connect form ; (000,010,020,030,031,021); For (011,001,002,003,013,012,022,023,033,032); in Internally, select 132, 032 and 132 to form a fault-free edge; in , , The code constructs a Hamiltonian path connecting 132 and 213; the Hamiltonian path is (132, 131, 130, 120, 121, 122, 123, 113, 112, 111, 110, 100, 101, 102, 103, 133, 230, 231, 232, 233, 223, 222, 221, 220, 200, 201, 202, 2 03,300,301,302,303,313,323,333,332,331,330,320,321,322,312,311,310,210,211,212,213); splice the Hamiltonian path, the fault-free edge, and the fourth path to obtain the final fourth path; combine the final fourth path with the third path to obtain the final 2-DPC path.

[0136] Case 3: When both starting points belong to the first subgraph and both ending points belong to the third subgraph, the construction process includes:

[0137] Construct initial 2-DPC paths within the first subgraph. These initial 2-DPC paths include the fifth and sixth paths. Select the fifth and sixth intermediate nodes within the first subgraph.

[0138] The first starting point is connected to the fifth intermediate node to form the fifth path, and the second starting point is connected to the sixth intermediate node to form the sixth path;

[0139] In the second subgraph, select the seventh intermediate node; in the fourth subgraph, select the eighth intermediate node; connect the fifth and eighth intermediate nodes to form the third fault-free edge; connect the sixth and seventh intermediate nodes to form the fourth fault-free edge.

[0140] Construct Hamiltonian paths connecting the seventh and eighth intermediate nodes within the second and fourth subgraphs;

[0141] By splicing the fifth path, the sixth path, the third fault-free edge, the fourth fault-free edge, and the Hamiltonian path connecting the seventh intermediate node and the eighth intermediate node, the first spliced ​​path is obtained.

[0142] Select the second intermediate edge on the first splicing path, and select the ninth and tenth intermediate nodes in the third subgraph; connect the first node of the second intermediate edge to the ninth intermediate node to form the fifth fault-free edge; connect the second node of the second intermediate edge to the tenth intermediate node to form the sixth fault-free edge.

[0143] Construct intermediate 2-DPC paths within the third subgraph. The intermediate 2-DPC paths include the seventh path and the eighth path. The seventh path connects the ninth intermediate node and the first endpoint, and the eighth path connects the tenth intermediate node and the second endpoint.

[0144] Delete the second intermediate edge, and concatenate the Hamiltonian path from the eighth intermediate node to the first node of the second intermediate edge, the fifth path, the seventh path, the third fault-free edge, and the fifth fault-free edge to obtain the first concatenated path.

[0145] By splicing the Hamiltonian path from the seventh intermediate node to the second node of the second intermediate edge, the sixth path, the eighth path, the fourth fault-free edge, and the sixth fault-free edge, the second spliced ​​path is obtained.

[0146] The first and second splicing paths are combined to obtain the final 2-DPC path.

[0147] like Figure 4 As shown, For 000, For 011, For 221, It is 213. , Subgraph , , Subgraph The 2-DPC construction process includes:

[0148] exist Internal selection and , It is 021. It is 032, according to , , , Construct the initial 2-DPC path; the initial 2-DPC path includes the fifth path. Second path , connect form , connect form ; (000,010,020,030,031,021); For (011,001,002,003,013,012,022,023,033,032); in Select 132 inside, in Inner edges 321, 032, and 132 form the fourth fault-free edge; 021 and 321 form the third fault-free edge. and Construct a Hamiltonian path connecting 132 and 321, with the path being (132, 131, 130, 120, 121, 122, 123, 113, 112, 111, 110, 100, 101, 102, 103, 133, 333, 332, 331, 330, 320, 322, 312, 311, 310, 300, 301, 302, 303, 313, 323, 321). Then, concatenate the fifth path, the sixth path, the third fault-free edge, the fourth fault-free edge, and the Hamiltonian path connecting the seventh and eighth intermediate nodes to obtain the first concatenated path. On the first concatenated path, select edge (320, 330), and within the third subgraph, select 220 and 230. Connect 320 with 220 to form the fifth fault-free edge. ; 330 connects to 230 to form the sixth fault-free edge ;

[0149] In the third subgraph The built-in intermediate 2-DPC path includes the seventh path. and the eighth path The third path Connect 220 and , for , Connect 230 and the ; The values ​​are (230, 231, 232, 233, 223, 222, 212, 211, 210, 200, 201, 202, 203, 213).

[0150] Delete the second intermediate edge, and concatenate the Hamiltonian path from the eighth intermediate node to the first node of the second intermediate edge, the fifth path, the seventh path, the third fault-free edge, and the fifth fault-free edge to obtain the first concatenated path.

[0151] By splicing the Hamiltonian path from the seventh intermediate node to the second node of the second intermediate edge, the sixth path, the eighth path, the fourth fault-free edge, and the sixth fault-free edge, the second spliced ​​path is obtained.

[0152] The first and second splicing paths are combined to obtain the final 2-DPC path.

[0153] Case 4: When the two starting points and two ending points belong to different subgraphs, the construction process includes:

[0154] Compress the subgraph corresponding to each point into a single point;

[0155] Connect the compression points of the subgraph corresponding to the first starting point and the compression points of the subgraph corresponding to the first ending point to form the first compression path;

[0156] Connect the compression points of the subgraph corresponding to the second starting point and the compression points of the subgraph corresponding to the second ending point to form the second compression path;

[0157] Construct a Hamiltonian path within each subgraph of the first compressed path to obtain the ninth path;

[0158] Construct a Hamiltonian path within each subgraph of the second compressed path to obtain the tenth path;

[0159] The ninth and tenth paths are combined to obtain the final 2-DPC path.

[0160] like Figure 5 As shown, For 000, For 111, For 221, It is 313. Subgraph , Subgraph , Subgraph , Subgraph The 2-DPC construction process includes:

[0161] Compress the subgraph corresponding to each point into a single point; subgraph The point after contraction is , The point after contraction is , The point after contraction is , Point after contraction First path connect and Second path connect and ;

[0162] In subgraph , , , Hamiltonian paths are constructed internally. For example: (000,010,020,030,031,021,011,001,002,003,013,012,022,023,033,032,230,231,232,233,223,213,203,202,201,200,210,211,212,222,220,221);

[0163] The values ​​are: (111,110,100,101,103,102,112,113,123,122,121,120,130,131,133,132,332,333,331,330,320,321,323,322,312,311,310,300,301,302,303,313).

[0164] splicing and Obtain the final 2-DPC path.

[0165] like Figure 6 As shown, a fault-tolerant 2-DPC construction system based on the PEF model is used to execute a fault-tolerant 2-DPC construction method based on the PEF model, including:

[0166] The acquisition module 101 acquires the switch port status and server connection status in real time, and determines the BCube logic diagram and the fault edge set of the BCube logic diagram based on the switch port status and server connection status.

[0167] The first construction module 102 constructs fault partition edge fault conditions based on the number of switch ports;

[0168] Verification module 103 verifies whether the fault edge set of the BCube logic graph satisfies the fault partition edge fault condition;

[0169] If the fault partition edge fault condition is met, then obtain the dimension with the most fault edges in the fault edge set of the BCube logical graph.

[0170] If the fault conditions of the fault partition edge are not met, redetermine the fault edge set of the BCube logic graph;

[0171] The partitioning module 104 divides the BCube logic graph into multiple BCube logic subgraphs based on the dimension with the most fault edges.

[0172] Select module 105 to select the start pair and end pair in the BCube logic diagram;

[0173] The second building module 106 constructs an initial 2-DPC path and a Hamiltonian path based on the distribution of the start-point pair and the end-point pair in the BCube logic subgraph, and concatenates the initial 2-DPC path and the Hamiltonian path to obtain the final 2-DPC path.

[0174] Through the collaborative work of the aforementioned modules, and leveraging the recursive nature of BCube, the BCube is divided into multiple subgraphs. Hamiltonian paths and fault-free edges between subgraphs are connected, ultimately constructing two disjoint paths from the starting point to the ending point, covering all points in the graph. This invention achieves exponential edge fault tolerance, improving the fault tolerance of the BCube data center network, and has significant research and application value.

[0175] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, and not to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some of the technical features; and these modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A fault-tolerant 2-DPC construction method based on the PEF model, characterized in that, include: S1: Real-time acquisition of switch port status and server connection status, and determination of BCube logic diagram and fault edge set of BCube logic diagram based on switch port status and server connection status; S2: Construct fault partitioning edge fault conditions based on the number of switch ports; Fault conditions for the faulty partition edge include: when , hour, ; when , hour, ; in, For dimension The number of faulty edges, for Number of faulty edges at time This refers to the number of ports on the switch. For the dimensions of BCube; when hour, , ; when hour, , , To round up; S3: Verify whether the set of fault edges in the BCube logic graph satisfies the fault partition edge fault condition; If the fault partition edge fault condition is met, then obtain the dimension with the most fault edges in the fault edge set of the BCube logical graph. If the fault condition of the fault partition edge is not met, the fault edge set of the BCube logic graph is re-determined according to step S1. S4: Divide the BCube logic graph into multiple BCube logic subgraphs based on the dimension with the most fault edges. S5: Select the start pair and end pair in the BCube logic diagram; S6: Construct the initial 2-DPC path and Hamiltonian path based on the distribution of the start point pair and the end point pair in the BCube logic subgraph, and concatenate the initial 2-DPC path and Hamiltonian path to obtain the final 2-DPC path. When all points at the start and end points belong to the first subgraph, the construction process includes: Construct an initial 2-DPC path within the first subgraph. The initial 2-DPC path includes a first path and a second path. The first path is formed by connecting the first starting point to the first ending point, and the second path is formed by connecting the second starting point to the second ending point. In the second path, select the first intermediate edge, select the first intermediate node in the second subgraph, and select the second intermediate node in the third subgraph. Connect the first intermediate node to the first node of the first intermediate edge to form the first fault-free edge; connect the second intermediate node to the second node of the first intermediate edge to form the second fault-free edge. Construct Hamiltonian paths connecting the first intermediate node and the second intermediate node in all subgraphs except the first subgraph. By concatenating the second path, the Hamiltonian path of the first intermediate node and the second intermediate node, the first fault-free edge and the second fault-free edge, and simultaneously deleting the first intermediate edge, the final second path is obtained. Finally, the second path is combined with the first path to obtain the final 2-DPC path.

2. The fault-tolerant 2-DPC construction method based on the PEF model according to claim 1, characterized in that, The BCube logical graph includes a set of nodes and a set of edges; The node set is Each node is represented by a string of numbers, and the range of values ​​for each dimension number is determined by... Sure, ,in, This is a BCube logic diagram. For node number Numbers in multiple dimensions; edge set is , Satisfy the first node With the second node Connected, and Connected if and only if a unique dimension exists. Make And the other dimensions , Make ,in, for No. Numbers in multiple dimensions for No. Numbers in multiple dimensions for No. Numbers in multiple dimensions for No. Numbers in multiple dimensions for No. Numbers in multiple dimensions for No. Numbers in multiple dimensions.

3. The fault-tolerant 2-DPC construction method based on the PEF model according to claim 2, characterized in that, If the set of fault edges in BCube satisfies the fault partitioning edge fault condition, then the set of fault edges in the BCube subgraph also satisfies the fault partitioning edge fault condition, and is determined by the nodes. Induced subgraph and isomorphism, where, For the node's Fixed value of dimension For the first Dimension is The nodes formed Subgraph, For dimension The BCube logic diagram.

4. The fault-tolerant 2-DPC construction method based on the PEF model according to claim 1, characterized in that, Both the initial 2-DPC path and the final 2-DPC path are two non-intersecting paths, and these two non-intersecting paths cover all nodes of the data center network.

5. The fault-tolerant 2-DPC construction method based on the PEF model according to claim 1, characterized in that, When three points at the start and end points belong to the first subgraph, and the other point belongs to the third subgraph, the construction process includes: Construct an initial 2-DPC path within the first subgraph; the initial 2-DPC path includes a third path and a fourth path. Select a third intermediate node in the first subgraph, connect the first starting point to the first ending point to form the third path, and connect the second starting point to the third intermediate node to form the fourth path. In the second subgraph, select the fourth intermediate node, and the third and fourth intermediate nodes form a fault-free edge; Construct Hamiltonian paths connecting the fourth intermediate node and the second endpoint in all subgraphs except the first subgraph; The final fourth path is obtained by concatenating the Hamiltonian path, the fault-free edge, and the fourth path. Finally, the fourth path is combined with the third path to obtain the final 2-DPC path.

6. The fault-tolerant 2-DPC construction method based on the PEF model according to claim 1, characterized in that, When two starting points belong to the first subgraph and two ending points belong to the third subgraph, the construction process includes: Construct an initial 2-DPC path within the first subgraph. The initial 2-DPC path includes the fifth path and the sixth path. Select the fifth intermediate node and the sixth intermediate node within the first subgraph. Connect the first starting point to the fifth intermediate node to form the fifth path, and connect the second starting point to the sixth intermediate node to form the sixth path. In the second subgraph, select the seventh intermediate node; in the fourth subgraph, select the eighth intermediate node; connect the fifth and eighth intermediate nodes to form the third fault-free edge; connect the sixth and seventh intermediate nodes to form the fourth fault-free edge. Construct Hamiltonian paths connecting the seventh and eighth intermediate nodes within the second and fourth subgraphs; By splicing the fifth path, the sixth path, the third fault-free edge, the fourth fault-free edge, and the Hamiltonian path connecting the seventh intermediate node and the eighth intermediate node, the first spliced ​​path is obtained. Select the second intermediate edge on the first splicing path, and select the ninth and tenth intermediate nodes in the third subgraph. Connect the first node of the second intermediate edge to the ninth intermediate node to form the fifth fault-free edge, and connect the second node of the second intermediate edge to the tenth intermediate node to form the sixth fault-free edge. Construct intermediate 2-DPC paths within the third subgraph. The intermediate 2-DPC paths include the seventh path and the eighth path. The seventh path connects the ninth intermediate node and the first endpoint, and the eighth path connects the tenth intermediate node and the second endpoint. Delete the second intermediate edge, and concatenate the Hamiltonian path from the eighth intermediate node to the first node of the second intermediate edge, the fifth path, the seventh path, the third fault-free edge, and the fifth fault-free edge to obtain the first concatenated path. By splicing the Hamiltonian path from the seventh intermediate node to the second node of the second intermediate edge, the sixth path, the eighth path, the fourth fault-free edge, and the sixth fault-free edge, the second spliced ​​path is obtained. The first and second splicing paths are combined to obtain the final 2-DPC path.

7. The fault-tolerant 2-DPC construction method based on the PEF model according to claim 1, characterized in that, When the two starting points and two ending points belong to different subgraphs, the construction process includes: Compress the subgraph corresponding to each point into a single point; Connect the compression points of the subgraph corresponding to the first starting point and the compression points of the subgraph corresponding to the first ending point to form the first compression path; Connect the compression points of the subgraph corresponding to the second starting point and the compression points of the subgraph corresponding to the second ending point to form the second compression path; Construct a Hamiltonian path within each subgraph of the first compressed path to obtain the ninth path; Construct a Hamiltonian path within each subgraph of the second compressed path to obtain the tenth path; The ninth and tenth paths are combined to obtain the final 2-DPC path.

8. A fault-tolerant 2-DPC construction system based on the PEF model, characterized in that, To implement a fault-tolerant 2-DPC construction method based on a PEF model as described in any one of claims 1 to 7, comprising: The acquisition module collects the switch port status and server connection status in real time, and determines the BCube logic diagram and the fault edge set of the BCube logic diagram based on the switch port status and server connection status. The first construction module constructs fault partition edge fault conditions based on the number of switch ports; The verification module verifies whether the fault edge set of the BCube logic graph satisfies the fault partition edge fault condition. If the fault partition edge fault condition is met, then obtain the dimension with the most fault edges in the fault edge set of the BCube logical graph. If the fault conditions of the fault partition edge are not met, redetermine the fault edge set of the BCube logic graph; A partitioning module, which divides the BCube logic graph into multiple BCube logic subgraphs based on the dimension with the most fault edges. The selection module selects a start pair and an end pair in the BCube logic diagram. The second building module constructs an initial 2-DPC path and a Hamiltonian path based on the distribution of the start point pair and the end point pair in the BCube logic subgraph, and then concatenates the initial 2-DPC path and the Hamiltonian path to obtain the final 2-DPC path.

Images