For the use in the Internet domain, distributed hash tables (DHTs) have proven to be an efficient and scalable approach to distributed content storage and access. In this paper, ...
In this paper, we present a novel approach, named RS2D, to risk driven semantic service query routing in unstructured, so called pure P2P networks. Following the RS2D protocol, ea...
Large-scale distributed data management with P2P systems requires the existence of similarity operators for queries as we cannot assume that all users will agree on exactly the sa...
Recently there has been an increasing interest to harness the potential of P2P technology to design and build rich environments where services are provided and multiple applicatio...
To achieve higher efficiency over their unstructured counterparts, structured peer-to-peer systems hold each node responsible for serving a specified set of keys and correctly r...
Application-level multicast systems are vulnerable to attacks that impede nodes from receiving desired data. Live streaming protocols are especially susceptible to packet loss ind...
P2P systems that rely on the voluntary contribution of bandwidth by the individual peers may suffer from freeriding. To address this problem, mechanisms enforcing fairness in band...
Pawel Garbacki, Alexandru Iosup, Dick H. J. Epema,...
The advent and popularity of the World Wide Web (WWW) has enabled access to a variety of semi-structured data and, when available, this data follows some common XML schema. On the...
Content storage in a distributed collaborative environment uses redundancy for better resilience and thus provides good availability and durability. In a peer-to-peer environment,...
Peer discovery and route set-up are an integral part of the processes by which anonymizing peer-to-peer systems are made secure. When systems are large, and individual nodes only ...