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.
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.
CLUSTERING-BASED SERVICE SELECTION FOR DYNAMIC SERVICE COMPOSITIONIJwest
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.
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.
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.
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.
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
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.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
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.
CLUSTERING-BASED SERVICE SELECTION FOR DYNAMIC SERVICE COMPOSITIONIJwest
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.
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.
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.
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.
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
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.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Service selection in service oriented architecture using probabilistic approa...IJECEIAES
In service Oriented Architecture, many services are offered with similar functionality but with different service quality parameters. Thus the service selection using a deterministic approach causes conflicts and inefficient results. We use asynchronous queue to model the service inventory architecture avoiding unnecessary locking of resources and thus allowing a provision to consumers to get their required services without intervening and with temporally decoupled fashion. Actually this kind of service selection strategy is considered in regards with game theory to eliminate fluctuations of queue length. It offers a discrete random service which is equal to some request requested by consumers, it means service can be provided based on probability mass function as a substitute of deterministic decisions for selecting a proper service provider as of the consumers. Once the request is taken out from the queue, it is delivered to the interceptor that has validation and sanitization module. It thus reduces the peak queue length and reduces periodic fluctuations in the queue length.
A HEURISTIC APPROACH FOR WEB-SERVICE DISCOVERY AND SELECTIONijcsit
In today’s businesses, service-oriented architectures represent the main paradigm for IT infrastructures.
Indeed, the emergence of Internet made it possible to set up an exploitable environment to distribute applications on a large scale, and this, by adapting the notion of “service”. With the integration of this paradigm in Business to Business Domain (B2B), the number of web services becomes very significant. Due to
this increase, the discovery and selection of web services meeting customer requirement become a very
difficult operation. Further, QoS properties must be taking into account in the web service selection. Moreover, with the significant number of web service, necessary time for the discovery of a service will be rather
long. In this paper, we propose an approach based on a new heuristic method called “Bees Algorithm”
inspired from honey bees behavior. We use this technique of optimization in order to discover appropriate
web services, meeting customer requirements, in least time and taking into account the QoS properties
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.
TOWARDS UNIVERSAL RATING OF ONLINE MULTIMEDIA CONTENTcsandit
Most website classification systems have dealt with the question of classifying websites based on
their content, design, usability, layout and such, few have considered website classification
based on users’ experience. The growth of online marketing and advertisement has lead to
fierce competition that has resulted in some websites using disguise ways so as to attract users.
This may result in cases where a user visits a website and does not get the promised results. The
results are a waste of time, energy and sometimes even money for users. In this context, we design
an experiment that uses fuzzy linguistic model and data mining techniques to capture users’
experiences, we then use the k-means clustering algorithm to cluster websites based on a set of
feature vectors from the users’ perspective. The content unity is defined as the distance between
the real content and its keywords. We demonstrate the use of bisecting k-means algorithm for
this task and demonstrate that the method can incrementally learn from user’s profile on their
experience with these websites.
AGENTS AND OWL-S BASED SEMANTIC WEB SERVICE DISCOVERY WITH USER PREFERENCE SU...IJwest
Service-oriented computing (SOC) is an interdisciplinary paradigm that revolutionizes the very fabric of
distributed software development applications that adopt service-oriented architectures (SOA) can evolve
during their lifespan and adapt to changing or unpredictable environments more easily. SOA is built
around the concept of Web Services. Although the Web services constitute a revolution in Word Wide Web,
they are always regarded as non-autonomous entities and can be exploited only after their discovery. With
the help of software agents, Web services are becoming more efficient and more dynamic.
The topic of this paper is the development of an agent based approach for Web services discovery and
selection in witch, OWL-S is used to describe Web services, QoS and service customer request. We develop
an efficient semantic service matching which takes into account concepts properties to match concepts in
Web service and service customer request descriptions. Our approach is based on an architecture
composed of four layers: Web service and Request description layer, Functional match layer, QoS
computing layer and Reputation computing layer.
CONTEMPORARY SEMANTIC WEB SERVICE FRAMEWORKS: AN OVERVIEW AND COMPARISONSijwscjournal
The growing proliferation of distributed information systems, allows organizations to offer their business processes to a worldwide audience through Web services. Semantic Web services have emerged as a means to achieve the vision of automatic discovery, selection, composition, and invocation of Web services by encoding the specifications of these software components in an unambiguous and machine-interpretable
form. Several frameworks have been devised as enabling technologies for Semantic Web services. In this paper, we survey the prominent Semantic Web service frameworks. In addition, a set of criteria is identified and the discussed frameworks are evaluated and compared with respect to these criteria. Knowing the strengths and weaknesses of the Semantic Web service frameworks can help researchers to utilize the most appropriate one according to their needs.
Exploring The Dynamic Integration of Heterogeneous Services csandit
The increase need for services to handle a plethora of business needs within the enterprise
landscape has yielded to an increase in the development of heterogeneous services across the
digital world. In today’s digital economy, services are the key components for communication
and collaboration amongst enterprises internally and externally. Since Internet has stimulated
the use of services, different services have been developed for different purposes prompting
those services to be heterogeneous due to incompatibles approaches relied upon at both
conceptual and exploitation phases. The proliferation of developed heterogeneous services in
the digital world therefore comes along with a range of challenges more precisely in the
integration layer. Traditionally, integration is achieved by using gateways, which require
considerable configuration effort. Many approaches and frameworks have been developed by
different researchers to overcome these challenges, but up to date the challenges of integration
heterogeneous services with minimal user-involvement still exist. In this paper, we are exploring
the challenges of heterogeneous services and characteristics thereof with the aim of developing
a seamless approach that will alleviate some of these challenges in near future. It is therefore of
outmost importance to understand the challenges and characteristics of heterogeneous services
before developing a mechanism that could eliminate these challenges.
A method of evaluating effect of qo s degradation on multidimensional qoe of ...IJCNCJournal
This paper studies a method of investigating effect of IP performance (QoS) degradation on quality of experience (QoE) for a Web service; it considers the usability based on the ISO 9241-11 as multidimensional QoE of a Web service (QoE-Web) and the QoS parameters standardized by the IETF. Moreover, the paper tackles clarification of the relationship between ISO-based QoE-Web and IETF-based QoS by the multiple regression analysis. The experiment is intended for the two actual Japanese online shopping services and utilizes 35 subjects. From the results, the paper quantitatively discusses how the QoE-Web deteriorates owing to the QoS degradation and shows that it is appropriate to evaluate the proposed method
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.
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
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.
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 PROCESSES: A COMPARATIVE STUDYijwscjournal
Service composition is the process of constructing new services by combining several existing ones. It considered as one of the complex challenges in distributed and dynamic environment. The composition process includes, in general, the searching for existing services in a specific domain, and selecting the appropriate service, then coordinating composition flow and invoking services. Over the past years, the problem of web service composition has been studied intensively by researchers. Therefore, a significant amount of solutions and new methods to tackle this problem are presented. In this paper, our objective is to investigate algorithms and methodologies to provide a classification of existing methods in each composition phase. Moreover, we aim at conducting a comparative study to discover the main features and limitation in each phase in order to assist future research in this area.
WEB SERVICE COMPOSITION PROCESSES: A COMPARATIVE STUDYijwscjournal
Service composition is the process of constructing new services by combining several existing ones. It considered as one of the complex challenges in distributed and dynamic environment. The composition process includes, in general, the searching for existing services in a specific domain, and selecting the appropriate service, then coordinating composition flow and invoking services. Over the past years, the problem of web service composition has been studied intensively by researchers. Therefore, a significant amount of solutions and new methods to tackle this problem are presented. In this paper, our objective is to investigate algorithms and methodologies to provide a classification of existing methods in each composition phase. Moreover, we aim at conducting a comparative study to discover the main features and limitation in each phase in order to assist future research in this area.
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.
Service selection in service oriented architecture using probabilistic approa...IJECEIAES
In service Oriented Architecture, many services are offered with similar functionality but with different service quality parameters. Thus the service selection using a deterministic approach causes conflicts and inefficient results. We use asynchronous queue to model the service inventory architecture avoiding unnecessary locking of resources and thus allowing a provision to consumers to get their required services without intervening and with temporally decoupled fashion. Actually this kind of service selection strategy is considered in regards with game theory to eliminate fluctuations of queue length. It offers a discrete random service which is equal to some request requested by consumers, it means service can be provided based on probability mass function as a substitute of deterministic decisions for selecting a proper service provider as of the consumers. Once the request is taken out from the queue, it is delivered to the interceptor that has validation and sanitization module. It thus reduces the peak queue length and reduces periodic fluctuations in the queue length.
A HEURISTIC APPROACH FOR WEB-SERVICE DISCOVERY AND SELECTIONijcsit
In today’s businesses, service-oriented architectures represent the main paradigm for IT infrastructures.
Indeed, the emergence of Internet made it possible to set up an exploitable environment to distribute applications on a large scale, and this, by adapting the notion of “service”. With the integration of this paradigm in Business to Business Domain (B2B), the number of web services becomes very significant. Due to
this increase, the discovery and selection of web services meeting customer requirement become a very
difficult operation. Further, QoS properties must be taking into account in the web service selection. Moreover, with the significant number of web service, necessary time for the discovery of a service will be rather
long. In this paper, we propose an approach based on a new heuristic method called “Bees Algorithm”
inspired from honey bees behavior. We use this technique of optimization in order to discover appropriate
web services, meeting customer requirements, in least time and taking into account the QoS properties
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.
TOWARDS UNIVERSAL RATING OF ONLINE MULTIMEDIA CONTENTcsandit
Most website classification systems have dealt with the question of classifying websites based on
their content, design, usability, layout and such, few have considered website classification
based on users’ experience. The growth of online marketing and advertisement has lead to
fierce competition that has resulted in some websites using disguise ways so as to attract users.
This may result in cases where a user visits a website and does not get the promised results. The
results are a waste of time, energy and sometimes even money for users. In this context, we design
an experiment that uses fuzzy linguistic model and data mining techniques to capture users’
experiences, we then use the k-means clustering algorithm to cluster websites based on a set of
feature vectors from the users’ perspective. The content unity is defined as the distance between
the real content and its keywords. We demonstrate the use of bisecting k-means algorithm for
this task and demonstrate that the method can incrementally learn from user’s profile on their
experience with these websites.
AGENTS AND OWL-S BASED SEMANTIC WEB SERVICE DISCOVERY WITH USER PREFERENCE SU...IJwest
Service-oriented computing (SOC) is an interdisciplinary paradigm that revolutionizes the very fabric of
distributed software development applications that adopt service-oriented architectures (SOA) can evolve
during their lifespan and adapt to changing or unpredictable environments more easily. SOA is built
around the concept of Web Services. Although the Web services constitute a revolution in Word Wide Web,
they are always regarded as non-autonomous entities and can be exploited only after their discovery. With
the help of software agents, Web services are becoming more efficient and more dynamic.
The topic of this paper is the development of an agent based approach for Web services discovery and
selection in witch, OWL-S is used to describe Web services, QoS and service customer request. We develop
an efficient semantic service matching which takes into account concepts properties to match concepts in
Web service and service customer request descriptions. Our approach is based on an architecture
composed of four layers: Web service and Request description layer, Functional match layer, QoS
computing layer and Reputation computing layer.
CONTEMPORARY SEMANTIC WEB SERVICE FRAMEWORKS: AN OVERVIEW AND COMPARISONSijwscjournal
The growing proliferation of distributed information systems, allows organizations to offer their business processes to a worldwide audience through Web services. Semantic Web services have emerged as a means to achieve the vision of automatic discovery, selection, composition, and invocation of Web services by encoding the specifications of these software components in an unambiguous and machine-interpretable
form. Several frameworks have been devised as enabling technologies for Semantic Web services. In this paper, we survey the prominent Semantic Web service frameworks. In addition, a set of criteria is identified and the discussed frameworks are evaluated and compared with respect to these criteria. Knowing the strengths and weaknesses of the Semantic Web service frameworks can help researchers to utilize the most appropriate one according to their needs.
Exploring The Dynamic Integration of Heterogeneous Services csandit
The increase need for services to handle a plethora of business needs within the enterprise
landscape has yielded to an increase in the development of heterogeneous services across the
digital world. In today’s digital economy, services are the key components for communication
and collaboration amongst enterprises internally and externally. Since Internet has stimulated
the use of services, different services have been developed for different purposes prompting
those services to be heterogeneous due to incompatibles approaches relied upon at both
conceptual and exploitation phases. The proliferation of developed heterogeneous services in
the digital world therefore comes along with a range of challenges more precisely in the
integration layer. Traditionally, integration is achieved by using gateways, which require
considerable configuration effort. Many approaches and frameworks have been developed by
different researchers to overcome these challenges, but up to date the challenges of integration
heterogeneous services with minimal user-involvement still exist. In this paper, we are exploring
the challenges of heterogeneous services and characteristics thereof with the aim of developing
a seamless approach that will alleviate some of these challenges in near future. It is therefore of
outmost importance to understand the challenges and characteristics of heterogeneous services
before developing a mechanism that could eliminate these challenges.
A method of evaluating effect of qo s degradation on multidimensional qoe of ...IJCNCJournal
This paper studies a method of investigating effect of IP performance (QoS) degradation on quality of experience (QoE) for a Web service; it considers the usability based on the ISO 9241-11 as multidimensional QoE of a Web service (QoE-Web) and the QoS parameters standardized by the IETF. Moreover, the paper tackles clarification of the relationship between ISO-based QoE-Web and IETF-based QoS by the multiple regression analysis. The experiment is intended for the two actual Japanese online shopping services and utilizes 35 subjects. From the results, the paper quantitatively discusses how the QoE-Web deteriorates owing to the QoS degradation and shows that it is appropriate to evaluate the proposed method
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.
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
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.
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 PROCESSES: A COMPARATIVE STUDYijwscjournal
Service composition is the process of constructing new services by combining several existing ones. It considered as one of the complex challenges in distributed and dynamic environment. The composition process includes, in general, the searching for existing services in a specific domain, and selecting the appropriate service, then coordinating composition flow and invoking services. Over the past years, the problem of web service composition has been studied intensively by researchers. Therefore, a significant amount of solutions and new methods to tackle this problem are presented. In this paper, our objective is to investigate algorithms and methodologies to provide a classification of existing methods in each composition phase. Moreover, we aim at conducting a comparative study to discover the main features and limitation in each phase in order to assist future research in this area.
WEB SERVICE COMPOSITION PROCESSES: A COMPARATIVE STUDYijwscjournal
Service composition is the process of constructing new services by combining several existing ones. It considered as one of the complex challenges in distributed and dynamic environment. The composition process includes, in general, the searching for existing services in a specific domain, and selecting the appropriate service, then coordinating composition flow and invoking services. Over the past years, the problem of web service composition has been studied intensively by researchers. Therefore, a significant amount of solutions and new methods to tackle this problem are presented. In this paper, our objective is to investigate algorithms and methodologies to provide a classification of existing methods in each composition phase. Moreover, we aim at conducting a comparative study to discover the main features and limitation in each phase in order to assist future research in this area.
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.
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-
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.
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.
An effective method for clustering-based web service recommendationIJECEIAES
Normally web services are classified by the quality of services; however, the term quality is not absolute and defined relatively. The quality of web services is measured or derived using various parameters like reliability, scalability, flexibility, and availability. The limitation of the methods employing these parameters is that sometimes they are producing similar web services in recommendation lists. To address this research problem, the novel improved clustering-based web service recommendation method is proposed in this paper. This approach is mainly dealing with producing diversity in the results of web service recommendations. In this method, functional interest, quality of service (QoS) preference, and diversity features are combined to produce a unique recommendation list of web services to end-users. To produce the unique recommendation results, we propose a varied web service classification order that is clustering-based on web services’ functional relevance such as non-useful pertinence, recorded client intrigue importance, and potential client intrigue significance. Additionally, to further improve the performance of this approach, we designed web service graph construction, an algorithm of various widths clustering. This approach serves to enhance the exceptional quality, that is, the accuracy of web service recommendation outcomes. The performance of this method was implemented and evaluated against existing systems for precision, and f-score performance metrics, using the research datasets.
QOS OF WEB SERVICE: SURVEY ON PERFORMANCE AND SCALABILITYcscpconf
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
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
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
Evaluation of QoS based Web- Service Selection Techniques for Service Composi...Waqas Tariq
In service oriented computing, services are the basic construct that aims to facilitate building of business application in a more flexible and interoperable manner for enterprise collaboration. To satisfy the needs of clients and to adapt to changing needs, service composition is performed in order to compose the various capabilities of available services. With the proliferation of services offering similar functionalities around the web, the task of service selection for service composition is complicated. It is vital to provide service consumers with facilities for selecting required web services according to their non-functional characteristics or quality of service (QoS). Therefore, the process of service selection is complicated due to divergent view of service consumers and service providers on the quality of services. The objective of this paper presents the exploration of various techniques of Quality of Service based Service Selection (QSS) approach in the literature. To evaluate the service selection process, a number of criteria for QSS approach have been identified and presented in this paper.
Web Service QoS Prediction Based on Adaptive Dynamic Programming Using Fuzzy ...redpel dot com
Web Service QoS Prediction Based on Adaptive Dynamic Programming Using Fuzzy Neural Networks for Cloud Services
for more ieee paper / full abstract / implementation , just visit www.redpel.com
Similar to USER-CENTRIC OPTIMIZATION FOR CONSTRAINT WEB SERVICE COMPOSITION USING A FUZZYGUIDED GENETIC ALGORITHM SYSTEM (20)
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...Amil Baba Dawood bangali
Contact with Dawood Bhai Just call on +92322-6382012 and we'll help you. We'll solve all your problems within 12 to 24 hours and with 101% guarantee and with astrology systematic. If you want to take any personal or professional advice then also you can call us on +92322-6382012 , ONLINE LOVE PROBLEM & Other all types of Daily Life Problem's.Then CALL or WHATSAPP us on +92322-6382012 and Get all these problems solutions here by Amil Baba DAWOOD BANGALI
#vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore#blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #blackmagicforlove #blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #Amilbabainuk #amilbabainspain #amilbabaindubai #Amilbabainnorway #amilbabainkrachi #amilbabainlahore #amilbabaingujranwalan #amilbabainislamabad
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
Hierarchical Digital Twin of a Naval Power SystemKerry Sado
A hierarchical digital twin of a Naval DC power system has been developed and experimentally verified. Similar to other state-of-the-art digital twins, this technology creates a digital replica of the physical system executed in real-time or faster, which can modify hardware controls. However, its advantage stems from distributing computational efforts by utilizing a hierarchical structure composed of lower-level digital twin blocks and a higher-level system digital twin. Each digital twin block is associated with a physical subsystem of the hardware and communicates with a singular system digital twin, which creates a system-level response. By extracting information from each level of the hierarchy, power system controls of the hardware were reconfigured autonomously. This hierarchical digital twin development offers several advantages over other digital twins, particularly in the field of naval power systems. The hierarchical structure allows for greater computational efficiency and scalability while the ability to autonomously reconfigure hardware controls offers increased flexibility and responsiveness. The hierarchical decomposition and models utilized were well aligned with the physical twin, as indicated by the maximum deviations between the developed digital twin hierarchy and the hardware.
USER-CENTRIC OPTIMIZATION FOR CONSTRAINT WEB SERVICE COMPOSITION USING A FUZZYGUIDED GENETIC ALGORITHM SYSTEM
1. International Journal on Web Service Computing (IJWSC), Vol.3, No.3, September 2012
DOI : 10.5121/ijwsc.2012.3301 1
USER-CENTRIC OPTIMIZATION FOR CONSTRAINT
WEB SERVICE COMPOSITION USING A FUZZY-
GUIDED GENETIC ALGORITHM SYSTEM
Mahdi Bakhshi1
and Dr. Seyyed Mohsen Hashemi2
1
Department of Computer Engineering, Islamic Azad University,
Shahrbabak Branch
Shahrbabak, Iran
mb@shahrbabakiau.ac.ir
2
Department of Computer Engineering, Islamic Azad University,
Science and Research Branch, Tehran, Iran
hashemi@isrup.com
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.
KEYWORDS
Web service, service composition, QoS, user preferences, fuzzy logic, genetic algorithms
1. INTRODUCTION
Service composition is a main problem in service based environment. Service composition means
how the simple services aggregate to construct a new compound service with more value. During
several years ago, many researchers have worked on this problem. Heretofore, the diverse
techniques have been presented based on different aspects for performing service composition
[2],[3],[4],[5]. From a business view, it is so important to find a composition whose cost is lower
than all other feasible compositions can be made up. In this paper we are going to find an
approach in order to select the optimal composition among different feasible compositions,
according to quality criteria of services by creation a Fuzzy-guided Genetic Algorithm System
(FGS).
One composite service performs specific functionalities which can be divided into some
component functions. Also, they can be accomplished by some component services respectively.
An example of a composite service is shown in Fig. 3 of [6]. The relations between component
2. International Journal on Web Service Computing (IJWSC), Vol.3, No.3, September 2012
2
functions are represented with the state chart in [3]. Some candidate services with same
functionality and different QoS values (non-functionality) are discovered for each task (abstract
service). Thus, there are various execution plans for each execution path in order to execute one
composite service. Furthermore, since the number of candidate services with same functionality
and different QoS values is increasing with the proliferation of web services, the composite size
should be larger and larger. For example, in one execution path, there are 10 component function
(task) and 20 candidate web services for each component function. In this composition scenario,
the size of composite service should be about 2010
. Since users who request web services usually
have both functional requirements and global QoS constraints, it is necessary to select candidate
services for a given task to achieve the best composite service and maximize user satisfaction
(here, the expression "the best" means the composite service which has the optimal QoS values).
Thus, web service selection with global QoS constraint satisfaction performs an important role in
the process of web service composition [7],[8].
There are several approaches for QoS-aware web service composition. But most approaches are
concerned about web service composition algorithm itself, while ignoring the flexibility for user
to set QoS and cost. Most of them require QoS constraints given in form of numbers. In reality, it
is difficult for users because they don’t know the exact value or range of QoS of composite web
services [25]. In this paper we try solve this problem through getting user constraints in form of
fuzzy constraints.
The remainder of this paper is organized as follows. After a review of performed works in section
2, we review the literature of QoS-aware web service composition using QoS computation in
Section 3. Section 4 presents modeling user preferences using quality driven fuzzy rules, designs
a Fuzzy-guided Genetic Algorithm System (FGS) in order to select the optimal web service
composition according to user preferences. Section 5 reports and discusses the results obtained
from the simulations. Finally, Section 6 concludes.
2. RELATED WORK
So far, different approaches are used for selecting the optimal composition of services from
quality properties point of view, like simple additive weighting technique (SAW) that stated in
[14]. But, the stated work in [3] is an effort based on using of linear programming (LP) technique
based on using constraints influence and introducing objective function for compositions
measurement. A survey of some nonlinear approaches is discussed in [15]. Also, genetic
algorithms are proposed for modeling composite services in the form of population members
without any supposition on linearity of problem contents [13].
The computation of QoS values based on QoS matrix is an appropriate solution. Web services
were ranked by normalizing QoS matrix in [16]. Anyway, it was only a local optimization
algorithm but not a global one for service selection problem. Other works in the area of QoS
computation include [3],[16], which proposed local optimization and global planning. The local
optimization technique could not take global QoS constraints into consideration. When the size of
composite service is very large, for example 2010
, the overhead of global planning is quite
enormous. Hereby, both had limitation to some extent. The mentioned techniques aren't able to
effectively solve the web service selection issue with global QoS constraints. This kind of issues
is NP-hard [16].
GA is a more suitable way in order to solve such issues. But GA performs an important role when
the size of composition is very large. In [13], some numerical simulations show that linear
Programming outperforms GA when the combinatorial size is small. Thus, GA should be
3. International Journal on Web Service Computing (IJWSC), Vol.3, No.3, September 2012
3
preferred instead of linear Programming in the case of widely used services. On the other hand,
linear Programming is to be preferred in the case of very specific services.
Generally, there are a few approaches that have investigated how various attributes of workflows
or composite web services can be aggregated [12],[17]. The proposed approach in this paper
performs selecting of optimal composition by added intuition of these works. Also, in this paper
we have shown, that ranking and thus plan selection is a possible use case for aggregation of web
service attributes, and we have also shown that how ranking can be calculated and plan selection
can be automated.
Therefore, there are some techniques for selecting the optimal service from the point view of the
user, based on giving high score to the service such as, whatever is proposed in [18] that includes
some approaches for generating suitable fuzzy rules for the service selection problem. But,
whatever is proposed in [19] tries to model user preferences by fuzzy rules in different strategies
in order to selecting the optimal service according to user preferences. Most of the existing
approaches for automatic selection of services, either consider only atomic services or they are
not based on user preferences.
For independent global constraint web services composition problem, [26] presents an
optimization method of web service composition with constraints using fuzzy Petri net (FPN),
which can transform solving the optimal service composition problem into locating the largest
trust value of legal firing sequences in the FPN model. Also To solve non-clarity and diversity of
user’s QoS requirements, a multi-strategic approach of fast composition of web services [25] is
proposed. Finally, in [27] an improved version of the standard genetic algorithm approach by
using fuzzy logic during the stochastic genetic search process is proposed. The fuzzy component
dynamically adjusts the crossover and mutation evolution rates for each ten consecutive
generations.
3. COMPUTING THE QOS OF COMPOSITE SERVICES
Services are constitutive units of service oriented systems. The service is presented serve to the
service receptor by server and can be recalled by service receptor. These services can be
combined and produce a value-added service. A composite service is an umbrella structure
aggregating multiple other elementary and composite web services, which interact with each
other according to a process model [3]. The composition of services can lead to a predetermined
objective, while don’t become certain by elementary services.
According to Std. ISO 8402 [20] and ITU E.800 [21], QoS may include a number of non-
functional properties such as cost, response time, availability and reliability. Thus, QoS value of a
composite service can be computed by fair computation of QoS of each composite service.
Methods for compute of quality criteria values are different. These values are used for
computation of QoS of composite services. Here, there are some aggregation functions that are
used to compute the QoS value of each composite service. Table 1 provides some of these
aggregation functions for the execution plan p [13].
4. International Journal on Web Service Computing (IJWSC), Vol.3, No.3, September 2012
4
Table 1. Aggregation functions for computation of quality values.
LoopFlowSwitchSequenceQoSAttr.
)(tTk ∗})({ }...1{ piitTMax ∈∑=
n
i
ii tTp
1
)(*∑=
m
i
itT
1
)(Time (T)
)(tCk ∗∑=
p
i
itC
1
)(∑=
n
i
ii tCp
1
)(*∑=
m
i
itC
1
)(Cost (C)
k
tA )(∏=
p
i
itA
1
)(∑=
n
i
ii tAp
1
)(*∏=
m
i
itA
1
)(Availability (A)
k
tR )(∏=
p
i
itR
1
)(∑=
n
i
ii tRp
1
)(*∏=
m
i
itR
1
)(Reliability (R)
))(,( tFkfL
}...1{
))((
pi
tFf iF
∈}...1{
)))(,((
ni
tFpf iiB
∈}...1{
))((
mi
tFf is
∈
Custom Attr. (F)
Namely, for a Sequence construct of tasks {t1,…, tm}, the Time and Cost functions are additive
while Availability and Reliability are multiplicative. The Switch construct of Cases 1,…,n, with
probabilities p1,…,pn such that 11
=∑
=
=
ni
i ip , and tasks {t1,…, tn} respectively, is always evaluated as
a sum of the attribute value of each task, times the probability of the Case to which it belongs.
The aggregation functions for the Flow construct are essentially the same as those for the
Sequence construct, except for the Time attribute where this is the maximum time of the parallel
tasks{t1,…,tp}[11]. Finally, a Loop construct with k iterations of task t is equivalent to a Sequence
construct of k copies of t [13]. Of course, this table includes a lot of quality attributes. As
mentioned in the last line, other features are definable by user.
4. A FUZZY-GUIDED GA APPROACH ACCORDING TO USER PREFERENCES
By moving toward the age of information, a hypothesis can formulate the human knowledge in
the systematic form, and introduce an approximate description that is reliable and analyzable.
This important subject is applicable by a fuzzy system [1].
User’s need to use considered services with different quality properties cause to user have a
determinative role in the process of service composition. For example, the cost criterion may be
the first grade importance for a user, but his need can be provide with a medium response time,
and for other users these preferences are vice versa. The main problem is providing an approach
for selecting the optimal composition of services according to user preferences and quality criteria
of services and the aggregated values for each quality criterion. Our work is an approach that
relies on the concept of domain ontology for description of services by specifying valid
vocabulary and adding semantic concepts for description of services. These vague semantic
descriptions located in the form of fuzzy rules and create a criterion to measurement of composite
services, and then determine and measure the importance of each rule according to user’s clear
point of views. In fact, we provide an approach for giving score to composite services by entering
the user’s point of views in the process of fuzzy inference.
4.1. Definition of Variables and Membership Functions of the System
In many application domains, the transition between the memberships of an individual from one
set to another is smooth. Consider, For example, height of a human. Small children grow, but
when do they stop to be small? Such kinds of knowledge can be encoded using techniques such as
fuzzy logic [19].
5. International Journal on Web Service Computing (IJWSC), Vol.3, No.3, September 2012
5
Vague knowledge, i.e. rules based on fuzzy logic, are also important from the aspect of evaluating
values of attributes that have very complex dependencies with other attribute values [19]. The
vague membership functions can be modeled in the form of some fuzzy sets. On the other hand,
in simplest form, a domain ontology would specifies the valid vocabulary of describing (naming)
functional and nonfunctional properties that are allowed to occur in service descriptions, but we
need a domain ontology that be able to define categories of linguistic variables. For example, the
response time could be described with the terms fast, normal, slow, very slow [18].
After the complete knowledge about linguistic variables, we can define the membership
functions. In our work, we use the triangular and trapezoidal shapes for defining membership
functions. According to expressed quality criteria, we define linguistic variables in the form of
fuzzy sets based on domain ontology to describe web services, as defined in Figure 1. The reason
of using triangular shapes for defining input variables and defining variable terms as a
symmetrical form is permanent change at input membership functions and the distinction between
different quality vectors.
v e ry c h e a p
c h e a p
m o d e ra te
e x p e n s iv e
0
0 .2
0 .4
0 .6
0 .8
1
0 2 0 4 0 6 0 8 0 1 0 0
C o s t (d o lla r )
Membership
v e ry e x p e n s iv e
v e ry fa s t
fa s t
m o d e ra te
s lo w
0
0 .2
0 .4
0 .6
0 .8
1
0 1 0 2 0 3 0 4 0 5 0
R esp o n se tim e (m sec)
Membership
v e ry s lo w
v e ry lo w
lo w
m o d e ra te
h ig h
0
0 .2
0 .4
0 .6
0 .8
1
-1 4 9 1 4 1 9 2 4
Availab ility (h o u r)
Membership
v e ry h ig h
6. International Journal on Web Service Computing (IJWSC), Vol.3, No.3, September 2012
6
v e ry lo w
lo w
m o d e ra te
h ig h
0
0 .2
0 .4
0 .6
0 .8
1
0 2 0 4 0 6 0 8 0 1 0 0
R e lia b ility (p e r c e n t)
Membership
v e ry h ig h
v e ry lo w m o d e ra te
h ig h
0
0 .2
0 .4
0 .6
0 .8
1
0 2 0 4 0 6 0 8 0 1 0 0
R a n k
Membership
v e ry h ig h
lo w
Figure 1. Membership functions for defining linguistic variables of the system.
In order to define membership functions, we use equal terms in definition of system’s linguistic
variables. The importance of this issue is because of logical relationship between the input and
output variable terms in the formation of system's fuzzy rules.
4.2. Modeling User Preferences Based on Weighting the Rules
We regard preferences as the information that describes the constraints on the properties of an
individual in order to be acceptable for further consideration. We specify different levels of
acceptance by definition of fuzzy membership functions [19].
We model user preferences with fuzzy IF-THEN rules. Fuzzy IF-THEN rules allow to evaluate
good approximations of desired QoS values in a very effective way [22],[23]. The IF part consists
of membership function of various properties of an individual, and the THEN part is one of the
membership functions of a special concept called Rank. Intuitively, a fuzzy rule describes which
composition of attribute values a user is willing to accept to which degree, where attribute values
and degree of acceptance are fuzzy sets, i.e. vague. An example of fuzzy rule can be:
IF Cost = Cheep and Response Time = Fast THEN
Rank = High
If all inputs classify into fuzzy sets viz. Very Low, Low, Moderate, High and Very High and The
output Rank classifies as Very High, High, Moderate, Low and Very Low, then all possible
combinations (55
i.e. 3125) of inputs are considered to design the rule base. Each rule corresponds
to one of the five outputs based on the expert opinions. But modeling all of the preferences by
users on fuzzy rules is very time consuming and maybe impossible.
Our approach with assumption existence of fuzzy rules that can be criteria for ranking quality
vectors related to feasible execution plans, gives more weight to the rules that are more important
from user’s point of view.
7. International Journal on Web Service Computing (IJWSC), Vol.3, No.3, September 2012
7
The confidence factor (CF) of each rule which is a number between 0 and 1, can express the
importance of a rule to obtain the final result. Equation (1) expresses the effect of this factor in
the process of computing the result [24].
iipremiseicon CFMembershipMembership ×= ,, (1)
This equation shows that the membership function of conclusion part in each rule i, is the result
of multiplying membership function of premise part by confidence factor of the relevant rule.
We can provide the preliminary of fuzzy system with complete knowledge about the quality
criteria and definition of input and output linguistic variables with equal terms. After that, we
obtain some category of fuzzy rules for each quality criterion, which in each category there are
some fuzzy rules that their number is equal to the number of input variable terms. In order to
express fuzzy rules, we create one logical mapping between input variable terms in premise part
and output variable in conclusion part for each category of rules. The effect of each rule in the
ranking process should be distinct by user. This work is done by means of getting the importance
grade of each quality criterion and located it as a confidence factor related to the one category of
rules. Therefore we define the importance grade as a number from 0 to 100 and by conversion of
distance is used as confidence factor.
In order to introduce fuzzy rules, we must create a logical mapping according to this point that
whether low or high value of variable is considerable for user. The fuzzy rules for cost variable
that low value of this variable is considerable for user can be expressed as follow:
CFcost IF Cost=very cheap THEN
Rank=very high
CFcost IF Cost=cheap THEN
Rank=high
CFcost IF Cost=moderate THEN
Rank=moderate
CFcost IF Cost=expensive THEN
Rank=low
CFcost IF Cost=very expensive THEN
Rank=very low
While, we express the fuzzy rules for availability variable that high value of this variable is
considerable for user as follow:
CFav IF Availability=very high THEN
Rank=very high
CFav IF Availability=high THEN
Rank=high
CFav IF Availability=moderate THEN
Rank=moderate
CFav IF Availability=low THEN
Rank=low
CFav IF Availability=very low THEN
Rank=very low
8. International Journal on Web Service Computing (IJWSC), Vol.3, No.3, September 2012
8
As pointed out above, we express (N=20) fuzzy rules for the fuzzy system that are according to
the numbers of system linguistic variables and variable terms, the number of these rules are
variable. These rules are criterion for evaluating different composite services.
4.3. A Genetic Algorithm based Optimization
By applying a GA-based approach the optimal solution (represented by its genotype)is
determined by simulating the evolution of an initial population (through generation)until survival
of best fitted individuals (here compositions) satisfying some constraints. The survivors are
obtained by crossover, mutation, selection of compositions from previous generations. Details of
GA parameterization follow:
• Genotype: it is defined by an array of integer. The number of items is equal to the
number tasks involved in the composition. Each item, in turn, contains an index to an array of
candidate services matching that task. Each composition, as a potential solution of the
optimization problem, can be encoded using this genotype (e.g., Figure 2 is encoding the
genotype of one composition).
Figure 2. Genotype encoding for service composition.
• Enhanced Initial Population: The value of every task in every chromosome is set
according to a local optimized method. The value of every task is QoS value of selected candidate
service. The larger QoS value of a candidate service is, the larger the probability to be selected is.
The probability of one candidate to be selected is the result of its QoS value divided by the sum of
QoS values of all candidates of same task.
• Fuzzy Constraints have to be met by compositions c e.g., Cost have to be cheap,
whereas the domain ontology it means Qco(c)<50 and Qco(c)>0 or response time at least have to
be moderate that it means Qrt(c)<38 and Qrt(c)>10.
• Fitness Function: Now, the problem can be modeled by means of a fitness function and
eventually, some constraints. The fitness function needs to maximize some QoS attributes (e.g.,
reliability), while minimizing others (e.g., cost). In our approach we define a new fitness
function f based defined fuzzy system.
),()( Rankinputfitcf = (2)
Where input is quality vector of a composition c and Rank is output result of fuzzy system. ∈lw
[0,1] is the weight assigned to the th
l quality criterion and ∑ ∈ },,,{ reavrtcol lw contrary to [10]
9. International Journal on Web Service Computing (IJWSC), Vol.3, No.3, September 2012
9
doesn’t have to be 1. Also QoS attribute factors ( },,,{ reavrtcolQ ∈ don't have to be normalized in the
interval [0,1]).
In addition f must drive the evolution towards constraint satisfaction. To this end compositions
that do not meet the constraints are penalized by (3).
2
},,,{
minmax
'
)
)()(
()()( ∑∈ −
∆
−=
avrertcol ll
l
pe
cQcQ
Q
wcfcf (3)
Where max
lQ , min
lQ are respectively the maximum and minimal value of the th
l quality
constraint, pew weights the penalty factor and },,,{ avrertcolQ ∈∆ is defined by:
<−
<<
<−
=∆
llll
lll
llll
l
QQifQQ
QQQif
QQifQQ
Q
minmin
maxmin
maxmax
0 (4)
Contrary to [5], compositions that violate constraints do not receive the same penalty. Indeed the
factor pew is further penalized in (3). This function avoids local optimal by considering also
compositions that disobey constraints. Unfortunately, (3) contains a penalty for candidate
compositions, which is the same at each generation. If, as usual, the weight pew for this penalty
factor is high, there is a risk that also candidate composition violating the constraints but "close"
to a good solution could be discarded.
The alternative is to adopt a dynamic penalty, i.e., a penalty having a weight that increases with
the number of generations. This allows, for the early generations, to also consider some
individuals violating the constraints. After a number of generations, the population should be able
to meet the constraints, and the evolution will try to improve only the rest of the fitness.
gen is the current generation, while maxgen is the maximum number of generations.
• Operators on Genotypes: they define authorized alterations on genotypes not only to
ensure evolution of compositions’ population along generations but also to prevent convergence
to local optimum. We use: i) composition mutation i.e., random selection of a task (i.e., a position
in the genotype) in a candidate composition and replacing its service with another one among
those available, ii) the standard two-points crossover i.e., randomly combination of two
compositions and iii) selection of compositions which is fitness-based i.e., compositions
disobeying the constraints are selected proportionally from previous generations.
• Stopping Criterion: it enables to stop the evolution of a population. First of all we
iterate until the constraints are met (i.e., 0=∆ lQ }),,,{ avrertcol ∈∀ within a maximum
number of generations. Once the latter constraints are satisfied we iterate until the best fitness
composition remains unchanged for a given number of generations.
4.4. Design of System
Figure 3 shows an aspect of the system. The system has several components which are described
below. The complete knowledge about quality criteria and then defining linguistic variables and
membership functions has a determinative role in fuzzification process of composite services. The
10. International Journal on Web Service Computing (IJWSC), Vol.3, No.3, September 2012
10
set of fuzzy rules which are proposed based on the logical mapping between the terms of
linguistic variables, are the criteria for evaluating the different composite services. But, these
rules are completely neutral against previous approaches of selecting suitable composition.
Therefore, the user’s role for preferring the rules that express his needs increases. As observed in
the figure, the received user preferences are based on the importance grade that is given to each
quality criterion. Then by changing distance, this numbers stated as confidence factors or weight
of each category of rules.
The plan generation unit produces all feasible plans based on workflow and presents services for
doing tasks. These plans can be limited by user constraints. For example, at composite service of
travel planner user can determine the maximum cost that he can pay for hotel or car rent and so,
infeasible execution plans will be omitted. In our system (FGS) these end compositions that do
not meet the constraints are penalized, but because they may be close to a good solution, they are
not discarded. On the other hand, aggregation functions for computing QoS of execution plans
formed quality gathering unit which create quality vector of each execution plan.
Finally, there is optimization of composition unit which works based on GA. Fuzzy rules, which
are created based on user preferences together with user constraints constitute one fitness
function. GA parameters are defined for the system. Quality vectors related to different
compositions are evaluated and one optimized solution is selected in accordance with user need
and convenience.
Figure 3. The general view of designed system.
5. EMPIRICAL STUDY
We implemented this approach by designing the FGS in MATLAB application and then run this
at XP operating system. The optimal compositions are computed by using an elitist GA where the
best 2 compositions were kept alive across generations, with a crossover probability of 0.7, a
mutation probability of 0.1, a population of 200 compositions. The roulette wheel selection has
been adopted as selection mechanism. We consider a simple stopping criterion i.e., up to 400
11. International Journal on Web Service Computing (IJWSC), Vol.3, No.3, September 2012
11
generations. We conducted experiments on Intel(R) Core(TM)2 CPU, 2.4GHz with 2GB RAM.
We conducted experiments on Intel(R) Core(TM)2 CPU, 2.4GHz with 2GB RAM.
5.1. Evaluation of Fitness Function
At first, we set confidence factor of each quality criterion equal to 1 and draw charts related to
changes of system variables. Figure 4 shows the changes of cost variable and results of these
changes on rank of composite services. The output level from the changes of input variables,
show the logical changes on rank of composite services.
Then, we decrease confidence factor that is related to this criterion (cost) and fix other criteria.
Now, we can observe that the chart gradient and width of ranking scores in each step of
confidence factor’s reduction, is lessened. This subject is true for other criteria and is a reason for
correct functionality of system. Figure 5 shows difference of maximum and minimum ranking
scores belong to composite services against changes of confidence factor related to one quality
criterion and fixing the other criteria in 1.
As observed here, the user’s point of view has direct effect on computed score for a composite
service. In fact, user can select a suitable composition through his point of view.
38
43
48
53
58
0 20 40 60 80 100
Cost
Rank
Figure 4. Effect of cost variable changing on rank variable.
0
5
10
15
20
25
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
confide nce factor
DifferenceofMax&Min
rankingscores
Figure 5. Effect of confidence factor changing on width of ranking scores.
5.2. Evolution of the Composition Quality
Figure 6 reports the evolution of the composition quality over the GA generations, by varying the
number of tasks. For each task, we considered 30 available candidate services. This illustrates
different levels of convergence to a composition that meets some constraints and optimizes its
12. International Journal on Web Service Computing (IJWSC), Vol.3, No.3, September 2012
12
different quality criteria by maximizing the availability and reliability while keeping low cost and
response time. For better evaluation, equal weights are assigned to the different quality criteria.
Figure 6. Evolution of the composition quality.
Table 2 and Figure 6 present the computation costs and the number of generations required to
obtain the maximal fitness value. The more the number of tasks, the more the amount of time it
takes to converge to the optimum. Obviously, the population size and the number of generations
should be extended to reach the optimum of more complex compositions.
Table 2. Overview of computation costs.
Tasks
Num.
Max. Fitness
(%)
Generation
Num.
Time (ms)
10 99 110 1230
20 97.5 267 2560
30 96 342 5540
5.3. Towards Large Scale Based Compositions
In this experiment we suggest to study the behavior of our approach regarding the optimization
with a large number of tasks (up to 500 tasks) and candidate services (500). To this end we focus
on its scalability and the impact of the number of generations as well as the population size on the
GA success.
Table 3. Large scale compositions.
Tasks
Num.
Max. Fitness
(%)
Generation Num./
Population size
Time (ms)
100
87
98
400/200
700/400
4350
9543
300
52
96
400/200
1500/500
5836
20568
500
27
95
400/200
3000/1000
8056
55655
As illustrated in Table 3, increasing both the number of generations and the population size does
actually result in better fitness values for problems with a larger number of tasks and candidate
services. For example, regarding the optimization of a composition of 500 tasks with 500
candidate services, a number of generations of 400 and a population size of 200 do result in a low
fitness value of 27% of the maximum, whereas considering a number of generations of 3000 and
13. International Journal on Web Service Computing (IJWSC), Vol.3, No.3, September 2012
13
a population size of 1000 achieve 95% of the maximum. Note that better fitness values can be
reached by further increasing the sizes of generations and populations.
5.4. Convergence of GA-based approaches
In this experiment, we compare the convergence of FGS with the main alternative at present [10].
Also for each task, there is 30 available candidate services.
Table 4. Comparing GA-based approaches (population size of 200).
Tasks
Num.
Approach Max.
Fitness (%)
Generation
Num.
Time
(ms)
10
FGS
[10]
99
98
110
156
1230
1350
20
FGS
[10]
97.5
93
267
425
2560
2865
30
FGS
[10]
96
84
342
596
5540
6570
According to Table 4, the advantage of FGS is twofold. Firstly we obtain better fitness values for
the optimal composition than the approach of [10]. Secondly, our approach converges faster than
the approach of [10]. In addition FGS avoids getting trapped by local optimums by i) further
penalizing compositions that disobey constraints (the factor of in (3) and (5)) and ii)
suggesting a dynamic penalty, i.e., a penalty having a weight that increases with the number of
generations. These results support the adoption of FGS in the cases where a large number of tasks
and services are considered.
A linear increase in time for increasing numbers of iterations for the GA which is proposed in
[10] and FGS are shown in Figure 7. Due to the additional time needed for the fuzzy component,
FGS shows the larger increase, but because of need to less iteration it is more valuable.
Figure 7. Execution times obtained using GA and FGS.
6. CONCLUSIONS
This paper proposed a hybrid Fuzzy-guided Genetic Algorithm system for QoS-aware service
composition, i.e., to determine a set of candidate services to be bound to abstract services
contained in a composition to meet a set of fuzzy constraints and to optimize a fitness criterion on
14. International Journal on Web Service Computing (IJWSC), Vol.3, No.3, September 2012
14
QoS attributes. In the GA optimization, the fitness function is a fuzzy system that is constructed
based on user preferences.
Several advantages can be stated for this approach. This approach emphasizes on accordance to
the user preferences and quality properties of composite service. The user clearly states his
preferences on the other hand he states many fuzzy rules. Also, in addition to high care in
expression of preferences, for modeling different user preferences there is no need to restate the
rules. User presents fuzzy constraints and don’t have to know details of information about QoS
values. Also, this system is extensible against increasing the quality criteria. Compared with GA,
this approach has better fitness values and faster convergence and more accuracy.
Finally, in future work which is user-centric in order to select the optimal web service
composition, we will consider composition of one technique such as simulated annealing or
migrating birds with fuzzy logic and survey their results through further experiments.
REFERENCES
[1] Li-Xin.Wang (1997) Course in fuzzy systems and control, 448 pages, Prentice Hall publisher.
[2] I.B.Arpinar, B.Aleman.meza, R.Zhang & A.Maduko, (2004) "Ontology-Driven Web Services
Composition Platform" s.l. IEEE International Conference on E-Commerce Technology (CEC'04).
[3] L.Zeng, B.Benatallah, M.Dumas, J.Kalagnanam & Q.Z.Sheng, (2003) "Quality driven web services
composition." In 12th International conference of WWW, pp. 411–421.
[4] J.Rao & X.Su, (2005) "A Survey of Automated Web Service Composition Methods" s.l. ICAPS.
[5] B.Srivastava & J.Koehler, (2004) "Web Service Composition - Current Solutions and OpenProblems"
s.l. ICAPS.
[6] Z. Liang-Jie, L.Bing, C. Tian & et al, (2003) "On demand web services-based business process
composition", In IEEE International Conference on System, Man, and Cybernetics (SMC’03),
Washington, USA, pp. 4057–4064.
[7] D.A Menasce, (2002) "QoS issues in web services" In IEEE Internet Computing 6 (6) 72–75.
[8] D.A. Menasce, (2004) "Composing web services: a QoS view" In IEEE Internet Computing 8 (6) 88–
90.
[9] C.Zhou, L-T.Chia & B-S.Lee, (2005) "Semantics inservice discovery and QoS measurement" IT
Professional, 7(2), 29–34.
[10] J.L.Ambite, G.Barish, C.A.Knoblock & M.Muslea, (2002) "Getting from Here to There: Interactive
Planning and Agent Execution for Optimizing Travel" s.l. Proceedings of the Fourteenth Conference
on Innovative Applications of Artificial Intelligence (IAAI-2002).
[11] J.Cardoso, (2002) "Quality of service and semantic composition of workflows" PhD thesis, Univ. of
Georgia.
[12] J.Cardoso, A.Sheth, J.Miller, J.Arnold & K.Kochut, (2004) "Quality of service for workflows and
web service processes" Web Semantics: Science, services and Agents on the World Wide Web,
1(3):281-308, April 2004.
[13] G.Canfora, M.D.Penta, R.Esposito & M.Villani, (2005) "An approach for QoS-aware service
composition based on genetic algorithms" In Proceedings of the Genetic and Evolutionary
Computation Conference (GECCO), Washington, DC, June 2005.
[14] H.C-L & K.Yoon, (1981) "Multiple Criteria Decision Making" Lecture Notes in Economics and
Mathematical Systems, Springer-Verlag.
[15] I.E.Grossmann, (2002) "Review of nonlinear mixed-integer and disjunctive programming techniques"
Optimization and Engineering, 3(3): 227-252, September 2002.
[16] M. Srinivas & L.M. Patnaik, (1994) "Genetic algorithm: a survey" In IEEE Computer 27 (6) 17–26.
[17] M.C.Jaeger, G.Rojec-Goldmann & G.M¨uhl, (2005) "QoS Aggregation in Web Service
Compositions" In: Proceedings of IEEE International Conference one-Technology, e-Commerce and
e-Service (EEE-05), China, IEEE Press. 181–185.
[18] I.Sora, D.Todinca & C.Avram, (2009) "Translating user preferences into fuzzy rules for the automatic
selection of services" 5th International Symposium on Applied Computational Intelligence and
Informatics. Timisoara, Romania, May 2009.
15. International Journal on Web Service Computing (IJWSC), Vol.3, No.3, September 2012
15
[19] S.Agarwal & S.Lamparter, (2005) "User preference based automated selection of web service
composition" in Proceedings of the ICSOC Workshop on Dynamic Web Service.
[20] F. Curbera & et al, (2002) "Unraveling the Web Services: An Introduction to SOAP, WSDL, and
UDDI" In IEEE Internet Computing, vol. 6, no. 2, Mar./Apr.
[21] ITU-T Recommendation E.800, (1994) "Terms and definitions related to quality of service and
network performance including dependability".
[22] L. A. Zadeh, (1965) "Fuzzy sets" Infor¬ma¬tion and Con¬trol, vol. 8, pp. 338–353.
[23] R.R.Yager, S.Ovchinnikov, R.M.Tong & H.T.Nguyen, (1987) "Fuzzy sets and applications" selected
Papers by L. A.Zadeh, John Wiley and Sons, New York.
[24] D.Nauck & R.Kruse, (1998) "How the learning of rule weights affects the interpretability of fuzzy
systems" Proc. of 7th IEEE International Conference on Fuzzy Systems, pp. 1235-1240.
[25] G.Wang, L.Zhang & K.Nie, (2012) " Multi-strategic approach of fast composition of web services"
APWeb 2012, LNCS 7235, pp.504-512.
[26] X.W Fang, Y.H Feng & Z.X Yin, (2011) " An Optimization Method for Constraint Web Service
Composition Based on Fuzzy Petri Net" Advanced Materials Research, pp. 1415-1420, July 2011.
[27] M. Chen & S.A.Ludwig, (2012) "Fuzzy-guided Genetic Algorithm applied to the Web Service
Selection Problem" Proceedings of the 2012 IEEE International Conference on Fuzzy Systems,
Brisbane, Australia, June 2012.
Authors
M. Bakhshi received his B.Sc in computer engineering from Shahid Bahonar University of
Kerman, Iran, his M.Sc degree in software engineering from Islamic Azad University of
Najaf Abad, Iran. Currently he is faculty of Islamic Azad University, shahrbabak branch.
His interests include Web Service technology and coordination problem. He is working on
dynamic choreography models for Web services in B2B Corporation.
Dr. S. M. Hashemi received his M.S. degree in Computer Science from Amirkabir
University of Technology in 2003, and his PhD degree in Computer Science from the Azad
University in 2009. Moreover, he is currently a faculty member at Science and Research
Branch, Azad University, Tehran. His current research interests include Software Intensive
Systems, Global Village Services, Grid Computing, Agile Enterprise Architecting through
ISRUP, and Globalization Governance through IT/IS Services.