Download now Free registration required
Existing research work towards the composition of complex federated services has assumed that service requests and deliveries flow through a particular service path or tree. In this paper, the authors extend such a service model to a directed acyclic graph, allowing services to be delivered via parallel paths and interleaved with each other. Such an assumption of the service flow model has apparently introduced complexities towards the development of a distributed algorithm to federate existing services, as well as the provisioning of the required quality in the most resource-efficient fashion. To this end, they propose sFlow, a fully distributed algorithm to be executed on all service nodes, such that the federated service flow graph is resource efficient, performs well, and meets the demands of service consumers.
- Format: PDF
- Size: 164.96 KB