Discrete channel assignment with message priority for packet-switched networks

Abstract

Optimal channel allocation with message priority is formulated as a mathematical programming problem, and it is shown that the exact solution is computationally impractical because of the combinatorial nature of the problem. A heuristic algorithm that is computationally very efficient is then developed to determine the optimal number of channels allocated to each link and the maximum user input rates with message priority for packetized traffic. Message priority is considered in the input rate flow control strategy, and a discrete number of channels is used in the optimization process.