As stated in the previous chapter, the two techniques that are used to control congestion within a network are flow control and routing. Hiaving considered flow control we now turn to routing. The goal of routing is to spread the flow throughout the network so as to avoid congestion. Since we are interested in the minimization of congestion, flow control in conjunction with routing must also be considered. As we shall see presently there are models in which routing and flow control can be considered in the same theoretical framework.


Central Node Average Delay Adjacent Node Control Message Outgoing Link 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. Schwartz and T. E. Stem, “Routing Techniques used in Computer Communication Networks,” IEEE Transactions on Communications COM-28(4), 539–553, April (1980).CrossRefGoogle Scholar
  2. 2.
    H. Rudin, “On Routing and Delta Routing a Taxonomy and Performance Comparison for Packet Switched Networks,” IEEE Transactions on Communications COM-24(l), 43–59, January (1976).CrossRefGoogle Scholar
  3. 3.
    D. P. Bertsekas, “Dynamic Behavior of a Shortest-Path Routing Algorithm of the ARPANET Type,” International Symposium on Information Theory, Grignano, Italy, June (1979).Google Scholar
  4. 4.
    H. Rudin and H. Müller, “More on Routing and Flow Control,” Proceedings of the National Telecommunication Conference (1979), pp. 34.5.1–34.5.9.Google Scholar
  5. 5.
    J. Spragins, “Analytical Queueing Models,” Computer, April (1980).Google Scholar
  6. 6.
    L. R. Ford and D. R. Fulkerson, Flows in Networks, Princeton University Press, Princeton, New Jersey (1962).MATHGoogle Scholar
  7. 7.
    T. C Hu, Integer Programming and Network Flows, Addison-Wesley, Reading, Massachusetts (1970).Google Scholar
  8. 8.
    D. P. Bertsekas, “Notes on Optimal Routing and Flow Control for Communication Networks,” MIT report No. LIDS-1169, December (1981).Google Scholar
  9. 9.
    E. W. Dijkstra, “A Note on Two Problems in Connection with Graphs,” Numer. Math., 1, 269–271 (1959).MathSciNetMATHCrossRefGoogle Scholar
  10. 10.
    A. V. Aho, J. E. Hopcroft, and J. D. Ullman, Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Massachusetts (1974).MATHGoogle Scholar
  11. 11.
    P. M. Merlin and A. Segall, “A Fail-Safe Distributed Routing Protocol,” IEEE Transactions on Communications, COM-27(9), 1280–1287, September (1979).MathSciNetCrossRefGoogle Scholar
  12. 12.
    S. E. Dreyfus, “An Appraisal of Some Shortest-Path Algorithms,” Operations Research, 17, 395–412(1969).MATHCrossRefGoogle Scholar
  13. 13.
    S. Warshall, “A Theorem on Boolean Matrices,” Journal of the ACM, 9, 11–12 (1962).MathSciNetMATHCrossRefGoogle Scholar
  14. 14.
    R. W. Floyd, “Algorithm 97, Shortest Path,” Communications of the ACM, 5, 345 (1962).CrossRefGoogle Scholar
  15. 15.
    W. Hoffman and R. Pavley, “A Method for the Solution of the Nth Best-Path Problem,” Journal of the ACM, 6, 506–514 (1959).MathSciNetMATHCrossRefGoogle Scholar
  16. 16.
    G. B. Danzig, Linear Programming and Extensions, Princeton University Press, Princeton, New Jersey (1962).Google Scholar
  17. 17.
    G. Hadley, Linear Programming, Addison-Wesley, Reading, Massachusetts (1964).Google Scholar
  18. 18.
    H. Frank and J. Frisch, “Planning Computer-Communication Networks,” Computer Com- munication Networks, N. Abramson and F. Kuo, editors, Prentice-Hall, Englewood Cliffs, New Jersey (1973).Google Scholar
  19. 19.
    L. Fratta, M. Gerla, and L. Kleinrock, “The Flow Deviation Method: An Approach to Store-and-Forward Communication Network Design,” Networks, 3, 97–133 (1973).MathSciNetMATHCrossRefGoogle Scholar
  20. 20.
    D. G. Cantor and M. Gerla, “Optimal Routing in a Packet-Switched Computer Network,” IEEE Transactions on Computers C-23(10), 1062–1069, October (1974).MathSciNetCrossRefGoogle Scholar
  21. 21.
    D. P. Bertsekas, “On the Goldstein-Levitin-Poljak Gradient Projection Method,” IEEE Transactions on Automatic Control AC-21, 174–184 (1976).MathSciNetCrossRefGoogle Scholar
  22. 22.
    D. P. Bertsekas, E. M. Gafni, and R. G. Gallager, “Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks,” to be published, IEEE Transactionson Communications (1984).Google Scholar
  23. 23.
    R. G. Gallager, “A Minimum Delay Routing Algorithm Using Distributed Computation,” IEEE Transactions on Communications, COM-25(l), 73–85, January (1977).MathSciNetCrossRefGoogle Scholar
  24. 24.
    S. J. Golestaani, “A Unified Theory of Flow Control and Routing in Data Communication Networks,” LIDS report No. TH-983, MIT, January (1980).Google Scholar
  25. 25.
    R. G. Gallager and S. J. Golestaani, “Flow Control and Routing Algorithms for Data Networks,” Proceedings of the Fifth International Conference on Computer Communication ICCC-80, Atlanta, October (1980), pp. 779–784.Google Scholar
  26. 26.
    J. M. McQuillan, “Adaptive Routing for Distributed Networks,” BBN report No. 2831, May (1974).Google Scholar
  27. 27.
    J. M. McQuillan, “The New Routing Algorithm for the ARPANET,” IEEE Transactions on Communications, COM-28, 711–719, May (1980).CrossRefGoogle Scholar
  28. 28.
    L. Tymes, “TYMNET—A Terminal-Oriented Communications Network,” Spring Joint Computer Conference, AFIPS Conference Proceedings, 38, 211 – 216 (1971).Google Scholar
  29. 29.
    A. Rajaraman, “Routing in TYMNET,” European Computing Conference, London, England, May (1978).Google Scholar
  30. 30.
    G. J. Foschini, “On Heavy Traffic Diffusion Analysis and Dynamic Routing in Packet-Switched Networks,” Computer Performance, K. M. Chandy and M. Reiser, editors, North-Holland, Amsterdam (1977).Google Scholar
  31. 31.
    G. J. Foschini and J. Salz, “A Basic Dynamic Routing Problem and Diffusion,” IEEE Transactions on Communications, COM-26(3), 320–327, March (1978).CrossRefGoogle Scholar

Copyright information

© Plenum Press, New York 1984

Authors and Affiliations

  • Jeremiah F. Hayes
    • 1
  1. 1.Concordia UniversityMontrealCanada

Personalised recommendations