Ranking queries, also known as top-k queries, have drawn considerable attention due to their usability in various applications. Several algorithms have been proposed for the evaluation of top-k queries. A large percentage of them follow the Threshold Approach. In p2p networks, top-k query processing can provide a lot of advantages both in time and bandwidth consumption. We focus on the main ada...

As a decentralized technology, P2P architecture arises as a new model for distributed computing and transaction in the last few years, consequently there is a need for a scheme to incorporate payment services to enable electronic commerce transaction via P2P systems. In this paper, the cascading sale model is described for multi-party P2P transaction, an efficient pricing and routing scheme is ...

Gossipping has demonstrate to be an efficient mechanism for spreading information among P2P networks. Within the context of P2P computing, we propose the so-called Evolvable Agent Model for distributed population-based algorithms which uses gossipping as communication policy, and represents every individual as a self-scheduled single thread. The model avoids obsolete nodes in the population by ...

Peer-To-Peer (P2P) networks have become popular with computer science researchers because of their compelling properties like robustness, scalability and failure resistance. Due to the lack of centralized control, several challenges arise in P2P networks: (1) fast indexing of data structures to allow efficient query processing, (2) creation, abstraction and dissemination of suitable metadata, (...

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...

This paper discusses and evaluates the design and the implementation of a Community-centric Mobile Service Environment (COMSE), where all services are developed with Web technologies. The service environment is built on a distributed communication platform that is implemented using a DHT-based peer-to-peer (P2P) protocol. The interaction between P2P overlay networks and Web-based services is re...

Distributed network computing environments have become a cost effective and popular choice to achieve high performance and to solve large scale computation problems. Unlike past supercomputers, a cluster or grid or peer-to-peer (P2P) system can be used as multipurpose computing platform to run diverse high performance parallel applications. Cluster computing environment consist of Personal Comp...

Peer-to-Peer (P2P) networks as distributed solutions are used in a variety of applications. Based on the type of routing for queries among their nodes, they are classified into three groups: structured, unstructured and small-world P2P networks. Each of these categories has its own applications and benefits. Structured networks by using Distributed Hash Tables (DHT) can forward request search q...

The deployment of wireless communication technologies has led to significant research in the area of heterogeneous network management. Pervasive computing applications based on networks with both wired and wireless connections involve collections of heterogeneous and resource-limited devices, typically operated over ad-hoc, completely decentralized networks and without requiring dedicated infra...

The first Peer-to-Peer (P2P) networks were based mainly on the altruistic behaviour of the peers. Although newer implementations incorporate some kind of incentive mechanism to award sharing peers, no P2P network assures any quality of service. This paper is meant as a first step towards the development of P2P networks with quality of service. We propose a distributed resource allocation algori...