论文信息 - The Complexity of Shortest Path and Dilation Bounded Interval Routing

The Complexity of Shortest Path and Dilation Bounded Interval Routing

Interval routing is an attractive space-efficient routing method for point-to-point communication networks which found industrial applications in novel transputer routing technology.

Daniel Stefankovic | Rastislav Kralovic | Peter Ruzicka

[1] Evangelos Kranakis,et al. Lower Bounds for Compact Routing (Extended Abstract) , 1996, STACS.

[2] Shmuel Zaks,et al. A Lower Bound for Linear Interval Routing , 1996, WDAG.

[3] Enrico Nardelli,et al. On the path length in interval routing schemes , 1997 .

[4] Jan van Leeuwen,et al. Interval Routing , 1987, Computer/law journal.

[5] Francis C. M. Lau,et al. A lower bound for interval routing in general networks , 1997 .

[6] Eli Upfal,et al. A tradeoff between space and efficiency for routing tables , 1988, STOC '88.

[7] Fcm Lau,et al. Two lower bounds for multi-label interval routing , 1997 .

[8] Michele Flammini,et al. On the Hardness of Devising Interval Routing Schemes , 1997, Parallel Process. Lett..

[9] Pierre Fraigniaud,et al. Local memory requirement of universal routing schemes , 1996, SPAA '96.

[10] Jan van Leeuwen,et al. The Complexity of Interval Routing on Random Graphs , 1995, MFCS.

[11] Francis C. M. Lau,et al. Lower Bounds for Multi-label Interval Routing , 1995, SIROCCO.

[12] Nicola Santoro,et al. Labelling and Implicit Routing in Networks , 1985, Computer/law journal.

[13] Pierre Fraigniaud,et al. Optimal Interval Routing , 1994, CONPAR.

[14] Eli Upfal,et al. A trade-off between space and efficiency for routing tables , 1989, JACM.

[15] Peter Ruzicka,et al. On Efficiency of Interval Routing Algorithms , 1988, MFCS.

[16] Cyril Gavoille. On the Dilation of Interval Routing , 1997, MFCS.