0000000000053681
AUTHOR
M. Vapa
P2PStudio - Monitoring, Controlling and Visualization Tool for Peer-to-Peer Networks Research
Peer-to-Peer Studio has been developed as a monitoring, controlling and visualization tool for peer-to-peer networks. It uses a centralized architecture to gather events from a peer-to-peer network and can be used to visualize network topology and to send different commands to individual peer-to-peer nodes. The tool has been used with Chedar Peer-to-Peer network to study the behavior of different peer-to-peer resource discovery and topology management algorithms and for visualizing the results of NeuroSearch resource discovery algorithm produced by the Peer-to-Peer Realm network simulator. This paper presents the features, the architecture and the protocols of Peer-to-Peer Studio and the ex…
Advertising Peer-To-Peer Networks over the Internet
Weber, Matthieu Advertising Peer-to-Peer Networks over the Internet Jyvaskyla: University of Jyvaskyla, 2006, 120 p. (Jyvaskyla Licentiate Theses in Computing ISSN 1795-9713; 7) ISBN 951-39-2329-0 Finnish summary Most peer-to-peer networks nowadays are decentralized or even fully distributed, meaning that they do not require a central authority for proper operation. Joining such networks is however often performed by using a central directory of its members, thus breaking their decentralized characteristic. This work proposes an advertisement system for peer-to-peer networks that does not rely on a central service, nor requires any dedicated infrastructure to be setup, using only already ex…
Mobile Encounter Networks and Their Applications
This article presents mobile encounter networks (MENs), which emerge when mobile devices come across each other and form a temporary connection between them using a common short-range radio technology. Local information exchanges between mobile devices results in a broadcast diffusion of information to other users of the network with a delay. Gasoline price comparison system (GPCS), which delivers newest gasoline prices to mobile users using mobile encounter information diffusion, is described as well as other application areas where MENs could be used. The feasibility of building MENs using bluetooth is tested with the BlueCheese mobile encounter network middleware and it is found that the…
Modelling Mobile Encounter Networks
This article presents mobile encounter networks, which emerge when mobile devices come across each other and form a temporary connection between them using a common short-range radio technology. Local information exchanges between mobile devices results in a broadcast diffusion of information to other users of the network with a delay. In addition to presenting the concept of mobile encounter networks, we also provide an abstract method for describing the information diffusion process inside them. peerReviewed
Mobile Search - Social Network Search Using Mobile Devices
During the last years progress in Web search engines has been made to the point that relevant information can be reached easily most of the time. However very little empirical research has been carried to study Web search in highly dynamic social network environments composed of mobile devices. The aim of this work was therefore to investigate novel approaches that took advantage of the social network environment inherent to mobile peer-to-peer paradigm. The work focused mainly on the development of a prototype for mobile search concept. The prototype was built on top of Drupal content site management system. This study suggests that the methods presented can be a complement to traditional …
Optimal Resource Discovery Paths of Gnutella2
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal query paths for the peer-to-peer resource discovery problem. Global knowledge of the topology and the resources from the peer-to-peer network are required as an input to the algorithm. The algorithm provides an objective measure for defining how good local search algorithms are. The performance is evaluated in simulated peer-to-peer scenarios and in the measured Gnutella2 P2P network topology with four local search algorithms: breadth-first search, self-avoiding random walker, highest degree search and Dynamic Query …
P2PRealm - Peer-to-Peer Network Simulator
Peer-to-peer realm (P2PRealm) is an efficient peer-to-peer network simulator for studying algorithms based on neural networks. In contrast to many simulators, which emphasize on detailed network simulation, the speed of simulation in P2PRealm is essential, because neural networks require a time consuming training phase. Efficiency has been obtained by optimizing training loops inside the simulator, using Java native interface (JNI) as well as distributing the simulator to hundreds of workstations using the P2PDisCo platform. In this paper we describe the architecture of P2PRealm and its input/output interfaces. Also, we present the mechanisms used for internally optimizing the implementatio…
An Adaptive Global-Local Memetic Algorithm to Discover Resources in P2P Networks
This paper proposes a neural network based approach for solving the resource discovery problem in Peer to Peer (P2P) networks and an Adaptive Global Local Memetic Algorithm (AGLMA) for performing the training of the neural network. This training is very challenging due to the large number of weights and noise caused by the dynamic neural network testing. The AGLMA is a memetic algorithm consisting of an evolutionary framework which adaptively employs two local searchers having different exploration logic and pivot rules. Furthermore, the AGLMA makes an adaptive noise compensation by means of explicit averaging on the fitness values and a dynamic population sizing which aims to follow the ne…
Topology management in unstructured P2P networks using neural networks
Resource discovery is an essential problem in peer-to-peer networks since there is no centralized index in which to look for information about resources. In a pure P2P network peers act as servers and clients at the same time and in the Gnutella network for example, peers know only their neighbors. In addition to developing different kinds of resource discovery algorithms, one approach is to study the different topologies or structures of the P2P network. In many cases topology management is based on either technical characteristics of the peers or their interests based on the previous resource queries. In this paper, we propose a topology management algorithm which does not predetermine fa…
A Memetic-Neural Approach to Discover Resources in P2P Networks
This chapter proposes a neural network based approach for solving the resource discovery problem in Peer to Peer (P2P) networks and an Adaptive Global Local Memetic Algorithm (AGLMA) for performing in training of the neural network. The neural network, which is a multi-layer perceptron neural network, allows the P2P nodes to efficiently locate resources desired by the user. The necessity of testing the network in various working conditions, aiming to obtain a robust neural network, introduces noise in the objective function. The AGLMA is a memetic algorithm which employs two local search algorithms adaptively activated by an evolutionary framework. These local searchers, having different fe…
Mobile Search - Social Network Search Using Mobile Devices Demonstration
Mobile search prototype demonstrates the possibilities of social network search in N800 mobile devices. Search is initiated from a N800 mobile device to search the contacts in mobile device's addressbook. The contacts can be other N800 mobile devices running mobile Web server or normal Web servers in the Internet with Drupal content management system. Mobile device users can select which of their personal information such as phone numbers, calendar data etc. to share via a mobile Web server. The proposed search mechanism has many benefits compared to centralized Web search engines like Google. The search can locate information which is not referenced anywhere and thus allows hidden or rare …