𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Compactness of Interval Routing

✍ Scribed by Gavoille, Cyril; Peleg, David

Book ID
118199594
Publisher
Society for Industrial and Applied Mathematics
Year
1999
Tongue
English
Weight
338 KB
Volume
12
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Interval routing & layered cross product
Interval routing & layered cross product: compact routing schemes for butterflies, meshes of trees, fat trees and BeneΕ‘ networks
✍ Tiziana Calamoneri; Miriam Di Ianni πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 291 KB

In this paper we propose compact routing schemes having space and time complexities comparable to a 2-interval routing scheme for the class of networks decomposable as layered cross product (LCP) of rooted trees. As a consequence, we are able to design a ''quasi'' 2-interval routing scheme (i.e. a 2

The complexity of shortest path and dila
The complexity of shortest path and dilation bounded interval routing
✍ Rastislav KrΓ‘ΔΎovič; Peter RuΕΎička; Daniel Ε tefankovič πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 227 KB

Interval routing is a popular compact routing method for point-to-point networks which found industrial applications in novel transputer routing technology (May and Thompson, Transputers and Routers: Components for Concurrent Machines, Inmos, 1991). Recently much e ort is devoted to relate the e ci