Innovative Routing Solutions: Centralized Hypercube Routing Among Multiple Clusters in 5G Networks

AA Abushgra, HA Kholidy… - 2023 20th ACS/IEEE …, 2023 - ieeexplore.ieee.org
In the ever-evolving landscape of real-time usage, there is a constant pursuit of
advancements in infrastructures and technologies to meet the growing demand for network …

Hierarchical interconnection networks with folded hypercubes as basic clusters

Y Shi, Z Hou, J Song - … on High Performance Computing in the …, 2000 - ieeexplore.ieee.org
The paper introduces a class of hierarchical interconnection networks, which is suitable for
multicomputer systems. These networks, to which we give the name HFCube, employ the …

An efficient disjoint shortest paths routing algorithm for the hypercube

K Qiu - 2008 14th IEEE International Conference on Parallel …, 2008 - ieeexplore.ieee.org
We present a routing algorithm that finds n disjoint shortest paths from the source node to n
target nodes in the n-dimensional hypercube in O (n 3 log n)= O (log 3 NloglogN) time …

A preliminary investigation into parallel routing on a hypercube computer

OA Olukotun, TN Mudge - Proceedings of the 24th ACM/IEEE Design …, 1987 - dl.acm.org
This paper describes an experiment in which parallel routing is performed on a medium
grained hypercube parallel processor having 64 processing elements. Each node is a …

The structural features of enhanced hypercube networks

H Liu - 2009 Fifth International Conference on Natural …, 2009 - ieeexplore.ieee.org
Duo to its topological advantages, the enhanced hypercube network is a very important kind
of networks which has huge potential to be widely used in computer networks to improve the …

An efficient construction of one-to-many node-disjoint paths in folded hypercubes

CN Lai - Journal of Parallel and Distributed Computing, 2014 - Elsevier
A folded hypercube is basically a hypercube with additional links augmented, where the
additional links connect all pairs of nodes with longest distance in the hypercube. In an n …

Adaptive packet routing in a hypercube

CK Kim, DA Reed - Proceedings of the third conference on Hypercube …, 1988 - dl.acm.org
All commercial hypercubes use fixed-path routing for packet switching. However, it has long
been known that adaptive routing reduces packet delay by sending packets via less …

[PDF][PDF] Time Optimal Node-to-Set Disjoint Paths Routing in Hypercubes.

A Bossard, K Kaneko - J. Inf. Sci. Eng., 2014 - researchgate.net
Due to their simplicity, hypercubes are a popular topology for the interconnection network of
massively parallel systems. One critical issue when dealing with such parallel systems is …

Optimal construction of all shortest node-disjoint paths in hypercubes with applications

CN Lai - IEEE Transactions on parallel and Distributed …, 2011 - ieeexplore.ieee.org
Routing functions had been shown effective in constructing node-disjoint paths in hypercube-
like networks. In this paper, by the aid of routing functions, m node-disjoint shortest paths …

A parallel simulated annealing algorithm for channel routing on a hypercube multiprocessor

RJ Brouwer, P Banerjee - Proceedings 1988 IEEE International …, 1988 - computer.org
The demand for energy from fossil fuel continues to increase, especially in countries such as
China and some developing countries. However, known reserves of fossil fuel continue to …