1 / 27

Network Topology Discovery

Network Topology Discovery. Fawad Nazir Date = 13-Oct-2003. From 29-Sep-2003 To 06-Oct-2003. Decided The Basic Architecture Designed Algorithm for Display Design The Class hierarchy Implementation of the First Prototype Went on Leave. Basic Architecture. Display Algorithm.

pearly
Télécharger la présentation

Network Topology Discovery

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Network Topology Discovery Fawad Nazir Date = 13-Oct-2003

  2. From 29-Sep-2003 To 06-Oct-2003 • Decided The Basic Architecture • Designed Algorithm for Display • Design The Class hierarchy • Implementation of the First Prototype • Went on Leave

  3. Basic Architecture Display Algorithm Discovery Algorithm Display Algorithm Starts Discovery Algorithm Starts Object Oriented Database (OODB) Of The Nodes and Their connections. In the form of classes and Objects. The whole database is in Main Memory For efficient access. The database is developed using the Following data structures in java 1. Hash Table 2. Vector 3. Link List It also provides a way of communication Between the discovery and display algorithms Get Information from the OODB Update OODB with the new Nodes detected and New Connections. Draw The Topology Discover New Nodes and New Connections

  4. ALGORITHM Display and Discovery

  5. The Screen is divided into a grid of nodes each 5*5 pixels. The color will indentify the • type of node • 2. The space between the nodes is also 5 pixels • 3. Initially the grid is nodes is divided into layers as shown (With Dark Black Lines)

  6. Initially the blocks in the center are given to the routers that if any router is discovered • it will be displayed at this place. • And all other nodes are given to the computers. • The switches are not yet given any space the switches will be given space at run time when the switch is detected so that it comes in the center of the computers attaches to it.

  7. The computer detected from where the algorithm started

  8. We got the gateway from the computer where we started algorithm • Pinging the gateway check its connectivity. • If alive draw it.

  9. Draw a line between the computer and the router

  10. Get all the ARP entries from the routers ARP cache. • Insert all the IP and MAC of the entries in some Hash table. • And check the connectivity and draw them

  11. Check for the neighbors of the router and draw the neighbors and Connect it with the router. • Up till this point the implementation is done .

  12. In the next step query the IP found from the ARP of router to check which IP is of Switch. • When get any switch query it to get the MACS connected to that switch. • When fond the MACS check the MAC to IP table to find the computers already discovered. • The computers which are already discovered connect them to the switch. • And if you get the MAC of router connect the switch with the router.

  13. Readjust the computers routers and switches.

  14. Now start pinging the computer range in the network ID which you got from the • IP and subnet mask of router. • 3. Draw the new computers which are detected.

  15. If some switch found, check or the MACS connected to it and connect the PCS. • .

  16. Discovery continued …

  17. If the space is complete them omit the last layer and add a new layer in between after • the first layer out side the routers..

  18. Demo of The First Prototype • Algorithm

  19. Went of Leave • Enjoyed

  20. Work During Leave • Refined and documented the Discovery Algorithm • Made a presentation of basic architecture and display algorithm • Mailed both documents to Mr. Umer and Dr. Iosif .

  21. Proposed Displayed Algorithm • From NMS get the Default Router. • Ping the router to check two things. • Connectivity • TTL to check the hop distance • If the TTL does not decrease then go to step 3. • If the TTL decreases then run the trace route to get IP addresses of the hops between the NMS and the Default router. • From the router get three things • ARP cache entries • Next Hop information from the routing table. • Subnet mask • Ping all the computers in the ARP cache to check connectivity.

  22. Algo Contd… • From the next hop information you will get the info about routers next to the default router. • From the subnet mask you will get the subnet address. • Ping all the computers in the subnet address that have not yet discovered. • When ever new node is detected check whether it’s a computer or a switch. • To get the MAC address of the node send a RARP request. • Enter the information in the database accordingly.

  23. Algo Contd… • When ever a switch is found check: • The MAC address of all the nodes connected to it. • Check for the nodes already detected and update their connection with the switch. • If you found a MAC address, which is not yet detected, then send a ARP request to that node to get its IP. • Now after discovering the topology of one subnet go to the next hop entries and discover other subnets in the similar way.

  24. Work During the Last week • NASCON 2003 • Worked on data storage techniques • Proposed Storage Techniques

  25. Storage Techniques • Data in the form of relations in RDBMS • Data in the form of text in in flat files • Data in the form of tree in XML based database.

  26. Why Data in the form of Tree? • Easily displayable • Ensure Scalability • Fast data parsing and access

  27. Work Planned For This Week • Finding Storage Technique • Deciding a Database • Database designing • Hand on with the database.

More Related