An optimized algorithm for abstraction based routing in connection oriented networks

Authors:
Rouhollah Mostafaei;Ali Habiboghli;Mohammad R. Maybodi
Affiliations:
Computer Engineering Department, Islamic Azad University, Khoy, Iran;Computer Engineering Department, Islamic Azad University, Khoy, Iran;Computer Engineering Department, Amirkabir University of Technology, Tehran, Iran
Venue:
SPECTS'09 Proceedings of the 12th international conference on Symposium on Performance Evaluation of Computer & Telecommunication Systems
Year:
2009

Citing 6
Cited 0

A theory of abstraction

Artificial Intelligence
Fiber Network Service Survivability

Fiber Network Service Survivability
Dynamic Routing in Telecommunications Networks

Dynamic Routing in Telecommunications Networks
Scaling Effects in the CSP Phase Transition

CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Where the really hard problems are

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.