Dynamic Querying (DQ) is a technique adopted in unstructured Peer-to-Peer (P2P) networks to minimize the number of peers that is necessary to visit to reach the desired number of results. In this paper we introduce the use of the DQ technique in structured P2P networks. In particular, we present a P2P search algorithm, named DQ-DHT (Dynamic Querying over a Distributed Hash Table), to perform DQ...

Structured peer-to-peer (p2p) overlay networks like CAN, Chord, Pastry and Tapestry offer a novel platform for a variety of scalable and decentralized distributed applications. They provide efficient and fault-tolerant routing, object location and load balancing within a selforganizing overlay network. One important aspect of these systems is how they exploit network proximity in the underlying...

Structured peer-to-peer systems rely on replication as a basic means to provide fault-tolerance in presence of high churn. Most select replicas using either multiple hash functions, successor-lists, or leaf-sets. We show that all three alternatives have limitations. We present and provide full algorithmic specification for a generic replication scheme called symmetric replication which only nee...

Non-trivial search predicates beyond mere equality are at the current focus of P2P research. Structured queries, as an important type of non-trivial search, have been studied extensively mainly for unstructured P2P systems so far. As unstructured P2P systems do not use indexing, structured queries are very easy to implement since they can be treated equally to any other type of query. However, ...

Fully decentralized peer-to-peer (P2P) systems do not have a central control mechanism. Thus, different forms of control mechanisms are required to deal with selfish peers. One type of selfish behavior is the consumption of resources without providing sufficient resources. Therefore, incentive schemes encourage peers to share resources while punishing selfish peers. A well-known example of an i...

The sharing economy has been growing continuously in the last decade thanks to the proliferation of internet-based platforms that allow people to disintermediate the traditional commercial channels and to share excess resources and trade with one another effectively at a reasonably low transaction cost. Whereas early peer-to-peer platforms were designed to enable file sharing and goods trading,...

Peer-to-Peer overlay systems offer a substrate for the construction of large scale and distributed applications. The Peer-to-Peer technique is differentiated in to two major forms, Structured P2P and Unstructured P2P. In structured peer-to-peer networks, connections in the overlay are fixed. They typically use distributed hash table-based (DHT) indexing, such as in the Chord system. Unstructure...

communication (CMC) to facilitate the construction of learning community. The formation of learning community, which involves students working together to solve ill-structured problems and putting applying knowledge and experience to heuristic teaching. "Peer Learning" broadly includes cooperative and collaborative learning, and which involves learners working together for achieving specific le...

Comic books provide an appropriate and structured context for education and personal or peer reflection. In this paper we discuss the benefits of comic books and technology in a pedagogical context, including the mechanism of scaffolding and how this interaction impacts upon the child's environment. Our studies into the educational benefits of comic books have lead to the development of an inte...

As the nodes and the resources in a structured peer-to-peer network are indexed with unique identifiers, and as the identifiers are assigned to nodes whose nodeId (i.e., the identifier of the peer) is closest (by some metrics) to the identifier, at an application level it is an issue to know the unique identifier a resource is indexed with, to route a message to the node that is responsible for...