CN102130810A - Method for realizing interconnection structure in same layer domain of tree topology - Google Patents
Method for realizing interconnection structure in same layer domain of tree topology Download PDFInfo
- Publication number
- CN102130810A CN102130810A CN2011100295042A CN201110029504A CN102130810A CN 102130810 A CN102130810 A CN 102130810A CN 2011100295042 A CN2011100295042 A CN 2011100295042A CN 201110029504 A CN201110029504 A CN 201110029504A CN 102130810 A CN102130810 A CN 102130810A
- Authority
- CN
- China
- Prior art keywords
- layer
- node
- territory
- tree
- individual
- 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.)
- Pending
Links
Images
Abstract
The invention discloses a method for realizing an interconnection structure in the same layer domain of a tree topology. The interconnection structure obtained by using the method is used for solving the defects of a tree structure, the average hop of the interconnection structure is smaller than that of the tree structure, the fault-tolerant capacity is stronger than that of the tree structure, and less extra switching nodes and links are utilized. Meanwhile, a fat tree structure can be regarded as the overlap of plurality of single tree structures. The method can also be applied to the fat tree structure, thus reducing the average hop of the fat tree structure and strengthening the fault-tolerant capacity of the fat tree structure.
Description
Technical field
The present invention relates to communication and field of computer technology, be specifically related to the implementation method of interconnect architecture in a kind of same layer territory of tree topology.
Background technology
In fields such as parallel internet, multicomputer system, network-on-chips, advantages such as characteristic that converge that tree-like switching fabric is little with its average number of hops, the pathfinding mode is easy and natural and being widely used.Yet well-known is that tree structure exists some defectives that are difficult to overcome.The characteristic that converges owing to the tree structure height makes that in the place near tree root link often needs very large capacity could satisfy the proper communication of whole network.In case and certain bar link or certain node lost efficacy in the tree structure, then the following institute in fault point has a capital to lose efficacy thereupon, when this situation occur near the tree root node local time, problem is particularly serious.In order to solve these deficiencies of tree structure, common way is to adopt fat tree structure at present.Yet fat tree often needs to introduce a large amount of extra switching node and links in order to reach designing requirement.
Summary of the invention
Problem to be solved by this invention is: the implementation method that interconnect architecture in a kind of same layer territory of tree topology is provided, this interconnection structure has reduced the average number of hops of tree structure, the balanced to a certain extent flow of tree structure has increased the fault-tolerant path of tree structure and then has improved the fault freedom of network.
Technical problem proposed by the invention is to solve like this: the implementation method of interconnect architecture in a kind of same layer territory of tree topology is provided, it is characterized in that:
1. set existing tree topology of existence, this structure begins from top to bottom to have altogether the m layer from root node R, and m is total to c node greater than 2, and wherein root node R is positioned at the 1st layer;
2. define any two node N for the n layer
iAnd N
j, n is greater than 2, if the father node P of their each leisure (n-1) layers
iAnd P
j(P
iAnd P
jMay be overlapping), have the father node R of same n-2 layer
i, then claim these nodes N
i, N
j, P
i, P
jAnd R
iBelong to same territory D
i, note is made N
i, N
j, P
i, P
j, R
iBelong to D
i, wherein unique n-2 node layer R
iThe root that is called this territory, obviously, for all c of any n layer (n is greater than 2)
nIf individual node is the always total c of n-2 layer
N-2Individual node, then the multipotency of n layer is to be divided into c
N-2Individual territory, and any one node N of n layer
iBelong to and only belong to some territory D wherein
i, i=1,2 ..., c
N-2
3. successively down whole tree is carried out the division in territory since the 3rd layer node, finally can obtain c
1+ c
2+ ... + c
N-2Individual different territory, note d
Max=c
1+ c
2+ ... + c
N-2, to any one territory D
i, suppose its root R
iAt the n layer of full tree, then need the n+1 layer increase some with layer territory in interlink node, make territory D
iAll interior n+2 node layers can carry out interconnected with interlink node in the layer territory by these;
4. establish territory D
iIn be positioned at the R of full tree n layer
iTotal p child node, the p of a n+1 layer child node has q again respectively
1, q
2..., q
pIndividual child node, the i.e. always total q of n+2 layer
1+ q
2+ ... + q
pIndividual node is got wherein maximum q
iNote is made q
Max, i=1,2 ..., p then needs to increase q
MaxIndividual with interlink node S in the layer territory.Individual to j with interlink node S in the layer territory
j, j=1,2 ..., q
MaxIf, q
i＜=j, then explanation is positioned at full tree n+1 layer and belongs to territory D
iIn i node do not carry out as yet in addition with interconnected child node in the layer territory, optional one is not also carried out with node interconnected in the layer territory and j interlink node S in layer territory together from the child node of this node
jLink to each other; So circulation is up to all territory D
iIn the n+2 node layer all just with one with till interlink node links to each other in the layer territory, at last with q
MaxIndividual with interlink node S in the layer territory
1, S
2..., Sq
MaxJoin end to end one by one, form a ring, just obtained interconnect architecture in the same layer territory in this territory, make in this territory between all nodes and can also realize directly carrying out alternately by interlink node in the same layer territory except there being the interchange channel on the elite tree;
5. 3. step is divided each the territory D that obtains
i4. increase with interconnect architecture in the layer territory according to step, i=1,2 ..., d
Max, just can access interconnect architecture in the same layer territory of full tree.
Can reduce in the tree average number of hops between any two bottom layer node effectively and increase fault-tolerant path significantly by this extended mode.Certainly adopting thisly can increase certain connection and exchange expense with interconnect architecture in the layer territory, so can carry out interconnectedly selectively in the territory of part high density, high capacity, then remains unchanged for other parts of tree-like exchange topological structure.
The fat tree structure that obtains for the tree structure variation, can utilize in this territory interconnected and then improve the characteristic of switching performance and fault freedom equally, promptly go for fat tree structure equally, be used for further improving the overall performance of fat tree structure with interconnect architecture in the layer territory.
This having increased with interconnected tree structure in the layer territory can be applied in parallel network and parallel processor system, problems such as the average number of hops of former tree-like structure and traffic aggregation have been improved to a certain extent, network to fault-tolerant demand condition with higher under, can effectively increase the fault-tolerance of whole tree structure.
Description of drawings
Fig. 1 is that any tree structure increases with the schematic diagram behind the interconnect architecture in the layer territory;
Fig. 2 is complete 4 yuan of tree CT (4,4), and wherein dash area is a subtree that satisfies condition of choosing;
Fig. 3 is the schematic diagram of interconnect architecture in the same layer of the subtree increase territory that satisfies condition among complete 4 yuan of tree CT (4,4);
Fig. 4 is that complete 4 yuan of tree CT (4,4) increase with the schematic diagram behind the interconnect architecture in the layer territory.
Embodiment
Below in conjunction with accompanying drawing the present invention is further described:
Tree topology has a common feature, exactly any one node in the tree is looked down as root, can obtain stalk tree.For the root of any stalk tree in the tree, its child node all directly links to each other by itself, its grandson's node (being the child node of child node) then might not link to each other with same child node, promptly look down from root node, two secondary child nodes might not belong to same one-level child node.To communicate by letter between two nodes like this, just must just can carry out by the root node of this stalk tree.This specific character of tree structure makes flow constantly converge toward the root node place of each subtree, and this communication that must be by root node is also can be than those need not just the communication between the brother of node that can realize be more by root node on the jumping figure, and when breaking down near the root node, all will being had a strong impact on of whole tree topology.
Meeting or exceeding in one tree on three layers the 3rd layer of all subtrees increases by one with interconnect architecture in the layer territory, thereby comes significantly improving on the performance for whole tree belt.After interconnected, for the root node of any stalk tree, its all grandson's nodes have all increased by interlink node in the same layer territory and have carried out interconnected passage, thereby have increased fault-tolerant path in large quantities, and can reduce to some extent on average number of hops.For these nodes below grandson's node, obviously they always are grandson's nodes of other certain node, so interconnect architecture is able to launch at the whole network in this layer together territory, and makes that whole tree topology is especially significantly improved above the fault-tolerance in performance.
Consider that mostly the tree structure in the actual use is symmetrical structure, should be with layer interconnect architecture with complete 4 yuan of tree CT (4,4) for the example explanation.(h is such one tree m) to complete m-ary tree CT, and all non-leaf nodes all have and only have m child node in the tree, the complete m-ary tree of its total h layer.Can obtain, (h m) has the individual leaf node of m^ (h-1) to CT, and (m^0+m^1+ is arranged ... + m^ (h-3)) the individual subtree that satisfies condition.
For as shown in Figure 2 be one complete 4 yuan the tree CT (4,4), select one the three straton tree that satisfies condition shown in dash area among Fig. 2, for the node of the second layer among the figure, they all just in time have 4 child nodes, realize the 3rd layer interconnected so need to increase by 4 switching nodes.For the 1st newly-increased switching node, as shown in Figure 31 ', a node of selecting from the child node of each node of the second layer is coupled respectively, all labels are 1 the 3rd node layer as shown in Figure 3; Select in the same way the 3rd straton node that links to each other with the 2nd, 3,4 newly-increased exchange (interconnected) node as shown in Figure 3 label be respectively 2,3,4 node.The the 1st, 2,3,4 node that will increase newly at last joins end to end in twos, obtains a ring.Obtain in the same layer territory of this subtree interconnect architecture so as shown in Figure 3.
Continue to choose in the elite tree remaining according to as above method and satisfy the subtree that equals or exceeds three layers and carry out interconnected transformation, just obtained with interconnect architecture in the layer territory, as shown in Figure 4.
The fat tree structures that use in a large number in the reality can be regarded a plurality of single trees equally as and carry out interconnected.(h, m w) are a fat tree to GFT, and it has w^h root node, and each root node down all is that (h m), has and only have m child node for each non-leaf node in the tree to a CT, and each non-root node has and only have w father node in the tree.
Claims (1)
1. the implementation method of interconnect architecture in the same layer territory of a tree topology is characterized in that:
1. set existing tree topology of existence, this structure begins from top to bottom to have altogether the m layer from root node R, and m is total to c node greater than 2, and wherein root node R is positioned at the 1st layer;
2. define any two node N for the n layer
iAnd N
j, n is greater than 2, if the father node P of their each leisure (n-1) layers
iAnd P
j(P
iAnd P
jMay be overlapping), have the father node R of same n-2 layer
i, then claim these nodes N
i, N
j, P
i, P
jAnd R
iBelong to same territory D
i, note is made N
i, N
j, P
i, P
j, R
iBelong to D
i, wherein unique n-2 node layer R
iThe root that is called this territory, obviously, for all c of any n layer (n is greater than 2)
nIf individual node is the always total c of n-2 layer
N-2Individual node, then the multipotency of n layer is to be divided into c
N-2Individual territory, and any one node N of n layer
iBelong to and only belong to some territory D wherein
i, i=1,2 ..., c
N-2
3. successively down whole tree is carried out the division in territory since the 3rd layer node, finally can obtain c
1+ c
2+ ... + c
N-2Individual different territory, note d
Max=c
1+ c
2+ ... + c
N-2, to any one territory D
i, suppose its root R
iAt the n layer of full tree, then need the n+1 layer increase some with layer territory in interlink node, make territory D
iAll interior n+2 node layers can carry out interconnected with interlink node in the layer territory by these;
4. establish territory D
iIn be positioned at the R of full tree n layer
iTotal p child node, the p of a n+1 layer child node has q again respectively
1, q
2..., q
pIndividual child node, the i.e. always total q of n+2 layer
1+ q
2+ ... + q
pIndividual node is got wherein maximum q
iNote is made q
Max, i=1,2 ..., p then needs to increase q
MaxIndividual with interlink node S in the layer territory.Individual to j with interlink node S in the layer territory
j, j=1,2 ..., q
MaxIf, q
i＜=j, then explanation is positioned at full tree n+1 layer and belongs to territory D
iIn i node do not carry out as yet in addition with interconnected child node in the layer territory, optional one is not also carried out with node interconnected in the layer territory and j interlink node S in layer territory together from the child node of this node
jLink to each other; So circulation is up to all territory D
iIn the n+2 node layer all just with one with till interlink node links to each other in the layer territory, at last with q
MaxIndividual with interlink node S in the layer territory
1, S
2..., Sq
MaxJoin end to end one by one, form a ring, just obtained interconnect architecture in the same layer territory in this territory, make in this territory between all nodes and can also realize directly carrying out alternately by interlink node in the same layer territory except there being the interchange channel on the elite tree;
5. 3. step is divided each the territory D that obtains
i4. increase with interconnect architecture in the layer territory according to step, i=1,2 ..., d
Max, just can access interconnect architecture in the same layer territory of full tree.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011100295042A CN102130810A (en) | 2011-01-27 | 2011-01-27 | Method for realizing interconnection structure in same layer domain of tree topology |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011100295042A CN102130810A (en) | 2011-01-27 | 2011-01-27 | Method for realizing interconnection structure in same layer domain of tree topology |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102130810A true CN102130810A (en) | 2011-07-20 |
Family
ID=44268706
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011100295042A Pending CN102130810A (en) | 2011-01-27 | 2011-01-27 | Method for realizing interconnection structure in same layer domain of tree topology |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102130810A (en) |
Cited By (5)
| 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 |
| CN104717111A (en) * | 2015-03-17 | 2015-06-17 | 中国科学技术大学苏州研究院 | Internet structure of extensible exchange cube |
| CN110719193A (en) * | 2019-09-12 | 2020-01-21 | 无锡江南计算技术研究所 | High-performance computing-oriented high-reliability universal tree network topology method and structure |
| CN110784782A (en) * | 2019-10-31 | 2020-02-11 | 烽火通信科技股份有限公司 | MSP protection configuration inter-block time sequence suppression method and system |
| CN113381940A (en) * | 2021-04-25 | 2021-09-10 | 中国空气动力研究与发展中心计算空气动力研究所 | Design method and device of two-dimensional fat tree network topology |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4809362A (en) * | 1987-03-13 | 1989-02-28 | Center For Innovative Technology | Fiber-optic star tree network |
| CN1514591A (en) * | 2002-12-31 | 2004-07-21 | 浪潮电子信息产业股份有限公司 | High speed, high character price ratio multi branch fat tree network topological structure |
| CN101083624A (en) * | 2007-07-10 | 2007-12-05 | 北京航空航天大学 | Tree structure based routing method |
| WO2008064518A1 (en) * | 2006-11-28 | 2008-06-05 | Zte Corporation | A united route query method in the automatic switched optical network |
-
2011
- 2011-01-27 CN CN2011100295042A patent/CN102130810A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4809362A (en) * | 1987-03-13 | 1989-02-28 | Center For Innovative Technology | Fiber-optic star tree network |
| CN1514591A (en) * | 2002-12-31 | 2004-07-21 | 浪潮电子信息产业股份有限公司 | High speed, high character price ratio multi branch fat tree network topological structure |
| WO2008064518A1 (en) * | 2006-11-28 | 2008-06-05 | Zte Corporation | A united route query method in the automatic switched optical network |
| CN101083624A (en) * | 2007-07-10 | 2007-12-05 | 北京航空航天大学 | Tree structure based routing method |
Non-Patent Citations (1)
| Title |
|---|
| 张攀翔等: "组播树维护策略的研究和实现", 《计算机工程与应用》 * |
Cited By (9)
| 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 |
| CN104717111A (en) * | 2015-03-17 | 2015-06-17 | 中国科学技术大学苏州研究院 | Internet structure of extensible exchange cube |
| CN104717111B (en) * | 2015-03-17 | 2018-07-06 | 中国科学技术大学苏州研究院 | A kind of extension exchanges cubical internet system |
| CN110719193A (en) * | 2019-09-12 | 2020-01-21 | 无锡江南计算技术研究所 | High-performance computing-oriented high-reliability universal tree network topology method and structure |
| CN110719193B (en) * | 2019-09-12 | 2021-02-02 | 无锡江南计算技术研究所 | High-performance computing-oriented high-reliability universal tree network topology method and structure |
| CN110784782A (en) * | 2019-10-31 | 2020-02-11 | 烽火通信科技股份有限公司 | MSP protection configuration inter-block time sequence suppression method and system |
| CN110784782B (en) * | 2019-10-31 | 2021-11-16 | 烽火通信科技股份有限公司 | MSP protection configuration inter-block time sequence suppression method and system |
| CN113381940A (en) * | 2021-04-25 | 2021-09-10 | 中国空气动力研究与发展中心计算空气动力研究所 | Design method and device of two-dimensional fat tree network topology |
| CN113381940B (en) * | 2021-04-25 | 2022-12-27 | 中国空气动力研究与发展中心计算空气动力研究所 | Design method and device of two-dimensional fat tree network topology |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102130810A (en) | Method for realizing interconnection structure in same layer domain of tree topology | |
| CN103763205B (en) | The global network on three-dimensional chip Delay Bound optimization method in a balanced way of silicon hole load | |
| CN101335704B (en) | Adaptive routing method without dead lock in three-dimensional torus network | |
| US10735305B2 (en) | Communication locality oriented high-radix interconnection network and adaptive routing algorithm design | |
| CN102780628B (en) | On-chip interconnection network routing method oriented to multi-core microprocessor | |
| CN104396198A (en) | Tie-breaking in shortest path determination | |
| CN102201993B (en) | Computing method for cross-domain working path and protection path thereof | |
| US20060268691A1 (en) | Divide and conquer route generation technique for distributed selection of routes within a multi-path network | |
| CN108449269A (en) | Data center network load-balancing method based on SDN | |
| CN103973564A (en) | Interconnection network system and self-adaptation routing method | |
| CN110460546B (en) | Data acquisition method based on network on chip | |
| CN101267398B (en) | Non deal lock self-adapted routing method in 2-D torus network | |
| CN102333116B (en) | P2P (peer-to-peer) network building method and data positioning method | |
| CN107135160B (en) | Spanning tree fault-tolerant method based on network failure node | |
| CN108768864B (en) | Data center network topology system easy to expand and high in fault tolerance | |
| CN104396163A (en) | Method and apparatus for providing non-overlapping ring-mesh network topology | |
| CN107592218A (en) | A kind of data center network structure of high fault tolerance and strong autgmentability | |
| CN105453489B (en) | A kind of modified ring topologies and its application method | |
| CN113127404B (en) | Method and device for reconstructing network topology structure of CPU interconnection system | |
| CN114244708B (en) | Communication optimization method on fat tree network structure | |
| Chen et al. | Measure of layer centrality in multilayer network | |
| CN107707471A (en) | The energy-saving scheme of minimum conversion link number based on extensive SDN | |
| CN107453997A (en) | A kind of optimization method for routing based on double costs | |
| Xinming et al. | Fault-tolerant routing in a prdt (2, 1)-based noc | |
| Wang et al. | Link fault tolerant routing algorithms in mirrored k-ary n-tree interconnection networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20110720 |