𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Shortest routing in trivalent Cayley graph network

✍ Scribed by Premkumar Vadapalli; Pradip K. Srimani

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
458 KB
Volume
57
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Shortest-Path Routing in Arbitrary Netwo
Shortest-Path Routing in Arbitrary Networks
✍ Friedhelm Meyer auf der Heide; Berthold VΓΆcking πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 197 KB

We introduce an on-line protocol which routes any set of N packets along shortest paths with congestion C and dilation D through an arbitrary network in Ε½ . O C q D q log N steps, with high probability. This time bound is optimal up to the additive log N, and it has previously only been reached for

Optimal routing in shortest-path data ne
Optimal routing in shortest-path data networks
✍ K. G. Ramakrishnan; Manoel A. Rodrigues πŸ“‚ Article πŸ“… 2002 πŸ› Institute of Electrical and Electronics Engineers 🌐 English βš– 249 KB πŸ‘ 1 views
Routing in a Class of Cayley Graphs of S
Routing in a Class of Cayley Graphs of Semidirect Products of Finite Groups
✍ 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