Interval Routing onk-Trees

Onk-Dimensional Balanced Binary Trees

✍ Vijay K. Vaishnavi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 510 KB

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

Onk-ary spanning trees of tournaments

✍ Lu, Xiaoyun; Wang, Da-Wei; Chang, Gerard J.; Lin, In-Jen; Wong, C. K. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB

It is well known that every tournament contains a Hamiltonian path, which can be restated as that every tournament contains a unary spanning tree. The purpose of this article is to study the general problem of whether a tournament contains a k-ary spanning tree. In particular, we prove that, for any

Interval Routing Schemes

✍ P. Fraigniaud; C. Gavoille 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 278 KB

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),

Lower bounds for linear interval routing

✍ Eilam, T.; Moran, S.; Zaks, S. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 211 KB 👁 2 views

Linear interval routing is a space-efficient routing method for point-to-point communication networks. It is a restricted variant of interval routing where the routing range associated with every link is represented by an interval with no wraparound. A common way to measure the efficiency of such ro