By Topic

Services Computing, IEEE Transactions on

Issue 2 • Date April-June 2008

Filter Results

Displaying Results 1 - 5 of 5
  • EIC Editorial: Introduction to the Knowledge Areas of Services Computing

    Page(s): 62 - 74
    Save to Project icon | Request Permissions | PDF file iconPDF (111 KB)  
    Freely Available from IEEE
  • A Secure Information Flow Architecture for Web Service Platforms

    Page(s): 75 - 87
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1251 KB) |  | HTML iconHTML  

    Current Web service platforms (WSPs) often perform all Web services-related processing, including security-sensitive information handling, in the same protection domain. Consequently, the entire WSP may have access to security-sensitive information, forcing us to trust a large and complex piece of software. To address this problem, we propose ISO-WSP, a new information flow architecture that decomposes current WSPs into a small trusted T-WSP to handle security-sensitive data and a large, legacy untrusted U-WSP that provides the normal WSP functionality. To achieve end-to-end security, the application code is also decomposed into a small trusted part and the remaining untrusted code. The trusted part encapsulates all accesses to security-sensitive data through a secure functional interface (SFI). To ease the migration of legacy applications to ISO-WSP, we developed tools to translate direct manipulations of security-sensitive data by the untrusted part into SFI invocations. Using a prototype implementation based on the Apache Axis2 WSP, we show that ISO-WSP reduces software complexity of trusted components by a factor of five, while incurring a modest performance overhead of few milliseconds per request. We also show that existing applications can be migrated to run on ISO-WSP with a few tens of lines of new and modified code. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Similarity-Based SOAP Multicast Protocol to Reduce Bandwith and Latency in Web Services

    Page(s): 88 - 103
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1751 KB) |  | HTML iconHTML  

    Web Services technology provided several advantages over other technologies, however it still has serious limitations, including high latency and high protocol overhead. To improve performance, SOAP network traffic needs to be substantially reduced. This paper presents a novel approach, called similarity-based SOAP multicast protocol (SMP), to address the issue of latency. SMP reduces network traffic by aggregating syntactically similar SOAP messages to form a "compact SMP message";. The addresses of clients are encoded as strings in the SMP message header. The similarity of SOAP messages is measured in pairs and is based both on the message template and on the values of each XML tag in the messages. Each XML node in a SOAP message is indexed with an identifier and its position in the SOAP message. Only the indexed form of a SOAP message is sent to clients. Intermediary routers along the paths from server to clients parse the content of each SMP message passing through them and perform necessary operations to forward it to neighbouring routers. Experiments show that SMP can achieve up to 70% reduction in network traffic compared to traditional SOAP unicast. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Web Service Selection for Reliable Web Service Composition

    Page(s): 104 - 116
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (778 KB) |  | HTML iconHTML  

    This paper studies the dynamic web service selection problem in a failure-prone environment, which aims to determine a subset of Web services to be invoked at run-time so as to successfully orchestrate a composite web service. We observe that both the composite and constituent web services often constrain the sequences of invoking their operations and therefore propose to use finite state machine to model the permitted invocation sequences of Web service operations. We assign each state of execution an aggregated reliability to measure the probability that the given state will lead to successful execution in the context where each web service may fail with some probability. We show that the computation of aggregated reliabilities is equivalent to eigenvector computation and adopt the power method to efficiently derive aggregated reliabilities. In orchestrating a composite Web service, we propose two strategies to select Web services that are likely to successfully complete the execution of a given sequence of operations. A prototype that implements the proposed approach using BPEL for specifying the invocation order of a web service is developed and served as a testbed for comparing our proposed strategies and other baseline Web service selection strategies. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coordinated Service Allocation through Flexible Reservation

    Page(s): 117 - 128
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1336 KB) |  | HTML iconHTML  

    Services are perishable and are simultaneously produced and consumed. A reservation is a traditional and effective means for coordinating service demand and supply. In recent years, computerized reservation systems have been used widely by many service vendors such as airline companies and hotels to satisfy their customer's demands and improve their profits. In this paper, we propose and describe a more flexible reservation method called "YuuZuu" reservation that motivates cooperation among customers with different preferences for services. It increases utilization of vendor-provided services. The DREAM reservation system, which is an implementation of "YuuZuu" reservation, comprises three functions: (1) reservation allocation, (2) demand analysis, and (3) price optimization. Preliminary experiments show that the DREAM reservation system outperforms a standard reservation system when some customers are insistent upon detailed preferences and others are not, which, we believe, reflects real-world conditions. 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]

Full Aims & Scope

Meet Our Editors

Ling Liu
Georgia Institute of Technology