Issue 3 • Date July-Sept. 2011
Guest Editorial: Services Composition and Virtualization TechnologiesPublication Year: 2011 , Page(s): 181 - 182
Cited by: Papers (1)
Cited by: Papers (4)
Reliability is one of the key challenges of pervasive systems. Numerous message-oriented architectures and service discovery protocols have been proposed to support service management in pervasive systems. Nevertheless, few researches have been done to improve the reliability of pervasive systems. This paper attempts to propose a reliable service management framework by formally defining a message-oriented service application model and protocols that facilitate autonomous composition, failure detection, and recovery of services. Proposed approaches are realized by constructing a developer's toolkit that enables rapid-prototyping of services. We evaluate the proposed approach by first proving the reliability property and then conducting experiments on recovery rate and performance. The results show that the recovery rate can be greatly improved by the proposed approach. Furthermore, the services developed by using the proposed approach are capable of integrating heterogeneous software/hardware, and can be deployed in dissimilar sites with little efforts. View full abstract»
Service Level Agreements (SLAs) are currently one of the major research topics in Grid computing. Among many system components for supporting of SLA-aware Grid jobs, the SLA mapping module holds an important position and the capability of the mapping module depends on the runtime of the mapping algorithm. With the previously proposed algorithm to optimize the execution time of the workflow, the mapping module may develop into the bottleneck of the system if many requests come in during a short period of time. This paper presents a parallel mapping algorithm to optimize the execution time of the workflow, which can reduce the runtime of the mapping algorithm without reducing the quality of the mapping solutions. Performance measurements thereby deliver evaluation results showing the quality of the method. The speedup of the algorithms and the quality of the solutions are significantly improved when using eight CPUs comparing to using one CPU. View full abstract»
Nowadays, enterprises can provide computing services through their intranet networks by letting their available resources be used as virtual clusters for scientific computation during idle periods such as nights, weekends, and holidays. Generally, these idle periods do not permit to carry out the computations completely. It is therefore necessary to save the context of uncompleted applications for possible restart. This checkpointing mechanism is subject to resource constraints: the network bandwidth, the disk bandwidth, and the delay T imposed for releasing the workstations. We first introduce a function bw that gives the bandwidth bw(m,V) of a system during the checkpointing of m applications with aggregated memory requirement V. Assuming that this bandwidth is shared equitably among the applications, the scheduling problem becomes a sequence of knapsack problems with nonlinear constraints for which we propose approximate solutions. Experiments carried out on Grid5000 show that the running time of this algorithm is negligible compared to the delay T which is of the order of few minutes. This means that the proposed scheduling algorithm does not induce a significant overhead on the checkpointing process. As a consequence, our mechanism can be incorporated in a batch scheduler. View full abstract»
Building Quick Service Query List Using WordNet and Multiple Heterogeneous Ontologies toward More Realistic Service CompositionPublication Year: 2011 , Page(s): 216 - 229
Cited by: Papers (9)
Although semantic-based composition approaches have brought some comprehensive advantages such as higher precisions and recalls, they are far from the real practice and hard to be applied in real-world applications due to the several challenging issues such as performance issues of time-consuming ontology reasoning, exponentially expanded searching time in large service repositories, lack of available and consensus ontologies, and higher using thresholds for users who do not have much semantic knowledge. To reduce these issues, in this paper, we present an innovative composition technique by building an Extended Quick Service Query List (EQSQL) for supporting more efficient and more realistic service composition. In EQSQL, data structures are specially designed to record service information and their associated semantic concepts by in advance processing semantic-related computing during service publication period. Particularly, WordNet and semantic similarities among multiple heterogeneous ontologies are exploited in our developed algorithms for forming EQSQL. As a result, EQSQL-based planning algorithm can not only achieve a quick response for a composition request, but guarantee the semantic composition quality as well. More importantly, our approaches can be scalable to the large service repositories and also significantly alleviate users or developers from the burden of using complicated semantic service composition, thus making service composition easier and more realistic. Our final experiments further demonstrate the feasibility and the efficiency of our proposed approaches. View full abstract»
Cited by: Papers (2)
Business processes and services can more flexibly be combined when based upon standards. However, such flexible compositions practically always contain vulnerabilities, which imperil the security and dependability of processes. Vulnerability management tools require patterns to find or monitor vulnerabilities. Such patterns have to be derived from vulnerability types. Existing analysis methods such as attack trees and FMEA result in such types, yet require much experience and provide little guidance during the analysis. Our main contribution is ATLIST, a new vulnerability analysis method with improved transferability. Especially in service-oriented architectures, which employ a mix of established web technologies and SOA-specific standards, previously observed vulnerability types and variations thereof can be found. Therefore, we focus on the detection of known vulnerability types by leveraging previous vulnerability research. A further contribution in this respect is the, to the best of our knowledge, most comprehensive compilation of vulnerability information sources to date. We present the method to search for vulnerability types in SOA-based business processes and services. Also, we show how patterns can be derived from these types, so that tools can be employed. An additional contribution is a case study, in which we apply the new method to an SOA-based business process scenario. View full abstract»
Cited by: Papers (3)
In response to increasing economical constraints, enterprise organization has evolved toward new structures such as networked enterprise, supply chains, virtual enterprise, or collaborative business organizations. This structural organization requires the interoperability of business processes (BPs)and information systems. Dealing with interoperability often leads to the deployment of Service-Oriented Architecture (SOA) based on Enterprise Service Bus (ESB) to design agile collaborative BPs and publish and compose new services. In order to protect each partner's own interests, security strategies must be developed and integrated in the service environment. Unfortunately, traditional security approaches deal with security concerns from a technical perspective (i.e., data transmission or authentication, etc.) and do not support end-to-end security in a distributed environment of business services and collaborative processes. In this paper, we attempt to improve end-to-end security by annotating service descriptions with security objectives used to generate convenient quality of protection (QoP) agreements between partners. Conversely, agreements are processed by a dedicated matching module with respect to security requirements and preferences to select business services, and then, compose their appropriate technical security services. View full abstract»
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.
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/
Meet Our Editors
Georgia Institute of Technology