Throughput Maximization Under Quality of Service Constraints: Determination of Optimal Offered Load in Circuit-Switched (Wireless or Nonwireless) Communication Networks

摘要

We consider the determination of the offered load that maximizes throughput in circuit-switched multihop networks, subject to quality of service (QoS) constraints on circuit blocking probability. This problem is of interest in network design for sizing the service capabilities that can be provided, and thereby providing a measure of network capacity. Lagrangian techniques are used to formulate this nonlinear optimization problem, which incorporates nonlinear inequality constraints. We then describe a heuristic technique that guides the search more directly toward the optimal solution, thereby resulting in faster and more-reliable convergence. We show that the degree of increase in throughput obtainable when the optimal values of offered load are used varies greatly among the examples we have studied, and can be dramatic in some cases. We demonstrate the effectiveness and robustness of our approach by comparing 18 versions of our algorithm for several network examples. Finally, the relationships between admission control and optimization of offered load are discussed.