Two-stage dynamic optimisation of service processes with temporal constraints
by Helan Liang; Yanhua Du
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 9, No. 1/2, 2016

Abstract: In order to guarantee the successful execution of service processes in cloud computing, it is important to dynamically optimise service processes with temporal constraints at runtime. Recently, there exist some works related to this issue. However, they cannot adapt to mixture distributed situations where distributions of service durations are complex and diverse, and they seldom consider the adjustment penalties of service processes when compensating the temporal deficits. In this paper, an approach based on two-stage dynamic optimisation is proposed. In the first stage, we validate the temporal constraints by queuing network with considering both the uncertainty of queue time and operation time of services. In the second stage, a temporal adjustment model is designed where both temporal compensation requirements and adjustment penalties are considered, and the optimal adjustment solution is obtained by linear programming. Finally, our approach is illustrated by a real-life example in a business environment. Compared with the existing works, our approach can adapt to mixture distributed situations and obtain temporal optimisation solution with less adjustment penalties.

Online publication date: Fri, 12-Feb-2016

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 High Performance Computing and Networking (IJHPCN):
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