network discovery tool

43
Problem Statement Related Work Proposed Work Design Plan of Implementation Network Discovery Tool Bestin Jose Mahesh Kumar Shyamsunder Computer Science and Engineering Indian Institue of Technology Bombay November 28, 2004 Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Upload: others

Post on 12-Sep-2021

10 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Network Discovery Tool

Bestin JoseMahesh KumarShyamsunder

Computer Science and Engineering

Indian Institue of Technology

Bombay

November 28, 2004

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 2: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

1 Problem Statement

2 Related WorkIntroduction to NetdiscoFeatures of NetDisco

3 Proposed Work

4 DesignMain AlgorithmInputs to the AlgorithmExample

5 Plan of Implementation

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 3: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Problem Statement

To implement the algorithm which discovers the network topologyinformation and give it to NetDisco tool.

Netdisco then uses this information to moniter and manage thenetwork.

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 4: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Problem Statement

To implement the algorithm which discovers the network topologyinformation and give it to NetDisco tool.

Netdisco then uses this information to moniter and manage thenetwork.

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 5: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Introduction to NetdiscoFeatures of NetDisco

What is NetDisco

Netdisco is an Open Source web-based network managementtool.

Designed for moderate to large networks.

Configuration information and connection data for networkdevices are retrieved using SNMP protocol.

With Netdisco you can locate the switch port of an end-usersystem by IP or MAC address.

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 6: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Introduction to NetdiscoFeatures of NetDisco

Screenshot of NetDisco

screenshot_03.jpg (JPEG Image, 640x473 pixels) http://netdisco.org/screenshot_03.jpg

1 of 1 10/31/2004 10:26 PM

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 7: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Introduction to NetdiscoFeatures of NetDisco

Features of NetDiscoSwitch Ports

Central Location to disable/enable switch ports.

MAC Address to switch port resolution

IP Address to switch port resolution

Find Switch Ports with multiple nodes attached

Find nodes using multiple IP addresses

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 8: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Introduction to NetdiscoFeatures of NetDisco

Features contd.

Easy Administration:

Controllable through Web Interface or Command LineInterface(CLI).Database store for scalability and speed.Easily extendible to new devices.

Network Administration and Security:

Automatic inventory and search of network hardware.Duplex Mismatch Finder.Layer Two Traceroute.

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 9: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Introduction to NetdiscoFeatures of NetDisco

Features contd.

Easy Administration:

Controllable through Web Interface or Command LineInterface(CLI).Database store for scalability and speed.Easily extendible to new devices.

Network Administration and Security:

Automatic inventory and search of network hardware.Duplex Mismatch Finder.Layer Two Traceroute.

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 10: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Introduction to NetdiscoFeatures of NetDisco

Features contd.

Reporting:

Graphing of network topology. Clickable image-map ofdevices. Link speed shown.Statistics for number of actual nodes connected to network.

Inventory of Network Devices:

By Operating System (IOS,CatOS,HP...)By Model, Vendor, OSI Layer, DNS NameFind device ports that are blocking (via Spanning TreeProtocol)Find devices using IP’s w/out DNS entries

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 11: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Introduction to NetdiscoFeatures of NetDisco

Features contd.

Reporting:

Graphing of network topology. Clickable image-map ofdevices. Link speed shown.Statistics for number of actual nodes connected to network.

Inventory of Network Devices:

By Operating System (IOS,CatOS,HP...)By Model, Vendor, OSI Layer, DNS NameFind device ports that are blocking (via Spanning TreeProtocol)Find devices using IP’s w/out DNS entries

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 12: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Proposed Work

Netdisco autodiscovers devices which support CDP protocol.

However, many networks have parts of the topology that arenot covered by CDP.

We need to fill the information of the devices which does notsuppot CDP protocol in netdisco-topology.txt.

Our Work

To discover the network topology and give the topologyinformation in the format required by Netdisco. For this we willuse SNMP protocol.

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 13: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Proposed Work

Netdisco autodiscovers devices which support CDP protocol.

However, many networks have parts of the topology that arenot covered by CDP.

We need to fill the information of the devices which does notsuppot CDP protocol in netdisco-topology.txt.

Our Work

To discover the network topology and give the topologyinformation in the format required by Netdisco. For this we willuse SNMP protocol.

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 14: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Example format of netdisco-topology.txt file

Let’s say you have two CDP speaking devices with a non-CDPspeaking device in between them.

CISCO BAY HP

21 25 26 12

topology file:

ciscoswitch.my.companylink:21,bayswitch.my.company,25bayswitch.my.companylink:26,hpswitch.my.company,12

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 15: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Snmp ptotocol

SNMP is a protocol designed to give remote managementaccess to a Network device.

Features:

Enable/disable a portChecks health and performance of the network.Access control.Error statistics etc...

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 16: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Snmp ptotocol

SNMP is a protocol designed to give remote managementaccess to a Network device.

Features:

Enable/disable a portChecks health and performance of the network.Access control.Error statistics etc...

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 17: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Main AlgorithmInputs to the AlgorithmExample

Idea of the Algorithm

1 Represents the network by a collection of skeleton paths, Q,between pairs of nodes belonging to the same subnet.

2 Iteratively refines Q to provide more accurate topologyinformation for the network.

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 18: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Main AlgorithmInputs to the AlgorithmExample

Idea of the Algorithm

1 Represents the network by a collection of skeleton paths, Q,between pairs of nodes belonging to the same subnet.

2 Iteratively refines Q to provide more accurate topologyinformation for the network.

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 19: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Main AlgorithmInputs to the AlgorithmExample

Flow diagram for the Algorithm

IDLE STATE

and subnet information

COMPUTING INITIAL SKELETON INFORMATION

REQUIREMENTS GATHERING STATE

START

EACH PATHCOMPUTING CONSTRAINTS ON

REFINING PATHS

comment: REFINING PATHS UNTIL NO REFINEMENT IS POSSIBLE

PATH REFINEMENT STATE

COMPUTE ACTUAL CONNECTIONS

Collecting Routers, switches

Collecting AFT Information

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 20: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Main AlgorithmInputs to the AlgorithmExample

Inputs to the AlgorithmRouter Information

Constraints: You need to know atleast One Router IPaddress

Idea: Repeatedly find the neighboring routers of thecurrently known routers until no new routers are discovered.

Implementation: The neighboring routers of a router R arethe set of routers that are next hops for some destination inthe ipRouteTable in MIB-II in R.

Shell Command: snmpwalk -0s -c public -v 1

10.105.1.250 ipRouteTable

Perl Module: Net::SNMP::Hostinfo module

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 21: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Main AlgorithmInputs to the AlgorithmExample

Inputs to the AlgorithmRouter Information

Constraints: You need to know atleast One Router IPaddress

Idea: Repeatedly find the neighboring routers of thecurrently known routers until no new routers are discovered.

Implementation: The neighboring routers of a router R arethe set of routers that are next hops for some destination inthe ipRouteTable in MIB-II in R.

Shell Command: snmpwalk -0s -c public -v 1

10.105.1.250 ipRouteTable

Perl Module: Net::SNMP::Hostinfo module

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 22: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Main AlgorithmInputs to the AlgorithmExample

Inputs to the AlgorithmRouter Information

Constraints: You need to know atleast One Router IPaddress

Idea: Repeatedly find the neighboring routers of thecurrently known routers until no new routers are discovered.

Implementation: The neighboring routers of a router R arethe set of routers that are next hops for some destination inthe ipRouteTable in MIB-II in R.

Shell Command: snmpwalk -0s -c public -v 1

10.105.1.250 ipRouteTable

Perl Module: Net::SNMP::Hostinfo module

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 23: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Main AlgorithmInputs to the AlgorithmExample

Inputs to the AlgorithmRouter Information

Constraints: You need to know atleast One Router IPaddress

Idea: Repeatedly find the neighboring routers of thecurrently known routers until no new routers are discovered.

Implementation: The neighboring routers of a router R arethe set of routers that are next hops for some destination inthe ipRouteTable in MIB-II in R.

Shell Command: snmpwalk -0s -c public -v 1

10.105.1.250 ipRouteTable

Perl Module: Net::SNMP::Hostinfo module

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 24: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Main AlgorithmInputs to the AlgorithmExample

Inputs to the AlgorithmRouter Information

Constraints: You need to know atleast One Router IPaddress

Idea: Repeatedly find the neighboring routers of thecurrently known routers until no new routers are discovered.

Implementation: The neighboring routers of a router R arethe set of routers that are next hops for some destination inthe ipRouteTable in MIB-II in R.

Shell Command: snmpwalk -0s -c public -v 1

10.105.1.250 ipRouteTable

Perl Module: Net::SNMP::Hostinfo module

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 25: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Main AlgorithmInputs to the AlgorithmExample

Inputs to the Algorithm contd..Switch Information

A interface of the router connects one subnet to the network.

Idea: The IP addresses of the subnet can be determined byknowing the IP address of the interface.

Implementation:

The IP address of the interface is obtained using ipAddrTable

in MIB-II.The subnet entities are computed by enumerating the ipaddresses in the subnet corresponding to the IP address of theinterface.From the ipNetToMediaTable we can find subnet,macaddress, system name and the number of ports.We determine whether a particular ip address is a device bychecking ipForwarding flag or system.sysService variables.

Perl Module: Net::SNMP::Hostinfo module

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 26: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Main AlgorithmInputs to the AlgorithmExample

Inputs to the Algorithm contd..Switch Information

A interface of the router connects one subnet to the network.

Idea: The IP addresses of the subnet can be determined byknowing the IP address of the interface.

Implementation:

The IP address of the interface is obtained using ipAddrTable

in MIB-II.The subnet entities are computed by enumerating the ipaddresses in the subnet corresponding to the IP address of theinterface.From the ipNetToMediaTable we can find subnet,macaddress, system name and the number of ports.We determine whether a particular ip address is a device bychecking ipForwarding flag or system.sysService variables.

Perl Module: Net::SNMP::Hostinfo module

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 27: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Main AlgorithmInputs to the AlgorithmExample

Inputs to the Algorithm contd..Switch Information

A interface of the router connects one subnet to the network.

Idea: The IP addresses of the subnet can be determined byknowing the IP address of the interface.

Implementation:

The IP address of the interface is obtained using ipAddrTable

in MIB-II.The subnet entities are computed by enumerating the ipaddresses in the subnet corresponding to the IP address of theinterface.From the ipNetToMediaTable we can find subnet,macaddress, system name and the number of ports.We determine whether a particular ip address is a device bychecking ipForwarding flag or system.sysService variables.

Perl Module: Net::SNMP::Hostinfo module

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 28: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Main AlgorithmInputs to the AlgorithmExample

Inputs to the Algorithm contd..Switch Information

A interface of the router connects one subnet to the network.

Idea: The IP addresses of the subnet can be determined byknowing the IP address of the interface.

Implementation:

The IP address of the interface is obtained using ipAddrTable

in MIB-II.The subnet entities are computed by enumerating the ipaddresses in the subnet corresponding to the IP address of theinterface.From the ipNetToMediaTable we can find subnet,macaddress, system name and the number of ports.We determine whether a particular ip address is a device bychecking ipForwarding flag or system.sysService variables.

Perl Module: Net::SNMP::Hostinfo module

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 29: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Main AlgorithmInputs to the AlgorithmExample

Inputs to the Algorithm contd..Switch Information

A interface of the router connects one subnet to the network.

Idea: The IP addresses of the subnet can be determined byknowing the IP address of the interface.

Implementation:

The IP address of the interface is obtained using ipAddrTable

in MIB-II.The subnet entities are computed by enumerating the ipaddresses in the subnet corresponding to the IP address of theinterface.From the ipNetToMediaTable we can find subnet,macaddress, system name and the number of ports.We determine whether a particular ip address is a device bychecking ipForwarding flag or system.sysService variables.

Perl Module: Net::SNMP::Hostinfo module

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 30: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Main AlgorithmInputs to the AlgorithmExample

Inputs to the Algorithm contd..Address Forwarding Table(AFT) information

Now we got all the MAC addresses of routers and switch inthe system.

Every Port of a switch or router has Address forwarding table.

Definition: AFT for a port is the set of MAC addresses thathave been seen as source addresses on frames received at thatport.

Constraint: AFT information should be complete.

AFT info is complete if it contains MAC addresses of allswitches and routers from which frames can be received atthat particular port.

Implementation: Perl Module SNMP::Info::Bridge.

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 31: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Main AlgorithmInputs to the AlgorithmExample

Inputs to the Algorithm contd..Address Forwarding Table(AFT) information

Now we got all the MAC addresses of routers and switch inthe system.

Every Port of a switch or router has Address forwarding table.

Definition: AFT for a port is the set of MAC addresses thathave been seen as source addresses on frames received at thatport.

Constraint: AFT information should be complete.

AFT info is complete if it contains MAC addresses of allswitches and routers from which frames can be received atthat particular port.

Implementation: Perl Module SNMP::Info::Bridge.

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 32: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Main AlgorithmInputs to the AlgorithmExample

Inputs to the Algorithm contd..Address Forwarding Table(AFT) information

Now we got all the MAC addresses of routers and switch inthe system.

Every Port of a switch or router has Address forwarding table.

Definition: AFT for a port is the set of MAC addresses thathave been seen as source addresses on frames received at thatport.

Constraint: AFT information should be complete.

AFT info is complete if it contains MAC addresses of allswitches and routers from which frames can be received atthat particular port.

Implementation: Perl Module SNMP::Info::Bridge.

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 33: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Main AlgorithmInputs to the AlgorithmExample

Inputs to the Algorithm contd..Address Forwarding Table(AFT) information

Now we got all the MAC addresses of routers and switch inthe system.

Every Port of a switch or router has Address forwarding table.

Definition: AFT for a port is the set of MAC addresses thathave been seen as source addresses on frames received at thatport.

Constraint: AFT information should be complete.

AFT info is complete if it contains MAC addresses of allswitches and routers from which frames can be received atthat particular port.

Implementation: Perl Module SNMP::Info::Bridge.

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 34: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Main AlgorithmInputs to the AlgorithmExample

Inputs to the Algorithm contd..Address Forwarding Table(AFT) information

Now we got all the MAC addresses of routers and switch inthe system.

Every Port of a switch or router has Address forwarding table.

Definition: AFT for a port is the set of MAC addresses thathave been seen as source addresses on frames received at thatport.

Constraint: AFT information should be complete.

AFT info is complete if it contains MAC addresses of allswitches and routers from which frames can be received atthat particular port.

Implementation: Perl Module SNMP::Info::Bridge.

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 35: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Main AlgorithmInputs to the AlgorithmExample

Inputs to the Algorithm contd..Address Forwarding Table(AFT) information

Now we got all the MAC addresses of routers and switch inthe system.

Every Port of a switch or router has Address forwarding table.

Definition: AFT for a port is the set of MAC addresses thathave been seen as source addresses on frames received at thatport.

Constraint: AFT information should be complete.

AFT info is complete if it contains MAC addresses of allswitches and routers from which frames can be received atthat particular port.

Implementation: Perl Module SNMP::Info::Bridge.

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 36: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Main AlgorithmInputs to the AlgorithmExample

ExampleOriginal Network Topology

s 1

r1

a1 2

32e1

f11

x

b1 2

q1

c1 2

y1

d1 1

b1

f1

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 37: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Main AlgorithmInputs to the AlgorithmExample

Example contd.

s1 a1 , a2 , b1 , b2 , c1 ,c2 , d1 ,d2 t1

x1 y1 b1 , b2 ,c1 ,c2 , e2 ,e1

u1 v1b1 , b2 , c1 , c2 , d1 , d2 , e3 , e1

a1 , a2 , b1 , b2r1 q1

S1 a1 , a2 , b1 , b2 , c1 , c2 , d1 , d2 T1

b1 , b2 , c1 , c2X1 E2 e1 y1

u1 e2 e1b1 , b2c1 , c2

d1 d2 v1

q1r1 a1 , a2 , b1 , b2

Skeleton Paths After first Iteration

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 38: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Main AlgorithmInputs to the AlgorithmExample

Example contd.

s1 t1a1 a2 b1 b2 c1 c2 d1 d2

x1 e1 e2 y1

u1 e2 e1 d1 d2 v1

r1 q1

b1 , b2 , c1 ,c2

b1 , b2 , c1 , c2

a1 , a2 , b1 ,b2

After second iteration

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 39: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Main AlgorithmInputs to the AlgorithmExample

Example contd.

s1 t1a1 a2 b1 b2 c1 c2 d1 d2

x1 e1 e2 b1 b2 c1 c2 y1

u1 e2 e1 b1 b2 c1 c2 d1 d2 v1

r1 a1 a2 b1 b2 q1

After third iteration

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 40: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Main AlgorithmInputs to the AlgorithmExample

Example contd.

r1

s1

a1 a2

e1

b1 b2 c1

q1

d2

u1

t1

e2 x1

e3 u1

c2 y1

d1

Resulting Connections

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 41: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Plan of Implementation

We will be using perl language for implementation.The perl modules which will be used are:NET::SNMP

Net::SNMP is a collection of various tools relating to thesnmp including:

An SNMP libraryTools to request or set information from SNMP agents.Tools to generate and handle SNMP traps etc..

FUNCTIONS: snmpget, snmpset, snmpwalk, snmpgetnext,snmpstatussnmpnetstat, snmptable, snmptranslate etc...

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 42: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

Plan of Implementation contd.

SNMP::INFO

Perl5 module to network devices through snmp.

SNMP::INFO gives an object oriented interface to informationobtained through SNMP.

SUB-CLASSES:SNMP::INFO::BRIDGE, SNMP::INFO::CDP,SNMP::INFO::ETHERLIKE, SNMP::INFO::LAYER1SNMP::INFO::LAYER2, SNMP::INFO::LAYER3,SNMP::INFO::MAU

METHODS:device type(), uptime(), name(), ports(), interfaces() etc...

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool

Page 43: Network Discovery Tool

Problem StatementRelated Work

Proposed WorkDesign

Plan of Implementation

References

1 Physical Topology Discovery for Large Multi-SubnetNetworks. Yigal Bejerano, Yuri Breitbart , Minos Garofalakis,Rajeev Rastogi. Bell Labs, Lucent Technologies

2 Topology Discovery in Heterogeneous IP Networks. YuriBreitbart, Minos Garofalakis, Cliff Martin, Rajeev Rastogi, S.Seshadri, Avi Silberschatz. Information Sciences ResearchCenter Bell Labs, Lucent Technologies.

3 www.netdisco.org

4 www.net-snmp.org

5 http://snmp-info.sourceforge.net

6 http://www.cpan.org/modules/by-module/SNMP/

7 http://www.switch.ch/misc/leinen/snmp/perl

Bestin Jose Mahesh Kumar Shyamsunder Network Discovery Tool