The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
On quadratic adaptive routing algorithms
Communications of the ACM
An analysis of traffic handling capacity of packet switched and circuit switched networks
DATACOMM '73 Proceedings of the third ACM symposium on Data communications and Data networks: Analysis and design
The design of store-and-forward (s/f) networks for computer communications
The design of store-and-forward (s/f) networks for computer communications
Adaptive routing techniques for message switching computer-communication networks
Adaptive routing techniques for message switching computer-communication networks
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Communication nets; stochastic message flow and delay
Communication nets; stochastic message flow and delay
Computer network development to achieve resource sharing
AFIPS '70 (Spring) Proceedings of the May 5-7, 1970, spring joint computer conference
Analytic and simulation methods in computer network design
AFIPS '70 (Spring) Proceedings of the May 5-7, 1970, spring joint computer conference
| Hi-index | 0.00 |
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.