A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is
For a bufferless statistical multiplexer allocating link bandwidth to a single class of connections with generally distributed call holding times, we study model-based call admission control (CAC) policies that map the number of calls in progress (state variable) to the admission decision (control variable). By formulating the CAC problem as a linear programming, establishing a convexity result, and applying the complementary slackness condition, we analytically prove that a randomizeddoi:10.1109/tac.2003.817929 fatcat:bgey6iw53jautpprdpnewff4mm