A formal approach to design optimized multimedia service overlay
NOSSDAV '05 Proceedings of the international workshop on Network and operating systems support for digital audio and video
Resource-aware service composition for video multicast to heterogeneous mobile users
Proceedings of the first ACM international workshop on Multimedia service composition
Hourglass multimedia content and service composition framework for smart room environments
Pervasive and Mobile Computing
Deriving protocol specifications from service specifications written as predicate/transition-nets
Computer Networks: The International Journal of Computer and Telecommunications Networking
An integrated tool for development of overlay services
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
A tentative model for virtualized resource-aware dynamic media-oriented service composition
CFI '09 Proceedings of the 4th International Conference on Future Internet Technologies
Minimum cost service composition in service overlay networks
World Wide Web
Decentralized management of bi-modal network resources in a distributed stream processing platform
Journal of Parallel and Distributed Computing
Multimedia service composition for context-aware mobile computing
MMM'07 Proceedings of the 13th International conference on Multimedia Modeling - Volume Part II
Software defined traffic measurement with OpenSketch
nsdi'13 Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation
| Hi-index | 0.00 |
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, we 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, we propose sFlow, a fully distributedalgorithm 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.