Dynamically traveling web service clustering based on spatial and temporal aspects

Traditional web service orchestration is always implemented by business process work flow or I/O matching, just takingWhat services provide and How to provide. But this method will invoke some problems including too many composite results, inefficiency, and useless service composition without taking...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Hao, Yang, Junliang, Chen, Xiangwu, Meng, Bingyu, Qiu
Format: Tagungsbericht
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 357
container_issue
container_start_page 348
container_title
container_volume
creator Hao, Yang
Junliang, Chen
Xiangwu, Meng
Bingyu, Qiu
description Traditional web service orchestration is always implemented by business process work flow or I/O matching, just takingWhat services provide and How to provide. But this method will invoke some problems including too many composite results, inefficiency, and useless service composition without taking account of When and Where services are provided. Based on divide-and-conquer rule, this paper provides a clustering algorithm based on spatial & temporal aspects which are used to describe spatial and temporal attributes of services, so When and Where are provided for service composition. After composite services cluster by cluster, the whole complex service is created and is sure to satisfy the time and space constraints. Testing cases illustrate that complex traveling services can be created and is optimized to meet users' requests.
doi_str_mv 10.5555/1784542.1784598
format Conference Proceeding
fullrecord <record><control><sourceid>acm</sourceid><recordid>TN_cdi_acm_books_10_5555_1784542_1784598_brief</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>acm_books_10_5555_1784542_1784598</sourcerecordid><originalsourceid>FETCH-LOGICAL-a227t-d981ccd005f735ec34f0d02b2dea89bc7b49be354ac528c3d6819ff9a2b1eff73</originalsourceid><addsrcrecordid>eNqNkE1LxDAQhgMiqOuevebopTUfzaY5yvqxwoIgei6TZCLV9IOmruy_t9X-AN_Lyww8w_AQcsVZrqbccF0WqhD5b5vyhFxIVTC9EYYXZ2Sd0gebIrnSRp2Tl7tjC03tIMYjHQc4YKzbd_qNliYcDrVD6uJXGnGY1xYSetq1NPUw1hAptJ6O2PTdMA-pRzemS3IaICZcL70ibw_3r9tdtn9-fNre7jMQQo-ZNyV3zjOmgpYKnSwC80xY4RFKY522hbE4_Q5OidJJvym5CcGAsBzDxKxI_ncXXFPZrvtMFWfV7KBaHFSLg8oONYYJuP4nIH8ARqRfdA</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Dynamically traveling web service clustering based on spatial and temporal aspects</title><source>Springer Books</source><creator>Hao, Yang ; Junliang, Chen ; Xiangwu, Meng ; Bingyu, Qiu</creator><contributor>Parsons, Jaffrey ; Trujillo, Juan ; Chen, Yi-Ping Phoebe ; Doerr, Martin ; Cerfi, Samira Si-Saïd ; Poels, Geert ; Yu, Eric ; Kirchberg, Markus ; Rundensteiner, Elke A. ; Bertolotto, Michela ; Han, Hyoil ; Hartmann, Sven ; Hainaut, Jean-Luc ; Rolland, Colette ; Zimányi, Esteban ; Brochhausen, Mathias</contributor><creatorcontrib>Hao, Yang ; Junliang, Chen ; Xiangwu, Meng ; Bingyu, Qiu ; Parsons, Jaffrey ; Trujillo, Juan ; Chen, Yi-Ping Phoebe ; Doerr, Martin ; Cerfi, Samira Si-Saïd ; Poels, Geert ; Yu, Eric ; Kirchberg, Markus ; Rundensteiner, Elke A. ; Bertolotto, Michela ; Han, Hyoil ; Hartmann, Sven ; Hainaut, Jean-Luc ; Rolland, Colette ; Zimányi, Esteban ; Brochhausen, Mathias</creatorcontrib><description>Traditional web service orchestration is always implemented by business process work flow or I/O matching, just takingWhat services provide and How to provide. But this method will invoke some problems including too many composite results, inefficiency, and useless service composition without taking account of When and Where services are provided. Based on divide-and-conquer rule, this paper provides a clustering algorithm based on spatial &amp; temporal aspects which are used to describe spatial and temporal attributes of services, so When and Where are provided for service composition. After composite services cluster by cluster, the whole complex service is created and is sure to satisfy the time and space constraints. Testing cases illustrate that complex traveling services can be created and is optimized to meet users' requests.</description><identifier>ISBN: 3540762914</identifier><identifier>ISBN: 9783540762911</identifier><identifier>DOI: 10.5555/1784542.1784598</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer-Verlag</publisher><ispartof>Proceedings of the 2007 conference on Advances in conceptual modeling: foundations and applications, 2007, p.348-357</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>309,310,776,780,785,786,27902</link.rule.ids></links><search><contributor>Parsons, Jaffrey</contributor><contributor>Trujillo, Juan</contributor><contributor>Chen, Yi-Ping Phoebe</contributor><contributor>Doerr, Martin</contributor><contributor>Cerfi, Samira Si-Saïd</contributor><contributor>Poels, Geert</contributor><contributor>Yu, Eric</contributor><contributor>Kirchberg, Markus</contributor><contributor>Rundensteiner, Elke A.</contributor><contributor>Bertolotto, Michela</contributor><contributor>Han, Hyoil</contributor><contributor>Hartmann, Sven</contributor><contributor>Hainaut, Jean-Luc</contributor><contributor>Rolland, Colette</contributor><contributor>Zimányi, Esteban</contributor><contributor>Brochhausen, Mathias</contributor><creatorcontrib>Hao, Yang</creatorcontrib><creatorcontrib>Junliang, Chen</creatorcontrib><creatorcontrib>Xiangwu, Meng</creatorcontrib><creatorcontrib>Bingyu, Qiu</creatorcontrib><title>Dynamically traveling web service clustering based on spatial and temporal aspects</title><title>Proceedings of the 2007 conference on Advances in conceptual modeling: foundations and applications</title><description>Traditional web service orchestration is always implemented by business process work flow or I/O matching, just takingWhat services provide and How to provide. But this method will invoke some problems including too many composite results, inefficiency, and useless service composition without taking account of When and Where services are provided. Based on divide-and-conquer rule, this paper provides a clustering algorithm based on spatial &amp; temporal aspects which are used to describe spatial and temporal attributes of services, so When and Where are provided for service composition. After composite services cluster by cluster, the whole complex service is created and is sure to satisfy the time and space constraints. Testing cases illustrate that complex traveling services can be created and is optimized to meet users' requests.</description><isbn>3540762914</isbn><isbn>9783540762911</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2007</creationdate><recordtype>conference_proceeding</recordtype><sourceid/><recordid>eNqNkE1LxDAQhgMiqOuevebopTUfzaY5yvqxwoIgei6TZCLV9IOmruy_t9X-AN_Lyww8w_AQcsVZrqbccF0WqhD5b5vyhFxIVTC9EYYXZ2Sd0gebIrnSRp2Tl7tjC03tIMYjHQc4YKzbd_qNliYcDrVD6uJXGnGY1xYSetq1NPUw1hAptJ6O2PTdMA-pRzemS3IaICZcL70ibw_3r9tdtn9-fNre7jMQQo-ZNyV3zjOmgpYKnSwC80xY4RFKY522hbE4_Q5OidJJvym5CcGAsBzDxKxI_ncXXFPZrvtMFWfV7KBaHFSLg8oONYYJuP4nIH8ARqRfdA</recordid><startdate>20071105</startdate><enddate>20071105</enddate><creator>Hao, Yang</creator><creator>Junliang, Chen</creator><creator>Xiangwu, Meng</creator><creator>Bingyu, Qiu</creator><general>Springer-Verlag</general><scope/></search><sort><creationdate>20071105</creationdate><title>Dynamically traveling web service clustering based on spatial and temporal aspects</title><author>Hao, Yang ; Junliang, Chen ; Xiangwu, Meng ; Bingyu, Qiu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a227t-d981ccd005f735ec34f0d02b2dea89bc7b49be354ac528c3d6819ff9a2b1eff73</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2007</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hao, Yang</creatorcontrib><creatorcontrib>Junliang, Chen</creatorcontrib><creatorcontrib>Xiangwu, Meng</creatorcontrib><creatorcontrib>Bingyu, Qiu</creatorcontrib></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hao, Yang</au><au>Junliang, Chen</au><au>Xiangwu, Meng</au><au>Bingyu, Qiu</au><au>Parsons, Jaffrey</au><au>Trujillo, Juan</au><au>Chen, Yi-Ping Phoebe</au><au>Doerr, Martin</au><au>Cerfi, Samira Si-Saïd</au><au>Poels, Geert</au><au>Yu, Eric</au><au>Kirchberg, Markus</au><au>Rundensteiner, Elke A.</au><au>Bertolotto, Michela</au><au>Han, Hyoil</au><au>Hartmann, Sven</au><au>Hainaut, Jean-Luc</au><au>Rolland, Colette</au><au>Zimányi, Esteban</au><au>Brochhausen, Mathias</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Dynamically traveling web service clustering based on spatial and temporal aspects</atitle><btitle>Proceedings of the 2007 conference on Advances in conceptual modeling: foundations and applications</btitle><date>2007-11-05</date><risdate>2007</risdate><spage>348</spage><epage>357</epage><pages>348-357</pages><isbn>3540762914</isbn><isbn>9783540762911</isbn><abstract>Traditional web service orchestration is always implemented by business process work flow or I/O matching, just takingWhat services provide and How to provide. But this method will invoke some problems including too many composite results, inefficiency, and useless service composition without taking account of When and Where services are provided. Based on divide-and-conquer rule, this paper provides a clustering algorithm based on spatial &amp; temporal aspects which are used to describe spatial and temporal attributes of services, so When and Where are provided for service composition. After composite services cluster by cluster, the whole complex service is created and is sure to satisfy the time and space constraints. Testing cases illustrate that complex traveling services can be created and is optimized to meet users' requests.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer-Verlag</pub><doi>10.5555/1784542.1784598</doi><tpages>10</tpages></addata></record>
fulltext fulltext
identifier ISBN: 3540762914
ispartof Proceedings of the 2007 conference on Advances in conceptual modeling: foundations and applications, 2007, p.348-357
issn
language eng
recordid cdi_acm_books_10_5555_1784542_1784598_brief
source Springer Books
title Dynamically traveling web service clustering based on spatial and temporal aspects
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-31T02%3A30%3A25IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-acm&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Dynamically%20traveling%20web%20service%20clustering%20based%20on%20spatial%20and%20temporal%20aspects&rft.btitle=Proceedings%20of%20the%202007%20conference%20on%20Advances%20in%20conceptual%20modeling:%20foundations%20and%20applications&rft.au=Hao,%20Yang&rft.date=2007-11-05&rft.spage=348&rft.epage=357&rft.pages=348-357&rft.isbn=3540762914&rft.isbn_list=9783540762911&rft_id=info:doi/10.5555/1784542.1784598&rft_dat=%3Cacm%3Eacm_books_10_5555_1784542_1784598%3C/acm%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true