A Peer-to-Peer Approach to Semantic Web Services Discovery

Li, Yong; Sen, Sandip; Yang, Fangchun

doi:10.1007/11758549_10

Cited by 14 publications

(10 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this case, used ontology need to be known in advance to create peers categories and it would be difficult for a user to search for certain services without knowing in advance the classification. Approaches in [11] and [21] are DHT based semantic service discovery systems where concepts that describe services parameters such as input and output are encoded into a Characteristic Vector (CV) that will serve as a key. Each peer maintains a routing table of these keys and also of their neighborhood.…”

Section: Related Workmentioning

confidence: 99%

A Scalable IoT Service Search Based on Clustering and Aggregation

Fredj¹,

Boussard²,

Kofman

et al. 2013

2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical A

View full text Add to dashboard Cite

With the Internet of Things (IoT), we are facing a proliferation of connected devices distributed over a collection of geographical locations and offering new services to users referred to as IoT services. These services are highly heterogeneous and their number is growing fast. To facilitate IoT service search, some solutions rely on the use of Semantic Web technologies to create homogenous service descriptions to reason on and support accurate and flexible search. However, most existing approaches are centralized and fail to scale with respect to the number of advertised services. To address this scalability issue, we present in this paper a distributed, semantic-based IoT service search system. It relies on a hierarchical network of semantic gateways that represent geographical locations and host semantic service descriptions. To answer a service query, our approach is based on request matching and forwarding though the use of routing tables and similarity thresholds. Based on defined metrics, recursive clustering and information aggregation are performed over the hierarchy of gateways to construct the routing tables. We prove theoretically that our method ensures an accurate search of all matching services within the system. Experimental results show that our method enables to reduce greatly search cost with comparison to a centralized approach and has an acceptable search path length.

show abstract

Section: Related Workmentioning

confidence: 99%

A Scalable IoT Service Search Based on Clustering and Aggregation

Fredj¹,

Boussard²,

Kofman

et al. 2013

2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical A

View full text Add to dashboard Cite

show abstract

“…Semantic web service discovery in P2P networks has been studied recently. In [5] [9], web service descriptions are indexed by keywords taken from its semantic attributes and are then stored on a DHT network. This method provides extensive service inquiry and accurate service matching.…”

Section: Related Workmentioning

confidence: 99%

QoS-aware web service discovery in P2P network

Zhu

Wei

2009

2009 2nd IEEE International Conference on Broadband Network &Amp; Multimedia Technology

View full text Add to dashboard Cite

A large number of works have been made to apply P2P techniques into services discovery. However, most of them only focus on matching the functional properties and ignore the non-functional properties. With a wide variety of services are offered that can satisfy the functional requirements, a policy is needed to support users to obtain the rank of the located services according to their nonfunctional preferences, and then select the appropriate services. Actually, the web services which fulfill the functional requirement and meet or exceed the non-functional requirement are the candidates. In this paper, we present a structure P2P framework based on distributed decision tree(DDT) to support range queries in multiple QoS attribute space, and propose the algorithm to effectively distribute web services among nodes to balance workload. Experiments with synthetic and real datasets show the effectiveness of the proposed scheme.

show abstract

“…Based on structured P2P, research work [18,19] can realize distributed SWS publication and discovery. However, the method in [18] can only adopt single domain ontology, while the method in [19] has to face the challenges of ontology mapping.…”

Section: Related Workmentioning

confidence: 99%

An approach to discover semantic web services in distributed environment based on Chord

Zhao¹,

Si²,

Qi³

et al. 2010

2010 IEEE International Conference on Intelligent Systems and Knowledge Engineering

View full text Add to dashboard Cite

Although WSDL and UDDI are widely accepted as standards for web service discovery, they can not guarantee scalable, flexible, robust and automatic service discovery, since WSDL and UDDI are syntax-based and centralized approach. Therefore, integrating with previous work, we propose an approach to distributed SWS discovery based on Chord and SWS technology. First, we present previous work in the paper. Next, the architecture and operation principle of the approach is described in detail as a distributed SWS registry. Then, we discuss its implementation and testing work. Finally, we analyze the properties of the approach. In fact, the approach proves to be a flexible, feasible, weight-light and effective distributed method to publish and discover SWS.

show abstract

A Peer-to-Peer Approach to Semantic Web Services Discovery

Cited by 14 publications

References 15 publications

A Scalable IoT Service Search Based on Clustering and Aggregation

A Scalable IoT Service Search Based on Clustering and Aggregation

QoS-aware web service discovery in P2P network

An approach to discover semantic web services in distributed environment based on Chord

Contact Info

Product

Resources

About