✦ LIBER ✦

Routings for involutions of a hypercube

✍ Scribed by Alan P. Sprague; Hisao Tamaki

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 843 KB
Volume: 48
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)00126-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Symmetric routings of the hypercube

✍ Jean-Claude König; Dominique Sotteau 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 774 KB

In this paper we prove that, for any n and k such that (k-l)C: is even, there exists a set of shortest paths between all the pairs of vertices at distance k of an n-cube such that each vertex is on the same number of paths. We conjecture that there also exists such a set of paths where each edge is

Highly Fault-Tolerant Routings and Fault

Highly Fault-Tolerant Routings and Fault-Induced Diameter for Generalized Hypercube Graphs

✍ Koichi Wada; Takaharu Ikeo; Kimio Kawaguchi; Wei Chen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 130 KB

Consider a communication network G in which a limited number of link and/or node faults F might occur. A routing ρ for the network (a fixed path between each pair of nodes) must be chosen without knowing which components might become faulty. The diameter of the surviving route graph R(G, ρ)/F, where

Optimal permutation routing for low-dime

Optimal permutation routing for low-dimensional hypercubes

✍ Ambrose K. Laing; David W. Krumme 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 244 KB

Fault-tolerant wormhole routing for hype

Fault-tolerant wormhole routing for hypercube networks

✍ Jau-Der Shih 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 145 KB

We present an adaptive fault-tolerant wormhole routing algorithm for hypercubes by using 3 virtual networks. The routing algorithm can tolerate at least n -1 faulty nodes and can route a message via a path of length no more than the shortest path plus four. Previous algorithms which achieve the same

Oblivious routing for LC permutations on

Oblivious routing for LC permutations on hypercubes

✍ Zhiyong Liu; David W. Cheung 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 197 KB

Rearrangeable Circuit-Switched Hypercube

Rearrangeable Circuit-Switched Hypercube Architectures for Routing Permutations

✍ S.B. Choi; A.K. Somani 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 496 KB

Rearrangeable hypercube architectures and routing algorithms are developed to realize arbitrary permutations in circuit switching. We prove that if each connection between two neighboring nodes consists of two pairs of links (two full-duplex communication lines), the hypercube can handle two arbitra