A Policy for Fast Connection Admission Control of Video Streams

"In this paper, we introduce a simple greedy policy for connection admission of video streams. We show that this simple policy produces, for moderate to high loads the same revenue as the revenue produced by a policy based on a Knapsack solution which maximizes the total network revenue. This simple policy is a potential good candidate for fast connection admission management in ATM networks."