Method and supporting framework for business domain-oriented web service discovery

This paper proposes a new business domain-oriented web service discovery method and framework to solve the low precision results caused by UDDI （universal description,discovery and integration） syntactic discovery and the difficulty in selecting from among functionally equivalent web services.When requesting services,service clusters are extracted from concrete services in terms of functional requests; then, through business information properties consultation,the most suitable services are determined and finally bound to user requests.The whole process is transparent to users. This framework is also tested and supported through a prototype based on a travel domain,IPVita （intelligent platform of virtual travel agency）.

Task-oriented web service discovery algorithm using semantic similarity for adaptive service composition

In order to achieve adaptive and efficient service composition, a task-oriented algorithm for discovering services is proposed. The traditional process of service composition is divided into semantic discovery and functional matching and makes tasks be operation objects. Semantic similarity is used to discover services matching a specific task and then generate a corresponding task-oriented web service composition （TWC） graph. Moreover, an algorithm for the new service is designed to update the TWC. The approach is applied to the composition model, in which the TWC is searched to obtain an optimal path and the final service composition is output. Also, the model can implement realtime updating with changing environments. Experimental results demonstrate the feasibility and effectiveness of the algorithm and indicate that the maximum searching radius can be set to 2 to achieve an equilibrium point of quality and quantity.

Reducing semantic bias of annotations for semantic web service discovery

In order to improve the effectiveness of semantic web service discovery, the semantic bias between an interface parameter and an annotation is reduced by extracting semantic restrictions for the annotation from the description context and generating refined semantic annotations, and then the semantics of the web service is refined. These restrictions are dynamically extracted from the parsing tree of the description text, with the guide of the restriction template extracted from the ontology definition. New semantic annotations are then generated by combining the original concept with the restrictions and represented via refined concept expressions. In addition, a novel semantic similarity measure for refined concept expressions is proposed for semantic web service discovery. Experimental results show that the matchmaker based on this method can improve the average precision of discovery and exhibit low computational complexity. Reducing the semantic bias by utilizing restriction information of annotations can refine the semantics of the web service and improve the discovery effectiveness.

A User Requirement Oriented Web Service Discovery Approach Based on Logic and Threshold Petri Net

In recent years, the number of Web services has increased significantly. Web service discovery has drawn much attention with the development of Web service applications and big data analysis. Under this circumstance, traditional Web service discovery strategies cannot adequately meet high user requirements due to the efficiency and precision of service discovery is low. In order to improve the accuracy and efficiency of service discovery, a user requirement oriented Web service discovery approach based on Petri nets is proposed in this study. A data preprocessing strategy of Web service is first designed. Then, a service clustering method is proposed based on Petri nets, which can conduct service cluster head generation, service cluster composition, and service discovery. The proposed method utilizes a superior data preprocessing method. Using simulation experiments,the efficiency and precision of Web service discovery are illustrated. Finally, the application value of the approach on real Web service is discussed.

An Efficient Grid Service Discovery Mechanism Based on the Locality Principle

With the explosion of services in grid environment, it＇s necessary to develop a mechanism which has the ability of discovering suitable grid services efficiently. This paper attempts to establish a layered resource management model based on the locality principle which classifies services into different domains and virtual organizations （VOs） according to their shared purposes. We propose an ontologybased search method applying the ontology theory for characterizing semantic information. In addition, we extend the UD- D1 in querying, storing, and so on. Simulation experiments have shown that our mechanism achieves higher performance in precision, recall and query response time.

Web Service Description and Discovery Based on Semantic Model

A novel semantic model of Web service descrip tion and discovery was proposed through an extension for profile model of Web ontology language for services （OWL-S） in this paper. Similarity matching of Web services was implemented through computing weighted summation of semantic similarity value based on specific domain ontology and dynamical satisfy extent evaluation for quality of service （QoS）. Experiments show that the provided semantic matching model is efficient.

A QoS-aware Method for Web Services Discovery

The non-functional QoS (quality of service) information helps us to select a proper Web-service from the web applications, by using component services such as UDDI[1](Universal Description, Discovery, and Integration) and MDS(Monitoring and Discovery System). MDS is a suite of web services to monitor and discover resources and service on Grids, but MDS only based on function aspects. This paper studies on an approach to provide the QoS information and a discovery model by using MDS and gives a system deployment and implementation plan. The simulation results show that the method is effective in service discovery.

Virtual and Dynamic Hierarchical Architecture： an overlay network topology for discovering grid services with high performance

This paper presents an overlay network topology called Virtual and Dynamic Hierarchical Architecture (VDHA) for discovering Grid services with high performance. Service discovery based on VDHA has scalable, autonomous, efficient, reliable and quick responsive. We propose two service discovery algorithms. Full Search Query and Discovery Protocol (FSQDP) discovers the nodes that match the request message from all N nodes, which has time complexity O(logN), space complexity O(nvg) (nvg being node numbers of each virtual group), and message-cost O(N), and Domain-Specific Query and Discovery Protocol (DSQDP) searches nodes in only specific domains with time complexity O(nvg), space complexity O(nvg), and message-cost O(nvg). In this paper, we also describe VDHA, its formal definition, and Grid Group Management Protocol.

A dynamic grid service discovery model： TDMSD

Frequent joining and withdrawal of resources and services in a grid make dynamic discovery of grid resource and service quite difficult. In this paper, a two-dimensional model of service discovery （TDMSD） is presented for use of dynamic service discovery. Description and proof of the model and the route algorithm of service discovery are proposed. The complexity analysis and simulation results show that the TDMSD model works well.

Development of a Smart Technique for Mobile Web Services Discovery

Web service(WS)presents a good solution to the interoperability of different types of systems that aims to reduce the overhead of high processing in a resource-limited environment.With the increasing demand for mobile WS(MWS),the WS discovery process has become a significant challenging point in the WS lifecycle that aims to identify the relevant MWSs that best match the service requests.This discovery process is a resource-consuming task that cannot be performed efficiently in a mobile computing environment due to the limitations of mobile devices.Meanwhile,a cloud computing can provide rich computing resources for mobile environments given its unlimited and easily scalable resources.This paper proposes a semantic WS discovery and invocation framework in mobile environments based on cloud and a relationship-aware matchmaking algorithm.The discovery algorithm enriches MWS and user requests semantically with the functional and non-functional properties of Ontology Web Language for Services,such as Quality of Web Service,device context,and user preferences.The WS repository is filtered based on logical reasoning and a parameter-based matching algorithm to minimize the matching space and improve runtime performance.The cosine similarity between the user request and services repository is then assessed to generate the most relevant WS.The relationships among concepts in the ontology are considered to improve the recall and precision ratio.After the WS discovery process,users can invoke and test these services in a mobile environment through a dynamic user interface.The interface of the invocation process is changed according to the WS description document.An application prototype is also developed to evaluate the framework based on a Cordova cross-mobile development framework.

Cloud Service Provisioning Based on Peer-to-Peer Network for Flexible Service Sharing and Discovery

In this paper, we present an approach to establish efficient and scalable service provisioning in the cloud environment using P2P-based infrastructure for storing, sharing and discovering services. Unlike most other P2P-based approaches, it allows flexible search queries, since all of them are executed against internal database presenting at each overlay node. Various issues concerning using this approach in the cloud environment, such as load-balancing, queuing, dealing with skewed data and dynamic attributes, are addressed in the paper. The infrastructure proposed in the paper can serve as a base for creating robust, scalable and reliable cloud systems, able to fulfill client’s QoS requirements, and at the same time introduce more efficient utilization of resources to the cloud provider.

Towards structural web services discovery

A syntactic and structural matching mechanism for service discovery was put forward, which tries to exploit the underlying semantics of web services to enhance tbe traditional syntactic service discovery. We commit WSDL （Web Service Description Language） as service description language. The syntactic matching mechanism is based on the textual similarity among WSDL documents using VSM （ Vector Space Model）. The structural information is extracted from WSDL document tree or the invocation sequence of a series of services which can be viewed as the problem of graph isomorphism. Then we combine the syntactic and structural similarity linearly to calculate the service similarity. Finally we provide a novel web services discovery framework named SG^＊ to find the exact services meeting the users＇ goals based on service similarity.

Context-aware computing-based reducing cost of service method in resource discovery and interaction

Reducing cost of service is an important goal for resource discovery and interaction technologies. The shortcomings of transhipment-method and hibernation-method are to increase holistic cost of service and to slower resource discovery respectively. To overcome these shortcomings, a context-aware computing-based method is developed. This method, firstly, analyzes the courses of devices using resource discovery and interaction technologies to identify some types of context related to reducing cost of service, then, chooses effective methods such as stopping broadcast and hibernation to reduce cost of service according to information supplied by the context but not the transhipment-method’s simple hibernations. The results of experiments indicate that under the worst condition this method overcomes the shortcomings of transhipment-method, makes the “poor” devices hibernate longer than hibernation-method to reduce cost of service more effectively, and discovers resources faster than hibernation-method; under the best condition it is far better than hibernation-method in all aspects.

Evaluation of Different Electronic Product Code Discovery Service Models

Electronic Product Code Discovery Service (EPCDS) is an important concept in supply chain processes and in Internet of Things (IOT). It allows supply chain participants to search for their partners, communicate with them and share product information using standardized interfaces securely. Many researchers have been proposing different EPCDS models, considering different requirements. In this paper, we describe existing architecture designs of EPCDS systems, namely Directory Service Model, Query Relay Model and Aggregating Discovery Service Model (ADS). We also briefly mention Secure Discovery Service (SecDS) Model, which is an improved version of Directory Service Model with a secure attribute-based access control mechanism. Then, we analyze the strengths and limitations of these models, by comparing based on non-functional features such as data ownership, confidentiality, business relationship independence, availability, reliability, implementation complexity, visibility, and scalability. From the analysis results, we have a better understanding of which model is more suitable in what kinds of situations or scenarios. Moreover, we suggest possible improvements and identify possible future add-on applications to SecDS model in the paper.

Dynamic Service Discovery, Composition and Reconfiguration in a Model Mapping Business Process to Web Services

In any organization where SOA has been implemented, all of the web services are registered in UDDI and users’ needs are served by using appropriate web services. So in this paper, we will try to discover a service from repository first that can provide the required output to the user. The process becomes difficult when a single service is not able to fulfill a user’s need and we need a combination of services to answer complex needs of users. In our paper, we will suggest a simpler approach for dynamic service composition using a graph based methodology. This will be a design time service composition. This approach uses the functional and non-functional parameters of the services to select the most suitable services for composition as per user’s need. This approach involves “service classification” on the basis of functional parameters, “service discovery” on the basis of user’s need and then “service composition” using the selected services on the basis of non-functional parameters like response time, cost, security and availability. Another challenge in SOA implementation is that, once the composition has performed, some services may become faulty at runtime and may stop the entire process of serving a user’s need. So, we will also describe a way of “dynamic service reconfiguration” in our approach that will enable us to identify and replace a faulty service that is violating the SLA or is not accessible anymore. This service reconfiguration is done without redoing or reconfiguring the entire composition. In the end, to simulate the proposed approach, we will represent a prototype application built on php 5.4 using My SQL database at backend.

Automatic Service Discovery in Universal Plug and Play

The home network technologies are taking advantage of the increasingly promising market prospect, thank to the popularity of digital home appliances. To enable control and data transfer among interconnected home network devices, it is necessary to adopt the Universal Plug and Play (UPnP) technology. This technology leverages the Internet technical standards including the Internet Protocol (IP), the Transmission Control Protocol (TCP), the User Datagram Protocol (UDP), the Hypertext Transfer Protocol (HTTP), and the Extensible Markup Language (XML) to provide the automatic across-platform service discovery and the remote control. In addition to the control and the data transfer among networked devices, the UPnP provides the flexible and robust service discovery ability to change the complex network device drive into a simple remote network control.

A Service Discovery Approach Based on a Quantitative Similarity Measure for M-Tourism Platforms

This paper presents a localization architecture for an m-tourism services delivery platform. The aim of the system is to deliver services for nomads (e-tourists) according to their localization and according to the results given by the search engine. This engine is based on a quantitative similarity measure. The discovered services are presented via a Web Map Service. Moreover, the platform integrates an adaptation sub-system for heterogeneous environments and an e-negotiation module.

P2P／Web Service与网格资源发现服务研究

资源发现是网格计算技术一个重要的研究领域。本文根据经典的五层沙漏网格架构模型,结合P2P、Web Service技术,提出了一个网格资源发现模型。使用P2P网络计算模式,充分利用网络边缘的终端设备发现共享资源,可以大大提高发现速度,降低服务器的负载。同时,使用了Web Service来发布网格结点提供的服务。本文中提出了该模型使用的通讯协议簇、模型的实现方法。本文具体的底层发现服务使用perl实现;使用Frontier-RPC发布服务和访问均已经实现。

Web Services发现和集成句法匹配算法研究

面向服务的应用,促进了WebServices的发现和集成服务技术研究。如何有效地对大量异构、跨平台的不同WebServices服务应用,实现发现(Discovery)和集成(Composition)技术,将是一个关键的问题。文章首先提出了面向WebServices服务的集合组成元素,进而分析了基于句法的WebServices服务发现和集成算法,通过发现路由和合成路由事例的应用研究,探讨了的基于句法匹配算法的WebServices发现和集成技术的可行性。

基于Web Services的UDDI技术与系统集成

Web Services提供了一种新的基于Internet的分布式计算的模型,促进了软件体系结构从紧耦合、严格、静态的模型向松耦合、灵活、动态的商务模型发展.介绍了Web Services的体系结构、运行机制、UDDI标准及在系统集成中的应用.使用Web Service技术进行系统集成,提高了系统的可扩展性和兼容性,增强了网络平台的适应能力,提高了系统的服务质量.