Skip to main content
SpringerLink
Log in

Static and dynamic low-congested interval routing schemes

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1998)

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

Included in the following conference series:

Abstract

In this paper we consider Interval Routing Schemes (IRS) that are optimal with respect to the congestion of the induced path system. We provide a general framework able to deal with the various congestion issues in IRS. In fact, it is possible to distinguish between static cases, in which the source-destination configurations are fixed, and dynamic cases, where they vary over time. All these situations can be handled in a unified setting, thanks to the notion of competitiveness introduced in this paper.

We first give some general results not related to specific traffic demands. Then, in the one-to-all communication pattern, we show that constructing competitive IRS for a given network is an intractable problem, both for the static and the dynamic case, that is respectively when the root vertex is fixed and when it can change along the time.

Finally, both for one-to-all and all-to-all communication patterns, we provide nicely competitive k-IRS for relevant topologies. Networks considered are chains, trees, rings, chordal rings and multi-dimensional grids and tori. We consider both the directed congestion case, in which there are pairwise opposite unidirectional links connecting two neighbor processors, and the undirected congestion case, in which two neighbors are connected by a single bi-directional link.

Work supported by the EU ESPRIT Long Term Research Project ALCOM-IT under contract N. 20244.

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. E. Bakker, J. van Leeuwen, and R.B. Tan. Linear interval routing. Algorithms Review, 2(2):45–61, 1991.

    Google Scholar 

  2. F.R.K. Chung, E.G. Coffman, M.I. Reiman, and D.E. Simon. The forwarding index of communication networks. IEEE Trans. on Inform. Theory, 33:224–232, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  3. S. Cicerone, G. Di Stefano, and M. Flammini. Low-congested interval routing schemes. Technical Report R.97-20, Dipartimento di Ingegneria Elettrica, Università di L'Aquila (L'Aquila, Italy), 1997.

    Google Scholar 

  4. R. Cypher, F. Meyer auf der Heide, C. Scheideier, and B. Vöcking. Universal algorithms for store-and-forward and wormhole routing. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pages 356–305, Philadelphia, Pennsylvania, 22–24 May 1996.

    Google Scholar 

  5. T. Eilatn, S. Moran, and S. Zaks. The complexity of characterization of networks supporting shortest-path interval routing. In 4th Colloquium on Structural Information and Communication Complexity (SIROCCO). Carleton University Press, 1997.

    Google Scholar 

  6. M. Flammini. On the hardness of devising interval routing schemes. Parallel Processing Letters, 7(1):39–47, 1997.

    Article  MathSciNet  Google Scholar 

  7. M. Flammini, G. Gambosi, and S. Salomone. Interval routing Scheines. Algorithmica, 16(6):549–568, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  8. M. Flammini, J. van Leeuwen, and A. Marchetti Spaccamela. The complexity of interval routing on random graphs. In 20th Symposium on Mathematical Foundation of Computer Science (MFCS), volume 969 of Lecture Notes in Computer Science, pages 37–49. Springer-Verlag, 1995.

    Google Scholar 

  9. P. Fraigniaud and C. Gavoille. A characterisation of networks supporting linear interval routing. In 13th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 216–224, 1994.

    Google Scholar 

  10. P. Fraigniaud and C. Gavoille. Interval routing schemes. Technical Report 94-04, Laboratoire de l'Informatique du Parallélisme, LIP, école Normale Supérieure de Lyon, 69364 Lyon Cedex 07, France, 1994. To appear in Algorithmica.

    Google Scholar 

  11. G.N. Frederickson and R. Janardan. Designing networks with compact routing tables.Algorithmica, 3:171 190, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  12. M.R. Garey and D.S. Johnson. Computers and Intractability. A Guide to the Theory of NP-completeness. W.H. Freeman, 1979.

    Google Scholar 

  13. C. Gavoille. A survey on interval routing scheme. Research Report RR-1182-97, University of Bordeaux (France), October 1997.

    Google Scholar 

  14. C. Gavoille and S. Pérennès. Lower bounds for interval routing on 3-regular networks. In 3rd Colloquium on Structural Information and Communication Complexity (SIROCCO). Carleton University Press, 1996.

    Google Scholar 

  15. R. I. Greenberg and H.-C. Oh. Universal wormhole routing. IEEE Transactions on Parallel and Distributed Systems (1EEE-TPDS), 8, 1997.

    Google Scholar 

  16. M.C. Heydemann, J.C. Meyer, J. Opatrny, and D. Sotteau. Forwarding indices of consistent routings and their complexity. Networks, 24(2):75–82, 1994.

    MATH  MathSciNet  Google Scholar 

  17. M.C. Heydemann, J.C. Meyer, and D. Sotteau. On forwarding indices of networks. Discrete Applied Math., 23:103–123, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  18. The T9000 Transputer Products Overview Manual. INMOS, 1991.

    Google Scholar 

  19. E. Kranakis, D. Krizanc, and S.S. Ravi. On multi-label linear interval routing schemes. In 19th Workshop on Graph Theoretic Concepts in Computer Science (WG), volume 790 of Lecture Notes in Computer Science, pages 338–349. Springer-Verlag, 1993.

    Google Scholar 

  20. T. Leighton, B. Maggs, and S. Rao. Universal packet routing algorithms. In 29th Annual Symposium on Foundations of Computer Science, pages 256–271, 1988.

    Google Scholar 

  21. P. Ruzicka and D. Stefankovic. On the complexity of multidimensional interval routing schemes. Manuscript, 1997.

    Google Scholar 

  22. N. Santoro and R. Khalib. Labeling and implicit routing in networks. The Computer Journal, 28:5–8, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  23. P. Solé. Expanding and forwarding. Discrete Applied Math., 58:67–78, 1995.

    Article  MATH  Google Scholar 

  24. J. van Leeuwen and R.B. Tan. Routing with compact routing tables. In G. Rozemberg and A. Salomaa, editors, The book of L, pages 259–273. Springer-Verlag, 1986.

    Google Scholar 

  25. J. van Leeuwen and R.B. Tan. Interval routing. The Computer Journal, 30:298–307,1987.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, University of L'Aquila, Monteluco di Roio, I-G7040, L'Aquila, Italy

    Serafino Cicerone & Gabriele Di Stefano

  2. Department of Mathematics, University of L'Aquila, Via Vetoio loc. Coppito, I-67100, L'Aqnila, Italy

    Michele Flammini

Authors
  1. Serafino Cicerone
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gabriele Di Stefano
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michele Flammini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Kim G. Larsen Sven Skyum Glynn Winskel

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cicerone, S., Di Stefano, G., Flammini, M. (1998). Static and dynamic low-congested interval routing schemes. In: Larsen, K.G., Skyum, S., Winskel, G. (eds) Automata, Languages and Programming. ICALP 1998. Lecture Notes in Computer Science, vol 1443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055087

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64781-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation