𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Regular layouts of butterfly networks

✍ Scribed by Jörg Keller

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
592 KB
Volume
17
Category
Article
ISSN
0167-9260

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Tight Layout of the Butterfly Network
A Tight Layout of the Butterfly Network
✍ A. Avior; T. Calamoneri; S. Even; A. Litman; A. L. Rosenberg 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 199 KB
Rabin numbers of Butterfly networks
Rabin numbers of Butterfly networks
✍ Sheng-Chyang Liaw; Gerard J. Chang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 505 KB

## Reliability and efficiency are important criteria in the design of interconnection networks. Recently, the w-wide diameter d,(G), the (W -1 )-fault diameter D,,(G), and the w-Rabin number r,(G) have been used to measure network reliability and efficiency. In this paper, we study these parameter

The forwarding indices of wrapped butter
The forwarding indices of wrapped butterfly networks
✍ Xinmin Hou; Jun-Ming Xu; Min Xu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 97 KB

## Abstract Let __G__ be a connected graph. A routing in __G__ is a set of fixed paths for all ordered pairs of vertices in __G__. The forwarding index of __G__ is the minimum of the largest number of paths specified by a routing passing through any vertex of __G__ taken over all routings in __G__.