Abstract
By composing distributed, autonomous services dynamically to provide new functionalities, service composition provides an attractive way for customized multimedia content production and delivery. Previous research work has addressed various aspects of service composition such as composibility, QoS-awareness, and load balancing. However, most of the work has focused on applications where data flow from a single source is processed by intermediate services and then delivered to a single destination. In this paper, we address the service composition problem for advanced multimedia applications where data flows from multiple content sources are processed and aggregated into a composite flow, which is then delivered to one or more destinations, possibly after being customized for each receiver. We formally define the problem and prove its NP hardness. We also design a heuristic algorithm to solve the problem. Our algorithm has the following attractive features: (1) it is effective at finding low cost composition solutions; (2) it has the ability to trade off computation overhead for better results; (3) it is efficient and can scale to relatively large number of network nodes and component services.
| Original language | English (US) |
|---|---|
| Article number | 23 |
| Pages (from-to) | 228-240 |
| Number of pages | 13 |
| Journal | Proceedings of SPIE - The International Society for Optical Engineering |
| Volume | 5680 |
| DOIs | |
| State | Published - 2005 |
| Event | Proceedings of SPIE-IS and T Electronic Imaging - Multimedia Computing and Networking 2005 - San Jose, CA, United States Duration: Jan 19 2005 → Jan 20 2005 |
Keywords
- Algorithm
- Quality of Service (QoS)
- Service composition
- Simulation
ASJC Scopus subject areas
- Electronic, Optical and Magnetic Materials
- Condensed Matter Physics
- Computer Science Applications
- Applied Mathematics
- Electrical and Electronic Engineering