๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Properties of a class of trivalent network graphs and optimal routing

โœ Scribed by Pradip K. Srimani; Bhabani P. Sinha; Bhargab B. Bhattacharya; Suranjan Ghosh


Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
561 KB
Volume
22
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Routing Properties of a Recursive Interc
โœ Rocky K.C. Chang; Hong Y. Wang ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 178 KB

In this paper, we consider a highly recursive interconnection network known as the fully connected cubic network (FCCN). By exploiting its recursive properties, we thoroughly analyze the performance of a simple routing algorithm for the FCCN. We show that at least 800 of the routes obtained from thi

Optimal Routing Algorithms for a Class o
โœ N.S. Woo; B. Naylor ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 538 KB

The cylindrical banyan network is a variation of the classical banyan network in two ways: (1) each node is a processor with a switch, and (2) every pair of nodes at the two ends is merged. We present a routing algorithm for the cylindrical banyan network, and show it is optimal in terms of the path

Routing in a Class of Cayley Graphs of S
โœ Fen Lin Wu; S. Lakshmivarahan; S.K. Dhall ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 374 KB

Recently, Draper initiated the study of interconnection networks based on Cayley graphs of semidirect products of two cyclic groups called supertoroids. Interest in this class of graphs stems from their relatively smaller diameter compared to toroids of the same size. The Borel graphs introduced by