SPSC: Efficient Composition of Semantic Services in Unstructured P2P Networks

摘要: The problem of automated semantic peer-to-peer P2P service composition has been addressed in cross-disciplinary research web and computing. Solutions for structured networks benefit from the underlying distributed global index but at cost network traffic overhead its maintenance. Current solutions to unstructured with selective flooding can be more robust against changes suffer redundant messaging, lack efficient semantics-empowered search heuristics proven soundness. In this paper, we present a novel approach, called SPSC, planning networks. SPSC peers conduct guarded heuristics-based jointly plan complex workflows services OWL-S. query branching method based on local observations by about overlay alleviates reaching dead-ends not fully observable heuristically pruned space. We theoretically prove that approach is sound provide lower bound completeness. Finally, our experimental evaluation shows achieves high cumulative recall relatively low overhead.