𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Average stretch analysis of compact routing schemes

✍ Scribed by Tamar Eilam; Cyril Gavoille; David Peleg

Book ID
108112630
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
233 KB
Volume
155
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Space-Efficiency for Routing Schemes of
Space-Efficiency for Routing Schemes of Stretch Factor Three
✍ Cyril Gavoille; Marc Gengler πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 133 KB

We deal with deterministic distributed routing algorithms on arbitrary n-node networks. For each router, we want to minimize the amount of routing information that must be stored in order to implement the local routing algorithm, even if the names of the routers can be chosen in advance. We take als

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