Font Size: a A A

The Wide Diameter Of Some Interconnection Networks

Posted on:2017-11-25Degree:MasterType:Thesis
Country:ChinaCandidate:C ZhuFull Text:PDF
GTID:2310330485479280Subject:Operational Research and Cybernetics
Abstract/Summary:PDF Full Text Request
The wide diameter is an important parameter in the network,and it can effectively mea-sure the performance of the network.The wide diameter has been paid a lot of attention since it first proposed.In the design of communication network,parallel and distributed computing systems,fault tolerance and transmission delay are two important aspects to be considered.Fault tolerance maps the connectivity of graph,and transmission delay maps the diameter of graph,when these two parameters are considered separately,it's hard to get a unified result,but we both need these two aspects of the performance.The wide diameter is the unified consideration of the two aspects of the performance.As long as the control of the network's wide diameter,we can control the fault tolerance and transmission delay of the network at the same time.The Large network can be in-terconnected by small networks.In this paper,we mainly study the wide diameter of several interconnection networks.By using the properties of the Rabin number and the method of constructing internally disjoint paths,we have got their upper bounds of the wide diameter,as discussed below:Chapter one and chapter two,we introduce the background,significance,current situation of the research and preliminary knowledge of this paper.Chapter three,We give the method to connect the two graphs by the matching edges,and proof the upper bound of the wide diameter of combined connection network G?G0,G1,M?.Chapter four,we extend the conclusion of chapter three,connect multiple graphs into a ring with matching edges,and get the upper bound of the wide diameter of combined connection network G(G0,G1,...,Gr-1,L).Chapter five,we propose another connection method which every vertex in one graph is connected by two vertices in the other graph for graph G0 and G1.It turns out a combined connection network G?G0,G1,F?,and also we proof it has the upper bound.Chapter six is the summary of the paper,we put all the main conclusions here and point out the remaining problems of the paper.
Keywords/Search Tags:wide diameter, combined connection network, connectivity, internally disjoint paths
PDF Full Text Request
Related items