UNIVERSITY OF JYVÄSKYLÄ
Progress Report
Presentation for the InBCT management team 28.10.2004
Mikko Vapa, researcher student
InBCT 3.2 Cheese Factory / P2P Communication
Agora Center
http://tisu.it.jyu.fi/cheesefactory
UNIVERSITY OF JYVÄSKYLÄ
Outcomes of Summer and Autumn 2004
•
The outcomes of Summer and Autumn 2004 consist of:
– 2 IEEE conference publications
– 4 theses
• 1 licentiate thesis
• 2 master’s theses
• 1 bachelor’s thesis
– 6 new manuscripts
– 1 implementation
• Peer-to-Peer Simulation for Network Simulator 2 (C++)
– And 2 ongoing implementations of prototypes
• BlueCheese and Gasoline Price Comparison System (Symbian
C++)
• Mobile Chedar and Mobile P2P Communication Environment
(Java 2 Micro Edition)
– Let’s review some of the outcomes…
2004
UNIVERSITY OF JYVÄSKYLÄ
Resource Discovery in P2P Networks
Using Evolutionary Neural Networks
• Mikko Vapa, Niko Kotilainen, Annemari Auvinen, Heikki
Kainulainen and Jarkko Vuori as authors
• To be published in IEEE International Conference on Advances
in Intelligent Systems – Theory and Applications (AISTA 2004) in
November 2004
• The paper describes how resource discovery problem can be
formulated as an optimization task and presents NeuroSearch
resource discovery algorithm for solving a resource discovery
problem in a given P2P scenario
• The results show that NeuroSearch is better than Breadth-First
Search algorithm and capable to adapt to a given environment
• This is the first effort to apply neural networks or evolutionary
algorithms in peer-to-peer network research
2004
UNIVERSITY OF JYVÄSKYLÄ
Resource Discovery in P2P Networks
Using Evolutionary Neural Networks
2004
UNIVERSITY OF JYVÄSKYLÄ
Building NeuroSearch - Intelligent
Evolutionary Search Algorithm For
Peer-to-Peer Environment
•
•
•
Joni Töyrylä as author
The master’s thesis evaluated how the behavior of NeuroSearch
algorithm changes when the structure of neural network is modified
The main findings of the thesis are that:
– NeuroSearch shifts from breadth-first search type of an algorithm to
depth-first search when the amount of neurons is increased and
when the amount of neurons is increased more the algorithm
returns back to breadth-first search
• we call this breadth-first search – depth-first search dilemma
• the reason for this behavior is still unknown
– Steiner tree algorithm is superior to local search algorithms and
NeuroSearch algorithm is closer to breadth-first search rather than
highest degree search algorithm
– To determine a reliable fitness value, a sufficient number of queriers
is 10 instead of 50  reduces time consumption of optimization
algorithm approximately to 20% from the original
2004
UNIVERSITY OF JYVÄSKYLÄ
20:10 had the greatest average hops value
What happens if the number of neurons
on 2nd hidden layer is increased? Will
the average number of hops decrease?
25:10 had the greatest fitness value
Would more generations than 100.000
increase the fitness when 1st hidden
layer contains more than 25 neurons?
2004
UNIVERSITY OF JYVÄSKYLÄ
Adaptation of Neural Nets for Resource
Discovery Problem in Dynamic and
Distributed P2P Environment
• Yevgeniy Ivanchenko as author
• The master’s thesis describes how the 16-input version of
NeuroSearch can be reduced to rule-based algorithm by
extracting if-then rules from a trained neural network using SelfOrganizing Maps (SOM)
• The thesis also evaluates how NeuroSearch is performing in a
power-law distributed dynamic scenario where peers are
disappearing
• The results indicate that rule-based algorithm is able to mimic
original NeuroSearch algorithm and that in a simple dynamic
scenario NeuroSearch performs almost as in static scenario
2004
UNIVERSITY OF JYVÄSKYLÄ
Adaptation of Neural Nets for Resource
Discovery Problem in Dynamic and
Distributed P2P Environment
U-matrix
toUnsearchedNeighbors
From
2004
UNIVERSITY OF JYVÄSKYLÄ
Peer-to-Peer Resource Discovery Is a
k-Steiner Minimum Tree Problem
• Mikko Vapa, Annemari Auvinen, Tuukka Tawast, Yevgeniy
Ivanchenko and Jarkko Vuori as authors
• Manuscript submitted in October 2004 to 25th IEEE International
Conference on Distributed Computing Systems (ICDCS 2005)
• The manuscript shows that peer-to-peer resource discovery
problem is in fact a modification to a well-known Steiner
minimum tree problem that has been studied since 1970’s in
graph theory and presents an approximation algorithm to solve
the problem
– Gives us 30 years of research literature about the problem
– Justifies the use of neural network approximation, because
Steiner tree problem is NP-complete
– Still, does not provide complete solution to resource
discovery problem, because Steiner tree algorithm requires
global knowledge of resources
2004
UNIVERSITY OF JYVÄSKYLÄ
Peer-to-Peer Resource Discovery Is a
k-Steiner Minimum Tree Problem
2004
UNIVERSITY OF JYVÄSKYLÄ
Peer-to-Peer Resource Discovery Is a
k-Steiner Minimum Tree Problem
Efficiency of the Algorithm s
1,2
Efficiency
1
0,8
Steiner
0,6
HDS
BFS
0,4
0,2
0
0,0
20,0
40,0
60,0
% of Resources
2004
80,0
100,0
UNIVERSITY OF JYVÄSKYLÄ
Peer-to-Peer Resource Discovery Is a
k-Steiner Minimum Tree Problem
Highest Degree
Search
2004
k-Steiner
Algorithm
UNIVERSITY OF JYVÄSKYLÄ
P2PDisCo – Java Distributed
Computing For Workstations Using
Chedar Peer-to-Peer Middleware
• Niko Kotilainen, Mikko Vapa, Matthieu Weber, Joni Töyrylä and
Jarkko Vuori as authors
• Extended abstract submitted in October 2004 to 7th IEEE & ACM
International Workshop on Java™ for Parallel and Distributed
Computing (IWJPDC 2005) workshop
• The extended abstract describes the architecture of Peer-toPeer Distributed Computing (P2PDisCo) platform and describes
some application experiences gained from the use of P2PDisCo
for distributing neural network training to multiple workstations
• As a short workshop paper, no measurements from the system
are described (and neither have they been conducted yet),
however some future work has been identified including faulttolerant state saving of computation and parallelization of tasks
2004
UNIVERSITY OF JYVÄSKYLÄ
P2PDisCo – Java Distributed
Computing For Workstations Using
Chedar Peer-to-Peer Middleware
2004
UNIVERSITY OF JYVÄSKYLÄ
Ongoing Activities
• The neural network implementation of a topology management
algorithm (master’s thesis work by Teemu Keltanen, co-designed
and supervised by Annemari Auvinen)
– When combined with NeuroSearch we can develop an
optimal peer-to-peer network
• NeuroSearch and k-Steiner Minimum Tree development cluster
– Dynamic scenarios, breadth-first search – depth-first search
dilemma, new inputs and scalability in large P2P networks
currently under study
• Modelling of information diffusion in mobile peer-to-peer networks
(Jani Kurhinen, Vesa Korhonen and Petri Rönkkö)
• BlueCheese and Gasoline Price Comparison System prototype
implementation for Symbian mobile devices (master’s thesis work
by Timo Juonoja and Oleksiy Volovikov)
• Mobile Chedar and Mobile Peer-to-Peer Communication
Environment (master’s thesis work by Niko Kotilainen)
2004
UNIVERSITY OF JYVÄSKYLÄ
BlueCheese MP2P Middleware
•
•
•
•
•
•
BlueCheese middleware has been implemented
by the MoPeDi student project in autumn 2003
designed for Mobile Peer-to-Peer applications
uses Bluetooth for communication (but for example WLAN may also be
used in future)
features:
– sending and receiving of data in stream and packet modes
– location service
– device control
– several applications may use it at the same time (porting system)
restrictions:
– can be connected to only one other device at a time
– location information is result of very rough estimation
– does not support multi-hopping
– trusts on everyone
implemented on Symbian OS with C++
2004
UNIVERSITY OF JYVÄSKYLÄ
Gasoline Price Comparison System
• Gasoline Price Comparison System
– gets new gasoline price information on refuels from the gas
stations
– diffuses information to other applications in other smart
phones using BlueCheese middleware and Bluetooth
– uses location information to choose where to refuel
– user interface implemented on Symbian OS with C++
• MP2P enables wide range of applications
– Newspaper service, Dating service…
2004
UNIVERSITY OF JYVÄSKYLÄ
Gasoline Price Comparison System
User Interface
2004
UNIVERSITY OF JYVÄSKYLÄ
Gasoline Price Comparison System
Information Diffusion
Gas Station
Data transmission
Connection
2004
UNIVERSITY OF JYVÄSKYLÄ
IEEE Conference Paper: Short Range
Wireless P2P for Co-operative Learning
• Jani Kurhinen, Mikko Vapa, Matthieu Weber, Niko Kotilainen and
Jarkko Vuori as authors
• Published in 3rd IEEE International Conference on Emerging
Technologies and Applications (ICETA 2004) in August 2004
• The paper introduced Mobile Peer-to-Peer Learning Environment
(MP2PLE) application that can be used for collaborative notes
taking on lectures and Mobile Chedar mobile device access
extension to Chedar peer-to-peer network using Bluetooth
gateway nodes
2004
UNIVERSITY OF JYVÄSKYLÄ
Mobile Chedar
• Mobile Chedar middleware
– mobile access extension to Chedar peer-to-peer network
– provides application programming interface for MP2P
applications to query resources and extends the idea of
BlueCheese to fixed peer-to-peer networks
– communicates through Bluetooth (or any other
communication technology provided by the phone)
– implemented with Java 2 Micro Edition
– the ambitious goal is to integrate the middleware as a
standard component to mobile phones
• Mobile Peer-to-Peer Communication Environment (MP2PCE) as
test application
– enables point-to-point and shared group communication
– partial replacement for short-message system
2004
UNIVERSITY OF JYVÄSKYLÄ
Mobile Chedar Architecture
2004
UNIVERSITY OF JYVÄSKYLÄ
Thank you!
2004