Efficient service provisioning through dynamic service task assignment in a multi-domain distributed computing environment

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.