Distance routing on series parallel networks

We consider the problem of routing messages on Series Parallel Graphs (SPGs) and we introduce a new technique called Distance Routing. This technique is based on the idea of encoding in the label of each node x some information about a shortest path from the source of the SPG to x, and from x to the terminal node of the SPG. We first compare shortest path Distance Routing and I-interval Routing Schemes on directed SPGs. We then show that Distance Routing can be used to route on bidirectional SPGs, where no general shortest path I-interval Routing Scheme can be applied. We also show the relevance of the study of the time complexity in the choice of a Compact Routing method.

[1]  Giorgio Gambosi,et al.  Boolean Routing , 1993, WDAG.

[2]  Giorgio Gambosi,et al.  Interval Labeling Scheme for Chordal Rings , 1994, SIROCCO.

[3]  Eugene L. Lawler,et al.  The Recognition of Series Parallel Digraphs , 1982, SIAM J. Comput..

[4]  Pierre Fraigniaud,et al.  A characterization of networks supporting linear interval routing , 1994, PODC '94.

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

[6]  Flaminia L. Luccio,et al.  Boolean Routing on Chordal Rings , 1995, SIROCCO.

[7]  Xin He,et al.  Efficient Parallel Algorithms for Series Parallel Graphs , 1991, J. Algorithms.

[8]  Flaminia L. Luccio,et al.  Interval Routing in Series Parallel Graphs , 1997 .

[9]  Flaminia L. Luccio.  On the convergence of a parallel algorithm for finding polynomial zeros , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

[10]  Flaminia L. Luccio,et al.  String Recognition on Anonymous Rings , 1995, MFCS.

[11]  Erwin M. Bakker,et al.  Linear Interval Routing , 1991 .

[12]  Ephraim Korach,et al.  General Vertex Disjoint Paths in Series-Parallel Graphs , 1993, Discret. Appl. Math..

[13]  Refael Hassin,et al.  Efficient algorithms for optimization and selection on series-parallel graphs , 1986 .

[14]  R. Duffin.  Topology of series-parallel networks , 1965 .

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

[16]  S. S. Ravi,et al.  On Multi-Label Linear Interval Routing Schemes , 1996, Comput. J..

[17]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[18]  Flaminia L. Luccio.  Almost Exact Minimum Feedback Vertex Set in Meshes and Butterflies , 1998, Inf. Process. Lett..