Skip to main content
SpringerLink
Log in

Network Design Techniques

  • Chapter
Practical Computer Data Communications

Part of the book series: Applications of Communications Theory ((ACTH))

  • 163 Accesses

Abstract

In this chapter we consider a number of fundamental network design issues and present some potential techniques for solving them. The major emphasis is on the topological layout of links and nodes and the traffic flow through them. However, before getting down to specific details we shall first use a simple example to establish some basic subproblems associated with data communications network design.

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. R. C. Prim, Shortest connection networks and some generalizations, Bell Syst. Tech. J. 36 (6), 1389–1401 (1957).

    Google Scholar 

  2. R. S. Wilkov, Analysis and design of reliable computer networks, IEEE Trans. Commun. 20 (6), 660–678 (1972).

    Article  Google Scholar 

  3. H. Frank and I. T. Frisch, Network analysis, Sci. Am. 223, 94–103 (1970).

    Article  Google Scholar 

  4. F. Boesch, Introduction to basic network problems, Proc. Symp. Appl. Math. 26, 1–29 (1982).

    Google Scholar 

  5. D. J. Kleitman, Methods for investigating the connectivity of large graphs, IEEE Trans. Ckt. Thy. 16 (5), 232–233 (1969).

    Article  MathSciNet  Google Scholar 

  6. G. B. Dantzig, Reminiscences about the origins of linear programming, Oper. Res. Lett. 1 (2), 43–48 (1982).

    Article  MathSciNet  Google Scholar 

  7. M. Sakarovitch, Notes on Linear Programming, Van Nostrand Reinhold, New York (1971).

    MATH  Google Scholar 

  8. K. M. Chanady and R. A. Russell, The design of multipoint linkages in a teleprocessing tree network, IEEE Trans. Comput. 21 (10), 1062–1066 (1972).

    Article  Google Scholar 

  9. A. Kershenbaum and W. Chou, A unified algorithm for designing multidrop teleprocessing networks, IEEE Trans. Commun. 22 (11), 1762–1771 (1974).

    Article  Google Scholar 

  10. J. B. Kruskal, Jr., On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. Am. Math. Soc. 7, 48–50 (1956).

    Article  MathSciNet  MATH  Google Scholar 

  11. R. R. Boorstyn and H. Frank, Large-scale network topological optimization, IEEE Trans. Commun. 25 (1), 29–47 (1977).

    Article  MATH  Google Scholar 

  12. H. G. Dysart and N. D. Georganas, NEWCLUST: An algorithm for the topological design of two-level, multidrop teleprocessing networks, IEEE Trans. Commun. 26 (1), 55–62 (1978).

    Article  MATH  Google Scholar 

  13. J. R. Jackson, Jobshop-like queueing systems, Management Sci. 10 (1), 131–142 (1963).

    Article  Google Scholar 

  14. L. Kleinrock, Queueing Systems, Vol. II, Wiley, New York, (1976) Vol. II.

    MATH  Google Scholar 

  15. L. R. Ford and D. R. Fulkerson, Flows in Networks, Princeton University Press, Princeton, New Jersey (1962), Chap. 1.

    Google Scholar 

  16. H. Frank and I. T. Frisch, Communication, Transmission, and Transport Networks, Addison-Wesley, Reading, Massachusetts (1971), Chap. 3.

    Google Scholar 

  17. R. W. Floyd, Algorithm 97: Shortest path, Commun. ACM 5 (6), 345 (1962).

    Article  Google Scholar 

  18. E. W. Dijkstra, A note on two problems in connexion with graphs, Numerische Math. 1, 269–271 (1959).

    Article  MathSciNet  MATH  Google Scholar 

  19. H. Rudin, On routing and “delta routing”: A taxonomy and performance comparison of techniques for packet-switched networks, IEEE Trans. Commun. 24 (1), 42–59, (1976).

    Article  Google Scholar 

  20. M. Schwartz and T. E. Stern, Routing techniques used in computer communication networks, IEEE Trans. Commun. 28 (4) (1980), pp. 539–552.

    Article  Google Scholar 

  21. H. Frank, I. T. Frisch, and W. Chou, Topological considerations in the design of the ARPA computer network, Proc. AFIS Spring Joint Computer Conf (1970), pp. 581–587.

    Google Scholar 

  22. D. R. Cox and W. L. Smith, Queues, Wiley, New York (1961).

    Google Scholar 

  23. J. C. Little, A proof for the queueing formula: L = AW, Oper. Res. 9, 383–387 (1961).

    Article  MathSciNet  MATH  Google Scholar 

Suggested Readings

  • G. Chartrand, Introduction to Graph Theory, reprinted by Dover, New York (1985).

    Google Scholar 

  • L. R. Ford and D. R. Fulkerson, Flows in Networks, Princeton University Press, Princeton, New Jersey (1962).

    MATH  Google Scholar 

  • L. Kleinrock, Queueing Systems Vols. I and II, Wiley, New York (1975 and 1976).

    MATH  Google Scholar 

  • M. Schwartz, Computer-Communication Network Design and Analysis, Prentice-Hall, Englewood Cliffs, New Jersey (1977).

    MATH  Google Scholar 

  • J. F. Hayes, Modeling and Analysis of Computer Communications Networks, Plenum Press, New York (1984).

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. South TEC Associates, Huntsville, Alabama, USA

    William J. Barksdale

Authors
  1. William J. Barksdale
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Plenum Press, New York

About this chapter

Cite this chapter

Barksdale, W.J. (1986). Network Design Techniques. In: Practical Computer Data Communications. Applications of Communications Theory. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-5164-1_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-4684-5164-1_9

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4684-5166-5

  • Online ISBN: 978-1-4684-5164-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation