The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The design of store-and-forward (s/f) networks for computer communications
The design of store-and-forward (s/f) networks for computer communications
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Communication nets; stochastic message flow and delay
Communication nets; stochastic message flow and delay
Analytic and simulation methods in computer network design
AFIPS '70 (Spring) Proceedings of the May 5-7, 1970, spring joint computer conference
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
This paper deals with the problem of discrete link capacity assignment in store-and-forward packet switching communication networks. Our problem formulation calls for minimizing the network cost while satisfying all the average packet delay constraints specified for different classes of packets. Heuristic algorithms which give near-optimal solutions of the problem are developed. We first describe a discrete link capacity assignment algorithm for networks with arbitrarily defined classes of packets having individual delay constraints. The problem of priority assignment on different classes of packets is then investigated, and an algorithm is developed which assigns suboptimal priorities on classes of packets based on parameters such as delay requirement, path length, packet length, and packet rate. These two algorithms for capacity assignment and priority assignment are combined and tested over a number of examples. It is found that a substantial reduction on network cost can be achieved by the use of a simple priority queuing discipline.