1 Research fellow at Secretaría de Investigación y Postgrado. Universidad Nacional de Luján. Argentina. ABSTRACT: Peer-to-peer networks (P2P) are considered a valid approach for the construction of distributed systems. Further research projects in the last few years have focused on using this kind of networks as an alternative for solving different situations that have traditionally required ce...

This paper presents an analytical framework to model fault-tolerance in unstructured peer-to-peer overlays, represented as complex networks. We define a distributed protocol peers execute for managing the overlay and reacting to node faults. Based on the protocol, evolution equations are defined and manipulated by resorting to generating functions. Obtained outcomes provide insights on the node...

Formation of suitable overlay-network topologies that are able to reflect the structure of the underlying network-infrastructure, has rarely been addressed by peer-to-peer applications so far. Often, peer-to-peer protocols restrain to purely random formation of their overlay-network. This leads to a far from optimal performance of such peer-to-peer networks and ruthlessly wastes network resourc...

Due to their minimum consideration to an actual network topology, the existing peer-to-peer (P2P) overlay networks will lead to high latency and low efficiency. In TaChord, we present a study of topology-aware routing approaches in P2P overlays, and present an improved design in Chord. We evaluate TaChord and other algorithms by physical hops, interdomain-adjusted latency, and aggregate bandwid...

We initiate a study on the effect of the network topology on the performance of Peer-to-Peer (P2P) information retrieval systems. The emerging P2P model has become a very powerful and attractive paradigm for developing Internet-scale systems for sharing resources, including files, or documents. We show that the performance of Information Retrieval algorithms can be significantly improved throug...

Recent peer to peer protocols have mainly been investigated and tested by discrete-event network simulators, e.g. ns-2. These software products usually model the network topology in great details, thus giving reliable picture about a possible run of the modeled protocol. In most cases they can estimate performance measures like throughput, traffic intensity, probability of failure, etc. These p...

The benefits of distributing a network simulation depend on characteristics of the simulated network. Performance improvements reported in the literature are comparatively low for peer-to-peer overlay networks in particular, as the logical topology of these networks can necessitate frequent synchronization between the processors executing the simulation. In this paper, we show that a speedup of...

Studies on the large scale peer-to-peer (P2P) network like Gnutella have shown the presence of large number of free riders. Moreover, the open and decentralized nature of P2P network is exploited by malicious users who distribute unauthentic or harmful contents. Despite the existence of a number of trust management schemes for combating against free riding and distribution of malicious files, t...

Pervasive services may be defined as services that are available to any client (anytime, anywhere). Here we focus on the software and network infrastructure required to support pervasive contextual services operating over a wide area. One of the key requirements is a matching service capable of assimilating and filtering information from various sources and determining matches relevant to those...

This paper presents a quantitative comparison of the efficiency of t self-organized construction processes of the P-Grid and Freenet peer-to-pe systems. Starting from a defined, realistic network topology we simulate t construction of their access structures and measure the incurred message lo and memory usage for routing tables. Besides these results our experiment setup may also be used as a ...