2015
DOI: 10.1007/s12652-015-0313-8
|View full text |Cite
|
Sign up to set email alerts
|

Efficient distributed discovery and composition of OWL-S process model in P2P systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(2 citation statements)
references
References 37 publications
0
2
0
Order By: Relevance
“…In (Boukhadra et al 2016), the authors describe a decentralized and interoperable approach for discovering and composing web services containing semantic information in large-sized P2P networks. It applies a scalable epidemic algorithm based on matching techniques of the OWL-S process model in order to ensure high recall and reduce the search space.…”
Section: Intelligencementioning
confidence: 99%
“…In (Boukhadra et al 2016), the authors describe a decentralized and interoperable approach for discovering and composing web services containing semantic information in large-sized P2P networks. It applies a scalable epidemic algorithm based on matching techniques of the OWL-S process model in order to ensure high recall and reduce the search space.…”
Section: Intelligencementioning
confidence: 99%
“…For the constrained network, solutions of discovery can be considered as distributed and centralized for the IoT environment [19]. The discovery servers can be deployed for the large-scale distributed system that has multiple systems to handle the network where the server is deployed [20]. This fully distributed architecture can support an efficient discovery approach in low power and lossy networks such as the CoAP network [21,22].…”
Section: Related Workmentioning
confidence: 99%