Graph Model of an IEEE802.1 Based Network Structure and Its - - PowerPoint PPT Presentation

▶
graph model of an ieee802 1 based network structure and
SMART_READER_LITE
LIVE PREVIEW

Graph Model of an IEEE802.1 Based Network Structure and Its - - PowerPoint PPT Presentation

Apr 12, 2023 116 likes •465 views

Advances in Methods of Information and Communication Technology, 2015 Graph Model of an IEEE802.1 Based Network Structure and Its Application for Enterprise ICT-infrastructure Discovery Anton Andreev Iurii A. Bogoiavlenskii Aleksandr Kolosov

slide-1
SLIDE 1

Advances in Methods of Information and Communication Technology, 2015

Graph Model of an IEEE802.1 Based Network Structure and Its Application for Enterprise ICT-infrastructure Discovery

Anton Andreev Iurii A. Bogoiavlenskii Aleksandr Kolosov Department of Computer Science Petrozavodsk State University

May 14, 2015 Petrozavodsk, Russia

Anton Andreev Graph Model of Network Structure 14.05.2015 1 / 30

slide-2
SLIDE 2

Areas of Network graph use

ICT-infrastructure graph (the Network) — most convinient way to represent data about its structure. Network documentation Network management and optimization Modelling and designing of network Load simulation for network segments

The Network graph discovery problem

Lack of standard tools for device detection Heterogeneity and incompleteness of data Diversity of network devices Network’s constant changing Comlex structure of Network (due to VLANs, IP-subnets, VPN)

Anton Andreev Graph Model of Network Structure 14.05.2015 2 / 30

slide-3
SLIDE 3

Project goal

The Nest platform

Network graph building Graph visualizing Tools for interaction with graph Data flows modeling Depiction and visualization of spatial and organizational structures of an enterprise

The goal

To develop, implement and test methods for automatized discovery of Network structure graph

Anton Andreev Graph Model of Network Structure 14.05.2015 3 / 30

slide-4
SLIDE 4

Network structure modelling

Importance of Network structure model

Formal relationship description Abstraction for devices Math tools for algorithms Ability to generate certain Network graphs

The modelling problem

Modelling of static structure of 1, 2, 3 layers of OSI model Modelling of Networks built in accordance to IEEE 802.1 и IP (RFC 791) standards Description of logical structures (VLAN, IP-subnets)

Anton Andreev Graph Model of Network Structure 14.05.2015 4 / 30

slide-5
SLIDE 5

Physical layer structure modelling

D — set of devices; d1, d2, d3 ∈ D

d1 d2 d3

Anton Andreev Graph Model of Network Structure 14.05.2015 5 / 30

slide-6
SLIDE 6

Physical layer structure modelling

P — set of ports; Pd ⊆ P — set of ports of device d ∈ D; O — set of edges of ownership

Pd3 Pd1 Pd2 d1 p11 p12 p13 d2 p21 p22 d3 p31 p32

Anton Andreev Graph Model of Network Structure 14.05.2015 6 / 30

slide-7
SLIDE 7

Physical layer structure modelling

L — set of edges between ports

d1 d2 p21 p22 d3 p31 p32 p11 p13 p12

Anton Andreev Graph Model of Network Structure 14.05.2015 7 / 30

slide-8
SLIDE 8

Link layer structure modelling

VP — set of interfaces; VPd ⊆ VP — set of interfaces of device d ∈ D; VO — set of edges of ownership for interfaces

VPd1 (p11, i1) (p12, i1) (p12, i2) (p13, i2) (p13, i3) d1

VPd2 (p21, i1) (p21, i2) (p22, i1) (p22, i3) d2 VPd3 (p31, i2) (p32, i1) (p32, i3) d3 Anton Andreev Graph Model of Network Structure 14.05.2015 8 / 30

slide-9
SLIDE 9

Link layer structure modelling

VC — set of switching edges;

VPd1 (p11, i1) (p12, i1) (p12, i2) (p13, i2) (p13, i3) d1 VPd2 (p21, i1) (p22, i1) (p21, i2) (p22, i3) d2

VPd3 (p31, i2) (p32, i1) (p32, i3) d3 Anton Andreev Graph Model of Network Structure 14.05.2015 9 / 30

slide-10
SLIDE 10

Link layer structure modelling

VL — set of edges between interfaces of different devices

d1 (p11, i1) (p12, i1) (p12, i2) (p13, i2) d2 (p21, i2) (p22, i1) (p22, i3) d3 (p31, i2) (p21, i1) (p13, i3) (p32, i1) (p32, i3)

Anton Andreev Graph Model of Network Structure 14.05.2015 10 / 30

slide-11
SLIDE 11

Broadcast domains modelling

BD — set of broadcast domains in network

(p11, i1) (p12, i1) (p11, i2) (p13, i2) (p21, i1) (p13, i3) (p21, i2) (p22, i1) (p22, i3) (p22, i4) (p31, i1) (p31, i2) (p32, i3)

Anton Andreev Graph Model of Network Structure 14.05.2015 11 / 30

slide-12
SLIDE 12

Network layer structure modelling

NP — set of network interfaces; NO — set of edges of ownership for network interfaces.

d1 ip1, mask1 ip2, mask2 ip1, mask1 ip2, mask2 ip3, mask1 ip3, mask1 ip4, mask3

Anton Andreev Graph Model of Network Structure 14.05.2015 12 / 30

slide-13
SLIDE 13

Common Network structure modelling

Graph G =< V, E >; V = D ∪ P ∪ VP ∪ NP, E = O ∪ VO ∪ NO ∪ L ∪ VC ∪ VL

p11 p31 p12 p21 p13 p22 p32 d3 (p11, i1) (p12, i1) (p31, i2) (p21, i1) (p12, i2) (p13, i2) (p21, i2) (p13, i3) (p22, i1) ip5, mask1 ip6, mask1 (p32, i1) ip5, mask1 (p22, i3) (p32, i3) ip7, mask3 ip8, mask1 ip9, mask1 ip10, mask3 ip1, mask1 ip1, mask1 ip2, mask2 ip2, mask2 ip3, mask1 ip3, mask1 ip4, mask3 d1 d2

Anton Andreev Graph Model of Network Structure 14.05.2015 13 / 30

slide-14
SLIDE 14

Examples

Switch d1 (p11, i1) (p12, i1) (p13, i1) (p14, i1) p11 p12 p13 p14 ip1, mask1 ip1, mask1 ip1, mask1 ip1, mask1

Anton Andreev Graph Model of Network Structure 14.05.2015 14 / 30

slide-15
SLIDE 15

Examples

Link aggregation

p11 p21 p12 p22 d2 (p11, i1) (p21, i1) (p12, i1) (p22, i1) d1

Anton Andreev Graph Model of Network Structure 14.05.2015 15 / 30

slide-16
SLIDE 16

Available data on Network structure

Retrieving using Simple Network Management Protocol

Ports and interfaces

IF-MIB IP-MIB Q-BRIDGE-MIB, VTP-MIB, CISCO-VLAN-MEMBERSHIP-MIB, ...

Physical and logical connections

Cisco Discovery Protocol: CISCO-CDP-MIB Link Layer Discovery Protocol: LLDP-MIB Spanning Tree Protocol: BRIDGE-MIB Address Forwarding Table: BRIDGE-MIB Address Resolution Protocol: RFC1213-MIB, IP-MIB

Anton Andreev Graph Model of Network Structure 14.05.2015 16 / 30

slide-17
SLIDE 17

Graph discovery algorithm

1 Data collection

◮ Data about devices (MACs, names, etc.) ◮ Data about VLAN and IP ◮ Data about connections

2 Graph vertices creation

◮ Vertices creation for devices accessible via SNMP ◮ Vertices creation for unaccessible devices using indirect data

3 Search for potential connections

◮ Using data about direct connections ◮ Using reachability data

4 Graph edges building

Anton Andreev Graph Model of Network Structure 14.05.2015 17 / 30

slide-18
SLIDE 18

Potential connections filtering example

A, B, C ∈ D a ∈ VPA b1 ∈ VPB b2 ∈ VPB c ∈ VPC b1 a c b2 c a ⇓ a ∈ VPA b1 ∈ VPB b2 ∈ VPB c ∈ VPC b1 a c b2 ⇓

A a B b2 C b1 c

Anton Andreev Graph Model of Network Structure 14.05.2015 18 / 30

slide-19
SLIDE 19

Algorithm implementation

Nestopo — Nest subsystem for automatized Network graph building Availability for Network structure graph building Use Simple Network Management Protocol (SNMP) for data retrieving Handling standard MIBs (Management Information Base) Availability to add vendor specifiс MIBs for handling Subsystem configuration:

◮ Start address for Network traversing ◮ Devices access parameters ◮ Algorithm partial execution Anton Andreev Graph Model of Network Structure 14.05.2015 19 / 30

slide-20
SLIDE 20

Testing of Nestopo

Testing necessity

Built graph correctness verification Various devices interaction examination Data incompletness influence analysis

Testing methods

Real network testing Use of virtual labs and Network simulators Automated testing using network structure generation

Anton Andreev Graph Model of Network Structure 14.05.2015 20 / 30

slide-21
SLIDE 21

Testing Nestopo using PetrSU network

Benefits

Maximal network structure realism Interaction with real devices

Disadvantages

Network structure change unpredictability Result graph virification difficulty Lack of influence on configuration Lack of tests variety Long data collection duration

Anton Andreev Graph Model of Network Structure 14.05.2015 21 / 30

slide-22
SLIDE 22

Graph of physical structure of PetrSU Network

Anton Andreev Graph Model of Network Structure 14.05.2015 22 / 30

slide-23
SLIDE 23

Testing Nestopo using GNS3 labs

GNS3 — Graphical Network Simulator 3

Benefits

Configuration opportunities Network behaviour predictability Simplicity of result graphs verification

Disadvantages

Long duration of handmade configuration Tiny scale of Networks Invariety of available devices

Anton Andreev Graph Model of Network Structure 14.05.2015 23 / 30

slide-24
SLIDE 24

Testing Nestopo with GNS3 labs

Anton Andreev Graph Model of Network Structure 14.05.2015 24 / 30

slide-25
SLIDE 25

Testing Nestopo with GNS3 labs

Anton Andreev Graph Model of Network Structure 14.05.2015 25 / 30

slide-26
SLIDE 26

Testing using Network structure generation

Benefits

A lot of varied network structures with any scale Formation of any type of data Availability of testing automatization Imitation of mechanics that can’t be seen in accessible networks

Disadvantages

Need for implementing generation mechanics Can’t replace testing in real networks

Anton Andreev Graph Model of Network Structure 14.05.2015 26 / 30

slide-27
SLIDE 27

Testing using generation: Netgen subsystem

Generation method

1 Sequential generation of three layers of model 2 Physical structure generation in shape of scale-free network

(Barabasi-Albert algorithm)

3 Data generation

Opportunities of Netgen

1 Structure generation configuration: number of nodes, VLAN sizes, etc. 2 Data generation configuration: data completeness degree 3 Storing result graph in various formats

Anton Andreev Graph Model of Network Structure 14.05.2015 27 / 30

slide-28
SLIDE 28

Testing using generation: examples

Generated Devices 15 Including hubs 3 Hosts 202 Links 216 Discovered Devices 14 Including hubs 2 Hosts 202 Links 195 Matched Devices 14 Hosts 202 Links 195

Anton Andreev Graph Model of Network Structure 14.05.2015 28 / 30

slide-29
SLIDE 29

Testing using generation: examples

The dependence of the found links part on the data completeness: AFT completeness ARP-cache completeness

Anton Andreev Graph Model of Network Structure 14.05.2015 29 / 30

slide-30
SLIDE 30

Results

Abstract Network structure model Algorithm of an automatized network graph discovering Program system for network graph discovering Subsystems of random network structure generation and automated testing

Code metrics

NetworkModel: 921 LOC, 5 classes Nestopo: 5832 LOC, 57 classes Netgen: 2245 LOC, 12 classes

Further work

Search for additional data sources Wireless network structure modeling Algorithm improving

Thank you for your attention!

andreev@cs.karelia.ru

Anton Andreev Graph Model of Network Structure 14.05.2015 30 / 30

slide-31
SLIDE 31

Graph of structure of PetrSU Network

Anton Andreev Graph Model of Network Structure 14.05.2015 30 / 30

slide-32
SLIDE 32

Related articles

Hassan Gobjuka, Yuri J. Breitbart. Ethernet Topology Discovery for Networks With Incomplete

  • Information. 2010

В. В. Воеводин, К. С. Стефанов. Автоматическое определение и описание сетевой инфраструктуры суперкомпьютеров. 2014 Li Zichao, Hu Ziwei, Zhang Geng, Ma Yan Ethernet topology discovery for virtual local area networks with incomplete information. 2014

Anton Andreev Graph Model of Network Structure 14.05.2015 30 / 30

slide-33
SLIDE 33

Nestopo architecture

Class diagram of NodeContext compoment

NodeContext NodeContextFactory SnmpNodeContext SnmpNodeContextFactory SnmpConfigurationManager CachedContext DataSupplier STPSupplier

. . .

VTPSupplier

Anton Andreev Graph Model of Network Structure 14.05.2015 30 / 30

slide-34
SLIDE 34

Nestopo architecture

Class diagram of components Collector, Creator, Connector NodeContextFactory Collector NestopoApp NestopoConfiguration NestopoIndex NetworkModel Procedure Algorithm

. . .

FindLinksProcedure Creator Connector

Anton Andreev Graph Model of Network Structure 14.05.2015 30 / 30