Robust connection acceptance control for ATM networks with incomplete source information

Consider an ATM resource where the statistics of each bursty traffic source are not precisely known. How should the resource decide when to accept fresh connections? The paper addresses this problem for the case where each source behaves as a simple ‘On-Off’ model and only the peak bandwidth is known. A connection acceptance control algorithm is proposed that relies on the choice of a boundary. The performance of this algorithm is analysed using an approximation based on separation of timescales. The slowly changing call process behaves like the queue process at an infinite server queue, where the arrival process to the queue is dictated by the fast moving burst process. A technique for finding a suitable boundary is also given, based on the Bayesian principle. The algorithm, together with the proposed boundary, could be used in a network to control connection accepance at each resource along a virtual path.