Interval Routing Schemes

P. Fraigniaud; C. Gavoille

doi:10.1007/pl00009211

Interval Routing Schemes

Algorithmica ◽

10.1007/pl00009211 ◽

1998 ◽

Vol 21 (2) ◽

pp. 155-182 ◽

Cited By ~ 15

Author(s):

P. Fraigniaud ◽

C. Gavoille

Keyword(s):

Routing Schemes ◽

Interval Routing

Download Full-text

Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)

Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing - PODC '00 ◽

10.1145/343477.343503 ◽

2000 ◽

Cited By ~ 1

Author(s):

Pierre Fraigniaud ◽

Cyril Gavoille ◽

Bernard Mans

Keyword(s):

Message Complexity ◽

Routing Schemes ◽

Interval Routing

Download Full-text

Ordered interval routing schemes

Journal of Discrete Algorithms ◽

10.1016/j.jda.2009.06.001 ◽

2009 ◽

Vol 7 (4) ◽

pp. 363-376

Author(s):

Mustaq Ahmed

Keyword(s):

Routing Schemes ◽

Interval Routing

Download Full-text

Deadlock-free interval routing schemes

Lecture Notes in Computer Science - STACS 97 ◽

10.1007/bfb0023472 ◽

1997 ◽

pp. 351-362 ◽

Cited By ~ 6

Author(s):

Michele Flammini

Keyword(s):

Routing Schemes ◽

Free Interval ◽

Interval Routing

Download Full-text

Interval routing schemes

STACS 95 - Lecture Notes in Computer Science ◽

10.1007/3-540-59042-0_80 ◽

1995 ◽

pp. 279-290 ◽

Cited By ~ 3

Author(s):

Michele Flammini ◽

Giorgio Gambosi ◽

Sandro Salomone

Keyword(s):

Routing Schemes ◽

Interval Routing

Download Full-text

Characterization of networks supporting multi-dimensional linear interval routing schemes

Theoretical Computer Science ◽

10.1016/j.tcs.2004.06.013 ◽

2004 ◽

Vol 326 (1-3) ◽

pp. 103-116

Author(s):

Yashar Ganjali ◽

MohammadTaghi Hajiaghayi

Keyword(s):

Routing Schemes ◽

Linear Interval ◽

Interval Routing

Download Full-text

Interval routing schemes

Algorithmica ◽

10.1007/bf01944351 ◽

1996 ◽

Vol 16 (6) ◽

pp. 549-568 ◽

Cited By ~ 18

Author(s):

M. Flammini ◽

G. Gambosi ◽

S. Salomone

Keyword(s):

Routing Schemes ◽

Interval Routing

Download Full-text

Low-congested interval routing schemes for hypercubelike networks

Networks ◽

10.1002/1097-0037(200010)36:3<191::aid-net6>3.0.co;2-k ◽

2000 ◽

Vol 36 (3) ◽

pp. 191-201

Author(s):

Serafino Cicerone ◽

Gabriele Di Stefano ◽

Michele Flammini

Keyword(s):

Routing Schemes ◽

Interval Routing

Download Full-text

On the hardness of minimizing space for all-shortest-path interval routing schemes

Theoretical Computer Science ◽

10.1016/j.tcs.2007.09.010 ◽

2007 ◽

Vol 389 (1-2) ◽

pp. 250-264

Author(s):

Rui Wang ◽

Francis C.M. Lau ◽

Yan Yan Liu

Keyword(s):

Shortest Path ◽

Routing Schemes ◽

Interval Routing

Download Full-text

Interval routing schemes allow broadcasting with linear message-complexity

Distributed Computing ◽

10.1007/s004460100058 ◽

2001 ◽

Vol 14 (4) ◽

pp. 217-229 ◽

Cited By ~ 6

Author(s):

Pierre Fraigniaud ◽

Cyril Gavoille ◽

Bernard Mans

Keyword(s):

Message Complexity ◽

Routing Schemes ◽

Interval Routing

Download Full-text

On the Hardness of Devising Interval Routing Schemes

Parallel Processing Letters ◽

10.1142/s0129626497000061 ◽

1997 ◽

Vol 07 (01) ◽

pp. 39-47 ◽

Cited By ~ 9

Author(s):

Michele Flammini

Keyword(s):

Time Complexity ◽

Compact Routing ◽

Routing Schemes ◽

Np Completeness ◽

Routing Scheme ◽

Np Complete ◽

Interval Routing ◽

General Networks

The k-Interval Routing Scheme (k-IRS) is a compact routing scheme on general networks. It has been studied extensively and recently been implemented on the latest generation of the INMOS transputer router chips. In this paper we investigate the time complexity of devising a minimal space k-IRS and we prove that the problem of deciding whether there exists a 2-IRS for any network G is NP-complete. This is the first hardness result for k-IRS where k is constant and the graph underlying the network is unweighted. Moreover, the NP-completeness holds also for linear and strict 2-IRS.

Download Full-text