By Topic

Services Computing, IEEE Transactions on

Issue 2 • Date April-June 2009

Filter Results

Displaying Results 1 - 7 of 7
  • Services Design and Optimization

    Page(s): 93
    Save to Project icon | Request Permissions | PDF file iconPDF (36 KB)  
    Freely Available from IEEE
  • Mismatch Patterns and Adaptation Aspects: A Foundation for Rapid Development of Web Service Adapters

    Page(s): 94 - 107
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (960 KB) |  | HTML iconHTML  

    Standardization in Web services simplifies integration. However, it does not remove the need for adapters due to possible heterogeneity among service interfaces and protocols. In this paper, we characterize the problem of Web services adaptation focusing on business interfaces and protocols adapters. Our study shows that many of the differences between business interfaces and protocols are recurring. We introduce mismatch patterns to capture these recurring differences and to provide solutions to resolve them. We leverage mismatch patterns for service adaptation with two approaches: by developing stand-alone adapters and via service modification. We then dig into the notion of adaptation aspects that, following aspect-oriented programming paradigm and service modification approach, allow for rapid development of adapters. We present a study showing that it is a preferable approach in many cases. The proposed approach is implemented in a proof-of-concept prototype tool, and evaluated using both qualitative and quantitative methods. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing Service Systems Based on Application-Level QoS

    Page(s): 108 - 121
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (807 KB) |  | HTML iconHTML  

    Making software systems service-oriented is becoming the practice, and an increasingly large number of service systems play important roles in today's business and industry. Currently, not enough attention has been paid to the issue of optimization of service systems. In this paper, we argue that the key elements to be considered in optimizing service systems are robustness, system orientation, and being dynamic and transparent. We present our solution to optimizing service systems based on application-level QoS management. Our solution incorporates three capabilities, i.e., 1) the ability to cater to the varying rigidities on Web service QoS in distinct application domains and of various users in a robust and heuristic manner, 2) the ability to formulate the overall system utility of a service system perceived by a particular system end user and to suggest its maximization using a utility model incorporated into a three-dimensional weighting scheme, and 3) the ability to dynamically achieve a higher perceived system utility of a service system via transparent negotiations. The calculation of the system utility encompasses a negotiation algorithm and a robust search algorithm for selecting heuristically best Web services. The effectiveness of the proposed algorithms and our solution is demonstrated by simulation experiments and our demo deployment, SSO. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mixed-Integer Programming for QoS-Based Web Service Matchmaking

    Page(s): 122 - 139
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1428 KB) |  | HTML iconHTML  

    QoS-based Web service (WS) discovery has been recognized as the main solution for filtering and selecting between functionally equivalent WSs stored in registries or other types of repositories. There are two main techniques for QoS-based WS matchmaking (filtering): ontology-based and constraint programming (CP)-based. Unfortunately, the first technique is not efficient as it is based on the rather immature technology of ontology reasoning, while the second one is not accurate as it is based on syntactic QoS-based descriptions and faulty matchmaking metrics. In our previous work, we have developed an extensible and rich ontology language for QoS-based WS description. Moreover, we have devised a semantic alignment algorithm for aligning QoS-based WS descriptions so as to increase the accuracy of QoS-based WS matchmaking algorithms. Finally, we have developed two alternative CP-based QoS-based WS matchmaking algorithms: a unary-constrained and n-ary-constrained one. In this paper, we claim that mixed-integer programming (MIP) should be used as a matchmaking technique instead of CP and we provide experimental results proving it. In addition, we analyze and experimentally evaluate our matchmaking algorithms against a competing techniques one in order to demonstrate their efficiency and accuracy. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Personalized Recommendation over a Customer Network for Ubiquitous Shopping

    Page(s): 140 - 151
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2249 KB) |  | HTML iconHTML  

    Personalization services in a ubiquitous computing environment-ubiquitous personalization services computing-are expected to emerge in diverse environments. Ubiquitous personalization must address limited computational power of personal devices and potential privacy issues. Such characteristics require managing and maintaining a client-side recommendation model for ubiquitous personalization. To implement the client-side recommendation model, this paper proposes buying-net, a customer network in ubiquitous shopping spaces. Buying-net is operated in a community, called the buying-net space, of devices, customers, and services that cooperate together to achieve common goals. The customers connect to the buying-net space using their own devices that contain software performing tasks of learning the customers' preferences, searching for similar customers for network formation, and generating recommendation lists of items. Buying-net attempts to improve recommendation accuracy with less computational time by focusing on local relationship of customers and newly obtained information. We experimented with such customer networks in the area of multimedia content recommendation and validated that buying-net outperformed a typical collaborative-filtering-based recommender system on accuracy as well as computational time. This shows that buying-net has good potential to be a system for ubiquitous shopping. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Choreographing Web Services

    Page(s): 152 - 166
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2092 KB) |  | HTML iconHTML  

    This paper introduces the multiagent protocols (MAP) Web service choreography language and demonstrates how service choreographies can be specified, verified, and enacted with a comparatively simple process language. MAP is a directly executable specification, services do not have to be preconfigured at design-time. Instead, a choreography, specified in MAP, can be sent dynamically to a group of distributed peers to execute at runtime. Furthermore, MAP is based on a formal foundation, this allows model checking of the choreography definition prior to live distribution and enactment. A motivating scenario, taken from the AstroGrid science use-cases, serves as the focal point for the paper and highlights the benefits of choreography, through data flow optimization and lack of centralized server. The MAP formal syntax and model checking environment are discussed in the context of the motivating scenario, along with MagentA, an implementation of MAP which provides a concrete, and open-source framework for the enactment of distributed choreographies. MAP is evaluated by demonstrating the languages conformance to the service interaction patterns, a collection of 13 recurring workflow patterns. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discovering Homogeneous Web Service Community in the User-Centric Web Environment

    Page(s): 167 - 181
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1866 KB) |  | HTML iconHTML  

    The Web has undergone a tremendous change toward a highly user-centric environment. Millions of users can participate and collaborate for their own interests and benefits. Services computing paradigm together with the proliferation of Web services have created great potential opportunities for the users, also known as service consumers, to produce value-added services by means of service discovery and composition. In this paper, we propose an efficient approach to facilitating the service consumer on discovering Web services. First, we analyze the service discovery requirements from the service consumer's perspective and outline a conceptual model of homogeneous Web service communities. The homogeneous service community contains two types of discovery: the search of similar operations and that of composible operations. Second, we describe a similarity measurement model for Web services by leveraging the metadata from WSDL, and design a graph-based algorithm to support both of the two discovery types. Finally, adopting the popular atom feeds, we design a prototype to facilitate the consumers to discover while subscribing Web services in an easy-of-use manner. With the experimental evaluation and prototype demonstration, our approach not only alleviates the consumers from time-consuming discovery tasks but also lowers their entry barrier in the user-centric Web environment. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

The scope covers all computing and software aspects of the science and technology of services innovation research and development. IEEE Transactions on Services Computing emphasizes the algorithmic, mathematical, statistical and computational methods that are central in services computing, the emerging field of Service Oriented Architecture, Web Services, Business Process Integration, Solution Performance Management, Services Operations and Management. Specifically, the transactions covers but is not limited to the following topics: Mathematical foundation of Services Computing, Service-Oriented Architecture (SOA), Service creation, development, and management, Linkage between IT services and business services, Web services security and privacy, Web services agreement and contract, Web services discovery and negotiation, Web services management, Web services collaboration, Quality of Service for Web services, Web services modeling and performance management, Solution frameworks for building service-oriented applications, Composite Web service creation and enabling infrastructures, Business and scientific applications using Web services and SOA, Business process integration and management using Web services, Standards and specifications of Services Computing, Utility models and solution architectures, Resource acquisition models in Utility Computing, Mathematical foundation of business process modeling, integration and management, Business process modeling, integration, and collaboration.

Additional Information:

TSC is a scholarly, archival journal published quarterly. 

It is noted that only service-oriented grid computing topics will be covered by TSC. 

Please be sure to visit the TSC Taxonomy List. [Link to http://www.computer.org/portal/web/tsc/taxonomy]

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Ling Liu
Georgia Institute of Technology
lingliu@cc.gatech.edu