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 languageEnglish (US)
Article number23
Pages (from-to)228-240
Number of pages13
JournalProceedings of SPIE - The International Society for Optical Engineering
Volume5680
DOIs
StatePublished - Jul 21 2005
EventProceedings of SPIE-IS and T Electronic Imaging - Multimedia Computing and Networking 2005 - San Jose, CA, United States
Duration: Jan 19 2005Jan 20 2005

Fingerprint

Multimedia Applications
Service Composition
multimedia
Data Flow
Chemical analysis
NP-hardness
Load Balancing
Heuristic algorithm
Multimedia
Receiver
Heuristic algorithms
Trade-offs
Composite
Resource allocation
Quality of service
Hardness
Vertex of a graph
delivery
Composite materials
hardness

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

Cite this

Service composition for advanced multimedia applications. / Liang, Jin; Nahrstedt, Klara.

In: Proceedings of SPIE - The International Society for Optical Engineering, Vol. 5680, 23, 21.07.2005, p. 228-240.

Research output: Contribution to journalConference article

@article{acb04e4586264136ba38c596840486e4,
title = "Service composition for advanced multimedia applications",
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.",
keywords = "Algorithm, Quality of Service (QoS), Service composition, Simulation",
author = "Jin Liang and Klara Nahrstedt",
year = "2005",
month = "7",
day = "21",
doi = "10.1117/12.592307",
language = "English (US)",
volume = "5680",
pages = "228--240",
journal = "Proceedings of SPIE - The International Society for Optical Engineering",
issn = "0277-786X",
publisher = "SPIE",

}

TY - JOUR

T1 - Service composition for advanced multimedia applications

AU - Liang, Jin

AU - Nahrstedt, Klara

PY - 2005/7/21

Y1 - 2005/7/21

N2 - 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.

AB - 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.

KW - Algorithm

KW - Quality of Service (QoS)

KW - Service composition

KW - Simulation

UR - http://www.scopus.com/inward/record.url?scp=21844432429&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=21844432429&partnerID=8YFLogxK

U2 - 10.1117/12.592307

DO - 10.1117/12.592307

M3 - Conference article

AN - SCOPUS:21844432429

VL - 5680

SP - 228

EP - 240

JO - Proceedings of SPIE - The International Society for Optical Engineering

JF - Proceedings of SPIE - The International Society for Optical Engineering

SN - 0277-786X

M1 - 23

ER -