Solutions to a complete web service discovery and composition

Mohammad A. Makhzan; Kwei Jay Lin

doi:10.1109/CEC-EEE.2006.83

Solutions to a complete web service discovery and composition

Mohammad A. Makhzan^*, Kwei Jay Lin

^*Corresponding author for this work

University of California at Irvine

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

Abstract

With the increasing number of web services and growingr demand for web service oriented computing, it is necessary to develop fast algorithms that could take a service requirement, and through compositional search of UDDI registered web services, find a cost effective (in terms of length of service response, total cost of composed services, minimal length of services, amount of space used for composition discovery) result. This paper describes two approaches for syntactic search, one for discovery of web services, without chaining, and the second one for the compositional chaining of web services with a front-to-end DAG based search approach. The assumption is that a user provides a XMLfile stating his required output and set of inputs, and the algorithm is supposed to identify one or a chain of services that does the job.

Original language	English
Title of host publication	Proceedings - CEC/EEE 2006
Subtitle of host publication	Joint Conference - 8th IEEE International Conference on E-Commerce and Technology (CEC 2006), 3rd IEEE International Conference on Enterprise Computing, E-Commerce
DOIs	https://doi.org/10.1109/CEC-EEE.2006.83
State	Published - 2006
Externally published	Yes
Event	CEC/EEE 2006 Joint Conferences - San Francisco, CA, United States Duration: 26 06 2006 → 29 06 2006

Publication series

Name	CEC/EEE 2006 Joint Conferences
Volume	2006

Conference

Conference	CEC/EEE 2006 Joint Conferences
Country/Territory	United States
City	San Francisco, CA
Period	26/06/06 → 29/06/06

Access to Document

10.1109/CEC-EEE.2006.83

Cite this

Makhzan, M. A., & Lin, K. J. (2006). Solutions to a complete web service discovery and composition. In Proceedings - CEC/EEE 2006: Joint Conference - 8th IEEE International Conference on E-Commerce and Technology (CEC 2006), 3rd IEEE International Conference on Enterprise Computing, E-Commerce Article 1640328 (CEC/EEE 2006 Joint Conferences; Vol. 2006). https://doi.org/10.1109/CEC-EEE.2006.83

@inproceedings{3f7633da093a4b7fa4819cb8584c5234,

title = "Solutions to a complete web service discovery and composition",

abstract = "With the increasing number of web services and growingr demand for web service oriented computing, it is necessary to develop fast algorithms that could take a service requirement, and through compositional search of UDDI registered web services, find a cost effective (in terms of length of service response, total cost of composed services, minimal length of services, amount of space used for composition discovery) result. This paper describes two approaches for syntactic search, one for discovery of web services, without chaining, and the second one for the compositional chaining of web services with a front-to-end DAG based search approach. The assumption is that a user provides a XMLfile stating his required output and set of inputs, and the algorithm is supposed to identify one or a chain of services that does the job.",

author = "Makhzan, {Mohammad A.} and Lin, {Kwei Jay}",

year = "2006",

doi = "10.1109/CEC-EEE.2006.83",

language = "英语",

isbn = "0769525113",

series = "CEC/EEE 2006 Joint Conferences",

booktitle = "Proceedings - CEC/EEE 2006",

note = "CEC/EEE 2006 Joint Conferences ; Conference date: 26-06-2006 Through 29-06-2006",

}

Makhzan, MA & Lin, KJ 2006, Solutions to a complete web service discovery and composition. in Proceedings - CEC/EEE 2006: Joint Conference - 8th IEEE International Conference on E-Commerce and Technology (CEC 2006), 3rd IEEE International Conference on Enterprise Computing, E-Commerce., 1640328, CEC/EEE 2006 Joint Conferences, vol. 2006, CEC/EEE 2006 Joint Conferences, San Francisco, CA, United States, 26/06/06. https://doi.org/10.1109/CEC-EEE.2006.83

Solutions to a complete web service discovery and composition. / Makhzan, Mohammad A.; Lin, Kwei Jay.
Proceedings - CEC/EEE 2006: Joint Conference - 8th IEEE International Conference on E-Commerce and Technology (CEC 2006), 3rd IEEE International Conference on Enterprise Computing, E-Commerce. 2006. 1640328 (CEC/EEE 2006 Joint Conferences; Vol. 2006).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Solutions to a complete web service discovery and composition

AU - Makhzan, Mohammad A.

AU - Lin, Kwei Jay

PY - 2006

Y1 - 2006

N2 - With the increasing number of web services and growingr demand for web service oriented computing, it is necessary to develop fast algorithms that could take a service requirement, and through compositional search of UDDI registered web services, find a cost effective (in terms of length of service response, total cost of composed services, minimal length of services, amount of space used for composition discovery) result. This paper describes two approaches for syntactic search, one for discovery of web services, without chaining, and the second one for the compositional chaining of web services with a front-to-end DAG based search approach. The assumption is that a user provides a XMLfile stating his required output and set of inputs, and the algorithm is supposed to identify one or a chain of services that does the job.

AB - With the increasing number of web services and growingr demand for web service oriented computing, it is necessary to develop fast algorithms that could take a service requirement, and through compositional search of UDDI registered web services, find a cost effective (in terms of length of service response, total cost of composed services, minimal length of services, amount of space used for composition discovery) result. This paper describes two approaches for syntactic search, one for discovery of web services, without chaining, and the second one for the compositional chaining of web services with a front-to-end DAG based search approach. The assumption is that a user provides a XMLfile stating his required output and set of inputs, and the algorithm is supposed to identify one or a chain of services that does the job.

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

U2 - 10.1109/CEC-EEE.2006.83

DO - 10.1109/CEC-EEE.2006.83

M3 - 会议稿件

AN - SCOPUS:33845865799

SN - 0769525113

SN - 9780769525112

T3 - CEC/EEE 2006 Joint Conferences

BT - Proceedings - CEC/EEE 2006

T2 - CEC/EEE 2006 Joint Conferences

Y2 - 26 June 2006 through 29 June 2006

ER -

Solutions to a complete web service discovery and composition

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this