Heuristic Design Algorithm for Computer Communication Networks with Different Classes of Packets
Kiyoshi Maruyama, Luigi Fratta, Dandan Tang · IBM Journal of Research and Development · 1977
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 applications of the overall network design are also given.