Node-disjoint paths in hierarchical hypercube networks

Wu, Ruei-Yu; Chen, Gen-Huey; Kuo, Yu‐Liang; Chang, Gerard J.

doi:10.1016/j.ins.2007.02.035

Cited by 54 publications

(25 citation statements)

References 23 publications

(34 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Parallel algorithms for solving algebraic and graph problems are based on a path architecture [1,20]. The path embedding problem has attracted intensive studies in various networks in the literature [11][12][13][14]18,[23][24][25][27][28][29][30][31].…”

Section: Introductionmentioning

confidence: 99%

Two node-disjoint paths in balanced hypercubes

Cheng

Hao

Feng

2014

Applied Mathematics and Computation

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 99%

Two node-disjoint paths in balanced hypercubes

Cheng

Hao

Feng

2014

Applied Mathematics and Computation

View full text Add to dashboard Cite

“…viii) Figs. (12)(13)(14)(15)(16)(17)(18)(19)(20)(21) have assured that as number of processors per cluster, number of tunable VCSELs, number of detectors, number of waveguides, number of demultiplexers, and number of clusters increase this result in increasing in network cost in the case of both optical crossbar connected cluster and optical hypercube connected cluster networks. We have indicated that optical crossbar connected cluster network is higher network cost than optical hypercube connected cluster network.…”

Section: Simulation Results and Discussionmentioning

confidence: 99%

“…AVERAGE MESSAGE DISTANCE The average message distance in the network is defined as the average number of the links that a message should travel between any nodes. Let N i is the number of nodes at distance i, then the average distance l is defined as [12]: [11,12]:…”

Section: 2 Optical Hypercube Connected Clustermentioning

confidence: 99%

Very Large Scale Optical Interconnect Systems For Different Types of Optical Interconnection Networks

Rashed¹

2012

IJCNIS

View full text Add to dashboard Cite

Abstract-The need for scalable systems in market demands in terms of lower computing costs and protection of customer investment in computing: scaling up the system to quickly meet business growth is obviously a better way of protecting investment: hardware, software, and human resources. A scalable system should be incrementally expanded, delivering linear incremental performance with a near linear cost increase, and with minimal system redesign (size scalability), additionally, it should be able to use successive, faster processors with minimal additional costs and redesign (generation scalability). On the architecture side, the key design element is the interconnection network. The interconnection network must be able to increase in size using few building blocks and with minimum redesign, deliver a bandwidth that grows linearly with the increase in system size, maintain a low or (constant) latency, incur linear cost increase, and readily support the use of new faster processors. The major problem is the ever-increasing speed of the processors themselves and the growing performance gap between processor technology and interconnect technology. Increased central processing unit (CPU) speeds and effectiveness of memory latency-tolerating techniques.

show abstract

“…Finding node disjoint paths or parallel paths in interconnection networks is one of the fundamental issues in design and implementation of parallel and distributed computing systems [4,16]. Parallel paths are useful in speeding up the transfer of large amounts of data between nodes and in providing alternative routes in cases of node or link failures [6].…”

Section: Introductionmentioning

confidence: 99%

“…From Menger's Theorem [15], there exist at least k parallel paths between any two distinct nodes in a network of connectivity k. In a general network, it is non-trivial to identify the parallel paths guaranteed by a given level of connectivity. For levels of connectivity greater than two, the identification of parallel paths is generally done using maximum flow algorithms which take O(N 3 ) time, where N is the size of the network [16]. However, for the interconnection networks with special structures such as Hypercube networks, OTIS networks, and so on, flow techniques taking O(N 3 ) time may be far from efficient.…”

Section: Introductionmentioning

confidence: 99%

An Efficient Construction of Node Disjoint Paths in OTIS Networks

Chen

Xiao

Parhami

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint paths in any OTIS network with a connected basis network is presented, which is independent of any construction of node disjoint paths in its basis network. This general construction is effective and efficient, which can obtain desirable node disjoint paths of length at most D+4 in O(Δ 2 +Δf(N 1/2 )) time if the basis network of size n has a shortest routing algorithm of time complexity O(f(n)), where D, Δ and N are, respectively, the diameter, the degree and the size of the OTIS network. Further, for OTIS networks with maximally fault tolerant basis networks, we give an improved version of a conventional construction of node disjoint paths by incorporating the above general construction. Finally, we show the effectiveness and efficiency of these constructions applied to OTIS-Hypercubes.

show abstract

Node-disjoint paths in hierarchical hypercube networks

Cited by 54 publications

References 23 publications

Two node-disjoint paths in balanced hypercubes

Two node-disjoint paths in balanced hypercubes

Very Large Scale Optical Interconnect Systems For Different Types of Optical Interconnection Networks

An Efficient Construction of Node Disjoint Paths in OTIS Networks

Contact Info

Product

Resources

About