Final Year IEEE Project 2013-2014 - Web Services Project Title and Abstract

Elysium Technologies Private Limited Singapore | Madurai | Chennai | Trichy | Coimbatore | Cochin | Ramnad |

Pondicherry | Trivandrum | Salem | Erode | Tirunelveli

http://www.elysiumtechnologies.com, [email protected]

13 Years of Experience

Automated Services

24/7 Help Desk Support

Experience & Expertise Developers

Advanced Technologies & Tools

Legitimate Member of all Journals

Having 1,50,000 Successive records in

all Languages

More than 12 Branches in Tamilnadu,

Kerala & Karnataka.

Ticketing & Appointment Systems.

Individual Care for every Student.

Around 250 Developers & 20

Researchers




227-230 Church Road, Anna Nagar, Madurai – 625020.

0452-4390702, 4392702, + 91-9944793398.

[email protected], [email protected]

S.P.Towers, No.81 Valluvar Kottam High Road, Nungambakkam,

Chennai - 600034. 044-42072702, +91-9600354638,

[email protected]

15, III Floor, SI Towers, Melapudur main Road, Trichy – 620001.

0431-4002234, + 91-9790464324.

[email protected]

577/4, DB Road, RS Puram, Opp to KFC, Coimbatore – 641002

0422- 4377758, +91-9677751577.

[email protected]

mailto:[email protected]

mailto:[email protected]




Plot No: 4, C Colony, P&T Extension, Perumal puram, Tirunelveli-

627007. 0462-2532104, +919677733255,

[email protected]

1st Floor, A.R.IT Park, Rasi Color Scan Building, Ramanathapuram

- 623501. 04567-223225,

[email protected]

74, 2nd floor, K.V.K Complex,Upstairs Krishna Sweets, Mettur

Road, Opp. Bus stand, Erode-638 011. 0424-4030055, +91-

9677748477 [email protected]

No: 88, First Floor, S.V.Patel Salai, Pondicherry – 605 001. 0413–

4200640 +91-9677704822

[email protected]

TNHB A-Block, D.no.10, Opp: Hotel Ganesh Near Busstand. Salem

– 636007, 0427-4042220, +91-9894444716.

[email protected]




ETPL

WS-001

A Memory-based Collaborative Filtering Algorithm for Recommending Semantic Web

Services

Abstract: This paper focuses on the construction of collaborative filtering (CF) recommender systems for

Web services. The main contribution of the proposed approach is to reduce the problems caused by sparse

rating data - one of the main shortcomings of memory-base CF algorithms - using semantic markup of

Web services. In the presented algorithm, the similarity between users is computed using the Pearson

correlation coefficient, extended to consider also the ratings of users for similarity services. Likewise, to

predict the rating a user would give to a target service, the algorithm considers the ratings of neighbor

users for the target service and also for similar services. Experiments conducted to evaluate the algorithm

show that our approach has a significant impact on the accuracy of the algorithm, particularly when rating

data are sparse.

ETPL

WS-002 Toward Trustworthy Coordination of Web Services Business Activities

Abstract: We present a lightweight Byzantine fault tolerance (BFT) algorithm, which can be used to

render the coordination of web services business activities (WS-BA) more trustworthy. The lightweight

design of the BFT algorithm is the result of a comprehensive study of the threats to the WS-BA

coordination services and a careful analysis of the state model of WS-BA. The lightweight BFT algorithm

uses source ordering, rather than total ordering, of incoming requests to achieve Byzantine fault tolerant,

state-machine replication of the WS-BA coordination services. We have implemented the lightweight

BFT algorithm, and incorporated it into the open-source Kandula framework, which implements the WS-

BA specification with the WS-BA-I extension. Performance evaluation results obtained from the

prototype implementation confirm the efficiency and effectiveness of our lightweight BFT algorithm,

compared to traditional BFT techniques.

ETPL

WS-003 Converged access of IMS and web services: A virtual client model

Abstract: This article presents a virtual client-based converged access architecture for IMS and web

services. A virtual client transfers most of the signaling and session maintenance loads to a remote server

named surrogate, which implements the IMS client. We describe how we have implemented an IMS-web

hybrid service, Movieon- Demand (MoD), by deploying a simple IMS client and web server in a

surrogate, and using an open-source implementation of a full IMS environment, from client to application

server.

ETPL

WS-004 Personalized QoS-Aware Web Service Recommendation and Visualization

Abstract: With the proliferation of web services, effective QoS-based approach to service

recommendation is becoming more and more important. Although service recommendation has been

studied in the recent literature, the performance of existing ones is not satisfactory, since (1) previous

approaches fail to consider the QoS variance according to users' locations; and (2) previous recommender

systems are all black boxes providing limited information on the performance of the service candidates. In

this paper, we propose a novel collaborative filtering algorithm designed for large-scale web service

recommendation. Different from previous work, our approach employs the characteristic of QoS and

achieves considerable improvement on the recommendation accuracy. To help service users better



http://www.elysiumtechnologies.com, [email protected] understand the rationale of the recommendation and remove some of the mystery, we use a

recommendation visualization technique to show how a recommendation is grouped with other choices.

Comprehensive experiments are conducted using more than 1.5 million QoS records of real-world web

service invocations. The experimental results show the efficiency and effectiveness of our approach.

ETPL

WS-005

Cloud Implementation of a Full Hyperspectral Unmixing Chain Within the NASA Web

Coverage Processing Service for EO-1

Abstract: The launch of the NASA Earth Observing 1 (EO-1) platform in November 2000 marked the

establishment of spaceborne hyperspectral technology for land imaging. The Hyperion sensor onboard

EO-1 operates in the 0.4-2.5 micrometer spectral range, with 10 nanometer spectral resolution and 30-

meter spatial resolution. Spectral unmixing has been one of the most successful approaches to analyze

Hyperion data since its launch. It estimates the abundance of spectrally pure constituents (endmembers) in

each observation collected by the sensor. Due to the high spectral dimensionality of Hyperion data,

unmixing is a very time-consuming operation. In this paper, we develop a cloud implementation of a full

hyperspectral unmixing chain made up of the following steps: 1) dimensionality reduction; 2) automatic

endmember identification; and 3) fully constrained abundance estimation. The unmixing chain will be

available online within the Web Coverage Processing Service (WCPS), an image processing framework

that can run on the cloud, as part of the NASA SensorWeb suite of web services. The proposed

implementation has been demonstrated using the EO-1 Hyperion imagery. Our experimental results with

a hyperspectral scene collected over the Okavango Basin in Botswana suggest the (present and future)

potential of spectral unmixing for improved exploitation of spaceborne hyperspectral data. The

integration of the unmixing chain in the WCPS framework as part of the NASA SensorWeb suite of web

services is just the start of an international collaboration in which many more processing algorithms will

be made available to the community through this service. This paper is not so much focused on the theory

and results of unmixing (widely demonstrated in other contributions) but about the process and added

value of the proposed contribution for ground processing on the cloud and onboard migration of those

algorithms to support the generation of low-latency products for new airborne/spaceborne missions.

ETPL

WS-006 Bottom-Up and Top-Down Cobol System Migration to Web Services

Abstract: Moving from mainframe systems to a service-oriented architecture (SOA) using Web services is

an attractive but daunting task. The bottom-up or direct-migration approach enables the effective

modernization of legacy systems to Web services. Conversely, bringing migration into fruition with the

top-down or indirect-migration approach is more difficult, but it achieves better migration results.

Employing both approaches on the same large enterprise system is uncommon, which leaves no room for

comparison. This article describes the migration processes, costs, and outcomes of applying both

approaches on a real Cobol system.

ETPL

WS-007

Design and Implementation of a Web-Service-Based Public-Oriented Personalized

Health Care Platform

Abstract: The use of information technology and management systems for the betterment of health care is

more and more important and popular. However, existing efforts mainly focus on informatization of

hospitals or medical institutions within the organizations, and few are directly oriented to the patients,

their families, and other ordinary people. The strong demand for various medical and public health care



http://www.elysiumtechnologies.com, [email protected] services from customers calls for the creation of powerful individual-oriented personalized health care

service systems. Service computing and related technologies can greatly help one in fulfilling this task. In

this paper, we present PHISP: a Public-oriented Health care Information Service Platform, which is based

on such technologies. It can support numerous health care tasks, provide individuals with many intelligent

and personalized services, and support basic remote health care and guardianship. In order to realize the

personalized customization and active recommendation of intelligent services for individuals, several key

techniques for service composition are integrated, which can support branch and parallel control

structures in the process models of composite services and are highlighted in this paper.

ETPL

WS-008 Web-Scale Service Delivery for Smart Cities

Abstract: Smart cities encompass services in diverse business and technological domains. Presently, most

of these services are delivered through domain-specific, tightly coupled systems, which entail limited

scalability and extensibility. The authors propose Web-scale service delivery that addresses these

limitations and encourage the creation of novel services based on a domain-independent, cloud-based

service-delivery platform.

ETPL

WS-009 Effective Message-Sequence Generation for Testing BPEL Programs

Abstract: With the popularity of Web Services and Service-Oriented Architecture (SOA), quality

assurance of SOA applications, such as testing, has become a research focus. Programs implemented by

the Business Process Execution Language for Web Services (WS-BPEL), which can be used to compose

partner Web Services into composite Web Services, are one popular kind of SOA applications. The

unique features of WS-BPEL programs bring new challenges into testing. A test case for testing a WS-

BPEL program is a sequence of messages that can be received by the WS-BPEL program under test.

Previous research has not studied the challenges of message-sequence generation induced by unique

features of WS-BPEL as a new language. In this paper, we present a novel methodology to generate

effective message sequences for testing WS-BPEL programs. To capture the order relationship in a

message sequence and the constraints on correlated messages imposed by WS-BPEL's routing

mechanism, we model the WS-BPEL program under test as a message-sequence graph (MSG), and

generate message sequences based on MSG. We performed experiments for our method and two other

techniques with six WS-BPEL programs. The results show that the message sequences generated by using

our method can effectively expose faults in the WS-BPEL programs.

ETPL

WS-010

Toward SWSs Discovery: Mapping from WSDL to OWL-S Based on Ontology Search

and Standardization Engine

Abstract: Semantic Web Services (SWSs) represent the most recent and revolutionary technology

developed for machine-to-machine interaction on the web 3.0. As for the conventional web services, the

problem of discovering and selecting the most suitable web service represents a challenge for SWSs to be

widely used. In this paper, we propose a mapping algorithm that facilitates the redefinition of the

conventional web services annotations (i.e., WSDL) using semantic annotations (i.e., OWL-S). This

algorithm will be a part of a new discovery mechanism that relies on the semantic annotations of the web

services to perform its task. The “local ontology repository” and “ontology

search and standardization engine” are the backbone of this algorithm. Both of them target to



http://www.elysiumtechnologies.com, [email protected] define any data type in the system using a standard ontology-based concept. The originality of the

proposed mapping algorithm is its applicability and consideration of the standardization problem. The

proposed algorithm is implemented and its components are validated using some test collections and real

examples. An experimental test of the proposed techniques is reported, showing the impact of the

proposed algorithm in decreasing the time and the effort of the mapping process. Moreover, the

experimental results promises that the proposed algorithm will have a positive impact on the discovery

process as a whole.

ETPL

WS-011 Ev-LCS: A System for the Evolution of Long-Term Composed Services

Abstract: We propose a system, called EVolution of Long-term Composed Services (Ev-LCS), to address

the change management issues in long-term composed services (LCSs). An LCS is a dynamic

collaboration between autonomous web services that collectively provide a value-added service. It has a

long-term commitment to its users. We first present a formal model, which provides the grounding

semantics to support the automation of change management. We present a set of change operators that

allow to specify a change in a precise and formal manner. We then propose a change enactment strategy

that actually implements the changes. We develop a prototype system for the proposed Ev-LCS to

demonstrate its effectiveness. We also conduct an experimental study to assess the performance of the

change management approach.

ETPL

WS-012 Prototyping Connected Devices for the Internet of Things

Abstract: Tools like Microsoft .NET Gadgeteer offer the ability to quickly prototype, test, and deploy

connected devices, providing a key element that will accelerate our understanding of the challenges in

realizing the Internet of Things vision. Gadgeteer is a general-purpose device development platform

where the key elements includes rapid construction and reconfiguration of electronic device hardware,

ease of programming and debugging, and the ability to leverage online Web services for additional

storage, communication, and processing.

ETPL

WS-013 A Generic Query Model for the Unified Discovery of Heterogeneous Services

Abstract: In this paper, we propose Proteus, a generic query model for the discovery of operations offered

by heterogeneous services. We demonstrate the need for such a model, and show how it unifies the task of

service discovery through abstractions, which allow for the technology-independent formulation of

service advertisements, queries, and query responses. On top of these generic elements, we build an

intuitive, fuzzy-based query evaluation mechanism that supports the service matchmaking process by

employing and appropriately combining existing similarity metrics. Thanks to the generality of Proteus, it

is possible to seamlessly accommodate the discovery of operations provided by various types of services

without the need of changing the existing service infrastructure. Thus, our approach is applicable to a

variety of settings ranging from traditional web services to service-oriented grids, peer-to-peer networks,

geospatial information systems, and so on. Overall, compared to the existing query models supported by

standard service discovery technologies, our approach is marked by openness, flexibility, and improved

performance in terms of precision and recall. The feasibility and efficiency of Proteus are verified by a

series of experiments.




ETPL

WS-014

A Dynamic Composition and Stubless Invocation Approach for Information-Providing

Services

Abstract: The automated specification and execution of composite services are important capabilities of

service-oriented systems. In practice, service invocation is performed by client components (stubs) that

are generated from service descriptions at design time. Several researchers have proposed mechanisms for

late binding. They all require an object representation (e.g., Java classes) of the XML data types specified

in service descriptions to be generated and meaningfully integrated in the client code at design time.

However, the potential of dynamic composition can only be fully exploited if supported in the invocation

phase by the capability of dynamically binding to services with previously unknown interfaces. In this

work, we address this limitation by proposing a way of specifying and executing composite services,

without resorting to previously compiled classes that represent XML data types. Semantic and structural

properties encoded in service descriptions are exploited to implement a mechanism, based on the

Graphplan algorithm, for the run-time specification of composite service plans. Composite services are

then executed through the stubless invocation of constituent services. Stubless invocation is achieved by

exploiting structural properties of service descriptions for the run-time generation of messages.

ETPL

WS-015 A Decentralized Service Discovery Approach on Peer-to-Peer Networks

Abstract: Service-Oriented Computing (SOC) is emerging as a paradigm for developing distributed

applications. A critical issue of utilizing SOC is to have a scalable, reliable, and robust service discovery

mechanism. However, traditional service discovery methods using centralized registries can easily suffer

from problems such as performance bottleneck and vulnerability to failures in large scalable service

networks, thus functioning abnormally. To address these problems, this paper proposes a peer-to-peer-

based decentralized service discovery approach named Chord4S. Chord4S utilizes the data distribution

and lookup capabilities of the popular Chord to distribute and discover services in a decentralized manner.

Data availability is further improved by distributing published descriptions of functionally equivalent

services to different successor nodes that are organized into virtual segments in the Chord4S circle. Based

on the service publication approach, Chord4S supports QoS-aware service discovery. Chord4S also

supports service discovery with wildcard(s). In addition, the Chord routing protocol is extended to

support efficient discovery of multiple services with a single query. This enables late negotiation of

Service Level Agreements (SLAs) between service consumers and multiple candidate service providers.

The experimental evaluation shows that Chord4S achieves higher data availability and provides efficient

query with reasonable overhead.

ETPL

WS-016 Dynamic Service Contract Enforcement in Service-Oriented Networks

Abstract: In recent years, service-oriented architectures (SOA) have emerged as the main solution for the

integration of legacy systems with new technologies in the enterprise world. A service is usually governed

by a client service contract (CSC) that specifies, among other requirements, the rate at which a service

should be accessed, and limits it to no more than a number of service requests during an observation

period. Several approaches, using both static and dynamic credit-based strategies, have been developed to

enforce the rate specified in the CSC. Existing approaches have problems related to starvation,

approximations used in calculations, and rapid credit consumption under certain conditions. In this paper,



http://www.elysiumtechnologies.com, [email protected] we propose and validate DoWSS, a doubly weighted algorithm for service traffic shaping. We show via

simulation that DoWSS possesses several advantages: It eliminates the approximation issues, prevents

starvation, and contains the rapid credit consumption issue in existing credit-based approaches.

ETPL

WS-017 Proactive and Reactive Runtime Service Discovery: A Framework and Its Evaluation

Abstract: The identification of services during the execution of service-based applications to replace

services in them that are no longer available and/or fail to satisfy certain requirements is an important

issue. In this paper, we present a framework to support runtime service discovery. This framework can

execute service discovery queries in pull and push mode. In pull mode, it executes queries when a need

for finding a replacement service arises. In push mode, queries are subscribed to the framework to be

executed proactively and, in parallel with the operation of the application, to identify adequate services

that could be used if the need for replacing a service arises. Hence, the proactive (push) mode of query

execution makes it more likely to avoid interruptions in the operation of service-based applications when

a service in them needs to be replaced at runtime. In both modes of query execution, the identification of

services relies on distance-based matching of structural, behavioral, quality, and contextual characteristics

of services and applications. A prototype implementation of the framework has been developed and an

evaluation was carried out to assess the performance of the framework. This evaluation has shown

positive results, which are discussed in the paper.

ETPL

WS-018 A Novel Method for Calculating Service Reputation

Abstract: Owing to their rapid development, services are increasing rapidly in quantity. The consequence

is that there are so many services that share the same or similar functions. Therefore, it is important to

select a credible and optimal service. Reputation as one of the important parameters of services plays a

significant role in the decision support for service selection. This paper proposes a novel two-phase

method to calculate service reputation. The first phase uses a dynamic weight formula to calculate

reputation such that it can reflect the latest tendency of a service. The second one uses an olfactory

response formula to mitigate the negative effect of unfair ratings. Some experiments are conducted and

the results validate the effectiveness of the proposed method.

ETPL

WS-019

The AppScale Cloud Platform: Enabling Portable, Scalable Web Application

Deployment

Abstract: AppScale is an open source distributed software system that implements a cloud platform as a

service (PaaS). AppScale makes cloud applications easy to deploy and scale over disparate cloud fabrics,

implementing a set of APIs and architecture that also makes apps portable across the services they

employ. AppScale is API-compatible with Google App Engine (GAE) and thus executes GAE

applications on-premise or over other cloud infrastructures, without modification.

ETPL

WS-020

On the Investigation of Cloud-Based Mobile Media Environments With Service-

Populating and QoS-Aware Mechanisms

Abstract: Recent advances in mobile devices and network technologies have set new trends in the way we

use computers and access networks. Cloud Computing, where processing and storage resources are

residing on the network is one of these trends. The other is Mobile Computing, where mobile devices

such as smartphones and tablets are believed to replace personal computers by combining network



http://www.elysiumtechnologies.com, [email protected] connectivity, mobility, and software functionality. In the future, these devices are expected to seamlessly

switch between different network providers using vertical handover mechanisms in order to maintain

network connectivity at all times. This will enable mobile devices to access Cloud Services without

interruption as users move around. Using current service delivery models, mobile devices moving from

one geographical location to another will keep accessing those services from the local Cloud of their

previous network, which might lead to moving a large volume of data over the Internet backbone over

long distances. This scenario highlights the fact that user mobility will result in more congestion on the

Internet. This will degrade the Quality of Service and by extension, the Quality of Experience offered by

the services in the Cloud and especially multimedia services that have very tight temporal constraints in

terms of bandwidth and jitter. We believe that a different approach is required to manage resources more

efficiently, while improving the Quality of Service and Quality of Experience of mobile media services.

This paper introduces a novel concept of Cloud-Based Mobile Media Service Delivery in which services

run on localized public Clouds and are capable of populating other public Clouds in different

geographical locations depending on service demands and network status. Using an analytical framework,

this paper argues that as the demand for specific services increases in a location, it might be more

efficient to move those services closer to that location. This will prevent th- Internet backbone from

experiencing high traffic loads due to multimedia streams and will offer service providers an automated

resource allocation and management mechanism for their services.

ETPL

WS-021 Message-Efficient Service Management Schemes for MOM-Based UPnP Networks

Abstract: The use of message-oriented middleware (MOM) in pervasive systems has increased noticeably

because of its flexible and failure-tolerant nature. Meanwhile, decentralized service management

protocols such as UPnP are believed to be more suitable for administrating applications in small-scale

pervasive environments such as smart homes. However, administering MOM-based pervasive systems by

UPnP often suffers from network flood problems due to the replications of too many unnecessary

messages. This paper presents several traffic reduction schemes, namely, decomposing the multicast

traffic, service-based node searching, heartbeat by decomposing the multicast traffic, and on-demand

heartbeat, which reduce the replications of unnecessary messages in MOM-based UPnP networks. The

analytical predictions agree well with the simulated and experimental results, which show that the

message counts of presence and leave announcements, node searching, and heartbeat can be greatly

reduced.

ETPL

WS-022 Robust Module-Based Data Management

Abstract: The current trend for building an ontology-based data management system (DMS) is to

capitalize on efforts made to design a preexisting well-established DMS (a reference system). The method

amounts to extracting from the reference DMS a piece of schema relevant to the new application needs-a

module-, possibly personalizing it with extra constraints w.r.t. the application under construction, and

then managing a data set using the resulting schema. In this paper, we extend the existing definitions of

modules and we introduce novel properties of robustness that provide means for checking easily that a

robust module-based DMS evolves safely w.r.t. both the schema and the data of the reference DMS. We

carry out our investigations in the setting of description logics which underlie modern ontology



http://www.elysiumtechnologies.com, [email protected] languages, like RDFS, OWL, and OWL2 from W3C. Notably, we focus on the DL-liteA dialect of the

DL-lite family, which encompasses the foundations of the QL profile of OWL2 (i.e., DL-liteR): the W3C

recommendation for efficiently managing large data sets.

ETPL

WS-023 Efficient Service Skyline Computation for Composite Service Selection

Abstract: Service composition is emerging as an effective vehicle for integrating existing web services to

create value-added and personalized composite services. As web services with similar functionality are

expected to be provided by competing providers, a key challenge is to find the “best” web services to

participate in the composition. When multiple quality aspects (e.g., response time, fee, etc.) are

considered, a weighting mechanism is usually adopted by most existing approaches, which requires users

to specify their preferences as numeric values. We propose to exploit the dominance relationship among

service providers to find a set of “best” possible composite services, referred to as a composite service

skyline. We develop efficient algorithms that allow us to find the composite service skyline from a

significantly reduced searching space instead of considering all possible service compositions. We

propose a novel bottom-up computation framework that enables the skyline algorithm to scale well with

the number of services in a composition. We conduct a comprehensive analytical and experimental study

to evaluate the effectiveness, efficiency, and scalability of the composite skyline computation approaches.

ETPL

WS-024

Predicting Quality of Service for Selection by Neighborhood-Based Collaborative

Filtering

Abstract: Quality-of-service-based (QoS) service selection is an important issue of service-oriented

computing. A common premise of previous research is that the QoS values of services to target users are

supposed to be all known. However, many of QoS values are unknown in reality. This paper presents a

neighborhood-based collaborative filtering approach to predict such unknown values for QoS-based

selection. Compared with existing methods, the proposed method has three new features: 1) the adjusted-

cosine-based similarity calculation to remove the impact of different QoS scale; 2) a data smoothing

process to improve prediction accuracy; and 3) a similarity fusion approach to handle the data sparsity

problem. In addition, a two-phase neighbor selection strategy is proposed to improve its scalability. An

extensive performance study based on a public data set demonstrates its effectiveness.

ETPL

WS-025 An Enterprise Ontology-Based Approach to Service Specification

Abstract: In recent years, the Web Service Definition Language (WSDL) and Universal Description

Discovery Integration (UDDI) standards arose as ad hoc standards for the definition of service interfaces

and service registries. However, even together these standards do not provide enough basis for a service

consumer to get a full understanding of the behavior of a service. In practice, this often leads to a serious

mismatch between the provider's intent and the consumer's expectations concerning the functionality of

the corresponding service. Though additional standards have been proposed, a holistic view of what

aspects of a service need to be specified is still lacking. This paper proposes a service definition, a service

classification, and service specification framework, all based on a founded theory, the $(Psi)$-theory. The

$(Psi)$-theory originates from the scientific fields of Language Philosophy and Systemic Ontology.

According to this theory, the operation of organizations is all about communication between and

production by social actors. The service specification framework can be applied both for specifying



http://www.elysiumtechnologies.com, [email protected] human services, i.e., services executed by human beings, and IT services (i.e., services executed by IT

systems).

ETPL

WS-026 Service Provision Control in Federated Service Providing Systems

Abstract: Different from traditional P2P systems, individuals nodes of a Federated Service Providing

(FSP) system play a more active role by offering a variety of domain-specific services. The service

provision control (SPC) problem is an important problem of the FSP system and will be tackled in this

paper within a stochastic optimization framework through several steps. The first step focuses on using

stochastic differential equations (SDEs) to model and analyze the dynamic evolution of the service

demand. Driven by the SDE model, expected future performance of a FSP system is analytically

evaluated in the second step. Step three utilizes the differential evolution (DE) algorithm to identify near-

optimal service-providing policies for each node. The service subscription protocol is further proposed in

step four to help every node adjust its local policy in accordance with the services provided by other

nodes. The four steps together implement a complete solution of the SPC problem and will be called the

SDE-based service-provision control (SSPC) mechanism in this paper. Experimental evaluation of the

mechanism has been reported in the paper. The results show that our approach is effective in tackling the

SPC problem and may be therefore suitable for many practical applications.

ETPL

WS-027 Cost-Based Optimization of Service Compositions

Abstract: For providers of composite services, preventing cases of SLA violations is crucial. Previous

work has established runtime adaptation of compositions as a promising tool to achieve SLA

conformance. However, to get a realistic and complete view of the decision process of service providers,

the costs of adaptation need to be taken into account. In this paper, we formalize the problem of finding

the optimal set of adaptations, which minimizes the total costs arising from SLA violations and the

adaptations to prevent them. We present possible algorithms to solve this complex optimization problem,

and detail an end-to-end system based on our earlier work on the PREvent (prediction and prevention

based on event monitoring) framework, which clearly indicates the usefulness of our model. We discuss

experimental results that show how the application of our approach leads to reduced costs for the service

provider, and explain the circumstances in which different algorithms lead to more or less satisfactory

results.

ETPL

WS-028 Distributed Web Systems Performance Forecasting Using Turning Bands Method

Abstract: With the increasing development of distributed computer systems (DCSs) in networked

industrial and manufacturing applications on the World Wide Web (WWW) platform, including service-

oriented architecture and Web of Things QoS-aware systems, it has become important to predict the Web

performance. In this paper, we present Web performance prediction in time and in space by making a

forecast of a Web resource downloading using the Turning Bands (TB) geostatistical simulation method.

Real-life data for the research were obtained in an active experiment conducted by our multi-agent

measurement system MWING performing monitoring of a group of Web servers worldwide from agents

localized in different geographical localizations in Poland. The results show good quality of Web

performance prediction made by means of the TB method, especially in the case when European Web




servers were monitored by an MWING agent localized in Gliwice, Poland.

ETPL

WS-029 Geo-Store: A Framework for Supporting Semantics-Enabled Location-Based Services

Abstract: Location-based services (LBSs) are popular information services for mobile users, who access

them using location-aware mobile devices over wireless networks. To enable devices to understand and

exchange information on the Web, LBS providers use Semantic Web data sources to develop semantics-

enabled LBSs. However, there are currently limited solutions for processing spatial queries, the building

blocks of most LBSs, on Semantic Web data to support these services. The Geo-Store system evaluates

spatial queries on RDF triple stores (Semantic Web data management systems) to provide semantics-

enabled LBSs.

ETPL

WS-030 Resisting Web Proxy-Based HTTP Attacks by Temporal and Spatial Locality Behavio

Abstract: A novel server-side defense scheme is proposed to resist the Web proxy-based distributed denial

of service attack. The approach utilizes the temporal and spatial locality to extract the behavior features of

the proxy-to-server traffic, which makes the scheme independent of the traffic intensity and frequently

varying Web contents. A nonlinear mapping function is introduced to protect weak signals from the

interference of infrequent large values. Then, a new hidden semi-Markov model parameterized by

Gaussian-mixture and Gamma distributions is proposed to describe the time-varying traffic behavior of

Web proxies. The new method reduces the number of parameters to be estimated, and can characterize the

dynamic evolution of the proxy-to-server traffic rather than the static statistics. Two diagnosis approaches

at different scales are introduced to meet the requirement of both fine-grained and coarse-grained

detection. Soft control is a novel attack response method proposed in this work. It converts a suspicious

traffic into a relatively normal one by behavior reshaping rather than rudely discarding. This measure can

protect the quality of services of legitimate users. The experiments confirm the effectiveness of the

proposed scheme.

Final Year IEEE Project 2013-2014 - Web Services Project Title and Abstract

Technology

proliferation of web

wsba coordination services

semantic web services

similarity services

web server

similar services

lightweight bft algorithm

etpl ws