A service path selection and adaptation algorithm for QoS assurance and load balancing in context-aware service overlay networks
by Kwonyong Lee; Sungyong Park
International Journal of Web and Grid Services (IJWGS), Vol. 11, No. 3, 2015

Abstract: As services are becoming more complicated, service providers face with tremendous difficulties in developing their services. In this environment, a lot of component functions are provided by multiple service providers, and the providers also desire to reduce costs for providing their services. A context-aware service overlay network (CSON) is a promising architecture to meet those demands by dynamically composing service paths and reconfiguring them based on various contexts. This paper proposes a service path selection and adaptation algorithm that assures quality of services (QoS) and balances the loads at the same time. The algorithm also dynamically adapts to an optimal service path when it detects a large amount of unexpected service loads over the service path. Since our algorithm is to solve a variation of multi-constrained path selection problem, which is known to be NP-complete, we formulate the problem using ant colony optimisation algorithm.

Online publication date: Tue, 04-Aug-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Web and Grid Services (IJWGS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com