Skip to main content
SpringerLink
Log in

Efficient Communication Schemes

  • Conference paper
  • First Online:
SOFSEM’ 98: Theory and Practice of Informatics (SOFSEM 1998)

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

  • 427 Accesses

Abstract

We give a survey of recent theoretical results for communication problems in point to point networks. This survey is based on the previous surveys in [57, 25].

Communication problems are studied as routing path systems satisfying given communication patterns in a network. Efficiency parameters of path systems such as congestion, dilation, stretch factor, compactness and buffer size are considered. We focus on the current research directions and the various techniques that are used. Open problems related to this line of research and an overview of several related research directions are given.

This research has been partially supported by VEGA 1/4315/97.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Awerbuch, S. Kutten, D. Peleg: Efficient Deadlock-Free Routing. In Proceedings of ACM Symposium on Principles of Distributed Computing (PODC’91), 1991, pp. 177–188.

    Google Scholar 

  2. E. Bakker, J. van Leeuwen, R.B. Tan: Linear interval routing schemes. Algorithms Review 2, 1991, pp. 45–61.

    Google Scholar 

  3. P.E. Berman, L. Gravano, G.D. Pifarré, J.L.C. Sanz: Adaptive Deadlock-and Livelock-Free Routing with All Minimal Paths in Torus Networks. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1992, pp. 3–12.

    Google Scholar 

  4. J.-C. Bermond, M. Di Ianni, M. Flammini, S. Pérennes: Acyclic Orientations for Deadlock Prevention in Interconnection Networks. In 23rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG’97), Lecture Notes in Computer Science, Springer-Verlag, 1997.

    Google Scholar 

  5. H.L. Bodlaender, J. van Leeuwen, R.B. Tan, D. Thilikos: On interval routing schemes and treewidth. In 21st International Workshop on Graph-Theoretic Concepts in Computer Science (WG’95), Lecture Notes in Computer Science, Springer-Verlag, 1995.

    Google Scholar 

  6. A Bouabdallah, D. Sotteau: On the Edge Forwarding Index Problem for Small Graphs. Networks 23, 1993, pp. 249–255.

    Article  MATH  MathSciNet  Google Scholar 

  7. F.R.K. Chung, E.G. Coffman, M.J. Reimann, B.E. Simon: The forwarding index of communication networks. IEEE Transactions on Information Theory 33, 1987,pp. 224–232.

    Article  MATH  Google Scholar 

  8. S. Cicerone, G. Di Stefano, M. Flammini: Static and Dynamic Low-Congested Interval Routing Schemes. In 25th International Colloquium ICALP’98, Lecture Notes in Computer Science 1443, Springer-Verlag, 1998, pp. 592–603.

    Google Scholar 

  9. R. Cypher: Minimal, Deadlock-Free Routing in Hypercubic and Arbitrary Networks. Proceedings of the 7th IEEE Symposium on Parallel and Distributed Processing, 1995.

    Google Scholar 

  10. R. Cypher, L. Gravano: Requirements for Deadlock-Free, Adaptive Packet Routing. SIAM Journal of Computing 23(6), 1994, pp. 1266–1274.

    Article  MATH  MathSciNet  Google Scholar 

  11. R. Cypher, L. Gravano: Storage-Efficient, Deadlock-Free Packet Routing Algorithms for Torus Networks. IEEE Transactions on Computers 43(12), 1994, pp. 1376–1385.

    Article  Google Scholar 

  12. R. Cypher, F. Meyer auf der Heide, C. Scheideler, B. Vöcking: Universal algorithms for store-and-forward and wormhole routing. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 1996, pp. 356–365.

    Google Scholar 

  13. W.J. Dally, C.L. Seitz: Deadlock-free message routing in multiprocessor interconnection networks. IEEE Transactions on Computers, C-36, 1987, pp. 547–553.

    Article  MATH  Google Scholar 

  14. J. Duato: Deadlock-Free Adaptive Routing Algorithms for Multicomputers: Evaluation of a New Algorithm. In 3rd IEEE Symposium on Parallel and Distributed Processing, 1991.

    Google Scholar 

  15. T. Eilam, C. Gavoille, D. Peleg: Compact Routing Schemes with Low Stretch Factor. LaBRI, Université Bordeaux I, 33405 Talence CEDEX, France, 1998. Submitted for publication.

    Google Scholar 

  16. T. Eilam, S. Moran, S. Zaks: A lower bound for linear interval routing. In 10th International Workshop on Distributed Algorithms (WDAG’96), Lecture Notes in Computer Science 1151, Springer-Verlag, 1996.

    Google Scholar 

  17. T. Eilam, S. Moran, S. Zaks: The complexity of the characterization of networks supporting shortest-path interval routing. In 4th International Colloquium on Structural Information and Communication Complexity (SIROCCO’97), 1997.

    Google Scholar 

  18. M. Flammini: Deadlock-Free Interval Routing Schemes. In 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science 1200, Springer-Verlag, 1997, pp. 351–362.

    Google Scholar 

  19. M. Flammini, G. Gambosi, U. Nanni, R.B. Tan: Multi-Dimensional Interval Routing Schemes. In 9th International Workshop on Distributed Algorithms (WDAG), Lecture Notes in Computer Science, Springer-Verlag, 1995. To appear in Theoretical Computer Science.

    Google Scholar 

  20. M. Flammini, G. Gambosi, U. Nanni, R.B. Tan: Characterization results of all shortest paths interval routing schemes1. In 5th International Colloquium on Structural Information and Communication Complexity (SIROCCO’98), Carleton Press, 1998.

    Google Scholar 

  21. M. Flammini, E. Nardelli: On the path length in interval routing schemes. Submitted for publication.

    Google Scholar 

  22. M. Flammini, J. van Leeuwen, A. Marchetti-Spaccamela: The complexity of interval routing on random graphs. In 20th International Symposium on Mathematical Foundations of Computer Science (MFCS’95), Lecture Notes in Computer Science 969, Springer-Verlag, 1995, pp. 37–49.

    Google Scholar 

  23. P. Fragniaud, C. Gavoille: Interval Routing Schemes. Research Report 94-04, LIP, Ecole Normale Superieure de Lyon, 69364 Lyon Cedex 07, France, 1994. To appear in Algorithmica.

    Google Scholar 

  24. G.N. Frederickson, R. Janardan: Designing networks with compact routing tables. Algorithmica 3, 1988, pp. 171–190.262

    Article  MATH  MathSciNet  Google Scholar 

  25. C. Gavoille: A Survey on Interval Routing Schemes. Research Report RR-1182-97, LaBRI, Université Bordeaux I, October 1997. Submitted for publication.

    Google Scholar 

  26. C. Gavoille: On the Dilation of Interval Routing. In 22nd International Symposium on Mathematical Foundations of Computer Science (MFCS’97), Lecture Notes in Computer Science 1295, Springer-Verlag, 1997, pp. 259–268.

    Chapter  Google Scholar 

  27. C. Gavoille, E. Guévremont: Worst case bounds for shortest path interval routing. Journal of Algorithms 27, 1998, pp. 1–23.

    Article  MATH  MathSciNet  Google Scholar 

  28. C. Gavoille, D. Peleg: The Compactness of Interval Routing. LaBRI, Université Bordeaux I, 33405 Talence CEDEX, France, 1997. Submitted for publication.

    Google Scholar 

  29. C. Gavoille, S. Pérennes: Lower Bounds for Interval Routing on 3-Regular Networks. In 3rd International Colloquium on Structural Information and Communication Complexity (SIROCCO’96), Carleton Press, 1996, pp. 88–103.

    Google Scholar 

  30. I.S. Gopal: Prevention of Store-and-Forward Deadlock in Computer Networks. IEEE Transactions on Communications 33(12), 1985, pp. 1258–1264.

    Article  Google Scholar 

  31. K.D. Günther: Prevention of Deadlocks in Packet-Switched Data Transport Systems. IEEE Transactions on Communications 29(4), 1981.

    Google Scholar 

  32. M.C. Heydemann, J.C. Meyer, D. Sotteau: On Forwarding Indices of Networks. Discrete Applied Mathematics 23, 1989, pp. 103–123.

    Article  MATH  MathSciNet  Google Scholar 

  33. M.C. Heydemann, J.C. Meyer, D. Sotteau, J. Opatrny: Forwarding Indices of Consistent Routings and Their Complexity. Networks 24, 1994, pp. 75–82.

    Article  MathSciNet  Google Scholar 

  34. R. KráĽovič: Optimal 1-IRS on 8-directional meshes. Unpublished manuscript, 1995.

    Google Scholar 

  35. R. KráĽovič, B. Rovan, P. RuŽička, D. štefankovič: Efficient Deadlock-free Multidimensional Interval Routing in Interconnection Networks. In Distributed Computing (DISC’98), Lecture Notes in Computer Science, Springer-Verlag, 1998.

    Google Scholar 

  36. R. KráĽovič, P. RuŽička, D. štefankovič: The Complexity of Shortest Path and Dilation Bounded Interval Routing. In 3rd International Euro-Par Conference, Lecture Notes in Computer Science 1300, Springer-Verlag, August 1997, pp. 258–265. Full version will appear in Theoretical Computer Science.

    Google Scholar 

  37. E. Kranakis, D. Krizanc, S.S. Ravi: On multi-label linear interval routing schemes. In 19th International Workshop on Graph-Theoretic Concepts in Computer Science (WG’93), Lecture Notes in Computer Science 790, Springer-Verlag, 1993, pp. 338–349.

    Google Scholar 

  38. T. Leighton: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, San Mateo, CA, 1992.

    MATH  Google Scholar 

  39. P.M. Merlin, P.J. Schweitzer: Deadlock avoidance in store-and-forward networks. IEEE Transactions of Communications, COM-27, 1980, pp. 345–360.

    Google Scholar 

  40. L. Narayanan, S. Shende: Characterization of networks supporting shortest-path interval labeling schemes. In 3rd International Colloquium on Structural Information and Communication Complexity (SIROCCO’96), Carleton University Press, 1996, pp. 73–87.

    Google Scholar 

  41. L. Narayanan, J. Opatrny: Compact routing on chordal rings. In 4th International Colloquium on Structural Information and Communication (SIROCCO’97), Carleton University Press, 1997.

    Google Scholar 

  42. G.D. Pifarré, L. Gravano, S.A. Felperin, J.L.C. Sanz: Fully-Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes and Other Networks. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures. 1991, pp. 278–290.

    Google Scholar 

  43. P. RuŽička: On efficiency of interval routing algorithms. In 13th International Symposium on Mathematical Foundations of Computer Science (MFCS’88), Lecture Notes in Computer Science 324, Springer-Verlag, 1988, pp. 492–500.

    Google Scholar 

  44. P. RuŽička, D. Stefankovič: On the Complexity of Multi-Dimensional Interval Routing Schemes. Submitted for publication.

    Google Scholar 

  45. R. Saad: Complexity of the forwarding index problem. SIAM Journal of Discrete Mathematics 1995.

    Google Scholar 

  46. N. Santoro, R. Khatib: Labelling and implicit routing in networks. The Computer Journal 28, 1985, pp. 5–8.

    Article  MATH  MathSciNet  Google Scholar 

  47. P. Solé: Expanding and Forwarding. Discrete Applied Mathematics 58, 1995, pp. 67–78.

    Article  MATH  MathSciNet  Google Scholar 

  48. D. štefankovič: Acyclic Orientations do not Lead to Optimal Deadlock-free Packet Routing Algorithms. Submitted for publication.

    Google Scholar 

  49. F. Shahrokhi, L. Szekely: An algebraic approach to the uniform concurrent multicommodity flow problem: theory and applications. Research report CRPDC-91-4, University of North Texas, 1991.

    Google Scholar 

  50. G. Tel: Introduction to Distributed Algorithms. (Chapter 5: Deadlock-free Packet Routing). Cambridge University Press, Cambridge, U.K., 1994.

    Google Scholar 

  51. S. Toueg: Deadlock-free and livelock-free packet switching networks. In Proceedings of Symposium on Theory of Computing (STOCS), 1980, pp. 94–99.

    Google Scholar 

  52. S. Toueg, K. Steiglitz: Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks. SIAM Journal of Computing 10(4), 1981, pp. 702–712.

    Article  MATH  MathSciNet  Google Scholar 

  53. S. Toueg, J. Ullman: Deadlock-free packet switching networks. SIAM Journal of Computing 10, 1981, pp. 594–611.

    Article  MATH  MathSciNet  Google Scholar 

  54. S.S.H. Tse, F.C.M. Lau: Lower bounds for multi-label interval routing. In 2nd International Colloquium on Structural Information and Communication Complexity (SIROCCO’95), Carleton University Press, 1995, pp. 123–134.

    Google Scholar 

  55. S.S.H Tse, F.C.M. Lau: An Optimal Lower Bound for Interval Routing in General Networks. In 4th International Colloquium on Structural Information and Communication Complexity (SIROCCO’97), Carleton University Press, 1997.

    Google Scholar 

  56. J. van Leeuwen, R.B. Tan: Interval Routing. The Computer Journal 30, 1987, pp. 298–307.

    Article  MATH  Google Scholar 

  57. J. van Leeuwen, R.B. Tan: Compact routing methods: A survey. In 1st International Colloquium on Structural Information and Communication Complexity (SIROCCO), Carleton Press, 1994, pp. 99–110.

    Google Scholar 

  58. J. Vounckx, G. Deconinck, R. Lauwereins, J.A. Peperstraete: Deadlock-free Fault Tolerant Wormhole Routing in Mesh-Based Massively Parallel Systems. In Technical Committee on Computer Architecture (TCCA) Newsletter, IEEE Computer Society, Summer-Fall issue, 1994, pp. 49–54.

    Google Scholar 

  59. J. Vounckx, G. Deconinck, R. Cuyvers, R. Lauwereins: Minimal Deadlock-free Compact Routing in Wormhole-Switching based Injured Meshes. In Proceedings of the 2nd Reconfigurable Architectures Workshop, Santa Barbara, Ca, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics Faculty of Mathematics and Physics, Comenius University, Bratislava, Slovak Republic

    Peter RuŽička

Authors
  1. Peter RuŽička
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Comenius University, SK-84215, Bratislava, Slovakia

    Branislav Rovan

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

RuŽička, P. (1998). Efficient Communication Schemes. In: Rovan, B. (eds) SOFSEM’ 98: Theory and Practice of Informatics. SOFSEM 1998. Lecture Notes in Computer Science, vol 1521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49477-4_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-49477-4_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65260-1

  • Online ISBN: 978-3-540-49477-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation