14872443
Application-aware Interface for SOAP Communication in Web Services
SOAP protocol has emerged as the Web service communication standard. Because of the relatively poor performance, many researchers focus on improving the speed of processing SOAP message. In this paper, we propose SPI, which introduces client usage pattern to the low level SOAP process infrastructure, in order to improve the performance of some kind of Web services applications with specific communication patterns. The pack interface of SPI is an approach to reduce the number of the SOAP messages to improve the latency on client side. This SOAP optimization technique packs concurrent service requests into one SOAP message on client side, and unpacks and executes them on server side. Our implementation and performance study demonstrates the usefulness and effectiveness of the technique
10926021
Agora: Grid Community in Vega Grid
In grid environment, how to organize, discover and use grid resources is one of the basic research problems. In this paper, we introduce a new concept called agora, which refers grid community in our Vega grid project. We propose a principle on agora as one of the basic design principles of Vega grid, which is the community principle. We give a detailed definition of the agora as a 4-tuple(S, O, C, P), representing the set of Subject, Object, Context, and Policy respectively. Our research methodology is comparative studies, drawing an analog between the grid and other platform systems such as OS, CPU, and MPI. We also study some properties about the agora, for example, grid law of inertia. This agora approach could be used to unify the grid invariability and dynamic variability effectively, develop the appropriate technology to support the dynamic and open properties of the grid, and deal with the complexity in the grid more efficiently.
3219653
Key Elements Tracing Method for Parallel XML Parsing in Multi-Core System
Though XML is applied intensively in a lot of applications, XML parsing is not practical in many fields because of its poor performance. Parallel XML parsing on multi-core is a promising choice. Previous methods all adopt data parallel approach on XML parsing. As the semi-structured nature of XML, they were obliged to divide the data into well-formed XML chunks and then parse these chunks parallel. The division process is named as preparsing. As the preparsing is serial, it becomes the bottleneck of parallel XML parsing. Related work Simultaneous Finite Transducer (SFTXP) parallelized the preparsing stage. It maintained multiple preparser results for each equal sized chunk according to enumerated all possible parsing states. In spite of finite states for each XML, the overhead by SFTXP is tremendous, including CPU time and memory for multiple results generating and storing, respectively. In this work, we address parallel XML parsing by Key Element Parse Tracing (KEPT) method which parallelizes the preparsing and parsing at element level. It remolds the preparsing as a key element extracting process and schedules the processing of key elements in the framework of KEPT. Then parsing process is parallelized as a whole. To demonstrate the effectiveness, we implement it on libxml2 and obtain good scalability on both an 8-core Linux machine and an 8-core 24 SMT Sun machine running Solaris.
14490221
Exploiting Request Characteristics to Improve Performance of Web Services Based Business Applications
Web Services and workflow have been widely adopted in building complicated business systems. In these systems, high security concern is claimed. But frequent authentication and computing-intensive encoding and decoding operation bring extra workload to the systems and greatly impact the performance of Web Services and workflow engine, especially under heavy load. In this paper, we propose Requests Automated Binding Mechanism, RABM, to automatically pack the requests from multiple clients but to a common target service in a short time period into one SOAP message, then sent by the workflow engine at runtime. Extra security operation costs are reduced without modifying of application programs. We use the Travel Service provided by W3C to evaluate RABM. As the experiment result shows, we can achieve up to 130% improvement of throughput and lower the average response time to 41%1.
11622519
Applying Knowledge Sharing for Business Intelligence Collaboration
IT services need an automatic and flexible ability to react to dynamic changes in their environment. Managing change effectively and reducing the negative effects of day-to-day operations has become one of the most important tasks in IT service management, which require hiring highly skilled IT professionals with correspondingly high labor costs. There is a challenge to select, implement and integrate the right resources quickly and effectively. Although there is a growing body of research into IT management, many techniques are either too narrow (focusing on a single component rather than the entire system), or they address only configuration data collection and integration. Instead, one needs to scale or respond to special domain knowledge, collaboration and the right data for helping IT professionals to improve their work. In this paper, we propose a knowledge-sharing based collaborating management system for IT service management. It aims to bridge the gap between domain experts’ knowledge and manageable systems. We developed a proof-of-concept of an impact analysis service based on knowledge-sharing; it establishes an IT service management collaboration paradigm and ecosystem, leveraging the expert’s rich knowledge and experience to improve the management quality and reduce the cost. A case study driven by customers demonstrates that collaboration with knowledge sharing is effective both at constructing useful system analysis services and in using those services to improve system management.
6501389
A Hierarchical Queueing Model for Streaming Video over Multi-Hop Wireless Networks
In our previous work, we proposed a distributed buffer (DB) scheme to tackle the problem of transporting layered video over erroneous multi-hop wireless networks. In DB scheme, some intermediate nodes are selected as DB nodes, which are used to pre-buffer video packets before the video streaming starts. In this paper, a novel hierarchical queueing model for DB nodes is proposed. The video playback quality including buffer overflow probability and video quality throughput can be computed based on the proposed queueing model. The simulation result matches the queueing performance of video streaming application.
189947
Evaluating Service Identification with Design Metrics on Business Process Decomposition
One of the key activities to construct a successful Service-Oriented Architecture (SOA) is the identification of services with the right level of abstraction. Most of existing SOA design methodologies advocate identifying services from the top-down decomposition of business processes. However, the identification quality in these methodologies heavily depends on the expertise and experience of individual designers. The ability to quantitatively evaluate service identification is absolutely needed. In this paper, we propose an approach that supports such evaluation by applying the measurement technology to the service-based business process decomposition. A model to capture related architectural elements with their relationships is presented. A set of design metrics are proposed for measuring various features of identified services in the service portfolio, including service granularity, coupling, cohesion, and business entity convergence. To apply the approach, a prototypical measurement tool for service identification is developed. An automotive work order scenario is used as an illustration example to explain our approach and demonstrate its effectiveness.
14899060
Automatic model-based service hosting environment migration
The proper operation of Service-Oriented Architecture (SOA) depends on underlying system services of operating systems, so efficient and effective migration of Service Hosting Environment is critical to cope with intrinsic-changed nature of SOA. However, due to the large amount of configuration items, complicated mapping and complex dependency relationship among system services, migrating into a new Service Hosting Environment satisfying the operation requirement of SOA becomes an error-prone and time-consuming task. The SCM project in IBM develops a novel approach to migrate Service Hosting Environment shaped in Unix-like systems. Firstly, this approach builds a set of configuration models to describe various system services. Then based on models, it presents knowledge based mapping to translate system service configurations between Service Hosting Environments. Finally, it designs a dependency hierarchy deducting algorithm to compute the dependency relationship among system services for migration traceability and error determination. A SCM prototype has performed well on largely reducing time, labor and errors in real migration cases.
15246145
A comprehensive semantic-based resource allocation framework for workflow management systems
Resource allocation that targets to assign the appropriate resource to the dynamically generated work item has always been a critical issue in the workflow management system research. However, today's workflow systems almost still depend on the static literal-based matchmaking mechanism to support the resource allocation, which would suffer greatly from the diversity and mutability of resources in current open and dynamic network environment. In this paper, we propose a comprehensive semantic-based resource allocation framework to enhance the matchmaking process. The essential contributions of this framework are: firstly, an OWL ontology is provided to describe available resources based on their semantic information. Secondly, based on the ontology, effective semantic reasoning techniques are used to select the eligible resource candidates. Thirdly, a bidding approach is adopted to further optimize the resource selection according to runtime conditions such as duration, cost and etc., which would typically overcome the inaccurate assignment based on pure static information in previous study.