CN104022928A - Topology construction method of high-density server and system thereof - Google Patents
Topology construction method of high-density server and system thereof Download PDFInfo
- Publication number
- CN104022928A CN104022928A CN201410215126.0A CN201410215126A CN104022928A CN 104022928 A CN104022928 A CN 104022928A CN 201410215126 A CN201410215126 A CN 201410215126A CN 104022928 A CN104022928 A CN 104022928A
- Authority
- CN
- China
- Prior art keywords
- kautz
- directed graph
- node
- exchange chip
- density server
- 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.)
- Granted
Links
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a topology construction method of a high-density server and a system thereof. The method comprises the following steps: a Kautz digraph for a topological structure of a high-density server is created according to requirements on network size, and the Kautz digraph is divided into multiple isomorphic sub-graphs; and switch chips are arranged on a subserver according to the isomorphic sub-graphs, and multiple subservers are arranged in the high-density server according to the Kautz digraph such that the switch chips on the multiple subservers are corresponding to nodes in the Kautz digraph one to one and the connection mode between the switch chips is consistent with the connection mode between the corresponding nodes in the Kautz digraph. Based on the Kautz digraph, the subservers with the same topological structure are used to form the high-density server. Thus, the high-density server has characteristics of high efficiency, good fault tolerance and extendibility. In addition, batch production of the subservers can be realized, thus saving manufacturing cost and time cost.
Description
Technical field
The present invention relates to the Topology Structure Design field of data center network, be specifically related to a kind of topological construction method and system of high density server.
Background technology
How day by day universal along with cloud computing, build fault-tolerance better and the higher data center network of efficiency has become current study hotspot.Due to the good nature of Kautz network in node scale, path and fault-tolerance, it has been widely used as the topological structure of data center network.The SiCortex SC5832 system of take is example, and this system forms one a little bigger (i.e. a station server) by 6 processor chips, and is 6 and to spend be 3 kautz network (or title Kautz directed graph) by 972 such diameters that are linked to be a little louder.
As a rule, Kautz directed graph can be denoted as K (d, n), and its out-degree and in-degree that represents node is all that d (d >=2) and network diameter are n (n >=1).In K (d, n), for each, be designated u
1u
2u
knode U (be denoted as U=u
1u
2u
k), U has d bar to go out limit.That is to say, for any α ∈ 0,1,2 ..., d and α ≠ u
k, node U=u
1u
2u
kthere is one to node V=u
2u
3u
kα goes out limit.Kautz directed graph has following character:
1, the number of nodes N of node scale: K (d, n) is d
n-1+ d
n.
2, network diameter: for the Kautz arbitrarily of given node number of degrees d and node sum N, its network diameter n can reach minimum value, so Kautz has optimum network diameter.
3, fault-tolerance: K (d, n) has connection degree d,, between any two nodes of Kautz figure, has the mutually disjoint path of d bar.
Yet for the existing system such as SiCortex SC5832 etc., the server consisting of 6 processor chips can not meet the demand of data-center applications to high-throughput.For addressing this problem, current way is to provide required high-throughput with high density server.Wherein, high density server can be the server consisting of many blade servers (or claiming backboard), and every station server comprises a plurality of exchange chips.Every high density server can comprise hundreds and thousands of exchange chips, for improving required high-throughput.
In high density server, the connected mode of these hundreds and thousands of exchange chips can have influence on the performance of whole system.How to build efficient, zmodem, extendible high density server, and the production cost of simultaneously saving child servers (for example blade server) is wherein current problem demanding prompt solution.
Summary of the invention
For addressing the above problem, according to one embodiment of present invention, provide a kind of topological construction method of high density server, comprising:
Step 1), according to demand to network size, create the Kautz directed graph for the topological structure of high density server, and this Kautz directed graph be divided into a plurality of isomorphism subgraphs;
Step 2), according to isomorphism subgraph, in child servers, arrange exchange chip, connected mode and the connected mode between the corresponding node in isomorphism subgraph between corresponding and exchange chip is consistent one by one to make exchange chip in child servers and node in isomorphism subgraph; And
Step 3), in high density server, arrange a plurality of child servers, connected mode and the connected mode between the corresponding node in described Kautz directed graph between corresponding and exchange chip is consistent one by one to make exchange chip in the plurality of child servers and node in described Kautz directed graph.
In one embodiment, step 3) comprising: according to the connected mode between the node in the isomorphism subgraph different, connect the exchange chip in corresponding different child servers.
In one embodiment, the direction of the line direction transfer of data between exchange chip.
In a further embodiment, the network diameter of described Kautz directed graph is 2.
In one embodiment, the out-degree that described Kautz directed graph is node and in-degree are 8 and the network diameter Kautz directed graph that is 2.In another embodiment, the out-degree that described Kautz directed graph is node and in-degree are 3 and the network diameter Kautz directed graph that is 2.
According to one embodiment of present invention, also provide a kind of topology constructing system of high density server, comprising:
For being used for the Kautz directed graph of the topological structure of high density server according to the demand establishment to network size, and this Kautz directed graph is divided into the equipment of a plurality of isomorphism subgraphs;
For arranging exchange chip according to isomorphism subgraph in child servers, make exchange chip in child servers and node in isomorphism the subgraph connected mode between corresponding and exchange chip and the consistent equipment of the connected mode between the corresponding node in isomorphism subgraph one by one; And
For arranging a plurality of child servers in high density server, make exchange chip in the plurality of child servers and node in described Kautz the directed graph connected mode between corresponding and exchange chip and the consistent equipment of the connected mode between the corresponding node in described Kautz directed graph one by one.
Adopt the present invention can reach following beneficial effect:
A plurality of child servers identical by topological structure and that routing mechanism is identical form high density server, and all exchange chips of high density server and line thereof form Kautz directed graph, make that formed high density server possesses efficiently, zmodem and extendible advantage.In addition, owing to can producing child servers in batches, thereby manufacturing cost and time cost have been saved.
Accompanying drawing explanation
Fig. 1 is the flow chart of the topological construction method of high density server according to an embodiment of the invention;
Fig. 2 a is the schematic diagram of Kautz directed graph K (3,2);
Fig. 2 b-2d shows respectively each the isomorphism subgraph of the Kautz directed graph K (3,2) shown in Fig. 2 a; And
Fig. 3 a-3i shows respectively each isomorphism subgraph of Kautz directed graph K (8,2).
Embodiment
Below in conjunction with the drawings and specific embodiments, the present invention is illustrated.Should be appreciated that specific embodiment described herein, only in order to explain the present invention, is not intended to limit the present invention.
A kind of topological construction method of high density server is provided according to one embodiment of present invention.Wherein, described high density server consists of a plurality of child servers (as blade server), comprises a plurality of exchange chips in each child servers.Concise and to the point, this topological construction method comprises: create Kautz directed graph and it is divided, obtaining a plurality of isomorphism subgraphs; According to isomorphism subgraph, in each child servers, arrange exchange chip; And, connect a plurality of such child servers and form high density server, make the topological structure of this high density server consistent with created Kautz figure.Refer now to Fig. 1, in detail each step of this topological construction method:
The first step: create Kautz directed graph
As described above, because Kautz directed graph is applicable to build zmodem, efficient and extendible network, therefore, all exchange chips and the line between exchange chip in expectation high density server can form a Kautz directed graph (wherein, the exchange chip in high density server is corresponding one by one with the node in Kautz directed graph).Because exchange chip is positioned in the different child servers of high density server, therefore need to build topological structure and the connected mode between definite child servers (by describing in the step below) of each child servers, make in this high density server, all exchange chips in different child servers and line thereof can form a Kautz directed graph.
First, can be according to the demand to network size, design is applicable to the Kautz directed graph K (d, n) of the topological structure of high density server.Wherein, the out-degree of node and in-degree are that d, network diameter are that n, interstitial content are N=d
n-1+ d
n, this interstitial content is identical with the exchange chip number in high density server.For example, can be according to designing a Kautz directed graph to the demand of exchange chip sum or to the demand of the network diameter in high density server.
In a preferred embodiment, create the Kautz directed graph that network diameter n is 2, the reason of selection 2 is: network diameter is shorter, and network delay can be less.
Second step: divide isomorphism subgraph
In this step, can adopt and well known to a person skilled in the art that any dividing mode is divided into a plurality of identical isomorphism subgraphs by Kautz directed graph K (d, n), wherein the topological structure of each isomorphism subgraph is identical.For example, first node sum N is carried out to decile (for example k decile), then this Kautz directed graph is divided into k isomorphism subgraph.Result according to dividing, can obtain the number of nodes m in each isomorphism subgraph, wherein N=k*m.
The 3rd step: the topological structure that child servers is set
In this step, first m exchange chip (being the nodes in each isomorphism subgraph) is arranged in a child servers, this exchange chip is corresponding one by one with the node in isomorphism subgraph; Then,, according to the connection mode between the node in isomorphism subgraph, in child servers, connect corresponding exchange chip.Packet, the direction of the direction transfer of data of line can be directly transmitted in the interconnection indication of two exchange chips between these two exchange chips.For example, if in isomorphism subgraph, the line direction of two nodes is to point to Node B from node A, and the exchange chip of corresponding node A can directly send packet to the exchange chip of corresponding node B, otherwise not all right.
The 4th step: form high density server by child servers
The sum that forms the isomorphism subgraph that the sum of the child servers of high density server obtains with second step division equates, the identical and routing mechanism of network topology structure in these child servers also can be identical.In the process of producing, due to produced be the child servers of same size (identical topological structure and routing mode), therefore can batch process, thus saved production cost.
When building high density server, according to created Kautz directed graph and the isomorphism subgraph of dividing, child servers is coupled together.According to the line between the different isomorphism subgraphs of Kautz directed graph, connect the exchange chip in different child servers, make all exchange chips and line thereof in high density server consistent with created Kautz directed graph structure.
Below respectively with K (3,2) and K (8,2) for example, be illustrated in and divide after isomorphism subgraph, the topological structure in each child servers.
Fig. 2 a shows the schematic diagram of Kautz directed graph K (3,2), and Fig. 2 b-2d divides to it three isomorphism subgraphs that obtain.As shown in Fig. 2 b-2d, this K (3,2) is divided into 3 groups, every group of 4 nodes, and the node number of each group equates and topological structure is identical.In practice, can build child servers (3 child servers altogether by the topological structure shown in any one in Fig. 2 b-Fig. 2 d, and in each child servers, there are 4 exchange chips), and when child servers is added to high density server, according to the topological structure shown in Fig. 2 a, connect each child servers, making in high density server is the structure of K (3,2).
Fig. 3 a-3i shows respectively Kautz directed graph K (8,2) is carried out to the result that the division of isomorphism subgraph obtains, and K (8,2) is divided into 9 groups, every group of 8 nodes.As shown in Fig. 3 a-3i, the node number of each group is equal and topological structure is identical.In practice, can carry out production child servers (9 child servers altogether according to the topological structure shown in any one in Fig. 3 a-3i, in each child servers, there are 8 exchange chips), and when child servers is added to high density server, according to K (8,2) topological structure connects each child servers, and making in high density server is the structure of K (8,2).
A kind of topology constructing system of high density server is also provided according to one embodiment of present invention.
This system comprises for the Kautz directed graph for the topological structure of high density server according to the demand establishment to network size, and this Kautz directed graph is divided into the equipment of a plurality of isomorphism subgraphs; For arranging exchange chip according to isomorphism subgraph in child servers, make exchange chip in child servers and node in isomorphism the subgraph connected mode between corresponding and exchange chip and the consistent equipment of the connected mode between the corresponding node in isomorphism subgraph one by one; And for arrange a plurality of child servers in high density server, make exchange chip in the plurality of child servers and node in Kautz the directed graph connected mode between corresponding and exchange chip and the consistent equipment of the connected mode between the corresponding node in Kautz directed graph one by one.
Should be noted that and understand, in the situation that not departing from the desired the spirit and scope of the present invention of accompanying claim, can make various modifications and improvement to the present invention of foregoing detailed description.Therefore, the scope of claimed technical scheme is not subject to the restriction of given any specific exemplary teachings.
Claims (9)
1. a topological construction method for high density server, comprising:
Step 1) the Kautz directed graph, according to the demand establishment to network size for the topological structure of high density server, and this Kautz directed graph is divided into a plurality of isomorphism subgraphs;
Step 2), according to isomorphism subgraph, in child servers, arrange exchange chip, connected mode and the connected mode between the corresponding node in isomorphism subgraph between corresponding and exchange chip is consistent one by one to make exchange chip in child servers and node in isomorphism subgraph; And
Step 3), in high density server, arrange a plurality of child servers, connected mode and the connected mode between the corresponding node in described Kautz directed graph between corresponding and exchange chip is consistent one by one to make exchange chip in the plurality of child servers and node in described Kautz directed graph.
2. method according to claim 1, wherein, step 3) comprising:
According to the connected mode between the node in the isomorphism subgraph different, connect the exchange chip in corresponding different child servers.
3. method according to claim 1 and 2, wherein, the direction of the line direction transfer of data between exchange chip.
4. method according to claim 1 and 2, wherein, the network diameter of described Kautz directed graph is 2.
5. method according to claim 1 and 2, wherein, the out-degree that described Kautz directed graph is node and in-degree are 8 and the network diameter Kautz directed graph that is 2.
6. method according to claim 1 and 2, wherein, the out-degree that described Kautz directed graph is node and in-degree are 3 and the network diameter Kautz directed graph that is 2.
7. a topology constructing system for high density server, comprising:
For being used for the Kautz directed graph of the topological structure of high density server according to the demand establishment to network size, and this Kautz directed graph is divided into the equipment of a plurality of isomorphism subgraphs;
For arranging exchange chip according to isomorphism subgraph in child servers, make exchange chip in child servers and node in isomorphism the subgraph connected mode between corresponding and exchange chip and the consistent equipment of the connected mode between the corresponding node in isomorphism subgraph one by one; And
For arranging a plurality of child servers in high density server, make exchange chip in the plurality of child servers and node in described Kautz the directed graph connected mode between corresponding and exchange chip and the consistent equipment of the connected mode between the corresponding node in described Kautz directed graph one by one.
8. system according to claim 7, wherein, the direction of the line direction transfer of data between exchange chip.
9. according to the system described in claim 7 or 8, wherein, the network diameter of described Kautz directed graph is 2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410215126.0A CN104022928B (en) | 2014-05-21 | 2014-05-21 | The topological construction method and system of a kind of high density server |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410215126.0A CN104022928B (en) | 2014-05-21 | 2014-05-21 | The topological construction method and system of a kind of high density server |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104022928A true CN104022928A (en) | 2014-09-03 |
| CN104022928B CN104022928B (en) | 2018-01-09 |
Family
ID=51439508
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410215126.0A Active CN104022928B (en) | 2014-05-21 | 2014-05-21 | The topological construction method and system of a kind of high density server |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104022928B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105739929A (en) * | 2016-01-29 | 2016-07-06 | 哈尔滨工业大学深圳研究生院 | Data center selection method for big data to migrate to cloud |
| CN107181613A (en) * | 2017-05-10 | 2017-09-19 | 广东工业大学 | A kind of kautz tree topology control methods based on wireless sensor network |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1921437A (en) * | 2006-08-04 | 2007-02-28 | 上海红神信息技术有限公司 | Inside and outside connecting network topology framework and parallel computing system for self-consistent expanding the same |
| US20080107116A1 (en) * | 2006-11-08 | 2008-05-08 | Sicortex, Inc. | Large scale multi-processor system with a link-level interconnect providing in-order packet delivery |
| CN102510404A (en) * | 2011-11-21 | 2012-06-20 | 中国人民解放军国防科学技术大学 | Nondestructive continuous extensible interconnection structure for data center |
-
2014
- 2014-05-21 CN CN201410215126.0A patent/CN104022928B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1921437A (en) * | 2006-08-04 | 2007-02-28 | 上海红神信息技术有限公司 | Inside and outside connecting network topology framework and parallel computing system for self-consistent expanding the same |
| US20080107116A1 (en) * | 2006-11-08 | 2008-05-08 | Sicortex, Inc. | Large scale multi-processor system with a link-level interconnect providing in-order packet delivery |
| CN102510404A (en) * | 2011-11-21 | 2012-06-20 | 中国人民解放军国防科学技术大学 | Nondestructive continuous extensible interconnection structure for data center |
Non-Patent Citations (1)
| Title |
|---|
| WEN-TAO BAO等: "High-Performance and Cost-Efficient Interconnection Network for High-Density Servers", 《JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105739929A (en) * | 2016-01-29 | 2016-07-06 | 哈尔滨工业大学深圳研究生院 | Data center selection method for big data to migrate to cloud |
| CN105739929B (en) * | 2016-01-29 | 2019-01-11 | 哈尔滨工业大学深圳研究生院 | The selection method of data center when big data is migrated to cloud |
| CN107181613A (en) * | 2017-05-10 | 2017-09-19 | 广东工业大学 | A kind of kautz tree topology control methods based on wireless sensor network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104022928B (en) | 2018-01-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Yuan et al. | Balance-based SDN controller placement and assignment with minimum weight matching | |
| CN108259195B (en) | Method and system for determining influence range of abnormal event | |
| CN109948938A (en) | The bill of materials configuration method and device and equipment of a kind of enterprise resource planning | |
| CN102724064A (en) | Method for building network application simulation system | |
| CN104022928A (en) | Topology construction method of high-density server and system thereof | |
| JP5824016B2 (en) | Extended Ethernet ring network and communication method thereof | |
| CN114884908A (en) | Data synchronization method, device, equipment and storage medium | |
| CN112532408A (en) | Method, device and storage medium for extracting fault propagation conditions | |
| CN108718287B (en) | Data exchange system, establishment method and device thereof and communication system | |
| Lakhotia et al. | PolarStar: Expanding the scalability horizon of diameter-3 networks | |
| Carrascal et al. | A Comprehensive Survey of In-Band Control in SDN: Challenges and Opportunities | |
| CN112217652B (en) | Network topology device and method based on central communication mode | |
| Galkin | Interaction model design of ZigBee-gateway between wireless sensor network and industrial network | |
| Sklyarov | Synthesis of circuits and systems from hierarchical and parallel specifications | |
| CN114579311B (en) | Method, device, equipment and storage medium for executing distributed computing task | |
| Xiao et al. | A class of data-center network models offering symmetry, scalability, and reliability | |
| CN107710701A (en) | Constraint separation path computing | |
| CN115242839A (en) | Internet of things cascading data transmission method and device, electronic equipment and storage medium | |
| Moraveji et al. | Multispanning tree zone-ordered label-based routing algorithms for irregular networks | |
| CN105468104A (en) | Converged server and backboard | |
| Yu et al. | Optical circuit switching enabled reconfigurable HPC network for traffic pattern | |
| CN107623586B (en) | Network link prediction method and device | |
| CN104410537A (en) | Generation system of tree type network topological graph and generation method of tree type network topological graph | |
| CN105490859A (en) | Node positioning method of high-end fault tolerance server | |
| CN106332287B (en) | Data transmission method and communication node |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |