Title :
QoS-Guaranteed Path Selection Algorithm for Service Composition
Author :
Jain, Manish ; Sharma, Puneet ; Banerjee, Sujata
Author_Institution :
Georgia Tech., Atlanta, GA
Abstract :
In this paper, QoS-guaranteed path selection algorithm for service composition is described. A heuristic algorithm, K-closest pruning (KCP), is used to solve the problem of multi-constraint service path selection for SON in polynomial time. The main feature of this algorithm is that the path selected by this algorithm meets all the QoS requirements specified by the user/application. The main idea in this approach is to leverage network proximity information to reduce search space, i.e. to reduce the number of qualified overlay nodes/links, for service path selection for a given request. This paper demonstrates the two distinct objectives reuse and load balancing and their use in modifying the path selection of KCP algorithm to achieve the objectives with affecting performance of KCP algorithm
Keywords :
IP networks; heuristic programming; quality of service; resource allocation; routing protocols; K-closest pruning; KCP algorithm; QoS-guaranteed path selection; SON; heuristic algorithm; load balancing; multiconstraint service; network proximity information; quality-of-service; service composition; service overlay networking; Aggregates; Bandwidth; Delay; Heuristic algorithms; Joining processes; Polynomials; Proposals; Resource management; Routing; Samarium;
Conference_Titel :
Quality of Service, 2006. IWQoS 2006. 14th IEEE International Workshop on
Conference_Location :
New Haven, CT
Print_ISBN :
1-4244-0476-2
Electronic_ISBN :
1548-615X
DOI :
10.1109/IWQOS.2006.250485
