Title :
An Efficient Approximation Scheme for the Multiple QoS Constraints Routing
Author :
Weijun Yang ; Yan Yang ; Xiaodong Wang ; Liang Yang
Author_Institution :
Dept. of Electromech. Eng., Guangzhou City Polytech., Guangzhou, China
Abstract :
It is vital to find a path that satisfies multiple Quality-of-Service (QoS) constraints with the deployment of current emerged services. However, it is not very efficient and effective at finding such a path for existing algorithms. In this paper, an improved version of fully polynomial time approximation scheme (IFPTAS) for multiple constraints path optimal (MCOP) problem was proposed. We find that the presented IFPTAS can find a -approximation path in the network with time complexity (where m is the number of edges and n is the number of nodes) by analyzing the proposed algorithm theoretically, which outperforms the previous best-known algorithm for MCOP.
Keywords :
computational complexity; graph theory; polynomial approximation; quality of service; telecommunication network routing; (1 + ε)-approximation path; IFPTAS; MCOP problem; O(m n/ ε ) time complexity; improved version-of-fully polynomial time approximation scheme; multiple QoS constraint routing; multiple constraint path optimal problem; multiple quality-of-service constraints; Algorithm design and analysis; Approximation algorithms; Approximation methods; Measurement; Polynomials; Quality of service; Routing; Approximation algorithm; Multiple constraints; QoS routing;
Conference_Titel :
Computational Intelligence and Security (CIS), 2014 Tenth International Conference on
Conference_Location :
Kunming
Print_ISBN :
978-1-4799-7433-7
DOI :
10.1109/CIS.2014.84
