We study a variant of Interval Routing SK85, LT86] where the routing range associated with every link is represented by a linear (i.e., contiguous) interval with no wrap around. This kind of routing schemes arises naturally in the study of dynamic Preex Routing BLT90]. Linear Interval Routing schemes are precisely the Preex Routing schemes that use an alphabet of one symbol. We characterize the type of networks that admit optimum Linear Interval Routing schemes. It is shown that several well-known interconnection networks such as hypercubes, certain n-tori, and n-dimensional grids all with unit-cost links, have optimum Linear Interval Routing schemes. We also introduce the multi-label Linear Interval Routing schemes where each link may contain more than one label, and we prove several characterization results for these schemes.
[1]
Greg N. Frederickson,et al.
Separator-based strategies for efficient message routing
,
1986,
27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[2]
Yehuda Afek,et al.
Upper and lower bounds for routing schemes in dynamic networks
,
1989,
30th Annual Symposium on Foundations of Computer Science.
[3]
Dimitri P. Bertsekas,et al.
Data Networks
,
1986
.
[4]
Nicola Santoro,et al.
Labelling and Implicit Routing in Networks
,
1985,
Computer/law journal.
[5]
Jan van Leeuwen,et al.
Prefix Routing Schemes in Dynamic Networks
,
1993,
Comput. Networks ISDN Syst..
[6]
Jan van Leeuwen,et al.
Interval Routing
,
1987,
Computer/law journal.