A Decentralized Service Discovery Approach on Peer-to-Peer Networks

Abstract

Abstract-Service-Oriented Computing (SOC) is emerging as a paradigm for developing distributed applications. A critical issue of utilizing SOC is to have a scalable, reliable, and robust service discovery mechanism. However, traditional service discovery methods using centralized registries can easily suffer from problems such as performance bottleneck and vulnerability to failures in large scalable service networks, thus functioning abnormally. To address these problems, this paper proposes a peer-to-peer-based decentralized service discovery approach named Chord4S. Chord4S utilizes the data distribution and lookup capabilities of the popular Chord to distribute and discover services in a decentralized manner. Data availability is further improved by distributing published descriptions of functionally equivalent services to different successor nodes that are organized into virtual segments in the Chord4S circle. Based on the service publication approach, Chord4S supports QoS-aware service discovery. Chord4S also supports service discovery with wildcard(s). In addition, the Chord routing protocol is extended to support efficient discovery of multiple services with a single query. This enables late negotiation of Service Level Agreements (SLAs) between service consumers and multiple candidate service providers. The experimental evaluation shows that Chord4S achieves higher data availability and provides efficient query with reasonable overhead.

Scalable and Reliable Approach for High Data Availability in Service Oriented Computing Environment and Result Analysis

“…This paper proposes Chord4S [1], a Chord-based decentralized service discovery approach that supports service description distribution and discovery in a P2P manner. Chord is selected because it is well recognized for its flexibility and scalability and is considered suitable in large scale SOC environments.…”

“…Above all, structured P2P systems such as Chord [3], CAN [4], Pastry [5], and Tapestry [6] have some characteristics that square measure applicable for facilitating economical decentralized service discovery. This paper proposes Chord4S [1], a Chord-based decentralized service discovery approach that supports service description distribution and discovery in a P2P manner.…”

Semantic Web Service Search: A Brief Survey

“…Semantic service queries are Services Structured P2P Unstruct. P2P I/O P/E QoS Selection AGORA-P2P (2006) [38] OWL-S Chord Hybrid RS2D (2006) [2] OWL-S Hybrid Skoutas+ (2008) [57] OWL-S SpatialP2P [21] Non-logic Chord4S (2013) [18] OWL-S Chord Non-logic Zhang+ (2009) [68] OWL-S Hybrid Di Modica+ (2011) [10] OWL-S, WSML, SAWSDL Hybrid ERGOT (2012) [53] SAWSDL Chord Hybrid Vu+ (2006) [63] WSML Chord Logic METEOR-S (2005) [61] WSDL-S super-peers random walk Non-logic PYRAMID-S (2009) [52] PS-WSDL super-peers random walk Hybrid P2P-SDSD (2008) [3] prop. Hybrid Table 2 Representative approaches for semantic service search in P2P networks.…”

Effective Communication in P2P Network by Introducing GOSIP–PHE Algorithms

“…In hybrid networks Napster [20], all peers have a single neighbor a central server that keeps information on all peers and responds to requests for that information. In super peer network [6] such as Kazaa [17], Gnutella ultrapeers [19], and Chord super peer [5], neighbors are selected from the set of high capacity peers called superpeers, low-capacity peers are the client peers, cannot become neighbors. In [6], super peers are nodes which have more bandwidth, more storage space, higher availability as compared to normal nodes.…”

“…In super peer network [6] such as Kazaa [17], Gnutella ultrapeers [19], and Chord super peer [5], neighbors are selected from the set of high capacity peers called superpeers, low-capacity peers are the client peers, cannot become neighbors. In [6], super peers are nodes which have more bandwidth, more storage space, higher availability as compared to normal nodes. Another approach looks at using user resources to help scale centralized online social networks [10] by using user resources to distribute large files among friends, but in such a scenario, the user's role is more that of a peer-to-peer content distribution network, and the privacy and autonomy issues still persist.…”