A system for priority routing and capacity assignment in packet switched networks

A model and its associated solution procedure for the problem of concurrent flow and capacity assignment in a packet switched network are presented. The distinguishing feature of the model lies in the fact that a user defined priority level is associated with each message in the network. Different service requirements and message characteristics are associated with each message class. An algorithm that generates good feasible solutions to the model, together with tight lower bounds on the value of the objective function, is developed. Results of numerical experiments using several network topologies are reported.