Heuristic Design Algorithm for Computer Communication Networks with Different Classes of Packets

A typical operating environment of a packet switching (store-and-forward) computer communication network is that it is shared by many users with different classes of packets. Packets may be classified in a very general fashion by types of users, messages, applications, transactions, response time requirements, packet parameters such as packet rate and length, and by network parameters such as source-destination and path length. A well-designed network must provide access and performance assurance to all packet classes. This paper presents a heuristic algorithm for designing such a communication network. The algorithm presented contains heuristic algorithms for discrete link capacity assignment, priority assignment, and flow assignment problems with an additional feature which allows one to alter network topology interactively. Sample results from application of the overall network design are also given.

[1]  Leonard Kleinrock.  Analytic and simulation methods in computer network design , 1970, AFIPS '70 (Spring).

[2]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .

[3]  A. O. Allen,et al.  Elements of Queuing Theory for System Design , 1975, IBM Syst. J..

[4]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[5]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[6]  Bernd Werner Meister,et al.  On the Optimization of Message-Switching Networks , 1972, IEEE Trans. Commun..

[7]  Donald T. Tang,et al.  Discrete Link Capacity and Priority Assignments in Communication Networks , 1977, IBM J. Res. Dev..

[8]  Leonard Kleinrock,et al.  Analytic and simulation methods in computer network design , 1899, AFIPS '70 (Spring).

[9]  July , 1890, The Hospital.

[10]  M. Schwartz,et al.  The Gradient Projection Algorithm for Multiple Routing in Message-Switched Networks , 1976, IEEE Trans. Commun..

[11]  Mario Gerla,et al.  The design of store-and-forward (s/f) networks for computer communications , 1973 .

[12]  Wushow Chou,et al.  Routing in computer networks , 1971, Networks.

[13]  Leonard Kleinrock,et al.  Communication Nets: Stochastic Message Flow and Delay , 1964 .

[14]  Kazuo Itoh,et al.  An analysis of traffic handling capacity of packet switched and circuit switched networks , 1973, DATACOMM '73.

[15]  J. A. Tomlin,et al.  Minimum-Cost Multicommodity Network Flows , 1966, Oper. Res..

[16]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[17]  C. E. Agnew,et al.  On quadratic adaptive routing algorithms , 1976, CACM.

[18]  Leonard Kleinrock,et al.  Queueing Systems: Volume I-Theory , 1975 .

[19]  B. W. Meister,et al.  New Optimization Criteria for Message-Switching Networks , 1971 .

[20]  D. T. Tang,et al.  Discrete Link Capacity Assignment in Communication Networks , 1976, ICCC.

[21]  Gary Lee Fultz,et al.  Adaptive routing techniques for message switching computer-communication networks , 1972 .

[22]  Leonard Kleinrock,et al.  Theory, Volume 1, Queueing Systems , 1975 .

[23]  Barry D. Wessler,et al.  Computer network development to achieve resource sharing , 1899, AFIPS '70 (Spring).

[24]  Roy Daniel Rosner.  Circuit and Packet Switching , 1976, Comput. Networks.

[25]  Louis Pouzin.  Cigale, The Packet Switching Machine of the Cyclades Computer Network , 1974, IFIP Congress.