The increase in the number of available web services led to the increase in the similarity of services functionality offered by different providers each with different QoS parameters. Therefore, in web service composition, the selection of the optimal service to satisfy the QoS values required by user is one of the significant requirements. Moreover, the dynamic nature of web services adds more challenges to obtain the accuracy of the selection process. Most of the existing service composition approaches deal with services changes during composition execution, causing a re-planning or re-selection that affecst the service composition performance. In this paper, we introduce the clustering-based service selection model that outperforms the existing ones. The proposed model has the ability to detect and recover the changes in service repository by monitoring the composition process from a global point of view. The approach is a two-levels-based web service clustering. The proposed model encompasses a clustering process, a planning process, a selection process and a recovery process.
WEB SERVICE COMPOSITION IN DYNAMIC ENVIRONMENT: A COMPARATIVE STUDYcscpconf
Web service composition development is a complex and dynamic process. It is one of the challenges in distributed dynamic environments. Although, SOA (Service Oriented Architecture) facilitates service composition process through standard protocols in searching and binding with web services. Yet composition in SOA paradigm faces many challenges. One of the main challenges is the environment in which composition services are developed. Nowadays the environment becomes more dynamic due to the increase in the number of web services that are frequently changing. Therefore, the need for self-adapted composition methods that acts according to environment changes is advocated. In this paper, we will study the existe researches that address the web service composition in a dynamic environment to state the art in this area and assist future research.
WEB SERVICE SELECTION BASED ON RANKING OF QOS USING ASSOCIATIVE CLASSIFICATIONijwscjournal
With the explosive growth of the number of services published over the Internet, it is difficult to select satisfactory web services among the candidate web services which provide similar functionalities. Quality of Service (QoS) is considered as the most important non-functional criterion for service selection. But this criterion is no longer considered as the only criterion to rank web services, satisfying user’s preferences. The similarity measure (outputs–inputs similarity) between concepts based on ontology in an interconnected network of semantic Web services involved in a composition can be used as a distinguishing criterion to estimate the semantic quality of selected services for the composite service. Coupling the
semantic similarity as the functional aspect and quality of services allows us to further constrain and select services for the valid composite services. In this paper, we present an overall service selection and ranking framework which firstly classify candidate web services to different QoS levels respect to user’s QoS requirements and preferences with an Associative Classification algorithm and then rank the most qualified candidate services based on their functional quality through semantic matching. The experimental results show that proposed framework can satisfy service requesters’ non-functional requirements.
USER-CENTRIC OPTIMIZATION FOR CONSTRAINT WEB SERVICE COMPOSITION USING A FUZZ...ijwscjournal
Service-Oriented Applications (SOA) are being regarded as the main pragmatic solution for distributed environments. In such systems, however each service responds the user request independently, it is essential to compose them for delivering a compound value-added service. Since, there may be a number of compositions to create the requested service, it is important to find one which its properties are close to user’s desires and meet some non-functional constraints and optimize criteria such as overall cost or response time. In this paper, a user-centric approach is presented for evaluating the service compositions
which attempts to obtain the user desires. This approach uses fuzzy logic in order to inference based on quality criteria ranked by user and Genetic Algorithms to optimize the QoS-aware composition problem. Results show that the Fuzzy-based Genetic algorithm system enables user to participate in the process of web service composition easier and more efficient.
Location-Aware and Personalized Collaborative Filtering for Web Service Recom...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
AN ARCHITECTURE FOR WEB SERVICE SIMILARITY EVALUATION BASED ON THEIR FUNCTION...ijwscjournal
By increasing popularity of SOC, using Web services in applications has increased too. SOC creates a loosely coupled environment in which the actual execution environment might differ significantly from the one with the presupposed conditions during application design. Therefore, although an appropriate Web service might have been selected, by passing time, the Web service may not be efficient enough or may not be applicable under specific conditions.
For service-oriented systems to be flexible and self-adaptive, it is necessary to automatically select and use a similar service instead of the one which causes the above mentioned problems. Finding a similar service means specifying the proper services which fulfill the same requirements as those fulfilled by the problematic service.
In most of the previous works, a number of the best services (k) are selected and ordered based on functional similarity. The user must select one of these services based on his/her preferences. One important metric in selecting a similar service is considering QoS properties and user preferences about QoS. Because of the importance of this issue, in the present paper, an architecture is proposed in which, in addition to functional similarity, QoS properties and user preferences are also considered in selecting a similar service.
AN ADAPTIVE APPROACH FOR DYNAMIC RECOVERY DECISIONS IN WEB SERVICE COMPOSITIO...ijwscjournal
Service Oriented Architecture facilitates automatic execution and composition of web services in
distributed environment. This service composition in the heterogeneous environment may suffer from
various kinds of service failures. These failures interrupt the execution of composite web services and
lead towards complete system failure. The dynamic recovery decisions of the failed services are
dependent on non-functional attributes of the services. In the recent years, various methodologies
have been presented to provide recovery decisions based on time related QoS (Quality of Service)
factors. These QoS attributes can be categorized further. Our paper categorized these attributes as
space and time. In this paper, we have proposed an affinity model to quantify the location affinity for
composition of web services. Furthermore, we have also suggested a replication mechanism and
algorithm for taking recovery decisions based on time and space based QoS parameters and usage
pattern of the services by the user.
WEB SERVICE COMPOSITION IN DYNAMIC ENVIRONMENT: A COMPARATIVE STUDYcscpconf
Web service composition development is a complex and dynamic process. It is one of the challenges in distributed dynamic environments. Although, SOA (Service Oriented Architecture) facilitates service composition process through standard protocols in searching and binding with web services. Yet composition in SOA paradigm faces many challenges. One of the main challenges is the environment in which composition services are developed. Nowadays the environment becomes more dynamic due to the increase in the number of web services that are frequently changing. Therefore, the need for self-adapted composition methods that acts according to environment changes is advocated. In this paper, we will study the existe researches that address the web service composition in a dynamic environment to state the art in this area and assist future research.
WEB SERVICE SELECTION BASED ON RANKING OF QOS USING ASSOCIATIVE CLASSIFICATIONijwscjournal
With the explosive growth of the number of services published over the Internet, it is difficult to select satisfactory web services among the candidate web services which provide similar functionalities. Quality of Service (QoS) is considered as the most important non-functional criterion for service selection. But this criterion is no longer considered as the only criterion to rank web services, satisfying user’s preferences. The similarity measure (outputs–inputs similarity) between concepts based on ontology in an interconnected network of semantic Web services involved in a composition can be used as a distinguishing criterion to estimate the semantic quality of selected services for the composite service. Coupling the
semantic similarity as the functional aspect and quality of services allows us to further constrain and select services for the valid composite services. In this paper, we present an overall service selection and ranking framework which firstly classify candidate web services to different QoS levels respect to user’s QoS requirements and preferences with an Associative Classification algorithm and then rank the most qualified candidate services based on their functional quality through semantic matching. The experimental results show that proposed framework can satisfy service requesters’ non-functional requirements.
USER-CENTRIC OPTIMIZATION FOR CONSTRAINT WEB SERVICE COMPOSITION USING A FUZZ...ijwscjournal
Service-Oriented Applications (SOA) are being regarded as the main pragmatic solution for distributed environments. In such systems, however each service responds the user request independently, it is essential to compose them for delivering a compound value-added service. Since, there may be a number of compositions to create the requested service, it is important to find one which its properties are close to user’s desires and meet some non-functional constraints and optimize criteria such as overall cost or response time. In this paper, a user-centric approach is presented for evaluating the service compositions
which attempts to obtain the user desires. This approach uses fuzzy logic in order to inference based on quality criteria ranked by user and Genetic Algorithms to optimize the QoS-aware composition problem. Results show that the Fuzzy-based Genetic algorithm system enables user to participate in the process of web service composition easier and more efficient.
Location-Aware and Personalized Collaborative Filtering for Web Service Recom...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
AN ARCHITECTURE FOR WEB SERVICE SIMILARITY EVALUATION BASED ON THEIR FUNCTION...ijwscjournal
By increasing popularity of SOC, using Web services in applications has increased too. SOC creates a loosely coupled environment in which the actual execution environment might differ significantly from the one with the presupposed conditions during application design. Therefore, although an appropriate Web service might have been selected, by passing time, the Web service may not be efficient enough or may not be applicable under specific conditions.
For service-oriented systems to be flexible and self-adaptive, it is necessary to automatically select and use a similar service instead of the one which causes the above mentioned problems. Finding a similar service means specifying the proper services which fulfill the same requirements as those fulfilled by the problematic service.
In most of the previous works, a number of the best services (k) are selected and ordered based on functional similarity. The user must select one of these services based on his/her preferences. One important metric in selecting a similar service is considering QoS properties and user preferences about QoS. Because of the importance of this issue, in the present paper, an architecture is proposed in which, in addition to functional similarity, QoS properties and user preferences are also considered in selecting a similar service.
AN ADAPTIVE APPROACH FOR DYNAMIC RECOVERY DECISIONS IN WEB SERVICE COMPOSITIO...ijwscjournal
Service Oriented Architecture facilitates automatic execution and composition of web services in
distributed environment. This service composition in the heterogeneous environment may suffer from
various kinds of service failures. These failures interrupt the execution of composite web services and
lead towards complete system failure. The dynamic recovery decisions of the failed services are
dependent on non-functional attributes of the services. In the recent years, various methodologies
have been presented to provide recovery decisions based on time related QoS (Quality of Service)
factors. These QoS attributes can be categorized further. Our paper categorized these attributes as
space and time. In this paper, we have proposed an affinity model to quantify the location affinity for
composition of web services. Furthermore, we have also suggested a replication mechanism and
algorithm for taking recovery decisions based on time and space based QoS parameters and usage
pattern of the services by the user.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
User-Rating Based QoS Aware Approach for Selection of Updated Web Services to...IDES Editor
The concept of dynamic composition of Web services
has been given major importance in the recent years. While
there are many systems available to select the services with
the highest QoS score, very little thought has been given to
the fact of constructing a model which takes in the user’s
rating of a service as a major input for selection. A robust
system for fetching the most updated version of the selected
services and selection of the services based on users’ ratings
of the QoS values rather than on the actual QoS values has
been presented in our paper.
Reliability evaluation model for composite web servicesdannyijwest
Web services are the new innovation in this era. Because of the cross-platform and language independent nature of the web
services, it is getting accepted by the various industries. Revolution in Service Oriented Architecture (SOA) has created
numerous web service users. Different choices of services are available to meet the specific requirement of customers. At the
same time, customer needs quality service. Selecting the web service which meets all the Quality of Service (QoS) requirement
specified by the consumer in the Service Level Agreement is a tedious task today. One of the predominant QoS factor is
reliability of the web service. Evaluation of reliability on web services and selecting the best one among the different choices are
needed now. This paper focuses on the design of reliability evaluation framework for the composite web services.
A review on framework and quality of service based web services discoveryMustafa Algaet
In consequence these services are nowadays accessible to the final clients. In the last few years, more
and more Web Services providing the same functionalities are available in the environment. In order to
select the best service adapted to client’s requests, we need some method capable to evaluate and
compare different services providing the same functionalities. In this context, Quality of service can be defined as the capability to respond to the requirements (constraints) of a client and to fulfill these
needs with the best criteria (preferences) established by the client. It is calculated based on the non-
functional properties of the service. This paper provides an overview of a research progress in Quality
of Service Based Web Services Discovery; it also highlights the issues that need to be investigated in
Quality of Service Based Web Services
Service-oriented computing is meant to support loose relationships between organizations; Serviceoriented
architectures often have the goal to integrate various distributed services of one or more
organizations in a flexible way to be able to quickly react on business changes.
Distributed services provided a new way of distributed computing that achieve the interoperability between
heterogonous application through platform and language independent interfaces. The creation of value
added services by composition of existing ones is gaining a significant momentum. Distributed service
composition is meant to support loose relationships between implemented services in order to provide new
functions. A composite service is the one resulting from the integration, coordination and synchronization
of different service components. In this paper, we generated A Services Composition Model (SCM) that
provides a general solution for the services composition problem by realizing the requirements of a new
service using the requirements of the already existing service. We explained in details all the steps of the
composition process; services registration, services discovery, services selection, services invoking, and
services integration. Although the SCM is not bounded to one particular algorithm to compose services, we
generated an application as an example to test our Service Composition Model.
We also generated the Services Composition Language (SCL) as a simple text-based language which
allows the user to express the requirements of his request, the inserted request will then be analyzed using
our Parsing Algorithm to determine the name of the requested services, after that our Service Composition
Algorithm will execute all the steps of the composition process and return the result of the composition to
the user.
QOS OF WEB SERVICE: SURVEY ON PERFORMANCE AND SCALABILITYcsandit
In today’s scenario, most of the organizations provide the services through the web. This makes
the web service an important research area. In addition, early design and building web services,
it is necessary to concentrate on the quality of web services. Performance is an important
quality attributes that to be considered during the designing of web services. The expected
performance can be achieved by proper scheduling of resources and scalability of the system.
Scalability is a desirable attribute of a process computer system or network. Poor scalability
can result in lacking system performance. Hence, in this paper, we have reviewed the literature
available for the quality attributes of performance and scalability and identified the issues that
affect the quality attributes related to Web Services.
FUZZY-BASED ARCHITECTURE TO IMPLEMENT SERVICE SELECTION ADAPTATION STRATEGYijwscjournal
One of the main requirements in service based applications is runtime adaptation to changes that occur in
business, user, environment, and computational contexts. Changes in contexts lead to QOS degrade.
Continues adaptation mechanism and strategies are required to stay service based applications(SBA) in
safe state. In this paper a framework for runtime adaptation in service based application isintroduced. It
checks user requirements change continuously and dynamically adopts architecture model. Also it checks
providers QOS attributes continuously and if adaptation requirement is triggered, runs service selection
adaptation strategy to satisfy user preferences. Thusit is a context aware and automatically adaptable
framework for SBA applications. Wehave implemented a fuzzy based system for web service selection unit.
Due to ambiguity of context’s data and cross-cutting effects of quality of services, using fuzzy would result
an optimised decision. Finally we illustrated that using of it has a good performance for web service based
applications.
SERVICE ORIENTED QUALITY REQUIREMENT FRAMEWORK FOR CLOUD COMPUTINGijcsit
This research paper introduces a framework to identify the quality requirements of cloud computing services. It considered two dominant sub-layers; functional layer and runtime layer against cloud characteristics. SERVQUAL model attributes and the opinions of the industry experts were used to derive the quality constructs in cloud computing environment. The framework gives proper identification of cloud computing service quality expectations of users. The validity of the framework was evaluated by using
questionnaire based survey. Partial least squares-structural equation modelling (PLS-SEM) technique was
used to evaluate the outcome. The research findings shows that the significance of functional layer is
higher than runtime layer and prioritized quality factors of two layers are Service time, Information and
data security, Recoverability, Service Transparency, and Accessibility.
Semantic Web: A Study on Web Service Composition Approachesijtsrd
A Web service is a collection of open protocols and standards used for exchanging data between applications and systems. Web Service discovery, selection and composition are the important tasks of the any automated business processes. In a web service composition set of web services are collectively executed to achieve the objectives. This study reveals the existing approaches used for web service composition in both syntactic and semantic environments. We have reviewed more than 40 articles in this domain and concluded with merits and demerits of the methodologies applied for the implementation of the web service composition. Michael Raj TF, | Siva Prakasam. P"Semantic Web: A Study on Web Service Composition Approaches" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-1 | Issue-4 , June 2017, URL: http://www.ijtsrd.com/papers/ijtsrd115.pdf http://www.ijtsrd.com/computer-science/world-wide-web/115/semantic-web-a-study-on-web-service-composition-approaches/michael-raj-tf-
A Modified Genetic Algorithm based Load Distribution Approach towards Web Hot...idescitation
Web hotspot is a serious problem often experienced in case popular websites. It
provides dramatic load spike in a website, which occurs when a huge number of users
accessing the same website. A prominent solution to this problem is server load balancing.
Dynamic load balancing involves allocation of requests to the server or processor
dynamically when they arrive. For effective load balancing, a near-optimal schedule of
incoming requests or processes must be determined “on-the-fly”, so that execution of
requests can be completed in shortest possible time. So we have proposed a Genetic
Algorithm based load balancing scheme which relies on a process scheduling policy. Genetic
Algorithm provides to search for the optimal solution out a search of candidate solutions. It
follows the survival-of-the-fittest principle, to achieve the optimal solution, through a
number of generations. The proposed algorithm is evaluated for various population size and
number of generations, to maximize the processor utilization of nodes/ processors in the
system.
2 ieee nui cone-13 soa testing perspective model for regression testingAbhishek Srivastava
Service-Oriented Architecture (SOA) supports loose-coupling and interoperability, where services communicate with each-other through message exchanging protocol and interfaces. SOA supports vendor diversity. In order to full-fill the vendor need, service composition is considered as a key process. Regression testing is inevitable to assure the quality of SOA based applications during their evolution. This paper defines a regression testing process which helps us in regression testing of complex SOA based applications. We also propose an SOA testing perspective model. Here we divide SOA testing perspective model into three parts: Service developer perspective, Service tester perspective and Service provider perspective. The Proposed model also focuses on service validity when the service is going to register in the Universal Description and Discovery Integration (UDDI).
Similarity measures for web service composition modelsijwscjournal
A Web service composition is an interconnected set of multiple specialized Web service operations, which
complement each other to offer an improved tool capable of solving more complex problems. Manual
design and implementation of Web service compositions are among the most difficult and error prone tasks.
To face this complexity and to reduce errors at design time, the developer can alternatively search and
reuse existing compositions that have solved similar problems. Thus the problem of designing and
implementing Web service compositions can be reduced to the problem of finding and selecting the
composition closest to an initial specification. To achieve this goal, there is the need to define and use
similarity measures to determine how close is a given composition with respect to any given specification.
Comparison of Web service compositions can be done using two possible sources: composition designs
(models), and execution logs of compositions. In particular, in this paper a set of similarity measures are
described for Web service composition models. The main objective is to measure and assess the degree of
closeness between two given compositions of Web services regardless of their modelling language.
WEB SERVICE SELECTION BASED ON RANKING OF QOS USING ASSOCIATIVE CLASSIFICATIONijwscjournal
With the explosive growth of the number of services published over the Internet, it is difficult to select satisfactory web services among the candidate web services which provide similar functionalities. Quality of Service (QoS) is considered as the most important non-functional criterion for service selection. But this criterion is no longer considered as the only criterion to rank web services, satisfying user’s preferences. The similarity measure (outputs–inputs similarity) between concepts based on ontology in an interconnected network of semantic Web services involved in a composition can be used as a distinguishing criterion to estimate the semantic quality of selected services for the composite service. Coupling the
semantic similarity as the functional aspect and quality of services allows us to further constrain and select services for the valid composite services.
In this paper, we present an overall service selection and ranking framework which firstly classify candidate web services to different QoS levels respect to user’s QoS requirements and preferences with an Associative Classification algorithm and then rank the most qualified candidate services based on their
functional quality through semantic matching. The experimental results show that proposed framework can satisfy service requesters’ non-functional requirements.
WEB SERVICE SELECTION BASED ON RANKING OF QOS USING ASSOCIATIVE CLASSIFICATIONijwscjournal
With the explosive growth of the number of services published over the Internet, it is difficult to select satisfactory web services among the candidate web services which provide similar functionalities. Quality of Service (QoS) is considered as the most important non-functional criterion for service selection. But this criterion is no longer considered as the only criterion to rank web services, satisfying user’s preferences. The similarity measure (outputs–inputs similarity) between concepts based on ontology in an interconnected network of semantic Web services involved in a composition can be used as a distinguishing criterion to estimate the semantic quality of selected services for the composite service. Coupling the semantic similarity as the functional aspect and quality of services allows us to further constrain and select services for the valid composite services.
In this paper, we present an overall service selection and ranking framework which firstly classify candidate web services to different QoS levels respect to user’s QoS requirements and preferences with an Associative Classification algorithm and then rank the most qualified candidate services based on their functional quality through semantic matching. The experimental results show that proposed framework can satisfy service requesters’ non-functional requirements.
WEB SERVICE SELECTION BASED ON RANKING OF QOS USING ASSOCIATIVE CLASSIFICATIONijwscjournal
With the explosive growth of the number of services published over the Internet, it is difficult to select satisfactory web services among the candidate web services which provide similar functionalities. Quality of Service (QoS) is considered as the most important non-functional criterion for service selection. But this criterion is no longer considered as the only criterion to rank web services, satisfying user’s preferences. The similarity measure (outputs–inputs similarity) between concepts based on ontology in an interconnected network of semantic Web services involved in a composition can be used as a distinguishing criterion to estimate the semantic quality of selected services for the composite service. Coupling the semantic similarity as the functional aspect and quality of services allows us to further constrain and select services for the valid composite services.
In this paper, we present an overall service selection and ranking framework which firstly classify candidate web services to different QoS levels respect to user’s QoS requirements and preferences with an Associative Classification algorithm and then rank the most qualified candidate services based on their functional quality through semantic matching. The experimental results show that proposed framework can satisfy service requesters’ non-functional requirements.
USER-CENTRIC OPTIMIZATION FOR CONSTRAINT WEB SERVICE COMPOSITION USING A FUZZ...ijwscjournal
Service-Oriented Applications (SOA) are being regarded as the main pragmatic solution for distributed environments. In such systems, however each service responds the user request independently, it is essential to compose them for delivering a compound value-added service. Since, there may be a number of compositions to create the requested service, it is important to find one which its properties are close to user’s desires and meet some non-functional constraints and optimize criteria such as overall cost or response time. In this paper, a user-centric approach is presented for evaluating the service compositions
which attempts to obtain the user desires. This approach uses fuzzy logic in order to inference based on quality criteria ranked by user and Genetic Algorithms to optimize the QoS-aware composition problem. Results show that the Fuzzy-based Genetic algorithm system enables user to participate in the process of web service composition easier and more efficient.
User-Centric Optimization for Constraint Web Service Composition using a Fuzz...ijwscjournal
ABSTRACT
Service-Oriented Applications (SOA) are being regarded as the main pragmatic solution for distributed
environments. In such systems, however each service responds the user request independently, it is
essential to compose them for delivering a compound value-added service. Since, there may be a number of
compositions to create the requested service, it is important to find one which its properties are close to
user’s desires and meet some non-functional constraints and optimize criteria such as overall cost or
response time. In this paper, a user-centric approach is presented for evaluating the service compositions
which attempts to obtain the user desires. This approach uses fuzzy logic in order to inference based on
quality criteria ranked by user and Genetic Algorithms to optimize the QoS-aware composition problem.
Results show that the Fuzzy-based Genetic algorithm system enables user to participate in the process of
web service composition easier and more efficient.
AN ARCHITECTURE FOR WEB SERVICE SIMILARITY EVALUATION BASED ON THEIR FUNCTION...ijwscjournal
By increasing popularity of SOC, using Web services in applications has increased too. SOC creates a loosely coupled environment in which the actual execution environment might differ significantly from the one with the presupposed conditions during application design. Therefore, although an appropriate Web service might have been selected, by passing time, the Web service may not be efficient enough or may not be applicable under specific conditions.
For service-oriented systems to be flexible and self-adaptive, it is necessary to automatically select and use a similar service instead of the one which causes the above mentioned problems. Finding a similar service means specifying the proper services which fulfill the same requirements as those fulfilled by the problematic service.
In most of the previous works, a number of the best services (k) are selected and ordered based on functional similarity. The user must select one of these services based on his/her preferences. One important metric in selecting a similar service is considering QoS properties and user preferences about QoS. Because of the importance of this issue, in the present paper, an architecture is proposed in which, in addition to functional similarity, QoS properties and user preferences are also considered in selecting a similar service.
AN ARCHITECTURE FOR WEB SERVICE SIMILARITY EVALUATION BASED ON THEIR FUNCTION...ijwscjournal
By increasing popularity of SOC, using Web services in applications has increased too. SOC creates a loosely coupled environment in which the actual execution environment might differ significantly from the one with the presupposed conditions during application design. Therefore, although an appropriate Web service might have been selected, by passing time, the Web service may not be efficient enough or may not be applicable under specific conditions.
For service-oriented systems to be flexible and self-adaptive, it is necessary to automatically select and use a similar service instead of the one which causes the above mentioned problems. Finding a similar service means specifying the proper services which fulfill the same requirements as those fulfilled by the problematic service.
In most of the previous works, a number of the best services (k) are selected and ordered based on functional similarity. The user must select one of these services based on his/her preferences. One important metric in selecting a similar service is considering QoS properties and user preferences about QoS. Because of the importance of this issue, in the present paper, an architecture is proposed in which, in addition to functional similarity, QoS properties and user preferences are also considered in selecting a similar service.
AN ADAPTIVE APPROACH FOR DYNAMIC RECOVERY DECISIONS IN WEB SERVICE COMPOSITIO...ijwscjournal
Service Oriented Architecture facilitates automatic execution and composition of web services in distributed environment. This service composition in the heterogeneous environment may suffer from various kinds of service failures. These failures interrupt the execution of composite web services and lead towards complete system failure. The dynamic recovery decisions of the failed services are dependent on non-functional attributes of the services. In the recent years, various methodologies have been presented to provide recovery decisions based on time related QoS (Quality of Service) factors. These QoS attributes can be categorized further. Our paper categorized these attributes as space and time. In this paper, we have proposed an affinity model to quantify the location affinity for composition of web services. Furthermore, we have also suggested a replication mechanism and algorithm for taking recovery decisions based on time and space based QoS parameters and usage pattern of the services by the user.
Immune-Inspired Method for Selecting the Optimal Solution in Semantic Web Ser...IJwest
The increasing interest in developing efficient and effective optimization techniques has conducted researchers to turn their attention towards biology. It has been noticed that biology offers many clues for designing novel optimization techniques, these approaches exhibit self-organizing capabilities and permit the reachability of promising solutions without the existence of a central coordinator. In this paper we handle the problem of dynamic web service composition, by using the clonal selection algorithm. In order to assess the optimality rate of a given composition, we use the QOS attributes of the services involved in the workflow as well as, the semantic similarity between these components. The experimental evaluation shows that the proposed approach has a better performance in comparison with other approaches such as the genetic algorithm.
Location-Aware and Personalized Collaborative Filtering for Web Service Recom...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
User-Rating Based QoS Aware Approach for Selection of Updated Web Services to...IDES Editor
The concept of dynamic composition of Web services
has been given major importance in the recent years. While
there are many systems available to select the services with
the highest QoS score, very little thought has been given to
the fact of constructing a model which takes in the user’s
rating of a service as a major input for selection. A robust
system for fetching the most updated version of the selected
services and selection of the services based on users’ ratings
of the QoS values rather than on the actual QoS values has
been presented in our paper.
Reliability evaluation model for composite web servicesdannyijwest
Web services are the new innovation in this era. Because of the cross-platform and language independent nature of the web
services, it is getting accepted by the various industries. Revolution in Service Oriented Architecture (SOA) has created
numerous web service users. Different choices of services are available to meet the specific requirement of customers. At the
same time, customer needs quality service. Selecting the web service which meets all the Quality of Service (QoS) requirement
specified by the consumer in the Service Level Agreement is a tedious task today. One of the predominant QoS factor is
reliability of the web service. Evaluation of reliability on web services and selecting the best one among the different choices are
needed now. This paper focuses on the design of reliability evaluation framework for the composite web services.
A review on framework and quality of service based web services discoveryMustafa Algaet
In consequence these services are nowadays accessible to the final clients. In the last few years, more
and more Web Services providing the same functionalities are available in the environment. In order to
select the best service adapted to client’s requests, we need some method capable to evaluate and
compare different services providing the same functionalities. In this context, Quality of service can be defined as the capability to respond to the requirements (constraints) of a client and to fulfill these
needs with the best criteria (preferences) established by the client. It is calculated based on the non-
functional properties of the service. This paper provides an overview of a research progress in Quality
of Service Based Web Services Discovery; it also highlights the issues that need to be investigated in
Quality of Service Based Web Services
Service-oriented computing is meant to support loose relationships between organizations; Serviceoriented
architectures often have the goal to integrate various distributed services of one or more
organizations in a flexible way to be able to quickly react on business changes.
Distributed services provided a new way of distributed computing that achieve the interoperability between
heterogonous application through platform and language independent interfaces. The creation of value
added services by composition of existing ones is gaining a significant momentum. Distributed service
composition is meant to support loose relationships between implemented services in order to provide new
functions. A composite service is the one resulting from the integration, coordination and synchronization
of different service components. In this paper, we generated A Services Composition Model (SCM) that
provides a general solution for the services composition problem by realizing the requirements of a new
service using the requirements of the already existing service. We explained in details all the steps of the
composition process; services registration, services discovery, services selection, services invoking, and
services integration. Although the SCM is not bounded to one particular algorithm to compose services, we
generated an application as an example to test our Service Composition Model.
We also generated the Services Composition Language (SCL) as a simple text-based language which
allows the user to express the requirements of his request, the inserted request will then be analyzed using
our Parsing Algorithm to determine the name of the requested services, after that our Service Composition
Algorithm will execute all the steps of the composition process and return the result of the composition to
the user.
QOS OF WEB SERVICE: SURVEY ON PERFORMANCE AND SCALABILITYcsandit
In today’s scenario, most of the organizations provide the services through the web. This makes
the web service an important research area. In addition, early design and building web services,
it is necessary to concentrate on the quality of web services. Performance is an important
quality attributes that to be considered during the designing of web services. The expected
performance can be achieved by proper scheduling of resources and scalability of the system.
Scalability is a desirable attribute of a process computer system or network. Poor scalability
can result in lacking system performance. Hence, in this paper, we have reviewed the literature
available for the quality attributes of performance and scalability and identified the issues that
affect the quality attributes related to Web Services.
FUZZY-BASED ARCHITECTURE TO IMPLEMENT SERVICE SELECTION ADAPTATION STRATEGYijwscjournal
One of the main requirements in service based applications is runtime adaptation to changes that occur in
business, user, environment, and computational contexts. Changes in contexts lead to QOS degrade.
Continues adaptation mechanism and strategies are required to stay service based applications(SBA) in
safe state. In this paper a framework for runtime adaptation in service based application isintroduced. It
checks user requirements change continuously and dynamically adopts architecture model. Also it checks
providers QOS attributes continuously and if adaptation requirement is triggered, runs service selection
adaptation strategy to satisfy user preferences. Thusit is a context aware and automatically adaptable
framework for SBA applications. Wehave implemented a fuzzy based system for web service selection unit.
Due to ambiguity of context’s data and cross-cutting effects of quality of services, using fuzzy would result
an optimised decision. Finally we illustrated that using of it has a good performance for web service based
applications.
SERVICE ORIENTED QUALITY REQUIREMENT FRAMEWORK FOR CLOUD COMPUTINGijcsit
This research paper introduces a framework to identify the quality requirements of cloud computing services. It considered two dominant sub-layers; functional layer and runtime layer against cloud characteristics. SERVQUAL model attributes and the opinions of the industry experts were used to derive the quality constructs in cloud computing environment. The framework gives proper identification of cloud computing service quality expectations of users. The validity of the framework was evaluated by using
questionnaire based survey. Partial least squares-structural equation modelling (PLS-SEM) technique was
used to evaluate the outcome. The research findings shows that the significance of functional layer is
higher than runtime layer and prioritized quality factors of two layers are Service time, Information and
data security, Recoverability, Service Transparency, and Accessibility.
Semantic Web: A Study on Web Service Composition Approachesijtsrd
A Web service is a collection of open protocols and standards used for exchanging data between applications and systems. Web Service discovery, selection and composition are the important tasks of the any automated business processes. In a web service composition set of web services are collectively executed to achieve the objectives. This study reveals the existing approaches used for web service composition in both syntactic and semantic environments. We have reviewed more than 40 articles in this domain and concluded with merits and demerits of the methodologies applied for the implementation of the web service composition. Michael Raj TF, | Siva Prakasam. P"Semantic Web: A Study on Web Service Composition Approaches" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-1 | Issue-4 , June 2017, URL: http://www.ijtsrd.com/papers/ijtsrd115.pdf http://www.ijtsrd.com/computer-science/world-wide-web/115/semantic-web-a-study-on-web-service-composition-approaches/michael-raj-tf-
A Modified Genetic Algorithm based Load Distribution Approach towards Web Hot...idescitation
Web hotspot is a serious problem often experienced in case popular websites. It
provides dramatic load spike in a website, which occurs when a huge number of users
accessing the same website. A prominent solution to this problem is server load balancing.
Dynamic load balancing involves allocation of requests to the server or processor
dynamically when they arrive. For effective load balancing, a near-optimal schedule of
incoming requests or processes must be determined “on-the-fly”, so that execution of
requests can be completed in shortest possible time. So we have proposed a Genetic
Algorithm based load balancing scheme which relies on a process scheduling policy. Genetic
Algorithm provides to search for the optimal solution out a search of candidate solutions. It
follows the survival-of-the-fittest principle, to achieve the optimal solution, through a
number of generations. The proposed algorithm is evaluated for various population size and
number of generations, to maximize the processor utilization of nodes/ processors in the
system.
2 ieee nui cone-13 soa testing perspective model for regression testingAbhishek Srivastava
Service-Oriented Architecture (SOA) supports loose-coupling and interoperability, where services communicate with each-other through message exchanging protocol and interfaces. SOA supports vendor diversity. In order to full-fill the vendor need, service composition is considered as a key process. Regression testing is inevitable to assure the quality of SOA based applications during their evolution. This paper defines a regression testing process which helps us in regression testing of complex SOA based applications. We also propose an SOA testing perspective model. Here we divide SOA testing perspective model into three parts: Service developer perspective, Service tester perspective and Service provider perspective. The Proposed model also focuses on service validity when the service is going to register in the Universal Description and Discovery Integration (UDDI).
Similarity measures for web service composition modelsijwscjournal
A Web service composition is an interconnected set of multiple specialized Web service operations, which
complement each other to offer an improved tool capable of solving more complex problems. Manual
design and implementation of Web service compositions are among the most difficult and error prone tasks.
To face this complexity and to reduce errors at design time, the developer can alternatively search and
reuse existing compositions that have solved similar problems. Thus the problem of designing and
implementing Web service compositions can be reduced to the problem of finding and selecting the
composition closest to an initial specification. To achieve this goal, there is the need to define and use
similarity measures to determine how close is a given composition with respect to any given specification.
Comparison of Web service compositions can be done using two possible sources: composition designs
(models), and execution logs of compositions. In particular, in this paper a set of similarity measures are
described for Web service composition models. The main objective is to measure and assess the degree of
closeness between two given compositions of Web services regardless of their modelling language.
WEB SERVICE SELECTION BASED ON RANKING OF QOS USING ASSOCIATIVE CLASSIFICATIONijwscjournal
With the explosive growth of the number of services published over the Internet, it is difficult to select satisfactory web services among the candidate web services which provide similar functionalities. Quality of Service (QoS) is considered as the most important non-functional criterion for service selection. But this criterion is no longer considered as the only criterion to rank web services, satisfying user’s preferences. The similarity measure (outputs–inputs similarity) between concepts based on ontology in an interconnected network of semantic Web services involved in a composition can be used as a distinguishing criterion to estimate the semantic quality of selected services for the composite service. Coupling the
semantic similarity as the functional aspect and quality of services allows us to further constrain and select services for the valid composite services.
In this paper, we present an overall service selection and ranking framework which firstly classify candidate web services to different QoS levels respect to user’s QoS requirements and preferences with an Associative Classification algorithm and then rank the most qualified candidate services based on their
functional quality through semantic matching. The experimental results show that proposed framework can satisfy service requesters’ non-functional requirements.
WEB SERVICE SELECTION BASED ON RANKING OF QOS USING ASSOCIATIVE CLASSIFICATIONijwscjournal
With the explosive growth of the number of services published over the Internet, it is difficult to select satisfactory web services among the candidate web services which provide similar functionalities. Quality of Service (QoS) is considered as the most important non-functional criterion for service selection. But this criterion is no longer considered as the only criterion to rank web services, satisfying user’s preferences. The similarity measure (outputs–inputs similarity) between concepts based on ontology in an interconnected network of semantic Web services involved in a composition can be used as a distinguishing criterion to estimate the semantic quality of selected services for the composite service. Coupling the semantic similarity as the functional aspect and quality of services allows us to further constrain and select services for the valid composite services.
In this paper, we present an overall service selection and ranking framework which firstly classify candidate web services to different QoS levels respect to user’s QoS requirements and preferences with an Associative Classification algorithm and then rank the most qualified candidate services based on their functional quality through semantic matching. The experimental results show that proposed framework can satisfy service requesters’ non-functional requirements.
WEB SERVICE SELECTION BASED ON RANKING OF QOS USING ASSOCIATIVE CLASSIFICATIONijwscjournal
With the explosive growth of the number of services published over the Internet, it is difficult to select satisfactory web services among the candidate web services which provide similar functionalities. Quality of Service (QoS) is considered as the most important non-functional criterion for service selection. But this criterion is no longer considered as the only criterion to rank web services, satisfying user’s preferences. The similarity measure (outputs–inputs similarity) between concepts based on ontology in an interconnected network of semantic Web services involved in a composition can be used as a distinguishing criterion to estimate the semantic quality of selected services for the composite service. Coupling the semantic similarity as the functional aspect and quality of services allows us to further constrain and select services for the valid composite services.
In this paper, we present an overall service selection and ranking framework which firstly classify candidate web services to different QoS levels respect to user’s QoS requirements and preferences with an Associative Classification algorithm and then rank the most qualified candidate services based on their functional quality through semantic matching. The experimental results show that proposed framework can satisfy service requesters’ non-functional requirements.
USER-CENTRIC OPTIMIZATION FOR CONSTRAINT WEB SERVICE COMPOSITION USING A FUZZ...ijwscjournal
Service-Oriented Applications (SOA) are being regarded as the main pragmatic solution for distributed environments. In such systems, however each service responds the user request independently, it is essential to compose them for delivering a compound value-added service. Since, there may be a number of compositions to create the requested service, it is important to find one which its properties are close to user’s desires and meet some non-functional constraints and optimize criteria such as overall cost or response time. In this paper, a user-centric approach is presented for evaluating the service compositions
which attempts to obtain the user desires. This approach uses fuzzy logic in order to inference based on quality criteria ranked by user and Genetic Algorithms to optimize the QoS-aware composition problem. Results show that the Fuzzy-based Genetic algorithm system enables user to participate in the process of web service composition easier and more efficient.
User-Centric Optimization for Constraint Web Service Composition using a Fuzz...ijwscjournal
ABSTRACT
Service-Oriented Applications (SOA) are being regarded as the main pragmatic solution for distributed
environments. In such systems, however each service responds the user request independently, it is
essential to compose them for delivering a compound value-added service. Since, there may be a number of
compositions to create the requested service, it is important to find one which its properties are close to
user’s desires and meet some non-functional constraints and optimize criteria such as overall cost or
response time. In this paper, a user-centric approach is presented for evaluating the service compositions
which attempts to obtain the user desires. This approach uses fuzzy logic in order to inference based on
quality criteria ranked by user and Genetic Algorithms to optimize the QoS-aware composition problem.
Results show that the Fuzzy-based Genetic algorithm system enables user to participate in the process of
web service composition easier and more efficient.
AN ARCHITECTURE FOR WEB SERVICE SIMILARITY EVALUATION BASED ON THEIR FUNCTION...ijwscjournal
By increasing popularity of SOC, using Web services in applications has increased too. SOC creates a loosely coupled environment in which the actual execution environment might differ significantly from the one with the presupposed conditions during application design. Therefore, although an appropriate Web service might have been selected, by passing time, the Web service may not be efficient enough or may not be applicable under specific conditions.
For service-oriented systems to be flexible and self-adaptive, it is necessary to automatically select and use a similar service instead of the one which causes the above mentioned problems. Finding a similar service means specifying the proper services which fulfill the same requirements as those fulfilled by the problematic service.
In most of the previous works, a number of the best services (k) are selected and ordered based on functional similarity. The user must select one of these services based on his/her preferences. One important metric in selecting a similar service is considering QoS properties and user preferences about QoS. Because of the importance of this issue, in the present paper, an architecture is proposed in which, in addition to functional similarity, QoS properties and user preferences are also considered in selecting a similar service.
AN ARCHITECTURE FOR WEB SERVICE SIMILARITY EVALUATION BASED ON THEIR FUNCTION...ijwscjournal
By increasing popularity of SOC, using Web services in applications has increased too. SOC creates a loosely coupled environment in which the actual execution environment might differ significantly from the one with the presupposed conditions during application design. Therefore, although an appropriate Web service might have been selected, by passing time, the Web service may not be efficient enough or may not be applicable under specific conditions.
For service-oriented systems to be flexible and self-adaptive, it is necessary to automatically select and use a similar service instead of the one which causes the above mentioned problems. Finding a similar service means specifying the proper services which fulfill the same requirements as those fulfilled by the problematic service.
In most of the previous works, a number of the best services (k) are selected and ordered based on functional similarity. The user must select one of these services based on his/her preferences. One important metric in selecting a similar service is considering QoS properties and user preferences about QoS. Because of the importance of this issue, in the present paper, an architecture is proposed in which, in addition to functional similarity, QoS properties and user preferences are also considered in selecting a similar service.
AN ADAPTIVE APPROACH FOR DYNAMIC RECOVERY DECISIONS IN WEB SERVICE COMPOSITIO...ijwscjournal
Service Oriented Architecture facilitates automatic execution and composition of web services in distributed environment. This service composition in the heterogeneous environment may suffer from various kinds of service failures. These failures interrupt the execution of composite web services and lead towards complete system failure. The dynamic recovery decisions of the failed services are dependent on non-functional attributes of the services. In the recent years, various methodologies have been presented to provide recovery decisions based on time related QoS (Quality of Service) factors. These QoS attributes can be categorized further. Our paper categorized these attributes as space and time. In this paper, we have proposed an affinity model to quantify the location affinity for composition of web services. Furthermore, we have also suggested a replication mechanism and algorithm for taking recovery decisions based on time and space based QoS parameters and usage pattern of the services by the user.
Immune-Inspired Method for Selecting the Optimal Solution in Semantic Web Ser...IJwest
The increasing interest in developing efficient and effective optimization techniques has conducted researchers to turn their attention towards biology. It has been noticed that biology offers many clues for designing novel optimization techniques, these approaches exhibit self-organizing capabilities and permit the reachability of promising solutions without the existence of a central coordinator. In this paper we handle the problem of dynamic web service composition, by using the clonal selection algorithm. In order to assess the optimality rate of a given composition, we use the QOS attributes of the services involved in the workflow as well as, the semantic similarity between these components. The experimental evaluation shows that the proposed approach has a better performance in comparison with other approaches such as the genetic algorithm.
Location-Aware and Personalized Collaborative Filtering for Web Service Recom...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
MMUNE-INSPIRED METHOD FOR SELECTING THE OPTIMAL SOLUTION IN SEMANTIC WEB SE...dannyijwest
The increasing interest in developing efficient and effective optimization techniques has conducted
researchers to turn their attention towards biology. It has been noticed that biology offers many clues for
designing novel optimization techniques, these approaches exhibit self-organizing capabilities and permit
the reachability of promising solutions without the existence of a central coordinator. In this paper we
handle the problem of dynamic web service composition, by using the clonal selection algorithm. In order
to assess the optimality rate of a given composition, we use the QOS attributes of the services involved in
the workflow as well as, the semantic similarity between these components. The experimental evaluation
shows that the proposed approach has a better performance in comparison with other approaches such as
the genetic algorithm
Web service composition is a concept based on the built of an abstract process, by combining multiple existing class instances, where during the execution, each service class is replaced by a concrete service, selected from several web service candidates. This approach has as an advantage generating flexible and low coupling applications, based on its conception on many elementary modules available on the web. The process of service selection during the composition is based on several axes, one of these axes is the QoS-based web service selection. The Qos or Quality of Service represent a set of parameters that characterize the non-functional web service aspect (execution time, cost, etc...). The composition of web services based on Qos, is the process which allows the selection of the web services that fulfill the user need, based on its qualities. Selected services should optimize the global QoS of the composed process, while satisfying all the constraints specified by the client in all QoS parameters. In this paper, we propose an approach based on the concept of agent system and Skyline approach to effectively select services for composition, and reducing the number of candidate services to be generated and considered in treatment. To evaluate our approach experimentally, we use a several random datasets of services with random values of qualities.
A TWO-LEVELED WEB SERVICE PATH RE-PLANNING TECHNIQUEijwscjournal
Web service paths can accomplish customer requirements. During the execution of a web service path, violations of service level agreements (SLAs) will cause the path to be re-planed (healed). Existing re-planning techniques generally suffer from shortcomings of ignoring the effect of requirement change.
This paper proposes a two-leveled path re-planning technique (TLPRP), which offers the following features: (a) TLPRP is composed of both meta and physical levels. The meta level re-planning senses environment parameters (e.g., requirement change and analysis/design errors) and re-plan the affected component paths produced by system design. (b) The physical level re-planning algorithm possesses the ability of web
service path composition. (c) The re-planning algorithm embeds an access control policy that computes a successful possibility for every path to facilitate avoiding execution failure caused by web service access failure.
QOS Aware Formalized Model for Semantic Web Service SelectionIJwest
Selecting the most relevant Web Service according to a client requirement is an onerous task, as innumerous number of functionally same Web Services(WS) are listed in UDDI registry. WS are functionally same but their Quality and performance varies as per service providers. A web Service Selection Process involves two major points: Recommending the pertinent Web Service and avoiding unjustifiable web service. The deficiency in keyword based searching is that it doesn’t handle the client request accurately as keyword may have ambiguous meaning on different scenarios. UDDI and search engines all are based on keyword search, which are lagging behind on pertinent Web service selection. So the search mechanism must be incorporated with the Semantic behavior of Web Services. In order to strengthen this approach, the proposed model is incorporated with Quality of Services (QoS) based Ranking of semantic web services.
This paper focuses on various concepts of Quality of Service associated with web services. Various QoS parameters like performance, availability, reliability and stability etc. are formalized in order to enhance the pertinence of web service selection. A QoS mediator agent based Web Service Selection Model is proposed where QoS Consultant acts as a Mediator Agent between clients and service providers. Model suggests user’s preferences on QoS parameter selection. The proposed model helps to select pertinent Web Service as per user’s requirement and reduce the human effort.. Further process of adding ontology with semantic web services is also illustrated here.
SERVICE SELECTION BASED ON DOMINANT ROLE OF THE CHOREOGRAPHYijwscjournal
Web services are playing dominant role on Internet for e-business. The compositions of these services are used to meet business objectives. The web service choreography describes the external observable behavior
of these compositions. Many compositions may available for same functionality. These compositions cannot be distinguished on the basis of functional properties. This Quality of services (QoS) may help the user to select web services and to analyze composition of the web services. Web service choreography is going to dictate implementation of workflow. This workflow consists of several tasks. Each task is implemented by web services. These services are hosted in large numbers by different service providers on different service clusters. The mapping of service and task is difficult issue in run time environment. The interoperability between services is also a great problem. The selection of services is very big issue. In this paper we have proposed a bio-inspired selection algorithm based on dominant role and proposed a discovery infrastructure. We have also used the client behavior to improve the failure of the composition of the service.
SERVICE SELECTION BASED ON DOMINANT ROLE OF THE CHOREOGRAPHY ijwscjournal
Web services are playing dominant role on Internet for e-business. The compositions of these services are
used to meet business objectives. The web service choreography describes the external observable behavior
of these compositions. Many compositions may available for same functionality. These compositions cannot
be distinguished on the basis of functional properties. This Quality of services (QoS) may help the user to
select web services and to analyze composition of the web services. Web service choreography is going to
dictate implementation of workflow. This workflow consists of several tasks. Each task is implemented by
web services. These services are hosted in large numbers by different service providers on different service
clusters. The mapping of service and task is difficult issue in run time environment. The interoperability
between services is also a great problem. The selection of services is very big issue.
SERVICE SELECTION BASED ON DOMINANT ROLE OF THE CHOREOGRAPHY ijwscjournal
Web services are playing dominant role on Internet for e-business. The compositions of these services are
used to meet business objectives. The web service choreography describes the external observable behavior
of these compositions. Many compositions may available for same functionality. These compositions cannot
be distinguished on the basis of functional properties. This Quality of services (QoS) may help the user to
select web services and to analyze composition of the web services. Web service choreography is going to
dictate implementation of workflow. This workflow consists of several tasks. Each task is implemented by
web services. These services are hosted in large numbers by different service providers on different service
clusters. The mapping of service and task is difficult issue in run time environment. The interoperability
between services is also a great problem. The selection of services is very big issue.
SERVICE SELECTION BASED ON DOMINANT ROLE OF THE CHOREOGRAPHYijwscjournal
Web services are playing dominant role on Internet for e-business. The compositions of these services are used to meet business objectives. The web service choreography describes the external observable behavior of these compositions. Many compositions may available for same functionality. These compositions cannot be distinguished on the basis of functional properties. This Quality of services (QoS) may help the user to select web services and to analyze composition of the web services. Web service choreography is going to dictate implementation of workflow. This workflow consists of several tasks. Each task is implemented by web services. These services are hosted in large numbers by different service providers on different service clusters. The mapping of service and task is difficult issue in run time environment. The interoperability between services is also a great problem. The selection of services is very big issue. In this paper we have proposed a bio-inspired selection algorithm based on dominant role and proposed a discovery infrastructure. We have also used the client behavior to improve the failure of the composition of the service.
FUZZY-BASED ARCHITECTURE TO IMPLEMENT SERVICE SELECTION ADAPTATION STRATEGYijwscjournal
One of the main requirements in service based applications is runtime adaptation to changes that occur in business, user, environment, and computational contexts. Changes in contexts lead to QOS degrade. Continues adaptation mechanism and strategies are required to stay service based applications(SBA) in safe state. In this paper a framework for runtime adaptation in service based application isintroduced. It checks user requirements change continuously and dynamically adopts architecture model. Also it checks providers QOS attributes continuously and if adaptation requirement is triggered, runs service selection adaptation strategy to satisfy user preferences. Thusit is a context aware and automatically adaptable
framework for SBA applications. Wehave implemented a fuzzy based system for web service selection unit. Due to ambiguity of context’s data and cross-cutting effects of quality of services, using fuzzy would result an optimised decision. Finally we illustrated that using of it has a good performance for web service based applications.
RECOMMENDATION FOR WEB SERVICE COMPOSITION BY MINING USAGE LOGSIJDKP
Web service composition has been one of the most researched topics of the past decade. Novel methods of
web service composition are being proposed in the literature include Semantics-based composition, WSDLbased
composition. Although these methods provide promising results for composition, search and
discovery of web service based on QoS parameter of network and semantics or ontology associated with
WSDL, they do not address composition based on usage of web service. Web Service usage logs capture
time series data of web service invocation by business objects, which innately captures patterns or
workflows associated with business operations. Web service composition based on such patterns and
workflows can greatly streamline the business operations. In this research work, we try to explore and
implement methods of mining web service usage logs. Main objectives include Identifying usage
association of services. Linking one service invocation with other, Evaluation of the causal relationship
between associations of services.
Similar to CLUSTERING-BASED SERVICE SELECTION FOR DYNAMIC SERVICE COMPOSITION (20)
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...Levi Shapiro
Letter from the Congress of the United States regarding Anti-Semitism sent June 3rd to MIT President Sally Kornbluth, MIT Corp Chair, Mark Gorenberg
Dear Dr. Kornbluth and Mr. Gorenberg,
The US House of Representatives is deeply concerned by ongoing and pervasive acts of antisemitic
harassment and intimidation at the Massachusetts Institute of Technology (MIT). Failing to act decisively to ensure a safe learning environment for all students would be a grave dereliction of your responsibilities as President of MIT and Chair of the MIT Corporation.
This Congress will not stand idly by and allow an environment hostile to Jewish students to persist. The House believes that your institution is in violation of Title VI of the Civil Rights Act, and the inability or
unwillingness to rectify this violation through action requires accountability.
Postsecondary education is a unique opportunity for students to learn and have their ideas and beliefs challenged. However, universities receiving hundreds of millions of federal funds annually have denied
students that opportunity and have been hijacked to become venues for the promotion of terrorism, antisemitic harassment and intimidation, unlawful encampments, and in some cases, assaults and riots.
The House of Representatives will not countenance the use of federal funds to indoctrinate students into hateful, antisemitic, anti-American supporters of terrorism. Investigations into campus antisemitism by the Committee on Education and the Workforce and the Committee on Ways and Means have been expanded into a Congress-wide probe across all relevant jurisdictions to address this national crisis. The undersigned Committees will conduct oversight into the use of federal funds at MIT and its learning environment under authorities granted to each Committee.
• The Committee on Education and the Workforce has been investigating your institution since December 7, 2023. The Committee has broad jurisdiction over postsecondary education, including its compliance with Title VI of the Civil Rights Act, campus safety concerns over disruptions to the learning environment, and the awarding of federal student aid under the Higher Education Act.
• The Committee on Oversight and Accountability is investigating the sources of funding and other support flowing to groups espousing pro-Hamas propaganda and engaged in antisemitic harassment and intimidation of students. The Committee on Oversight and Accountability is the principal oversight committee of the US House of Representatives and has broad authority to investigate “any matter” at “any time” under House Rule X.
• The Committee on Ways and Means has been investigating several universities since November 15, 2023, when the Committee held a hearing entitled From Ivory Towers to Dark Corners: Investigating the Nexus Between Antisemitism, Tax-Exempt Universities, and Terror Financing. The Committee followed the hearing with letters to those institutions on January 10, 202
Embracing GenAI - A Strategic ImperativePeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
Normal Labour/ Stages of Labour/ Mechanism of LabourWasim Ak
Normal labor is also termed spontaneous labor, defined as the natural physiological process through which the fetus, placenta, and membranes are expelled from the uterus through the birth canal at term (37 to 42 weeks
Introduction to AI for Nonprofits with Tapp NetworkTechSoup
Dive into the world of AI! Experts Jon Hill and Tareq Monaur will guide you through AI's role in enhancing nonprofit websites and basic marketing strategies, making it easy to understand and apply.
Safalta Digital marketing institute in Noida, provide complete applications that encompass a huge range of virtual advertising and marketing additives, which includes search engine optimization, virtual communication advertising, pay-per-click on marketing, content material advertising, internet analytics, and greater. These university courses are designed for students who possess a comprehensive understanding of virtual marketing strategies and attributes.Safalta Digital Marketing Institute in Noida is a first choice for young individuals or students who are looking to start their careers in the field of digital advertising. The institute gives specialized courses designed and certification.
for beginners, providing thorough training in areas such as SEO, digital communication marketing, and PPC training in Noida. After finishing the program, students receive the certifications recognised by top different universitie, setting a strong foundation for a successful career in digital marketing.
2024.06.01 Introducing a competency framework for languag learning materials ...Sandy Millin
http://sandymillin.wordpress.com/iateflwebinar2024
Published classroom materials form the basis of syllabuses, drive teacher professional development, and have a potentially huge influence on learners, teachers and education systems. All teachers also create their own materials, whether a few sentences on a blackboard, a highly-structured fully-realised online course, or anything in between. Despite this, the knowledge and skills needed to create effective language learning materials are rarely part of teacher training, and are mostly learnt by trial and error.
Knowledge and skills frameworks, generally called competency frameworks, for ELT teachers, trainers and managers have existed for a few years now. However, until I created one for my MA dissertation, there wasn’t one drawing together what we need to know and do to be able to effectively produce language learning materials.
This webinar will introduce you to my framework, highlighting the key competencies I identified from my research. It will also show how anybody involved in language teaching (any language, not just English!), teacher training, managing schools or developing language learning materials can benefit from using the framework.
CLUSTERING-BASED SERVICE SELECTION FOR DYNAMIC SERVICE COMPOSITION
1. International Journal of Web & Semantic Technology (IJWesT) Vol.8, No.2, April 2017
DOI : 10.5121/ijwest.2017.8201 1
CLUSTERING-BASED SERVICE SELECTION FOR
DYNAMIC SERVICE COMPOSITION
Aram AlSedrani and AmeurTouir
College of Computer and Information Sciences, Department of Computer Science King
Saud University, Saudi Arabia
ABSTRACT
The increase in the number of available web services led to the increase in the similarity of services
functionality offered by different providers each with different QoS parameters. Therefore, in web service
composition, the selection of the optimal service to satisfy the QoS values required by user is one of the
significant requirements. Moreover, the dynamic nature of web services adds more challenges to obtain the
accuracy of the selection process. Most of the existing service composition approaches deal with services
changes during composition execution, causing a re-planning or re-selection that affecst the service
composition performance. In this paper, we introduce the clustering-based service selection model that
outperforms the existing ones. The proposed model has the ability to detect and recover the changes in
service repository by monitoring the composition process from a global point of view. The approach is a
two-levels-based web service clustering. The proposed model encompasses a clustering process, a planning
process, a selection process and a recovery process.
KEYWORDS
Web services, service clustering, service composition, service selection, self-healing composition
1. INTRODUCTION
Web service composition involves the integration of several existing web services to provide
more complex and powerful service. The goal of service composition is to reuse existing web
services and composing them into a process. However, the process of composition is considered
as a high complex task due to many reasons. According to (Rao & Su 2004) the complexity of
service composition raises because of three main reasons. First, the huge increase on the number
of web services available over the internet, whichcauses the increase of the service repositories
available for searching. Moreover, web services is in continuously changing and updating which
requires a dynamic composition at runtime causing intensive computations. Another reason when
different providers develop web services in different models making the mapping between
services in the compositions a difficult task.
Service selection is about choosing the most appropriate service for each task in the composition
in order to satisfy user requirement.The input of service selection problem is the set of candidate
services for various tasks involved in the composition plan. A single candidate services set
consists of services providing the same functionality offered by different providers through
service Quality of Service (QoS) profile. Moreover, the same provider may offer several services
that have the same functionality with different QoS to obtain satisfaction of a large panoply of
users(Moghaddam & Davis 2014).
Nowadays, the composition environment becomes more dynamic due to the increase in the
number of web services that are frequently changing. Therefore, the need for self-adapted
2. International Journal of Web & Semantic Technology (IJWesT) Vol.8, No.2, April 2017
2
composition methods that acts according to environment changes is advocated. Some existing
composition approaches consider more or less the dynamic environment context while executing
services. This is performed by monitoring the changes that occur to services, and considering the
environment as static in early phases as in (Friedrich et al. 2010) and (Wiesner et al. 2009).
A limited number of researches highlight the importance of monitoring the changes on services
during the selection phase. Batakat(Barakat et al. 2012) proposes an algorithm that reacts to
changes that occurred in the participating web services during the selection phase. The algorithm
modeled the problem as a graph, where each node stores the optimal path from the started node.
When a change occurs, the algorithm re-tracks the stored information in each node in the path and
reselects a new service accordingly. The proposed algorithm runs in a dynamic environment.
However, when the number of nodes increases the complexity and the storage capacity increases
considerably.
The limited number of researches in this area indicates that the service selection in dynamic
environment is a new research direction, and it is not mature enough to satisfy composition
process requirements. The need for new techniques is highly recommended, especially with the
fast growth of the web.
In this paper, we propose the self-healing model for web service selection that has the ability to
recover from service failure. The self-healing model involves three main processes: the web
service clustering process, the service selection process, and the failure recovery process. The
service clustering process involves two levels of clustering: first, classify the similar web services
based on their functionality to “task”, second, generate composite tasks and group them into more
abstract representation called “job”. By two levels services clustering, we aim at three goals:
First, minimizing the selection problem search space within jobs rather than services. Second, the
ability of fast recovery, in case of service failure, by substitutes the faulty service from the
corresponding job and task clusters. Third, isolate the faulty web service in its job boundary and
not affecting the rest of the well composed service. The selection in the proposed model is
monitored through its entire process, where the failure recovery process is triggered whenever an
environment change is occurred.
2. THE SELF-HEALING MODEL FOR WEB SERVICE SELECTION:
We define the Web Service Selection Problem (WSSP) as finding the most suitable web services
from a set of candidate web services that match the QoS attributes asked by user. The adopted
self-healing model embodies the service clustering process, the service selection process, and the
failure recovery process. The service clustering classifies the web services with similar
precondition and post condition to tasks. Thus, each task includes a set of atomic web service. As
a second level, the service clustering classifies similar tasks into more abstract representation
named jobs. A job represents a set of simple or composite tasks that have the same precondition
and post condition. A composite task is composed of a sequence of tasks. The selection process is
responsible of selecting the best candidate web service (low level) related to each job (high level)
involved in the planning phase based on its QoS values. However, if any contingency occur
during the selection process, the failure recovery process is triggered to react and solve the
emerging problems.
As it was stated in the formulation of the WSSP, we used two types of service clustering in order
to arrange the services prior the selection process: the task clustering and the job clustering. Each
(J), includes multiple candidate tasks either atomic or composite. The principle of web service
selection algorithm is to substitute each job from the composition plan by a corresponding web
service via the clustered tasks in order to achieve the requested service (RS) and satisfy the QoS
3. International Journal of Web & Semantic Technology (IJWesT) Vol.8, No.2, April 2017
3
requirements. The input of the selection algorithm is the QoS Constraint Plan (QCP) that consists
of set of connected jobs, and the solution is the Execution Plan (EP) that consists of set of
connected web services. The QoS attributes that are going to be addressed by our model are the
Cost (C) and the Execution Time (ET). The Cost (C) is the price that a user has to pay to the
service provider for theinvocation of a service (). The Execution Time(ET)is the time measured
from invoking () until theresult is received(Rajeswari et al. 2014). Moreover, the failure
recovery algorithm is triggered in case of web service failure. It aims at collaborating with the
selection process to recover the failures by substituting the faulty web service with a valid service
from the same job cluster. In the sequel, we will elaborate the self-healing model processes in
more detail.
2.1. DEFINITION AND SPECIFICATION:
In the sequel, we use the following definitions and notations:
- A web service directory WS is the set of services of a specific domain that exist in a service
repository. We assume that each web service WS is atomic that is not composed of other web
services. Each WS has two values: a cost Cthat specifies the cost of executing , the
execution time ET that denotes the execution time of.
- A web service (, , ) is an atomic web service, where is the precondition, is the effect
and is its QoS.
- A task (, , , , WS, ) is an abstract representation of all web services with similar
functionality. That is the set of the web services which have the same precondition and the
same effect . The QoS of , = , is the number of web service in , WS is the
set of equivalent web services, and is the candidate web service to be selected with quality . T
is the set of all tasks.
- A job J(, , q, ,Tj, ) is the cluster of the tasks that have the same precondition , the same
effect . The QoS of J, q =
, and finally, is the number of tasks in J, Tj is the set of
tasks, and is the candidate task to be selected with quality q.
-A QoS Constraint Plan is a directed acyclic graph denoted as QCP [J(, ), E, Q] where: J(,
)={j1 … jn/ji is a job i = 1, …, n} is the set of vertices representing the jobs in the graph where
the precondition of j1= and the effect of jn =. E J X J is the set of edges. Q is the global QoS
for the plan Q= . We assume that the jobs flow sequentially within QCP starting from
j1 until jn.
-We define the Web Service Selection Problem (WSSP) as follow: given a QoS Constraint Plan
QCP, the WSSP is to find the optimal web service for each j ϵ J that has the best quality by
satisfying the following conditions:
C() = min { C(i) , i ϵ j } -1-
ET() = min { ET(i) , iϵ j } -2-
-The Execution plan (EP) is defined as the solution of WSSP. It is denoted as EP={ (j1, 1), (j2,
2), ……, (jn, n)} where:
4. International Journal of Web & Semantic Technology (IJWesT) Vol.8, No.2, April 2017
4
a. {j1, j2, ….. , jn } ϵQCP.
b. (ji, i) ϵ EP (i ϵ ji)and (i ϵ i ).
2.2. TASK AND JOB CLUSTERING:
As it was stated, the repository is made up of two-level of abstractions. The jobs: where each
jobincludes a set of tasks having the same preconditions and effects. The tasks: where each task is
a generic abstraction representing a set of serviceswith similarpreconditions and effects. The
clustering is a continuous process thatupdates the tasks and jobs repositories. The clustering is
built from the ground-up.
Each newly discovered web service () isinsertedinto the Web Service repository WS and the
update is propagated accordingly to the Task repository and the Job repository. The update
propagation takes into account the definition and theconstraints (precondition and effect) of the
discovered web service.
The first step in the clustering process is to update the task repository. For each web service (,
, ), the precondition () and effect () constraints are extracted from the service description
profile. Then, match the constraints with the available tasks in task repository and insert into its
belonging task. If no task matches the service constraints a new task is added to the task
repository and assigned precondition ., quality .and effect .from profile. For each
inserting , the QoS is revised as to keep .with the minimum of all web services within the
task cluster.
Several QoS attributes are considered for a single web service. In such problems a utility function
is used to evaluate the multi-attributes quality of a set of alternative web services. For this
purpose, we use the multiple attribute decision making, in particular the Simple Additive
weighting (SAW) method (Hwang & Yoon 1981) is used. The evaluation score is calculated
based on multiplying the scaled value for the alternative web services with the importance weight
of the quality attribute, then adds the product for all attributes. The SAW uses the following
formula to evaluate the alternatives.
-3-
Where is the evaluation score of the web service , is the weight of the attribute a, and
is the score of with respect to attribute a. The maximum the value of means the
minimum the quality attribute values, thus the better quality. The value of is calculated for
each web service within the same task cluster for each quality attribute based on the following
formula:
-4-
For task clustering process, we evaluate and rank the quality of each web service within the same
task cluster based on the values of execution time ET() and cost C(). These quality values are
extracted from the OWL-S description file for each web service . Knowing that, OWL-S is Web
Ontology Language for describing Semantic Web Services.
On the other hand, creating the Job repository is made up in two times. First, for each task , a job
J is created. The job J takes the precondition ., the quality ., the effect ., and the singleton
{} in its task set. As two simple tasks cannot have the same precondition and effect, a job J may
5. International Journal of Web & Semantic Technology (IJWesT) Vol.8, No.2, April 2017
5
have at most one simple task. Composite tasks may be added later based on the circumstances.
Each job will be updated by generating composite tasks with the same constraints. That is, if a
task fails to achieve the request, a new composite task is prepared to substitute the failed task.
The values of the job quality q, the job length and the candidate task are updated
accordingly.
The quality of the job j.q is calculated using SAW method. Based on the quality .andlength
.of the task , we compute the SAW of each task. Then we compute the SAW of the job. The
job quality j.q will equal the Maximum of all SAW values that reflect the minimum of the
execution time and the cost resulting with the best available quality.
The quality .and the length .for a composite tasks in each job cluster are the aggregation of
these values in each task. The aggregation values for the Cost (C) and Execution Time (ET) for a
composite task are the summation of their respective values in each task involved as shown in
equation (5, 6).
2.3. CLUSTERING-BASED WEB SERVICE SELECTION:
As defined in section 2.1, the WSSP aims at finding the optimal web service to compensate each
job in QCP plan. This optimality is achieved by finding the web services with the best Quality
values. In our model, we utilize the two QoS attributes (Execution time, Cost) to direct the
selection process. In the clustering process, each service is inserted in a task cluster .
Furthermore, the web service with minimum quality is identified in the cluster as the candidate
web service to be chosen (. ). This process is also applied to the job repository for each new
task inserted to any job cluster by identifying (J. ).
By preparing the candidate web service (. ) for each task, the Clustering-based Selection of
web service as described in algorithm 1 is based on substituting each job in the QCP with its
candidate task ; then, substitute each task with its candidate web service . The output of the
selection process is the execution plan (EP) as defined in section 2.1.
Algorithm 1:Clustering-based Selection
1: Procedure Clustering-based Selection (CP)
2:Foreach ϵ CPDo
3: Select Where .=
(SAW)
4: If.getLength() =1Then
5: Select ϵ Where .=
ϵ
(SAW)
6: EP.Add (, )
7: EndIf
8: If.getLength() > 1 Then
6. International Journal of Web & Semantic Technology (IJWesT) Vol.8, No.2, April 2017
6
9: suppose c :composite empty task
10: Foreach( ) Do
11: Select ϵ Where .=
ϵ
(SAW)
12: c.Append(’)
13:EndForeach
14: EP.Add (c, )
15: EndIf
16: EndForeach
17: Return EP
2.4 SELF-HEALING SELECTION ALGORITHM
The self-healing selection algorithm has the ability to recover any changes or faults that occur
during selection phase of service composition process. It aims at substituting the faulty web
service with similar web service from the same job/task cluster. Algorithm 2 describes the self-
healing process; In case of web service failure, the algorithm test if the failed service belongs to
an atomic task, if so, the failed service is replaced with an alternative one from that task. In the
other hand, if the failed service is within a composite task, then replace it with the next best
alternative web services based on its quality, and then recalculate the composite task quality. The
next step is to determine if the composite task still has the minimum quality comparing with the
tasks in its job cluster, then it will be substituted by job in EP. Else select an alternative task from
the same job with the minimum task quality.
Algorithm 2:Self-healing Selection
1: ProcedureSelf-healing Selection(EP, )
2: <- .getTaskOwner()
3: foundAlternative<- False .
4: If.getLength() > 1 Then
5: Re-Calculate .
6: Select ’ ϵ with ’.=
(SAW)
7: EP.Substitute(;’)
8: foundAlternative<- True
9: EndIf
10: If.getLength() =1 Then
11: j <- .getJobOwner()
12: Re-Calculate j.q
13: Select ’ ϵ with ’.=
(SAW)
14: suppose c :composite empty task
15: Foreach( k ϵ ’ ) Do
16: Select ’ ϵ with ’.=
(SAW)
17: c.Append(’)
18: EndForeach
19: EP.Substitute(;c)
20: foundAlternative<- True
21: EndIf
22: ReturnfoundAlternative
7. International Journal of Web & Semantic Technology (IJWesT) Vol.8, No.2, April 2017
7
Example 1:consider the following clusters available in the task repository(table 1) with their QoS
values. Each web service has two quality values, the first is the execution time ET measured in
msand the second is the cost C measured in $:
Table 1: Web Service Repository Example
For each web service, we apply the SAW formula to calculate the normalized quality values. By
assigning, for example, the weights of the criteria as W (ET)= 0.5 and W (C)= 0.3 meaning that
the ET is more important than C. However the weight of a quality criterion could be adjusted
according to the user preference. Based on this assumption, we can calculate the quality value for
3 (a,b) as follow:
And accordingly, the quality values for the web services in each task cluster in the task repository
will be as shown in Table 2
8. International Journal of Web & Semantic Technology (IJWesT) Vol.8, No.2, April 2017
8
Table 2: Task Repository Example Including QoS
Accordingly, The quality values for the tasks in the job repository is computed using eq. (5, 6),
knowing that a task has two attributes as ranking criteria ., and .. For example to calculate
the quality of (1 5) in J2 (Table 3), we will apply eq. (5, 6), taking W(.)= 0.5 and W(.) =
0.3:
Since
=
= 0.61 + 0.5 = 1.11
And = + = 6 + 5 = 11
Then
Table 3 shows the job repository results after applying SAW formula.
9. International Journal of Web & Semantic Technology (IJWesT) Vol.8, No.2, April 2017
9
Table 3: Job Repository Example
Example 2:
Consider the followingCPthat represents a plan with a precondition (a) and an effect (e) generated
according to the jobs in previous table:
Figure 1: Quality Constraint Plan Example
From the job and task repositories we can retrieve the following information:
Table 4: Service Selection Example
Job
J4 4 3
J3 3 3
J2 2 4
10. International Journal of Web & Semantic Technology (IJWesT) Vol.8, No.2, April 2017
10
According to table 4, the Execution Plan (EP) will be:
To illustrate the selection algorithm in case of service failure, we consider several situations; each
example is independent of the other:
Situation 1:Suppose we have an event occurring in service repository that deletes J4.2.4. In this
case, the deleted web service does not affect the selection process and nothing changed since 4
is not the candidate service in task cluster 2.
Situation 2:Suppose we have an event occurring in service repository that deletes the web
services J2.2.1 and J2.2.4. In this case, the selection is affected and the algorithm will first
recalculate the SAW values for the remaining web services in J2.2.
2 (b, e) {2 (b, e).=0.3 3 (b, e). = 0.5} 2. = 2
Then, recalculate the SAW values for the tasks in J2 and select the web service with maximum
quality value.
J2 {2.=0.8 (1 5).= 0.3 (6 4 3).=0}
The web service with maximum quality value= J2.2.3. In this situation the Execution plan (EP)
will result with:
2.5. TIME AND SPACE COMPLEXITY:
Lemma: For a web service failure within a job J in a given CP, the time complexity of the Self-
healing Selection algorithm depends on the number of web services in the job J.
The recovery process aims at substituting the failed web service with a valid one from the same
job. Therefore, the time needed to recovery is the time to traverse all the web services in the job
to recalculate the quality, thus selecting the optimal service.
The number of services in a job is equal to all the services within the atomic and composite tasks.
Accordingly, the number of services in a single composite task (that composed of nh simple
tasks) and each simple task (hi) has nhi web services=
Thus, total number of web services in the job (where m is the number of tasks in j) is
11. International Journal of Web & Semantic Technology (IJWesT) Vol.8, No.2, April 2017
11
3. PERFORMANCE EVALUATION:
3.1. DATASET AND EXPERIMENT SETUP:
In our experiment, we utilized several web service description files datasets to test our model,
The OWLS-TC version 4.0 dataset, OPOSSum database for service descriptions [8], and SWS-
TC-1.1 dataset provided by [9]. The OWLS-TC dataset provides 1083 semantic Web services
written in OWL-S 1.1 from nine different domains (education, medical care, food, travel,
communication, economy, weapons, geography and simulation)[10]. The OPOSSum is an open
source project to collect semantic web services descriptions launched by Friedrich Schiller
University in Germany, the data collection include 1129 OWL-S file in different domains. The
SWS-TC-1.1 is a public dataset that contains 241 semantic web services descriptions in OWL-S
also. Moreover, we collect extra web service descriptions from the web in order to raise the
number of services and we came up to 6785 OWL-S services description files. After performing
the job cluster algorithm we came up with 739 job clusters in the job repository and the same
number in task repository.
However, the OWLS-TC dataset does not contain any information of the Quality values of the
web services. Therefore we generate random values of Execution Time and Execution Cost that
are picked from the QWS DATASET 1.0[11]. In our model we used only the Execution time and
Cost quality parameters. Though, the model can be easily generalized to include other QoS
parameters. The parser in our model extracted the main services parameters needed to the
composition process from OWLS-TC dataset such as service name, input, output, preconditions,
effect, quality values, and service description.
In order to evaluate the performance of the clustering-based selection and the self-healing
algorithm we implementedtwoother algorithms that react to changes occurred in dynamic
repository during selection phase.The algorithm provided by Barakat in [5] that stores the optimal
path from the initial to the goal in each node in the plan.The traditional method of re-composition
in case of faults occurs.
3.2. EXPERIMENTS RESULTS:
The experiment involves 6785 OWL-S files in the service repository, and after performing the job
cluster algorithm we came up with 739 job clustersin the job repository. We performed two
experiments in order to measure the performance of the selection and of the recovery in case of
service fail.
3.2.1. Clustering based selection time:
In this experiment, we apply 100 test cases to measure the selection time of our method. For each
test case the input is a composition plan (CP) that consists of jobs and the output is an execution
plan (EP) that involves of the candidate web services. The plans vary in length; the range in our
experiment start with plans consisting of 50jobs to plans containing500 jobs. Figure 2 shows the
selection time resulted from the experiment of the clustering-based method. The time needed to
select web services for each job within a plan is between 0.9 and 2.6 seconds.
12. International Journal of Web & Semantic Technology (IJWesT) Vol.8, No.2, April 2017
12
Figure 2: Clustering-based Selection Time
To highlightthe performance of the developed selection methodwith respect to the existing
methods, we compared the performance of the clustering-based and barakat methods. Figure 3
shows the major enhancement in the selection time by the clustering-based selection. As one can
notice, the execution time in barakat algorithm is much sloweras it requires storing all the paths
from an exact node in the plan until the goal node. However, in our method, preparing in
advance, the candidate services in each task cluster decreases considerably the time complexity of
the selection process as shown in section 2.5.
Figure 3: Selection Time Comparison
3.2.2 Self-healing Recovery Time:
For this experiment, we picked a random set of plans and executed 100 test cases over the three
methods: self-healing, barakat and reselection algorithms. For each test case, we performed the
following:
A random plan is entered to the selection algorithm.
Two types of web service faults are simulated:
o The first is the case when the faulty web services are recovered directly from either task
or job repository. In this type, we performed three failed services; one that occurred in the
0.00
0.50
1.00
1.50
2.00
2.50
3.00
100 200 300 400 500
Clustering based selection time
0
5
10
15
20
25
30
35
100 200 300 400 500
TimeinSeconds
Number of Elements
Service Selection Time
Self-healing
Barakat
13. International Journal of Web & Semantic Technology (IJWesT) Vol.8, No.2, April 2017
13
beginning of the plan, another, when a fault occurred in the middle of the plan and a third,
when the fault occurred in the end of the plan.
By applying the input and simulation of several web service faults described previously, we
ended up with 600 test cases to measure the time needed from the self-healing algorithm to
recover a web service fault during selection phase.For each type of fault simulation, we calculated
the average time needed to recover based on the number of services within the plan. The
evaluation procedure is based on the number of the simulated faults. For each composite service
length (50 -500), we applied first 10 faults during selection, then in the next step we increase the
number by 10 until we simulated 60 faults. We will show the performance for the algorithms for
each number of simulated faults (10 to 60).
The result of our experiment is shown in figure 5.It compares the three methods together.Figure 5
shows that the self-healing algorithm outperforms the other methods in the recovery time in
selecting a substitute service for a faulty one. By preparing the tasks clusters and jobs clusters
prior the selection time, the recovery time will cost the time needed to retrieve the job cluster
where the fault occur and pick the service within that cluster that has the minimum quality values.
Figure 4:Recovery Time Comparison
4. CONCLUSION:
In this paper, we proposed a web service selection algorithm and a self-healing algorithm for
service composition that react to changes in dynamic repository. The algorithm consists of three
phases: first, continuous clustering of the similar web services to tasks and similar tasks to jobs.
Second, a selection phase that chooses the most candidate web service from the task cluster to
replace it in the plan. Third, a self-healing selection algorithm that reacts to changes in the web
service repository by substituting the faulty service with similar one within the same cluster. An
experiment is performed to test the selecting and recovering time for the proposed algorithm.
14. International Journal of Web & Semantic Technology (IJWesT) Vol.8, No.2, April 2017
14
Moreover, a comparison with similar studies is done that shows an improvement in recovery time
resulted from the proposed clustering algorithm.
REFERENCES:
[1] J. Rao and X. Su, “A Survey of Automated Web Service Composition Methods,” in Proceedings of
the First international conference on Semantic Web Services and Web Process Composition, 2004,
vol. 3387, pp. 43–54.
[2] M. Moghaddam and J. G. Davis, “Service Selection in Web Service Composition: A Comparative
Review of Existing Approaches,” in Web Services Foundations, First., A. Bouguettaya, Q. Z. Sheng,
and F. Daniel, Eds. New York: Springer, 2014, pp. 321–346.
[3] G. Friedrich, M. Fugini, E. Mussi, B. Pernici, and G. Tagni, “Exception Handling for Repair in
Service-Based Processes,” in IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2010, vol.
36, no. 2, pp. 198–216.
[4] K. Wiesner, R. Vacul, M. Kollingbaum, and K. Sycara, “Recovery Mechanisms for Semantic Web
Services,” in International Conference on Distributed applications and interoperable systems (DAIS),
2009, pp. 100–105.
[5] L. Barakat, S. Miles, and M. Luck, “Reactive Service Selection in Dynamic Service Environments,”
in First European Conference in Service-Oriented and Cloud Computing, 2012, pp. 17–31.
[6] M. Rajeswari, G. Sambasivam, N. Balaji, M. S. Saleem Basha, T. Vengattaraman, and P.
Dhavachelvan, “Appraisal and analysis on various web service composition approaches based on QoS
factors,” J. King Saud Univ. - Comput. Inf. Sci., vol. 26, no. 1, pp. 143–152, Jan. 2014.
[7] C.-L. Hwang and K. Yoon, Multiple Attribute Decision Making: Methods and Applications A State-
of-the- Art and Survey, 1st ed. Munich: Springer-Verlag Berlin Heidelberg, 1981.
[8] Opossum, “OPOSSum, an Online Portal for Semantic Services,” FUSION group, Friedrich Schiller
University Jena, Germany, 2010. [Online]. Available: http://fusion.cs.uni-jena.de/opossum/.
[Accessed: 12-Feb-2017].
[9] Y. Ganjisaffar and H. Saboohi, “SWS-TC 1.1,” SemWeb Central, 2006. [Online]. Available:
http://projects.semwebcentral.org/projects/sws-tc/. [Accessed: 12-Feb-2017].
[10] M. Klusch and P. Kapahnke, “OWLS-TC,” SemWebCentral, 2010. [Online]. Available:
http://projects.semwebcentral.org. [Accessed: 01-Jan-2016].
[11] E. Al-Masri and Q. H. Mahmoud, “QoS-based Discovery and Ranking of Web Services,” in IEEE
16th International Conference on Computer Communications and Networks (ICCCN), 2007, pp. 529–
534.
AUTHORS
Prof. AmeurTouir, teaching in King Saud University in Riyadh KSU, he got his B.Sc. in
computer science from Saint Etienne University in 1985. And his M.Sc. degreefrom Pierre &
Marie Curie (Paris VI) University in Artificial Intelligence 1988.Ph.D. in Computer Science
1993 from Ecole Nationale Superieure des Telecommunications de Paris. Prof.Touirresearch
interests is in Databases, spatial access methods, spatial query processing, spatio-temporal,
object-oriented, design pattern.
Aram AlSedrani is a PHD student in King Saud University KSU in Riyadh, KSA. She got her B.Sc.
degree from KSU in computer science in 1998, and got her M.Sc. degreefrom KSU in 2009. Aram
research interest in software engineering, service oriented computing