A Service-Oriented Peer-to-Peer Architecture for a Digital Ecosystem

Abstract

Abstract-Service-oriented computing is becoming an increasingly popular paradigm for modelling and building distributed systems in heterogeneous, decentralised, and open environments. However, proposed service-oriented architectures are usually based on centralised components, such as service registries or service brokers, that introduce reliability, management, and performance issues. In this paper, we present a fully decentralised service-oriented architecture built on top of a self-organising peer-to-peer infrastructure. This architecture is especially designed to support digital ecosystems due to its low deployment and maintenance cost and inherently decentralised nature.

A Versatile and Scalable Everything-as-a-Service Registry and Discovery

“…A fully decentralised architecture based on peerto-peer hashtables and gradient topologies has been proposed to keep deployment costs low and to handle high scalability (Sacha et al, 2007).…”

A Survey of Peer-to-Peer Architectures for Service Oriented Computing

“…Furthermore, while Gerke et al provide rich SOC functionality, they do not consider the critical issues of reliability, security and trust, which are of paramount importance in decentralised, unreliable and largely anonymous P2P networks. Sacha et al (2007) also propose a decentralised P2P SOC approach which considers the issues of node reliability using a network of trust in which peers with better reliability characteristics are moved into optimal positions in the network, while peers with sub-optimal characteristics are marginalized. The supporting implementation was developed on a structured decentralised network and thus provides good support for reliable service publication but poor support for service discovery.…”

Decentralising a service-oriented architecture

“…The approach to decentralise a service-oriented architecture, described in this paper, has been initially proposed in [44]. The gradient search and Boltzmann search heuristics have been first proposed in [16], and the super-peer election thresholds have been introduced in [43].…”

“…The gradient search and Boltzmann search heuristics have been first proposed in [16], and the super-peer election thresholds have been introduced in [43]. However, compared with [44], [16] and [43], the algorithms presented in this paper have been substantially elaborated and improved. In particular, the neighbour selection algorithm has been extended, the push-based aggregation algorithm has been replaced by a push-pull algorithm, a new super-peer election approach based on system load and adaptive thresholds has been introduced, an approach to multiple utility functions support has been added, a bootstrap mechanism has been described, and most importantly, a substantially more elaborate evaluation has been performed.…”