Current Service Discovery Research Articles

Service Discovery Method Based on Knowledge Graph and Word2vec

Mashup is a new type of application that integrates multiple Web APIs. For mashup application development, the quality of the selected APIs is particularly important. However, with the rapid development of Internet technology, the number of Web APIs is increasing rapidly. It is unrealistic for mashup developers to manually select appropriate APIs from a large number of services. For existing methods, there is a problem of data sparsity, because one mashup is related to a few APIs, and another problem of over-reliance on semantic information. To solve these problems in current service discovery approaches, we propose a service discovery approach based on a knowledge map (SDKG). We embed service-related information into the knowledge graph, alleviating the impact of data sparsity and mining deep relationships between services, which improves the accuracy of service discovery. Experimental results show that our approach has obvious advantages in accuracy compared with the existing mainstream service discovery approaches.

A New Approach Customizable Distributed Network Service Discovery System

Computer systems and applications on the internet provide services to outsiders and, at the same time, the vulnerabilities may be exploited by attackers and leak some sensitive private information. To collect and monitor the service information provided by the network environment such as IoT (Internet of Things), vehicular networks, cloud computing, and cloud storage, it is particularly important that a system can provide faster service discovery for discovering and identifying specific network services. The current service discovery systems mainly use port scanning technology, including Nmap, Zmap, and Masscan. However, these technologies hard code the service features and only support common services so that cannot cope with real‐time updates and changing network services. To solve the above problems, this paper proposed a customizable distributed network service discovery system based on stateless scanning technology of Masscan and proposed a customizable interactive pattern set syntax. The system used random destination address technologies to scan for Ipv4 address allocation and used a distributed deployment scheme. Experimental results show that the system has high scanning speed and has high adaptability to new services and special services.

An intelligent cloud service discovery framework

Due to the heterogeneity nature and the huge number of published cloud services, as well as, the continuous increase of the users’ complexity demands, the discovery process of cloud services remains an open issue. According to our conducted comprehensive survey study, the existing cloud service discovery solutions suffer from a set of drawbacks; missing a standardized and comprehensive specification of cloud services, not considering the lack of knowledge about cloud concepts, and not considering the continuous increase of the complex cloud services published to meet the complexity of the users’ demands. In this paper, a comprehensive, standardized, flexible, and intelligent cloud service discovery framework is proposed to overcome these drawbacks. According to this framework, a comprehensive ontology has been developed to provide a standardized semantic specification of cloud services based on their functional features and non-functional features. For exploiting the high performance of the relational databases in managing the large amounts of data and improving the effectiveness of the proposed framework, instances of the non- functional features’ ontological concepts are separated from the developed ontology to be stored in a relational database, where Ontop OBDA platform is used to translate the complex queries over the ontology to SQL queries that are understood by the underlying relational database source. Also, our proposed framework provides a user-centric interface that enables users with low knowledge about cloud concepts to compose complex queries using their natural English language. The effectiveness evaluation shows that the proposed framework provides better results than other solutions. According to the implementation results, the average amount of error expected to identify a service by using the proposed framework is 11% compared to 31% by using the Cloudle service discovery solution. Also, the framework achieves entirely the cloud service discovery evaluation criteria compared to 66% of these criteria for the current cloud service discovery solutions. For efficiency, the proposed framework achieves 88% F-Score for mapping cloud services into suitable functional features and 80% for discovering services that match the users’ queries.

QoS-aware query relaxation for service discovery with business rules

Service discovery, the process of locating web services capable of satisfying the requirements of service requesters, plays a crucial role in the development of user-centric, service-oriented applications; however, most current service discovery mechanisms do not focus on integrating various business-driven quality of service (QoS) attributes or establishing relaxation mechanisms to enhance search results. This research proposes a systematic approach, referred to as business-rule-based service discovery (BRSD), to address the above issues. The main features of the proposed approach are as follows: (1) a business rule annotation mechanism that includes condition rules, enumeration rules, and applied utility references; (2) the ability to eliminate unsuitable services through the application of filters to deal with kernel properties, provider constraints, and user constraints; (3) the calculation of service ranking scores for single services or service sets according to QoS constraints and QoS importance ranking; and (4) the ability to retrieve suitable single services as well as service sets using the proposed two-point and incremental service query relaxation mechanisms.

A scalable automatic service discovery approach based on probabilistic topic model

Current service discovery approaches mainly focus on syntax matchmaking, which contains little semantic information to discover services automatically. This paper proposes a scalable automatic serv...

A scalable automatic service discovery approach based on probabilistic topic model

Current service discovery approaches mainly focus on syntax matchmaking, which contains little semantic information to discover services automatically. This paper proposes a scalable automatic service discovery approach based on probabilistic topic model. Specifically, a novel service description model PTWSDM is proposed. With this model, heterogeneous service descriptions can be represented in a topic vector form on the same homogeneous plane. For the scarcity of word co-occurrence patterns in service functional descriptions, Biterm topic model is introduced to extract latent topics. Finally, a stream algorithm for topic model updating is introduced in order that the proposed approach is scalable and adaptable for large-scale dynamic registry. Experimental results confirm that the proposed approach outperforms the state-of-the-art solutions in terms of precision and normalised discounted cumulative gain values. It also has good time performance and scalability.

A UPnP-based Decentralized Service Discovery Improved Algorithm

The current UPnP service discovery algorithm in the presence of the service can cause severe drops in the digital home network. The reason is that the root devices instantly send delay sending response messages and randomly selected independent response message congestion through simulation analysis. To solve these problems, an improved UPnP service discovery algorithm was given. Considering the length of the message and the bandwidth of the router, derived by testing the router the packet loss rate can be reduced

Implementation of an Efficient Service Discovery Protocol for Directory Facilitator Based on CALM Agent

Current service discovery protocols such as UPnP, Jini, SLP provide the basic function which is message exchange pattern, service representation and description, in service discovery. They does not guarantee service interoperability among service discovery. Therefore, in this paper, we design and implement CLAM (Component-based Autonomic Layered Middleware) agent platform to enable an efficient service discovery through extension of DF agent function in FIPA-compliant specification. Also, we propose an efficient service discovery mechanism using DHT-Chord algorithm to guarantee scalability and interoperability in DF agent.

A Method of Semantic Web Service Discovery Based on Bipartite Graph Matching

How to discover services for users efficiently is the key for the application of the Web service technology. The current semantic-based service discovery methods are of great inconvenience to be used and have much potential improvement for their performance. This paper proposes an information model of registered services that isn′t limited to specific service models and languages and supports semantic-annotation and interface-dependency declaration. Then, a method of service discovery based on bipartite graph matching is proposed that translates the service matchmaking to the problem of extended optimal matching for bipartite graph. It enhances the recall rate and precision as it considers the interface dependency relations within a service in matchmaking. A serial of experiments illustrate the method not only improves its efficiency much, but also has a linear complexity in time consumption to fulfill users′ requests.

An Efficient Service Discovery Method and its Application

To discover services efficiently has been regarded as one of important issues in the area of Service Oriented Computing (SOC). This article carries out a survey on the issue and points out the problems for the current semantic-based service discovery approaches. After that, an information model for registered services is proposed. Based on the model, it brings forward a two-phase semantic-based service discovery method which supports both the operation matchmaking and operation-composition matchmaking. The authors import the bipartite graph matching to improve the efficiency of matchmaking. An implementation of the proposed method is presented. A series of experiments show that the method gains better performance on both discovery recall rate and precision than a traditional matchmaker and it also scales well with the number of services being accessed.

A Semantic Model for Matchmaking of Web Services Based on Description Logics

Matchmaking plays an important role in Web services interactions. The matchmaking based on keywords easily leads to low precision, Meanwhile, the current semantic service discovery methods perform service I/O based profile matching, there exists no matchmaker that performs an integrated service matching by additional reasoning on logically defined preconditions, effects, Qos and so on. In this paper, the semantic web services are described based on Description Logics, and the services description model is designed, which describes the various aspects (such as IOPEs, Qos and so on) of the web services. So the services matchmaking is transformed into the match of concepts. The service match algorithm is proposed and the description logics reasoner RacerPro is adopted for Web services discovery. We show how the semantic matching between providers and a requester is performed by a case study.

Aligning with the Web: an atom-based architecture for Web services discovery

During the past three years, the Web has undergone a radical change towards a highly user-centred cyberspace where end users can easily participate and collaborate for their own benefits and profits. The surge of Web services has created increasingly demand by end users and small-and-medium enterprises to effectively participate in service publication, discovery, and subscription over the Web. However, current public service discovery mechanism, one of the key aspects in the SOA, does not align itself with this fully user-oriented Web. The recent shutdown of public UDDI exposes issues and makes public Web services discovery missing. In this paper, we propose a novel Web service discovery architecture—AtomServ, which is built upon widely adopted Web2.0 technology (RSS/Atom) and the publish/subscribe model. It aims to provide a handy and scalable discovery facility for most Web services providers and requesters, who can easily participate in service discovery via various user-friendly application interfaces (e.g., web browsers, mobile phones). With the proliferation of RSS/Atom, AtomServ widens the adoption of service discovery by allowing simple and unified user access to frequently changing business services. This undoubtedly lowers the entry barrier for end users to play their roles in a user-centred Service-Oriented Web environment.

An ontology-based Grid service discovery matchmaking framework

The need for semantic matching based on a defined ontology is becoming increasingly important as there are many different implementations available within the Grid Environment (GE). Especially for Service Discovery (SD), an ontology description is very useful in supporting a customized SD process. This paper proposes a SD matchmaking framework for GEs based on a welldefined ontology. The matching of service requests is discussed and a matchmaking mechanism is described in detail. The proposed framework allows for close and customized SD matches that current Service Discovery Systems (SDSs) cannot provide as their SD process is based on type matching only.