✦ LIBER ✦

Interval Routing Schemes

✍ Scribed by P. Fraigniaud; C. Gavoille

Publisher: Springer
Year: 1998
Tongue: English
Weight: 278 KB
Volume: 21
Category: Article
ISSN: 0178-4617
DOI: 10.1007/pl00009211

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Deadlock-free interval routing schemes

✍ Flammini, Michele 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 199 KB

k-Interval labeling schemes (k-ILS) are compact routing schemes on general networks which have been studied extensively and recently been implemented on the latest generation INMOS Transputer Router chips. In this paper, we introduce an extension of the k-ILS to the ͗k, s͘-DFILS (deadlock-free ILS),

Low-congested interval routing schemes f

Low-congested interval routing schemes for hypercubelike networks

✍ Serafino Cicerone; Gabriele Di Stefano; Michele Flammini 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 173 KB 👁 2 views

Characterization results of all shortest

Characterization results of all shortest paths interval routing schemes

✍ M. Flammini; G. Gambosi; U. Nanni; R.B. Tan 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 119 KB

Interval routing schemes allow broadcast

Interval routing schemes allow broadcasting with linear message-complexity

✍ Pierre Fraigniaud; Cyril Gavoille; Bernard Mans 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 222 KB

Universal routing schemes

✍ Pierre Fraigniaud; Cyril Gavoille 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 558 KB

Interval Routing onk-Trees

✍ Lata Narayanan; Naomi Nishimura‡ 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 400 KB