Hypercube internetwork topology

In computer networking, hypercube networks are a type of network topology used to connect and route data between multiple processing units or computers.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 2 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In computer networking, hypercube networks are a type of network topology used to connect and route data between multiple processing units or computers. Hypercube networks consist of nodes, which form the vertices of squares to create an internetwork connection. A hypercube is basically a multidimensional mesh network with two nodes in each dimension.

Due to similarity, such topologies are usually grouped into a -ary -dimensional mesh topology family, where represents the number of dimensions and represents the number of nodes in each dimension. N=2^m where m is the number of bits that are required to label the nodes in the network. So, if there are 4 nodes in the network, 2 bits are needed to represent all the nodes in the network.

The network is constructed by connecting the nodes that just differ by one bit in their binary representation. This is commonly referred to as Binary labelling. A 3D hypercube internetwork would be a cube with 8 nodes and 12 edges.

A 4D hypercube network can be created by duplicating two 3D networks, and adding a most significant bit. The new added bit should be ‘0’ for one 3D hypercube and ‘1’ for the other 3D hypercube. The corners of the respective one-bit changed MSBs are connected to create the higher hypercube network.

This method can be used to construct any m-bit represented hypercube with (m-1)-bit represented hypercube. \mathsf{Hamming\_weight}(01\oplus10)=\mathsf{Hamming\_weight}(11) = 2 E-Cube routing is a static routing method that employs XY-routing algorithm. This is commonly referred to as deterministic, dimension-ordered routing model.

E-Cube routing works by traversing the network in the k th dimension, where k is the least significant non-zero bit in the result of calculating distance. For example, let the sender's label be 00 and the receiver's label be 11. So, the distance between them is 11 and the least significant non-zero bit is the LSB bit.

Figuring out which way to go for a 0 or 1 is determined by XY routing algorithm. d_a= \sum_{d=1}^r{(d.N_d)\over N-1} In case of hypercubes the average distance is given as m/2.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1353493558 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001353493558 · captured 1778422770.0 · version history

Cite this page as: encyclopegia.org, “Hypercube internetwork topology”, snapshot enwiki-001353493558. https://encyclopegia.org/a/hypercube-internetwork-topology

Sources cited in this revision

3 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.