Optimal Link Weights for Maximizing QoS Traffic

In this paper we explore the optimal weight setting to maximize QoS traffic admissible to a hop-by-hop routing network (such as the Internet). We try to answer the following questions: (1) How much ingress and egress traffic can be admitted to a hop-by-hop routing network (such as the Internet) without causing congestion of any link, and (2) what is the optimal link weight setting that can maximize the amount of traffic admissible to the network? We first present a mixed-integer programming formulation to compute the optimal link weights that can maximize the ingress and egress QoS traffic admissible to a hop-by-hop routing network. We then present a heuristic search algorithm to find the optimal weights. The heuristic algorithm has a performance comparable to the optimal link weights, but its computation complexity is much lower.