Network Design Techniques
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.
KeywordsProbability Density Function Span Tree Traffic Flow Network Design Central Site
Unable to display preview. Download preview PDF.
- 1.R. C. Prim, Shortest connection networks and some generalizations, Bell Syst. Tech. J. 36 (6), 1389–1401 (1957).Google Scholar
- 4.F. Boesch, Introduction to basic network problems, Proc. Symp. Appl. Math. 26, 1–29 (1982).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
- 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
- G. Chartrand, Introduction to Graph Theory, reprinted by Dover, New York (1985).Google Scholar