Skip to main content
SpringerLink
Log in
Book cover

Communications and Networks pp 299–324Cite as

The Routing Problem in Computer Networks

  • Chapter

Abstract

Few problems in the field of computer communication networks have received as early and extensive attention as the routing problem. The reason for this is twofold. First there have been numerous studies of flow problems in network theory that provide a basis for modeling the routing problem in a mathematically tractable way and, second, routing has proved to be a necessary and fundamental design choice for the operation of message- or packet- switched networks. In its simplest form the statement of the routing problem is as follows. Consider, as in Figure 12.1, a node that receives messages from an incoming link and has a choice of forwarding them via one of two outgoing links.

This is a preview of subscription content, 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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Fratta, M. Gerla and L. Kleinrock, The flow deviation method - an approach to store-and-forward communication network design, Networks, Vol. 3, pp. 97–133, 1973.

    Article  MathSciNet  MATH  Google Scholar 

  2. L. Kleinrock, Communication Nets, New York, NY: McGraw-Hill, 1964.

    Google Scholar 

  3. J.R. Jackson, Networks of waiting lines, Operations Research, Vol. 5, pp. 518–521, 1957.

    Article  MathSciNet  Google Scholar 

  4. N. Abramson, The ALOHA system - another alternative for computer communications, AFIPS Conference Proceedings, FJCC 37, pp. 281–285, 1970.

    Google Scholar 

  5. L. Kleinrock, Queueing Systems, Vol. II, New York, NY: Wiley- Interscience, 1976.

    MATH  Google Scholar 

  6. R.G. Gallager, A minimum delay routing algorithm using distributed computation, IEEE Trans. Comm., Vol. COM-25, pp. 73–85, 1977.

    Google Scholar 

  7. A. Ephremides, Extension of an adaptive distributed routing algorithm to mixed media networks, IEEE Trans. Comm., Vol. COM-26, pp. 1262–1266, 1978.

    Google Scholar 

  8. D.P. Bertsekas, A class of optimal routing algorithms for communication networks, Proc. 5th Intl. Conf. Comp. Comm., pp. 71–76, 1980.

    Google Scholar 

  9. D.P. Bertsekas, Projected Newton methods for optimization problems with simple constraints, SI AM Jour. Cont. Opt., Vol. 20, pp. 221–246, 1982.

    Article  MathSciNet  MATH  Google Scholar 

  10. R.G. Gallager and S.J. Golestaani, Flow control and routing algorithms for data networks, Proc. 5th Intl. Conf. Comp. Comm., pp. 779–784, 1980.

    Google Scholar 

  11. D. Bertsekas, Dynamic behavior of shortest path routing algorithms for communication networks, IEEE Trans, on Auto. Cont., Vol. AC-27, pp. 60–74, 1982.

    Google Scholar 

  12. P. Merlin and A. Segall, A failsafe distributed routing protocol, IEEE Trans. Comm., Vol. COM-27, pp. 1280–1287, 1979.

    Google Scholar 

  13. A. Segall and B. Awerbuch, A reliable broadcast protocol, Proc. of INFOCOM, pp. 103 - 107, 1983.

    Google Scholar 

  14. F. Zerbib and A. Segall, A distributed shortest path protocol, LIDS-P- 1102 report, MIT, June, 1981.

    Google Scholar 

  15. J. Hagouel, Source routing and a distributed algorithm to implement it, Proc. of INFOCOM, pp. 115–123, 1983.

    Google Scholar 

  16. A.E. Baratz and J.M. Jaffe, Establishing virtual circuits in large computer networks, Proc. of INFOCOM, pp. 311–318, 1983.

    Google Scholar 

  17. M. Weber and A. Ephremides, A simulated performance study of some distributed routing algorithms for mobile radio networks, Proc. Conf. Inform. Sci. Sys., Johns Hopkins University, 1983.

    Google Scholar 

  18. J.E. Wieselthier, D.J. Baker, A. Ephremides and D.N. McGregor, Preliminary system concept for an HF intra-task force communication network, NRL Report 8637, 1983.

    Google Scholar 

  19. D.J. Baker and A. Ephremides, The architectural organization of a mobile radio network via a distributed algorithm, IEEE Trans. Comm., Vol. COM-29, pp. 1694–1701, 1981.

    Google Scholar 

  20. D.J Baker, A. Ephremides and J.E. Wieselthier, A distributed algorithm for scheduling the activation of links in a self-organizing, mobile, radio network, Proc. of the ICC, Philadelphia, PA, June, 1982.

    Google Scholar 

  21. A. Ephremides, Distributed protocols for mobile radio networks, Proc. of NATO Advanced Study Institute on the Impact of Processing Techniques to Communications, Chateau Bonas, France, July, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, University of Maryland, College Park, Maryland, USA

    Anthony Ephremides

Authors
  1. Anthony Ephremides
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    Ian F. Blake

  2. Department of Electrical and Computer Engineering, University of Illinois at Urbana Champaign, 61801, Urbana, IL, USA

    H. Vincent Poor

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag New York Inc.

About this chapter

Cite this chapter

Ephremides, A. (1986). The Routing Problem in Computer Networks. In: Blake, I.F., Poor, H.V. (eds) Communications and Networks. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4904-7_13

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-4904-7_13

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-9354-5

  • Online ISBN: 978-1-4612-4904-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation