Analysis of tentative accommodating and congestion confirming strategy: a novel admission control strategy for packet switching networks

We previously introduced a concept for admission control in packet switching networks that makes deploying a centralized management agent and collecting resource information in advance unnecessary. The new concept is to tentatively accommodate incoming flows and decide whether or not they can be accommodated after an observation period. We called the admission control scheme based on this concept as tentative accommodating and congestion confirming strategy (TACCS). We have now modeled a TACCS system by combining M^X /M/c/c loss and M/G/1/K queuing systems and mathematically analyzed its performance and characteristics. The analytical results showed that TACCS enables a domain to control admission without using a signalling scheme or a centralized management agent. We have also provided guidelines for configuring the values of parameters for TACCS.