CN109039672B - Information broadcasting method and system for hypercube line graph structure data center network - Google Patents

Information broadcasting method and system for hypercube line graph structure data center network Download PDF

Info

Publication number
CN109039672B
CN109039672B CN201810802418.2A CN201810802418A CN109039672B CN 109039672 B CN109039672 B CN 109039672B CN 201810802418 A CN201810802418 A CN 201810802418A CN 109039672 B CN109039672 B CN 109039672B
Authority
CN
China
Prior art keywords
vertex
edge
tree
root
data center
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201810802418.2A
Other languages
Chinese (zh)
Other versions
CN109039672A (en
Inventor
程宝雷
樊建席
杨季文
林政宽
王丽丹
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhangjiagang Industrial Technology Research Institute Of Suzhou University
Suzhou University
Original Assignee
Zhangjiagang Industrial Technology Research Institute Of Suzhou University
Suzhou University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Zhangjiagang Industrial Technology Research Institute Of Suzhou University, Suzhou University filed Critical Zhangjiagang Industrial Technology Research Institute Of Suzhou University
Priority to CN201810802418.2A priority Critical patent/CN109039672B/en
Publication of CN109039672A publication Critical patent/CN109039672A/en
Application granted granted Critical
Publication of CN109039672B publication Critical patent/CN109039672B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H04L12/16—Arrangements for providing special services to substations
    • H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
    • H04L12/1863—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast comprising mechanisms for improved reliability, e.g. status reports

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Small-Scale Networks (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses an information broadcasting method and system for a hypercube line graph structure data center network, wherein the method comprises the following steps: s1, constructing 1 st to n-1 st independent spanning trees; s11. constructing
Figure DDA0001737332160000011
And
Figure DDA0001737332160000012
the independent spanning tree of (1); s12, constructing a tree Ti"; s13, obtaining a subtree Ti'; s14, for Ti' adding edge vertices, the resulting tree is Ti(ii) a S2, constructing the nth to 2n-2 independent spanning trees; s21. constructing
Figure DDA0001737332160000013
And
Figure DDA0001737332160000014
the independent spanning tree of (1); s22, constructing a tree Tk+n‑1"; s23, obtaining a subtree Tk+n‑1'; s24, for Tk+n‑1' adding edge vertices, the resulting tree is Tk+n‑1. Compared with the prior art, the invention has the advantages that when the information is in the hypercube QnDiagram-structured data center network L (Q)n) When the system is used for broadcasting, 2n-3 fault servers can be accommodated, so that the reliability of the network is effectively improved.

Description

Information broadcasting method and system for hypercube line graph structure data center network
Technical Field
The invention belongs to the technical field of communication, and particularly relates to an information broadcasting method and system for a hypercube line graph structure data center network.
Background
The existing data center network broadcasting method of the hypercube structure is mainly realized by means of an independent spanning tree. An independent spanning tree is a special set of spanning trees with the same root vertex for a certain network construction. In any two spanning trees, the edges and the vertexes passed between the root and any one vertex are different. For having 2nN-dimensional hypercube Q of individual verticesnIn other words, there are n completely independent spanning trees with any vertex (set as r) as the root. We broadcast the data S along these n independent spanning trees, and since there are n independent paths between the root r and any one vertex (set as v), v can still accept the data S from the word r under the condition that no more than n-1 servers are damaged.
However, the hypercube Q has been proposed in recent yearsnLine graph L (Q)n) The connectivity of any vertex on the data center network is 2 n-2. Reliable broadcast method on existing hypercube, is not suitable for hypercube graph network L (Q)n)。
Disclosure of Invention
In order to solve the technical problem, the invention provides an information broadcasting method and system for a hypercube graph structure data center network.
In order to achieve the purpose, the technical scheme of the invention is as follows:
the invention provides an information broadcasting method of a hypercube line graph structure data center network, which comprises the following steps:
s1, constructing 1 st to n-1 st independent spanning trees;
s11. constructing
Figure GDA0001790536910000023
In the n-1 independent spanning trees T taking 0 as rootA，1，TA，2，...，TA，n-1(ii) a Adding 2 to each vertex in the treen-1Can obtain
Figure GDA0001790536910000024
Wherein n-1 is 2n-1Independent spanning tree for rootTB，1，TB，2，...，TB，n-1；
S12, the two groups of trees T are arranged in the left-to-right directionA，iAnd TB，iIs connected, and T is disconnectedB，iThe edges of the loop are formed to obtain the tree Ti", where i ═ 1,2,.., n-1;
s13, combining Ti"transformation by edge vertex method, get L (Q)n) Upper subtree Ti', where i is 1, 2.., n-1;
s14, for Ti' adding edge vertices, the resulting tree is TiWhere i is 1, 2.., n-1;
s2, constructing the nth to 2n-2 independent spanning trees;
s21. constructing
Figure GDA0001790536910000022
In the n-1 independent spanning trees T taking 0 as rootA，1，TA，2，...，TA，n-1And
Figure GDA0001790536910000021
wherein n-1 is 2n-1Independent spanning tree T as rootB，1，TB，2，...，TB，n-1；
S22, the two groups of trees T are arranged from right to leftA，kAnd TB，kIs connected, and T is disconnectedA，kThe edges of the loop are formed to obtain the tree Tk+n-1", where k is 1,2,. -, n-1;
s23, combining Tk+n-1"transformation by edge vertex method, get L (Q)n) Upper subtree Tk+n-1', where k is 1, 2.., n-1;
s24, for Tk+n-1' adding edge vertices, the resulting tree is Tk+n-1Where k is 1, 2.
Preferably, in the construction of 1 st to n-1 st independent spanning trees, the vertex in the line graph L (G) of a graph G is an edge in the graph G; the vertices in the line graph l (g) are called edge vertices, and are constructed as follows:
let L (G) be null, for any edge (x, y) in G, add vertex [ x, y ] to L (G); where [ x, y ] is referred to as an edge vertex, where [ x, y ] and [ y, x ] represent the same vertex; for any adjacent edges (x, y) and (y, z) in G, connecting edge vertices [ x, y ] and [ y, z ] in l (G);
for an edge vertex [ x, y ], it is either a vertex containing an x component or a vertex containing a y component.
Preferably, T is treated in step S14i' add edge vertices in three cases:
s141. for
Figure GDA0001790536910000034
And
Figure GDA0001790536910000035
the edge between them is converted into an edge vertex and then set as [ u, v ]](u < v), grafting to Ti' on the vertex containing the component u;
s142, for TB，iMiddle broken side (x, y) is set at TB，iThe father vertex of which x is y is converted into an edge vertex and then is connected to Ti' on the vertex containing the x component;
s143. for the position L (Q)n) But not at TiEach vertex in' is set to [ a, b ]](ii) a Let a have an even number of 1 s, when a is represented in binary, let Ti' the vertex containing a component nearest to the root is [ a, z]Is connected to [ a, b]And [ a, z ]]。
Preferably, T is treated in step S24k+n-1' add edge vertices in three cases:
s241. for
Figure GDA0001790536910000032
And
Figure GDA0001790536910000033
the edge between them is converted into an edge vertex and then set as [ u, v ]](u < v), grafting to Tk+n-1' on the vertex containing the component v;
s242. for TA，kMiddle broken side (x, y) is set at TB，kThe father vertex of which x is y is converted into an edge vertex and then is connected to Tk+n-1' on the vertex containing the y component;
s243. for the position L (Q)n) But not at Tk+n-1Each vertex in' is set to [ a, b ]](ii) a Let b have an odd number of 1 s, when b is represented in binary, let Tk+n-1' the vertex containing the b component nearest to the root is [ b, w]Is connected to [ a, b]And [ b, w]。
As a preferred solution, the present invention further provides an information broadcasting system of a hypercube graph structure data center network, including a network control unit component and a processor unit component, where the network control unit component and the processor unit component implement the following steps:
s1, constructing 1 st to n-1 st independent spanning trees;
s11. constructing
Figure GDA0001790536910000031
In the n-1 independent spanning trees T taking 0 as rootA，1，TA，2，...，TA，n-1(ii) a Adding 2 to each vertex in the treen-1Can obtain
Figure GDA0001790536910000043
Wherein n-1 is 2n-1Independent spanning tree T as rootB，1，TB，2，...，TB，n-1；
S12, the two groups of trees T are arranged in the left-to-right directionA，iAnd TB，iIs connected, and T is disconnectedB，iThe edges of the loop are formed to obtain the tree Ti", where i ═ 1,2,.., n-1;
s13, combining Ti"transformation by edge vertex method, get L (Q)n) Upper subtree Ti', where i is 1, 2.., n-1;
s14, for Ti' adding edge vertices, the resulting tree is TiWhere i is 1, 2.., n-1;
s2, constructing the nth to 2n-2 independent spanning trees;
s21. constructing
Figure GDA0001790536910000041
In the n-1 independent spanning trees T taking 0 as rootA，1，TA，2，...，TA，n-1And
Figure GDA0001790536910000042
wherein n-1 is 2n-1Independent spanning tree T as rootB，1，TB，2，...，TB，n-1；
S22, the two groups of trees T are arranged from right to leftA，kAnd TB，kIs connected, and T is disconnectedA，kThe edges of the loop are formed to obtain the tree Tk+n-1", where k is 1,2,. -, n-1;
s23, combining Tk+n-1"transformation by edge vertex method, get L (Q)n) Upper subtree Tk+n-1', where k is 1, 2.., n-1;
s24, for Tk+n-1' adding edge vertices, the resulting tree is Tk+n-1Where k is 1, 2.
The invention has the following beneficial effects: compared with the prior art, the invention has the advantages that when the information is in the hypercube QnDiagram-structured data center network L (Q)n) When the system is used for broadcasting, 2n-3 fault servers can be accommodated, so that the reliability of the network is effectively improved.
Drawings
Fig. 1 is a workflow diagram of the construction of the (n) th to 2n-2 independent spanning trees in the information broadcasting method of the hypercube graph structure data center network according to the present invention.
FIG. 2 is a diagram of an independent spanning tree T constructed in the information broadcasting method of the hypercube graph structure data center network of the present inventionB，1And TB，2Is described.
FIG. 3a is a structural tree T in the information broadcasting method of the hypercube graph structure data center network of the present inventioni"work flow ofFigure (a).
FIG. 3b is a diagram of a sub-tree T constructed in the information broadcasting method of the hypercube graph structure data center network of the present inventioni' is provided.
FIGS. 3c-3e are diagrams illustrating the information broadcasting method for the hypercube graph structure data center network according to the present inventioni' A workflow diagram for adding edge vertices in three cases.
FIG. 4 is a diagram of an independent spanning tree T constructed in the information broadcasting method of the hypercube graph structure data center network of the present invention3And T4Is described.
FIG. 5 is a diagram of L (Q) in the information broadcasting method of the hypercube graph structure data center network of the present invention3) Server [0, 4 ] in]A workflow diagram for root information broadcast.
Detailed Description
Preferred embodiments of the present invention will be described in detail below with reference to the accompanying drawings.
In order to achieve the object of the present invention, in one embodiment of the present invention, there is provided an information broadcasting method for a hypercube graph structure data center network, including the steps of:
s1, constructing 1 st to n-1 st independent spanning trees;
s11. constructing
Figure GDA0001790536910000051
In the n-1 independent spanning trees T taking 0 as rootA，1，TA，2，...，TA，n-1(ii) a Adding 2 to each vertex in the treen-1Can obtain
Figure GDA0001790536910000052
Wherein n-1 is 2n-1Independent spanning tree T as rootB，1，TB，2，...，TB，n-1；
S12, the two groups of trees T are arranged in the left-to-right directionA，iAnd TB，iIs connected, and T is disconnectedB，iThe edges of the loop are formed to obtain the treeTi", where i ═ 1, 2., n-1；
S13, combining Ti"transformation by edge vertex method, get L (Q)n) Upper subtree Ti', where i is 1, 2.., n-1;
s14, for Ti' adding edge vertices, the resulting tree is TiWhere i is 1, 2.., n-1;
s2, constructing the nth to 2n-2 independent spanning trees;
s21. constructing
Figure GDA0001790536910000063
In the n-1 independent spanning trees T taking 0 as rootA，1，TA，2，...，TA，n-1And
Figure GDA0001790536910000064
wherein n-1 is 2n-1Independent spanning tree T as rootB，1，TB，2，...，TB，n-1；
S22, the two groups of trees T are arranged from right to leftA，kAnd TB，kIs connected, and T is disconnectedA，kThe edges of the loop are formed to obtain the tree Tk+n-1", where k is 1,2,. -, n-1;
s23, combining Tk+n-1"transformation by edge vertex method, get L (Q)n) Upper subtree Tk+n-1', where k is 1, 2.., n-1;
s24, for Tk+n-1' adding edge vertices, the resulting tree is Tk+n-1Where k is 1, 2.
When 1 st to n-1 st independent spanning trees are constructed, the vertex in the graph L (G) of one graph G is an edge in the graph G; the vertices in the line graph l (g) are called edge vertices, and are constructed as follows:
let L (G) be null, for any edge (x, y) in G, add vertex [ x, y ] to L (G); where [ x, y ] is referred to as an edge vertex, where [ x, y ] and [ y, x ] represent the same vertex; for any adjacent edges (x, y) and (y, z) in G, connecting edge vertices [ x, y ] and [ y, z ] in l (G);
for an edge vertex [ x, y ], it is either a vertex containing an x component or a vertex containing a y component.
Specifically, in step S14, T is treatedi' add edge vertices in three cases:
s141. for
Figure GDA0001790536910000061
And
Figure GDA0001790536910000062
the edge between them is converted into an edge vertex and then set as [ u, v ]](u < v), grafting to Ti' on the vertex containing the component u;
s142, for TB，iMiddle broken side (x, y) is set at TB，iThe father vertex of which x is y is converted into an edge vertex and then is connected to Ti' on the vertex containing the x component;
s143. for the position L (Q)n) But not at TiEach vertex in' is set to [ a, b ]](ii) a Let a have an even number of 1 s, when a is represented in binary, let Ti' the vertex containing a component nearest to the root is [ a, z]Is connected to [ a, b]And [ a, z ]]。
Specifically, in step S24, T is treatedk+n-1' add edge vertices in three cases:
s241. for
Figure GDA0001790536910000075
And
Figure GDA0001790536910000076
the edge between them is converted into an edge vertex and then set as [ u, v ]](u < v), grafting to Tk+n-1' on the vertex containing the component v;
s242. for TA，kMiddle broken side (x, y) is set at TB，kThe father vertex of which x is y is converted into an edge vertex and then is connected to Tk+n-1' on the vertex containing the y component;
s243. for the position L (Q)n) But not at Tk+n-1Each vertex in' is set to [ a, b ]](ii) a Suppose b has an odd number1 of a number, when b is represented in binary, let Tk+n-1' the vertex containing the b component nearest to the root is [ b, w]Is connected to [ a, b]And [ b, w]。
As shown in fig. 1, the present invention further provides an information broadcasting system of a hypercube graph structure data center network, which comprises a network control unit component and a processor unit component, wherein the network control unit component and the processor unit component implement the following steps:
s1, constructing 1 st to n-1 st independent spanning trees;
s11. constructing
Figure GDA0001790536910000074
In the n-1 independent spanning trees T taking 0 as rootA，1，TA，2，...，TA，n-1(ii) a Adding 2 to each vertex in the treen-1Can obtain
Figure GDA0001790536910000073
Wherein n-1 is 2n-1Independent spanning tree T as rootB，1，TB，2，...，TB，n-1；
S12, the two groups of trees T are arranged in the left-to-right directionA，iAnd TB，iIs connected, and T is disconnectedB，iThe edges of the loop are formed to obtain the tree Ti", where i ═ 1,2,.., n-1;
s13, combining Ti"transformation by edge vertex method, get L (Q)n) Upper subtree Ti', where i is 1, 2.., n-1;
s14, for Ti' adding edge vertices, the resulting tree is TiWhere i is 1, 2.., n-1;
s2, constructing the nth to 2n-2 independent spanning trees;
s21. constructing
Figure GDA0001790536910000071
In the n-1 independent spanning trees T taking 0 as rootA，1，TA，2，...，TA，n-1And
Figure GDA0001790536910000072
wherein n-1 is 2n-1Independent spanning tree T as rootB，1，TB，2，...，TB，n-1；
S22, the two groups of trees T are arranged from right to leftA，kAnd TB，kIs connected, and T is disconnectedA，kThe edges of the loop are formed to obtain the tree Tk+n-1", where k is 1,2,. -, n-1;
s23, combining Tk+n-1"transformation by edge vertex method, get L (Q)n) Upper subtree Tk+n-1', where k is 1, 2.., n-1;
s24, for Tk+n-1' adding edge vertices, the resulting tree is Tk+n-1Where k is 1, 2.
In order to further optimize the implementation effect of the invention, one embodiment of the invention is a 3-dimensional hypercube Q3For example, its upper vertices 0(000), 1(001), 2(010), 3(011), 4 (100), 5(101), 6(110), 7 (111). We construct 2 x 3-2 ═ 4 IST on top of it as follows.
The 1 st to 2 nd trees are constructed as follows:
constructed according to methods in the prior art
Figure GDA0001790536910000083
Middle 2 independent spanning trees T with 0 as rootA，1And TA，2Adding 2 to each vertex in the tree3-1Is 4, then the product is obtained
Figure GDA0001790536910000084
Middle 2 independent spanning trees T with 4 as rootB，1And TB，2As shown in fig. 2.
Firstly, the two groups of trees connect the middle vertexes according to the left-to-right direction, and disconnect TB，iConstitutes the edge of the loop.
Get the tree TiWhere i is 1,2, as shown in fig. 3 a.
Then, Ti"transformation by edge vertex method, get L (Q)3) Upper subtree Ti', as shown in FIG. 3 b.
Then, for Ti' add edge vertices in three cases:
phi to
Figure GDA0001790536910000081
And
Figure GDA0001790536910000082
edge in between, after conversion into edge vertex, here at T1' in is [0, 4]And [2, 6 ]](ii) a At T2' in is [0, 4]And [1, 5 ]]. At T1' in, the edge vertex [0, 4 ]]Hitched to edge vertex [0, 1 ]]The edge vertex [2, 6 ]]Hitched to edge vertex [2, 3 ]](ii) a At T2' in, the edge vertex [0, 4 ]]Hitched to edge vertex [0, 2 ]]The edge vertex [1, 5 ]]Hitched to edge vertex [3, 1 ]]As shown in fig. 3 c.
For TB，1In the broken edge (5, 7), into edge vertices [5, 7 ]]Then hang to TB，1Vertex [5, 1 ] with 5 components]The above step (1); for TB，2In the broken edge (6, 7), into edge vertices [6, 7 ]]Then hang to TB，1Vertex [6, 2 ] with 6 components]As shown in fig. 3 d.
③ for L (Q)3) But not at T1' Top point of [0, 2 ]]And [6, 4 ]]Respectively hitched to T1' the vertex containing a 0 component nearest to the root is [0, 1 ]]And a vertex with 6 components of [6, 7 ]]The above step (1); for in L (Q)3) But not at T2' Top point of [0, 1 ]]And [5, 4 ]]Respectively hitched to T1' the vertex containing a 0 component nearest to the root is [0, 2 ]]And a vertex with 5 components of [5, 7 ]]As shown in fig. 3 e.
The resulting tree is T1And T2。
Using the above method, we can construct T3And T4As shown in fig. 4.
For any n is more than or equal to 3, the invention can construct 2n-2 independent generation on the plantAnd (4) a tree. For a data center network adopting a hypercube line graph structure, under the condition that the root is a failure-free vertex and no more than 2n-3 servers are damaged, the method can reliably broadcast all failure-free servers. As shown in fig. 5, as L (Q)3) Server [0, 4 ] in]As a root, the broken servers 2 x 3-3 x 3 servers are [3, 7 ]]，[5，7]，[0，2]。
Any non-fault server in the data center network can correctly receive the root [0, 4 ]]The data sent out. Here, the non-failure server includes [0, 1 ]]，[5，1]，[5，4]，[3，1]，[3，2]，[6，2]，[6，7]，[6，4]. Such as independent spanning tree T1Can reliably transfer data from root [0, 4 ]]To [0, 1 ]]，[5，1]，[5，4]，[3，1]，[3，2]，[6，2](ii) a Independent spanning tree T4Can reliably transfer data from root [0, 4 ]]To [6, 7 ]]And [6, 4 ]]。
The foregoing is only a preferred embodiment of the present invention, and it should be noted that, for those skilled in the art, various changes and modifications can be made without departing from the inventive concept of the present invention, and these changes and modifications are all within the scope of the present invention.

Claims (5)

1. The information broadcasting method of the hypercube line graph structure data center network is characterized by comprising the following steps of:
s1, constructing 1 st to n-1 st independent spanning trees;
s11. constructing
Figure FDA0002956757610000011
In the n-1 independent spanning trees T taking 0 as rootA,1，TA,2，…，TA,n-1(ii) a Adding 2 to each vertex in the treen-1Can obtain
Figure FDA0002956757610000012
Wherein n-1 is 2n-1Independent spanning tree T as rootB,1，TB,2，…，TB,n-1；
S12. pressThe two groups of trees T are arranged from left to rightA,iAnd TB,iIs connected, and T is disconnectedB,iThe edges of the loop are formed to obtain the tree TiWhere i is 1,2, …, n-1;
s13, combining Ti"transformation by edge vertex method, get L (Q)n) Upper subtree Ti', where i is 1,2, …, n-1;
s14, for Ti' adding edge vertices, the resulting tree is TiWhere i is 1,2, …, n-1;
s2, constructing the nth to 2n-2 independent spanning trees;
s21. constructing
Figure FDA0002956757610000013
In the n-1 independent spanning trees T taking 0 as rootA,1，TA,2，…，TA,n-1And
Figure FDA0002956757610000014
wherein n-1 is 2n-1Independent spanning tree T as rootB,1，TB,2，…，TB,n-1；
S22, the two groups of trees T are arranged from right to leftA,kAnd TB,kIs connected, and T is disconnectedA,kThe edges of the loop are formed to obtain the tree Tk+n-1Where k is 1,2, …, n-1;
s23, combining Tk+n-1"transformation by edge vertex method, get L (Q)n) Upper subtree Tk+n-1', where k is 1,2, …, n-1;
s24, for Tk+n-1' adding edge vertices, the resulting tree is Tk+n-1Where k is 1,2, …, n-1;
wherein, the data center network L (Q)n) The root and the vertex of the tree and the subtree are all servers;
after the construction is completed, the information is made to be in the data center network L (Q) of the hypercube graph structuren) And in the upper broadcast, any fault-free server in the data center network can correctly receive the data sent from the root.
2. The information broadcasting method for the hypercube line graph structure data center network according to claim 1, characterized in that, in the construction of 1 st to n-1 st independent spanning trees, for a graph G, the vertexes in the line graph l (G) are the edges in the graph G; the vertices in the line graph l (g) are called edge vertices, and are constructed as follows:
let L (G) be null, for any edge (x, y) in G, add vertex [ x, y ] to L (G); where [ x, y ] is referred to as an edge vertex, where [ x, y ] and [ y, x ] represent the same vertex; for any adjacent edges (x, y) and (y, z) in G, connecting edge vertices [ x, y ] and [ y, z ] in l (G);
for an edge vertex [ x, y ], it is also referred to as a vertex containing an x component or a vertex containing a y component.
3. The information broadcasting method of the hypercube graph structure data center network as claimed in claim 2, wherein in step S14 for Ti' add edge vertices in three cases:
s141. for
Figure FDA0002956757610000021
And
Figure FDA0002956757610000022
the edge between them is converted into an edge vertex and then set as [ u, v ]],(u<v) is hooked to Ti' on the vertex containing the component u;
s142, for TB,iMiddle broken side (x, y) is set at TB,iThe father vertex of which x is y is converted into an edge vertex and then is connected to Ti' on the vertex containing the x component;
s143. for the position L (Q)n) But not at TiEach vertex in' is set to [ a, b ]](ii) a Let a have an even number of 1 s, when a is represented in binary, let Ti' the vertex containing a component nearest to the root is [ a, z]Is connected to [ a, b]And [ a, z ]]。
4. The hypercube graph structure number of claim 3Method for broadcasting information in a data-centric network, characterized in that in step S24, T is transmittedk+n-1' add edge vertices in three cases:
s241. for
Figure FDA0002956757610000023
And
Figure FDA0002956757610000024
the edge between them is converted into an edge vertex and then set as [ u, v ]],(u<v) is hooked to Tk+n-1' on the vertex containing the component v;
s242. for TA,kMiddle broken side (x, y) is set at TB,kThe father vertex of which x is y is converted into an edge vertex and then is connected to Tk+n-1' on the vertex containing the y component;
s243. for the position L (Q)n) But not at Tk+n-1Each vertex in' is set to [ a, b ]](ii) a Let b have an odd number of 1 s, when b is represented in binary, let Tk+n-1' the vertex containing the b component nearest to the root is [ b, w]Is connected to [ a, b]And [ b, w]。
5. The information broadcasting system of the hypercube graph structure data center network is characterized by comprising a network control unit component and a processor unit component, wherein the network control unit component and the processor unit component realize the following steps:
s1, constructing 1 st to n-1 st independent spanning trees;
s11. constructing
Figure FDA0002956757610000031
In the n-1 independent spanning trees T taking 0 as rootA,1，TA,2，…，TA,n-1(ii) a Adding 2 to each vertex in the treen-1Can obtain
Figure FDA0002956757610000032
Wherein n-1 is 2n-1Independent spanning tree T as rootB,1，TB,2，…，TB,n-1；
S12, the two groups of trees T are arranged in the left-to-right directionA,iAnd TB,iIs connected, and T is disconnectedB,iThe edges of the loop are formed to obtain the tree TiWhere i is 1,2, …, n-1;
s13, combining Ti"transformation by edge vertex method, get L (Q)n) Upper subtree Ti', where i is 1,2, …, n-1;
s14, for Ti' adding edge vertices, the resulting tree is TiWhere i is 1,2, …, n-1;
s2, constructing the nth to 2n-2 independent spanning trees;
s21. constructing
Figure FDA0002956757610000033
In the n-1 independent spanning trees T taking 0 as rootA,1，TA,2，…，TA,n-1And
Figure FDA0002956757610000034
wherein n-1 is 2n-1Independent spanning tree T as rootB,1，TB,2，…，TB,n-1；
S22, the two groups of trees T are arranged from right to leftA,kAnd TB,kIs connected, and T is disconnectedA,kThe edges of the loop are formed to obtain the tree Tk+n-1Where k is 1,2, …, n-1;
s23, combining Tk+n-1"transformation by edge vertex method, get L (Q)n) Upper subtree Tk+n-1', where k is 1,2, …, n-1;
s24, for Tk+n-1' adding edge vertices, the resulting tree is Tk+n-1Where k is 1,2, …, n-1; wherein, the data center network L (Q)n) The root and the vertex of the tree and the subtree are all servers; and after construction, the data center network L (Q) of the hypercube graph structuren) And (4) carrying out information broadcasting, and correctly receiving the data sent from the root by any fault-free server in the data center network.
CN201810802418.2A 2018-07-20 2018-07-20 Information broadcasting method and system for hypercube line graph structure data center network Active CN109039672B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810802418.2A CN109039672B (en) 2018-07-20 2018-07-20 Information broadcasting method and system for hypercube line graph structure data center network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810802418.2A CN109039672B (en) 2018-07-20 2018-07-20 Information broadcasting method and system for hypercube line graph structure data center network

Publications (2)

Publication Number Publication Date
CN109039672A CN109039672A (en) 2018-12-18
CN109039672B true CN109039672B (en) 2021-04-20

Family

ID=64643792

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810802418.2A Active CN109039672B (en) 2018-07-20 2018-07-20 Information broadcasting method and system for hypercube line graph structure data center network

Country Status (1)

Country Link
CN (1) CN109039672B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110519170B (en) * 2019-08-30 2021-07-09 苏州大学 Data safety distribution method

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103957163A (en) * 2014-03-07 2014-07-30 哈尔滨工业大学深圳研究生院 Network topology structure based on fat tree high scalability hypercube
CN106373189A (en) * 2016-09-06 2017-02-01 西安建筑科技大学 Space-time body data coding method based on linear hexadecimal tree
CN108040012A (en) * 2017-12-05 2018-05-15 西南交通大学 Multi-object multicast routed path construction method in the SDN network that must be searched for based on longicorn

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8730241B2 (en) * 2008-09-08 2014-05-20 Fair Isaac Corporation Techniques for drawing curved edges in graphs

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103957163A (en) * 2014-03-07 2014-07-30 哈尔滨工业大学深圳研究生院 Network topology structure based on fat tree high scalability hypercube
CN106373189A (en) * 2016-09-06 2017-02-01 西安建筑科技大学 Space-time body data coding method based on linear hexadecimal tree
CN108040012A (en) * 2017-12-05 2018-05-15 西南交通大学 Multi-object multicast routed path construction method in the SDN network that must be searched for based on longicorn

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
《超立方体网络中多播路由优化策略研究》;王洪伟;《中国博士学位论文全文数据库》;20140131;第24-39页 *

Also Published As

Publication number Publication date
CN109039672A (en) 2018-12-18

Similar Documents

Publication Publication Date Title
US11294888B2 (en) Blockchain system and blockchain transaction data processing method based on ethereum
AU2019302940B2 (en) Implementing a blockchain-based web service
CN105608219B (en) A kind of streaming recommended engine, recommender system and recommended method based on cluster
CN110472745B (en) Information transmission method and device in federated learning
JP6090681B2 (en) System and method for scalable structured data distribution
CN111080288B (en) Block chain consensus achieving method and device based on directed acyclic graph
WO2015176603A1 (en) Method and device for locating network fault
CN103209210A (en) Method for improving erasure code based storage cluster recovery performance
CN114418129B (en) Deep learning model training method and related device
CN109039672B (en) Information broadcasting method and system for hypercube line graph structure data center network
CN114050904B (en) Consensus system and method based on two-level leader node fragmentation structure
CN105162623A (en) Cloud processing method and cloud server
CN105897678A (en) Network broadcast data processing method and device
Jeong et al. Locally recoverable coded matrix multiplication
CN110519170A (en) A kind of Secure distributing of data method
CN107153506A (en) Distributed memory system and processing method based on regeneration code
US20150127941A1 (en) Systems and Methods for Secure File Transfers
CN109582735A (en) A kind of block chain blocks of knowledge storage system
Zhou et al. Cycles embedding in exchanged crossed cube
Xiang et al. Minimal edge controllability of directed networks
CN104283792A (en) W Internet pipeline communication protocol routing algorithm based on content
CN115905978A (en) Fault diagnosis method and system based on layered federal learning
Li et al. Architectures for coded mobile edge computing
CN109067878A (en) A kind of electronic equipment and method of the Publish-subscribe message in Internet of Things
CN107665152A (en) The interpretation method of a kind of correcting and eleting codes

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant