NETMAX project

advertisement
GRID-2012, Dubna, Russia 16-20 july 2012
Kurochkin I.I., Prun A.I.
Institute for systems analysis of RAS
Centre for grid-technologies and distributed computing
NetMax project
Program toolkit NetMax is created
for modeling of telecommunication networks for the
maximization of the general traffic, and also for the
analysis of telecommunication networks.
The analysis technique of the telecommunication
networks, loading of networks revealing direct
dependence on routing strategy is implemented.
Primary goals
The primary goals which can be solved:
 Check of efficiency of strategy of routing;
 Determination of vulnerabilities in a
telecommunication network;
 Modeling on a failure for determination of
reliability of corporate networks;
 Execution of an estimation and the comparative
analysis of various strategies of routing;
 Visualization of network graph.
NetMax use
 Routing in SDH/SONET networks;
 Management of flows in the distributed systems of
storage and data transmission;
 Problem of minimization of jams in a city road
network;
 Problem of development of a city road network;
 Routing and planning in IP-networks for
autonomous system or its segments at use MPLS
and tunneling;
 Channel routing with the centralized
management.
Matlab for software development
Software Matlab (MATrix LABoratory) is a package of applied
programs for mathematical and engineering calculations includes
an internal programming language.
At the moment Matlab use more than 1 million engineers and
scientists. (according to Mathworks)
Use of Matlab allows to carry out development of programs quickly
 the internal Matlab language is a higher-level programming
language,
 there is an integrated environment of development,
 there are many functions and sets of ready subprogrammes
(Matlab toolboxes).
Precompiled application execute at computer possible without
installation of Matlab software, but Matlab Compiler
Runtime (MCR) – must be installed
7
Parallel mode into one iteration of network filling model
Начало одного шага функционирования сети
Назначение
доп. cт. [1]
Назначение
доп. cт. [2]
...
Назначение
доп. cт. [N]
Calculation of min cut values
and determine edges of min
cuts between source-target
pairs of network nodes
Поиск маршрута
с использованием доп. стоимостей дуг
Нет
Маршрут существует?
Регистрация отказа
Да
Прокладка маршрута
с использованием доп. стоимостей дуг
Вычисление
параметров
сети [1]
Вычисление
параметров
сети [2]
...
Вычисление
параметров
сети [N]
Окончание шага функционирования сети
Calculation of
parameters for each
source-target pair of
nodes
8
Use NetMax project in serial and parallel mode
Net 1
Algorithm 1
Net 1
Algorithm 1
Net 1
Algorithm 2
...
Net 2
Algorithm K
Net 1
Algorithm 2
Net 3
Algorithm K
Net 1
Algorithm K
Net N
Algorithm K
Net 1
Algorithm K
...
Net N
Algorithm K
Parallel mode with asynchronous iteration
computing
9
Distributed computing platform
BOINC – Berkeley Open Infrastructure for Network
Computing
Platform of voluntary distributing computing:
 Server-client architecture;
 Use CPU of desktops;
 Client part for different OS;
 Adjustment of client part on desktop.
10
Distributing computing on BOINC platform
CPU usage
BOINC
Clients
User
25%
Server
75%
Server
Input data, application
Client
Results – output data
11
Resource allocation
CPU usage
25%
BOINC
User
75%
1 core
2 core
3 core
4 core
OS services,
applications
BOINC
worker 1
BOINC
worker 2
BOINC
worker 3
Data set #32
Data set #107
Data set #8
1 CPU, 4 cores
12
Wrong variants use of NetMax project on clients
MCR
MCR
MCR
13
Client part of NetMax project
+ MCR and java libraries
Input data set
in file
14
Deployment NetMax project
•
•
•
•
•
•
•
•
www site
forum
presentation
Project abstract
Application versions for different OS
Many data set for distributing computing
Test deployment of project
Distributing computing statistic
15
Thank you for your attention
Institute for systems analysis of RAS
Centre for grid-technologies and distributing computing
web:
dcs.isa.ru, desktop-grid.ru
e-mail:
kurochkin@isa.ru
16
Download