Sequential Routing Algorithm for Reliable M/G/m/m Networks Considering Realtime Admission Control

Abstract

In this paper, we study the problem of realtime admission control for M/G/m/m networks by using sequential routing algorithm. To accommodate different communication systems to generic network models, we model telephony systems as M/G/m/m networks. In general, there is a trade-off between quality of service, the implementation complexity of admission control algorithms, and system performance. Under the assumption of given average traffic demands and candidate routes for each O-D pair, we propose a sequential routing algorithm to decide realtime connection- setup sequence for reliable multiple-connectivity networks. The emphasis of this work is to develop a centralized sequential routing policy to support distributed realtime admission control for optimizing total revenue of generic M/G/m/m networks purpose. We formulate this algorithm as a combinatorial optimization problem, where the objective function is to minimize the average system call-blocking rate. For considering realtime admission control purpose, we decide the routing sequence for each O-D pair to optimize system performance by predicting aggregated traffic of each link and blocking probability of each O-D pair. We apply this algorithm as our kernel and develop a realtime admission control application for reliable wireless networks. That application can achieve up to 99% improvement of the total call-blocking rate.