Quality of Service Routing for Real-Time Applications Using the Analytical Hierarchy Process (Invited Paper)

Multimedia and real-time applications applied on the Internet require Quality of Service (QoS) routing algorithms; however, QoS routing is considered an NP-complete problem. This paper proposes an enhanced source based QoS routing algorithm that aims at reducing the complexity of route selection for services with multi QoS metrics. The algorithm uses the Analytic Hierarchy Process to find the best path between the service provider and the client that meets a list of constraints stored in a QoS profile; these constraints are specific for that particular service. Simulation results show that the algorithm finds a path with multiple metrics in scalable time; also the algorithm shows high ability to handle various types of multimedia and real-time applications