Optimality of soft-threshold policy for call admission control with packet loss constraint
By use of the complementary slackness condition for linear programming, we prove analytically that for a statistical multiplexer allocating link bandwidth to connections of a single traffic class as based on the number of connections in progress, the connection admission control policy which maximizes the probability of admission subject to a packet loss quality of service requirement is of "soft-threshold" type.