0000000000020330
AUTHOR
J. Vuori
showing 6 related works from this author
P2PStudio - Monitoring, Controlling and Visualization Tool for Peer-to-Peer Networks Research
2006
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
2002
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
2008
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…
Optimal Resource Discovery Paths of Gnutella2
2008
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
2006
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…
Best compromise solution for a new multiobjective scheduling problem
2006
In future wireless networks, a mobile terminal will be able to communicate with a service provider using several network connections. These connections to networks will have different properties and they will be priced separately. In order to minimize the total communication time and the total transmission costs, an automatic method for selecting the network connections is needed. Here, we describe the network connection selection problem and formulate it mathematically. We discuss solving the problem and analyse different multiobjective optimization approaches for it.