An optimized algorithm for abstraction based routing in connection oriented networks

Communication networks are expected to offer a wide range of services to an increasingly large number of users, with a diverse range of quality of service. This calls for efficient control and management of these networks. We address the problem of quality-of-service routing, more specifically the planning of bandwidth allocation to communication demands. Shortest path routing is the traditional technique applied to this problem. However, this can lead to poor network utilization and even congestion. In this paper, we combine this technique with systematic search algorithm and heuristics which are derived from artificial intelligence (AI) to solve this problem more efficiently and empirical result shows that this algorithm works better than others in RAIN problem.