𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improved Routing and Sorting on Multibutterflies

✍ Scribed by B. M. Maggs; B. Vöcking

Book ID
106149267
Publisher
Springer
Year
2000
Tongue
English
Weight
163 KB
Volume
28
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Selection, Routing, and Sorting on the S
Selection, Routing, and Sorting on the Star Graph
✍ Sanguthevar Rajasekaran; David S.L. Wei 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 270 KB

We consider the problems of selection, routing, and sorting on an n-star graph (with n! nodes), an interconnection network which has been proven to possess many special properties. We identify a tree like subgraph (which we call a "(k, 1, k) chain network") of the star graph which enables us to desi

k-k Routing, k-k Sorting, and Cut-Throug
k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh
✍ S. Rajasekaran 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 1009 KB

In this paper we present randomized algorithms for \(k-k\) routing, \(k-k\) sorting, and cut-through routing on an \(n \times n\) mesh connected computer (referred to simply as the mesh). The stated resource bounds hold with high probability. The algorithm for \(k-k\) routing runs in \((k / 2) n+o(k

F-Chord: Improved uniform routing on Cho
F-Chord: Improved uniform routing on Chord
✍ G. Cordasco; L. Gargano; A. Negro; V. Scarano; M. Hammar 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 267 KB

## Abstract We propose a family of novel Chord‐based P2P schemes retaining all positive aspects that made Chord a popular topology for routing in P2P networks. The schemes, based on the Fibonacci number system, allow to simultaneously improve on the maximum/average number of hops for lookups and th