Efficient service provisioning through dynamic service task assignment in a multi-domain distributed computing environment
by Malamati Louta, Angelos Michalas
International Journal of Internet Protocol Technology (IJIPT), Vol. 3, No. 3, 2008

Abstract: Highly competitive and open environments should encompass mechanisms that will assist Service Providers (SPs) in accounting for their interests, i.e., offering at a given period of time the adequate quality services in a cost-efficient manner. Assuming that a user wishes to access a specific service composed of a distinct set of service tasks, which can be served by various Candidate Service Nodes (CSNs), a problem that should be addressed is the assignment of service tasks to the most appropriate service nodes. The pertinent problem is concisely defined, optimally formulated and evaluated through simulation experiments on a real network test bed.

Online publication date: Sat, 25-Oct-2008

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 Internet Protocol Technology (IJIPT):
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