Distributed admission control via dual-queue management

This paper introduces and studies a new queue management framework via the use of connection level information already embedded in existing data traffic. Our goal is to improve the system performance and resource utilization at times of intense network congestion. Under this framework, data packets and connection establishment packets are queued separately. Different queueing and dropping policies can then be applied to them, thus the term dual-queue management. This framework is stateless and does not require per-flow queueing or flow counting. Using examples of such policies our initial simulation shows that this scheme can lead to much higher performance and network resource utilization during severe congestion. It also leads to more robust and scalable network design. Moreover, it provides an attractive mechanism for network provisioning via parameter tuning.