Service composition using dynamic programming and concept service (CS) network

Research output: Contribution to conferencePaper

2 Citations (Scopus)

Abstract

The explosion of ecommerce and a need to automate internet based services has necessitated research into automated service composition. This research addresses the optimal selection of services in order to satisfy customer requests. In this paper, we develop a dynamic programming and concept service (CS) matrix based model to solve service composition problems under uncertainty (e.g., changes in customer queries and service provider availability) and derive an analytical optimal policy.

Original languageEnglish (US)
StatePublished - Jan 1 2011
Event61st Annual Conference and Expo of the Institute of Industrial Engineers - Reno, NV, United States
Duration: May 21 2011May 25 2011

Other

Other61st Annual Conference and Expo of the Institute of Industrial Engineers
CountryUnited States
CityReno, NV
Period5/21/115/25/11

Fingerprint

Dynamic programming
Chemical analysis
Explosions
Availability
Internet
Uncertainty

All Science Journal Classification (ASJC) codes

  • Industrial and Manufacturing Engineering

Cite this

Cui, L., Tirupatikumara, S. R., & Yao, T. (2011). Service composition using dynamic programming and concept service (CS) network. Paper presented at 61st Annual Conference and Expo of the Institute of Industrial Engineers, Reno, NV, United States.
Cui, Liying ; Tirupatikumara, Soundar Rajan ; Yao, Tao. / Service composition using dynamic programming and concept service (CS) network. Paper presented at 61st Annual Conference and Expo of the Institute of Industrial Engineers, Reno, NV, United States.
@conference{9391e2333da04f71b1a76784857d4d32,
title = "Service composition using dynamic programming and concept service (CS) network",
abstract = "The explosion of ecommerce and a need to automate internet based services has necessitated research into automated service composition. This research addresses the optimal selection of services in order to satisfy customer requests. In this paper, we develop a dynamic programming and concept service (CS) matrix based model to solve service composition problems under uncertainty (e.g., changes in customer queries and service provider availability) and derive an analytical optimal policy.",
author = "Liying Cui and Tirupatikumara, {Soundar Rajan} and Tao Yao",
year = "2011",
month = "1",
day = "1",
language = "English (US)",
note = "61st Annual Conference and Expo of the Institute of Industrial Engineers ; Conference date: 21-05-2011 Through 25-05-2011",

}

Cui, L, Tirupatikumara, SR & Yao, T 2011, 'Service composition using dynamic programming and concept service (CS) network' Paper presented at 61st Annual Conference and Expo of the Institute of Industrial Engineers, Reno, NV, United States, 5/21/11 - 5/25/11, .

Service composition using dynamic programming and concept service (CS) network. / Cui, Liying; Tirupatikumara, Soundar Rajan; Yao, Tao.

2011. Paper presented at 61st Annual Conference and Expo of the Institute of Industrial Engineers, Reno, NV, United States.

Research output: Contribution to conferencePaper

TY - CONF

T1 - Service composition using dynamic programming and concept service (CS) network

AU - Cui, Liying

AU - Tirupatikumara, Soundar Rajan

AU - Yao, Tao

PY - 2011/1/1

Y1 - 2011/1/1

N2 - The explosion of ecommerce and a need to automate internet based services has necessitated research into automated service composition. This research addresses the optimal selection of services in order to satisfy customer requests. In this paper, we develop a dynamic programming and concept service (CS) matrix based model to solve service composition problems under uncertainty (e.g., changes in customer queries and service provider availability) and derive an analytical optimal policy.

AB - The explosion of ecommerce and a need to automate internet based services has necessitated research into automated service composition. This research addresses the optimal selection of services in order to satisfy customer requests. In this paper, we develop a dynamic programming and concept service (CS) matrix based model to solve service composition problems under uncertainty (e.g., changes in customer queries and service provider availability) and derive an analytical optimal policy.

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

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

M3 - Paper

ER -

Cui L, Tirupatikumara SR, Yao T. Service composition using dynamic programming and concept service (CS) network. 2011. Paper presented at 61st Annual Conference and Expo of the Institute of Industrial Engineers, Reno, NV, United States.