Skip to main content
SpringerLink
Log in

A simple DFS-Based algorithm for linear interval routing

  • Contributed Papers
  • Conference paper
  • First Online:
Distributed Algorithms (WDAG 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1320))

Included in the following conference series:

Abstract

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 wrap-around. It was noted in [BLT91] that not every network has a valid Linear Interval Labeling Scheme (LILS). A complete characterization of the networks that admit a valid LILS was presented in [FG94], together with an algorithm that generates a valid LILS in case one exists. We present a new algorithm that generates an LILS for every network that admits one. Our algorithm is based on a DFS spanning tree of the network, and is “in the spirit” of the algorithms for Interval Routing. Our algorithm has few advantages over the algorithm of [FG94]: it utilizes the well-known theory of DFS spanning trees and is thus simpler to understand and to implement, it uses all links of the network for routing (thus it better distributes the load), and it guarantees that some paths traversed by messages are shortest length paths.

This research was supported by the fund for promoting reseach in the Technion, and by the Bernard Elkin Chair in Computer Science.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Awerbuch, B., Bar-Noy, A., Linial, N., Peleg, D.: Improved Routing Strategies with Succinct Tables. Journal of Algorithms, 11 (1990) 307–341.

    Article  Google Scholar 

  2. Awerbuch, B., Peled, D.: Routing with Polinomial Communication-Space Tradeoff. SIAM Journal on Discrete Math., 5 (1992) 151–162.

    Article  Google Scholar 

  3. Bakker, E.M., van Leeuwen, J., Tan, R.B.: Prefix Routing Schemas in Dynamic Networks. Tech. Rep. RUU-CS-90-10, Dept. of Computer science, Utrecht University, Utrecht (1990), and, Computer Networks and ISDN Systems, 26 (1993), 403–421.

    Google Scholar 

  4. Bakker, E.M., van Leeuwen, J., Tan, R.B.: Linear Interval Routing. Algorithms Review 2 (1991) 45–61.

    Google Scholar 

  5. Even, S.: Graph Algorithms. Computer Science Press, Inc., (1979).

    Google Scholar 

  6. Eilam, T., Moran, S., Zaks, S.: Lower Bounds for Linear Interval Routing. Proc. 10th int. Workshop on Distributed Algorithms (WDAG) (1996) 191–205.

    Google Scholar 

  7. Fraigniaud, P., Gavoille, C.: Interval Routing Schemes. Research Rep. 94–04, LIPS-ENS Lyon (1994).

    Google Scholar 

  8. Flammini, M., Gambosi, G., Nanni, U., Tan, R.: Multi-Dimensional Interval Routing Scheme. Proc. 9th Int. Workshop on Distributed Algorithms (WDAG) (1995) 131–144.

    Google Scholar 

  9. Flammini, M., Gambosi, G., Salomone, S.: Boolean Routing. Proc. 7th Int. Workshop on Distributed Algorithms (WDAG) (1993) 219–233.

    Google Scholar 

  10. Fraigniaud, P., Gavoille, C.: Local Memory Requirement of Universal Routing Schemes. Proc. 8th Annual ACM Symp. on Parallel Algorithms and Architecture (SPAA) (1996).

    Google Scholar 

  11. Gavoille, C., Perennes, S.: Memory Requirements for Routing in Distributed Networks. Proc. 15th Annual ACM Symp. on Principles of Distributed Computing (PODC) (1996) 125–133.

    Google Scholar 

  12. Gavoille, C., Perennes, S.,: Lower Bounds for Shortest Path Interval Routing. Proc. 3rd Colloq. on Structural Information and Communication Complexity (SIROCCO) (1996).

    Google Scholar 

  13. The T9000 Transputer Products Overview Manual, INMOS (1991).

    Google Scholar 

  14. van Leeuwen, J., Tan, R.B.: Routing with Compact Routing Tables. Tech. Rep. RUU-CS-83-16, Dept. of Computer Science, Utrecht University (1983). Also as: Computer Networks with Compact Routing Tables: In: G. Rozenberg and A. Salomaa (Eds.) The book of L, Springer-Verlag, Berlin (1986) 298–307.

    Google Scholar 

  15. van Leeuwen, J., Tan, R.B.: Computer Network with Compact Routing 'Tables. In: G. Rozenberg and A. Salomaa (Eds.), The Book of L., Springer-Verlag, Berlin (1986) 259–273.

    Google Scholar 

  16. Peleg, D., Upfal, E.: A Trade-Off between Space and Efficiency of Routing Tables. Journal of the ACM 36 (1989) 510–530.

    Article  Google Scholar 

  17. Ružička, P.: A Note on the Efficiency of an Interval Routing Algorithm. The Computer Journal 34 (1991) 475–476.

    Article  Google Scholar 

  18. Santoro, N., Khatib, R.: Routing Without Routing Tables. Tech. Rep. SCS-TR-6, 6, School of Computer Science, Carleton Univrsity (1982). Also as: Labeling and Implicit Routing in Networks. The Computer Journal 28 (1) (1985) 5–8.

    Google Scholar 

  19. Tse, S. S.H., Lau, F. C.M.: A Lower Bound for Interval Routing in General Networks. Networks 29 (1997) 49–53. Also as: Tech. Rep. TR-94-09, Department of Computer Science, University of Hong Kong (1994).

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Technion, 32000, Haifa, Israel

    T. Eilam & S. Moran

Authors
  1. T. Eilam
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Moran
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. Zaks
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marios Mavronicolas Philippas Tsigas

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Eilam, T., Moran, S., Zaks, S. (1997). A simple DFS-Based algorithm for linear interval routing. In: Mavronicolas, M., Tsigas, P. (eds) Distributed Algorithms. WDAG 1997. Lecture Notes in Computer Science, vol 1320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030674

Download citation

  • DOI: https://doi.org/10.1007/BFb0030674

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63575-8

  • Online ISBN: 978-3-540-69600-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation