=========================================================================== CALL FOR PAPERS =========================================================================== 1st Workshop on Service Discovery and Selection in SOA Ecosystems (SDS-SOA 2009) in conjunction with 12th International Conference on Business Information Systems (BIS 2009) Poznan, Poland April 29, 2008 /bis2009/wscfp.php?ws=sedss2009 =========================================================================== Deadline for submissions: February 23, 2009 =========================================================================== Taking into consideration the development of SOA and growing number of available Web services, it is reasonable to start perceiving services as real goods and not only as programmatic tools that facilitate the integration of IT systems. This perception is a first step to create SOA ecosystems with Web service markets that link requesters and providers, and support them in their transactions. Outsourcing of IT services to external vendors causes dependency and introduces new challenges. In particular, this applies to the quality of outsourced services. If a mission-critical service is sourced out to an external vendor, the provisioning of the required service and its quality is beyond immediate control of the service customer. The success of the companies depends heavily on the ability to discover and select the right service (meaning the best possible in the given market condition and clients' requirements i.e. given context) for the needs of business processes taking into account both functional and non-functional characteristic of a service. This suggests also a need for defining Web service quality models that may assure the requirements of service users and service providers. Providing correct and up-to-date service descriptions that can be matched against fine-grained search requests is essential for automated service discovery and selection, but it is not always feasible. A single service may provide quite broad, frequently changing, functionality. Describing all aspects of such a service may produce large descriptions that quickly become outdated and where frequent re-publishing may be not feasible. On the other hand, the intricacies of service functionality may depend on the customer at hand, the actual request and current business conditions. Moreover, service providers might not want to disclose some of the details of their functionality due to its sensitive character (e.g., pricing policy). In case of dynamic and customer dependent service, aspects like availability, price, delivery time and lead time cannot be statically described. Functionality offered by such services can be non-deterministic and cannot be generalized into static service descriptions which would be detailed enough for matching against fine grained search requests. Dynamic services call for the discovery and service model that would encompass information dynamism. Two possible directions can be pointed out: (1) user data dependence in service description, (2) support for information provisioning by interacting with a service during the discovery process. Strategies and service models utilizing dynamic information in service discovery and selection process should be further investigated. This workshop aims at gathering researchers and practitioners who present their original work in the topics of service interactions in service ecosystems with a special focus on the interactions mentioned above i.e. (dynamic) service discovery and selection. TOPICS OF INTEREST * Service description * Non-functional properties * Models and testing of quality of service * Service dynamic properties and user data dependence * Data structures for the needs of service ecosystems/marketplaces * Service discovery * Service matching * Dynamic discovery of services * Methods of service differentiation * Service selection * Optimal service selection * Context-aware service selection * Business rules-based service selection * Service ecosystems * Business models of service ecosystems * Web services marketplaces * Semantics in service ecosystems SUBMISSION * Long papers: max. 12 pages * Work-in-progress reports: max. 6 pages * Demo papers: max. 4 pages Papers must be submitted in PDF format according to Springer LNBIP template available from http://www.springer.com/east/home/computer/lncs?SGWID=5-164-7-487211-0. Submission system is available at http://www.easychair.org/conferences/?conf=sdssoa2009. Papers approved for presentation at SDS-SOA 2009 will be published in BIS 2009 workshop proceedings, as a volume in Springer's Lecture Notes in Business Information Processing (LNBIP) series. WORKSHOP FORMAT All authors of accepted papers as well as other participants will be asked to read accepted papers abstracts before the workshop (papers will be available on-line in advance) to facilitate discussion. Workshop participants will be also invited to take part in the BIS conference and other BIS workshops. IMPORTANT DATES * February 23, 2009 - submission deadline for papers (extended) * March 16, 2009 - notification of acceptance/rejection (new date) * March 25, 2009 - submission of final papers (new date) * April 29, 2008 - the workshop ORGANIZERS * Poznan University of Economics, Department of Information Systems (http://kie.ae.poznan.pl/) CHAIRS * Konstanty Haniewicz * Monika Kaczmarek * Maciej Zaremba * Dominik Zyskowski PROGRAM COMMITTEE * Konstanty Haniewicz, Poznan University of Economics, Poland * Monika Kaczmarek, Poznan University of Economics, Poland * Maciej Zaremba, DERI Galway, Ireland * Dominik Zyskowski, Poznan University of Economics, Poland * Natalia Kokash, CWI Amsterdam, The Netherlands * Ulrich Kuster, Friedrich Schiller University of Jena, Germany * Andre Ludwig, University of Leipzig, Germany * Ivan Markovic, SAP Research Centre, Karlsruhe * Raul Palma, Universidad Politecnica de Madrid, Spain * Laurentiu Vasiliu, DERI Galway, Ireland * Tomas Vitvar, STI2 Innsbruck, Austria * Raluca Zaharia, DERI Galway, Ireland ===========================================================================