Autonomous System Network Topology Discovery Algorithm Based On OSPF Protocol

Similar documents
Open Shortest Path First (OSPF)

Cabrillo College. Rick Graziani, Instructor

OSPF Demand Circuit Feature

OSPF Protocol Overview on page 187. OSPF Standards on page 188. OSPF Area Terminology on page 188. OSPF Routing Algorithm on page 190

Basic Idea. Routing. Example. Routing by the Network

Routing by the Network

Table of Contents 1 OSPF Configuration 1-1

OSPF. Unless otherwise noted, OSPF refers to OSPFv2 throughout this document.

Chapter 7: Routing Dynamically. Routing & Switching

Introduction to OSPF

Routing Protocols. Autonomous System (AS)

Introduction to OSPF OSPF. Link State Routing. Link State. Fast Convergence. Low Bandwidth Utilisation

Introduction to OSPF

OSPF Stub Router Advertisement

Introduction to OSPF

Overview. Problem: Find lowest cost path between two nodes Factors static: topology dynamic: load

Logging neighbor state changes 38 Configuring OSPF network management 39 Enabling message logging 39 Enabling the advertisement and reception of

Configuring OSPF network management 39 Enabling message logging 39 Enabling the advertisement and reception of opaque LSAs 40 Configuring OSPF to

Vanguard Managed Solutions

CCNA 3 (v v6.0) Chapter 5 Exam Answers % Full

Chapter 4: Advanced Internetworking. Networking CS 3470, Section 1

Routing. Advanced Computer Networks: Routing 1

Lecture 12. Introduction to IP Routing. Why introduction? Routing

Table of Contents 1 Static Routing Configuration RIP Configuration 2-1

Computer Networks ICS 651. IP Routing RIP OSPF BGP MPLS Internet Control Message Protocol IP Path MTU Discovery

Antonio Cianfrani. Routing Protocols

OSPF Commands. Cisco IOS IP Command Reference, Volume 2 of 3: Routing Protocols IP2R-61

Top-Down Network Design, Ch. 7: Selecting Switching and Routing Protocols. Top-Down Network Design. Selecting Switching and Routing Protocols

Lab 4: Routing using OSPF

EECS 122, Lecture 16. Link Costs and Metrics. Traffic-Sensitive Metrics. Traffic-Sensitive Metrics. Static Cost Metrics.

Routing. Info 341 Networking and Distributed Applications. Addresses, fragmentation, reassembly. end-to-end communication UDP, TCP

OSPF Virtual Link. Contents. Prerequisites. Document ID: Requirements. Components Used

Introduction to IP Routing. Geoff Huston

Routing Protocols of IGP. Koji OKAMURA Kyushu University, Japan

CompSci 356: Computer Network Architectures. Lecture 13: Dynamic routing protocols: Link State Chapter 3.3.3, Xiaowei Yang

BTEC Level 3 Extended Diploma

Why dynamic route? (1)

TDC 363 Introduction to LANs

Link State Routing. Link State Packets. Link State Protocol. Link State Protocols Basic ideas Problems and pitfalls

IPv6 Switching: Provider Edge Router over MPLS

IP Routing Tecnologie e Protocolli per Internet II rev 1

Routing Protocols. The routers in an internet are responsible for receiving and. forwarding IP datagrams through the interconnected set of

OSPF (Open Shortest Path First)

Chapter 7 Routing Protocols

Helsinki University of Technology Telecommunications Laboratory. OSPF Routing Protocol Licenciate course seminar paper

CHAPTER 4: ROUTING DYNAMIC. Routing & Switching

Link State Routing. Link State Packets. Link State Protocol. Link State Protocols Basic ideas Problems and pitfalls

Performance Comparison of OSPF and IS-IS Routing Protocols in Dual-Stack Enterprise Networks. Paris Alexandros Roussinos

Chapter 6 Reading Organizer

IPv6 Switching: Provider Edge Router over MPLS

Introduction to Dynamic Routing Protocols

Operation Manual IPv4 Routing H3C S3610&S5510 Series Ethernet Switches. Table of Contents

Creating Multiple OSPF Areas. 2001, Cisco Systems, Inc. 6-1

IT-Operation (2) OSPF. Who am I

TCPIP Protocol Suite & Utilities. Revision no.: PPT/2K403/02

Configuring Networking Protocols

Routing. Routing. Overview. Overview. Routing vs. Forwarding. Why Routing

CompSci 356: Computer Network Architectures. Lecture 12: Dynamic routing protocols: Link State Chapter Xiaowei Yang

Unit 3: Dynamic Routing

Configuring OSPF. Finding Feature Information. Contents

Vendor: Alcatel-Lucent. Exam Code: 4A Exam Name: Alcatel-Lucent Interior Routing Protocols and High Availability.

Configuring OSPF. Cisco s OSPF Implementation

OSPF Not So Stubby Area (NSSA)

Initial motivation: 32-bit address space soon to be completely allocated. Additional motivation:

OSPF (Open Shortest Path First)

OSPFv3 Address Families

9.1. Routing Protocols

Troubleshooting Routing Solutions

debug ip ospf database external default-metric subnet area 0 stub distribute-list in Serial0/1

Chapter 8 Configuring OSPF

Configuring OSPF with CLI

Configuring OSPF. Finding Feature Information

2001, Cisco Systems, Inc. All rights reserved.

Top-Down Network Design

OSPF. OSPF processs can be enabled on 2 levels

Politecnico di Milano Scuola di Ingegneria Industriale e dell Informazione. 06 Routing protocols. Fundamentals of Communication Networks

REDDIG II Computer Networking Training

CCNA Exploration: Routing Protocols and Concepts Chapter 11 Case Study

Routing Protocols and

Unicast Routing Protocols (RIP, OSPF, and BGP)

Computer Networks II IPv4 routing

OSPF Routers Connected by a Point to Multipoint Link

Alcatel-lucent EXAM - 4A Alcatel-Lucent Interior Routing Protocols and High Availability. Buy Full Product.

Planning for Information Network

Overview 4.2: Routing

Which of the following describe the process identifier that is used to run OSPF on a router? (Choose two)

Routing Protocol Type Primarily IGP or EGP RIP Distance-Vector IGP EIGRP OSPF IS-IS BGP

Configuring Integrated IS-IS Protocol Shutdown Support Maintaining Configuration Parameters

This document is not restricted to specific software and hardware versions.

Simulation Based EIGRP over OSPF Performance Analysis

Passit4Sure.4A Questions 4A Alcatel-Lucent Interior Routing Protocols and High Availability

Internet Routing Protocols, DHCP, and NAT

Outline. Routing. Introduction to Wide Area Routing. Classification of Routing Algorithms. Introduction. Broadcasting and Multicasting

Session 2: MPLS Traffic Engineering and Constraint-Based Routing (CR)

MikroTik RouterOS Training. Routing. Schedule. Instructors. Housekeeping. Introduce Yourself. Course Objective 7/4/ :00 10:30 Morning Session I

Design and Implementation of an Anycast Efficient QoS Routing on OSPFv3

Network Working Group. Category: Standards Track Juniper Networks J. Moy Sycamore Networks December 1999

ICS 351: Today's plan. distance-vector routing game link-state routing OSPF

Unicast Routing. TCP/IP class

Chapter 5: Maintaining and Troubleshooting Routing Solutions

Transcription:

3rd International Conference on Material, Mechanical and Manufacturing Engineering (IC3ME 2015) Autonomous System Network Topology Discovery Algorithm Based On OSPF Protocol Xingchao Ma 1, a *, Geming Xia 2, b 1, 2 College of Computer, National University of Defense Technology, Changsha, China a maxc2010@sina.com, b xiageming@126.com Keywords: Network topology discovery, OSPF protocol, Autonomous system,. Abstract. The existing algorithms of network topology discovery are mainly based on Internet control message protocol (ICMP) and simple network management protocol (SNMP). These algorithms are active network topology discovery methods which can inject new traffic into the Internet and affect the network performance. In the paper we present an algorithm of network topology discovery based on open shortest path first (OSPF) protocol. As one kind of active network topology discovery methods, the algorithm of network topology discovery based on OSPF protocol doesn t inject new traffic into the network. Moreover, this algorithm of network topology discovery based on OSPF protocol can make up the deficiencies of existing techniques of network topology discovery. We suspect that this algorithm of network topology discovery based on OSPF protocol will be widely used. Introduction Network topology discovery is a technology that automatically finds the computer network entities (routers, hosts, subnet, etc.) and the connection between entities without manual intervention. Network topology discovery is the basic function of network management tools today. This technology plays an important role in optimizing the network configuration, finding the bottleneck of the network, locating the network failure and finding the potential risks that may exist in the network. The traditional network topology discovery methods are mainly based on ICMP protocol and SNMP protocol [1, 2]. In recent years, the network topology discovery technology has been widely studied in the domestic and international academic circles [3, 4]. Related Work Analysis of Network Topology Discovery Technology Network topology discovery is one of the core technologies in the field of computer network management. And it has been studied for many years both at home and abroad. Different classifications are listed below. Physical Network Topology Discovery and Logical Network Topology Discovery Physical network topology is a physical connection between real network devices. For example, the connection between the switch and the switch, the switch and the host. Logical network topology uses the IP address of the network equipment to find the logical connection relationship between network devices, including connections between router and router, router and subnet. Physical topology discovery technology works on the data link layer, while logical network topology discovery on the IP layer. In general, physical network topology discovery can be realized in local area network (LAN). And logical network topology is realized in the wide area network. Active and Passive Network Topology Discovery Methods Active network topology discovery method observes and records the results by sending monitor data packets to the target network. By using this method the behaviors of the network users and structure of the network can be studied. Active network has its shortage. When sending monitor data packets in the network, extra network load increases. The accuracy of the topology discovery is not good because of the increasing network load. However, passive network topology discovery method has no 2015. The authors - Published by Atlantis Press 1099

effect on the network topology discovery. In this method, monitors which are set up in the target network record the data of the network and extract information relate to topology. With this information the topology of the network can be restored. The passive network topology discovery method doesn t increase network load, having no effect on the performance of the network. Topology Discovery Base on SNMP and ICMP Protocol In recent year topology discovery technologies base on SNMP and ICPM protocol are the most widely used. At the same time they are the most widely studied both at home and abroad. Analysis of Topology Discovery Technology Based on OSPF Protocol Routers rely on routing protocols to generate their own routing table. Routing protocols maintain the normal order of the network. If we can get the data of routing protocols, we can learned how routers connect to each other and their respective subnet, and the topology of the network at the same time. There are two different dynamic routing protocols: Distance Vector Protocol and Link State Protocol. Distance Vector Protocol (DVP). Routers running a DVP transfer some or all of the routing tables directly to their neighboring routers. If we can obtain the data of the DVP, we can obtain the routing table, then with the routing table we can restore the topological structure. DVP are very familiar with network topology discovery technology base on SNMP protocol. Link State Protocol (LSP). The LSP transfers the information of the network topology, which is also called the link state information. Routers learn the topology of the entire network, and then calculate the routing table based on the topology information. OSPF protocol is a typical LSP. Network topology discovery based on OSPF learns the connections between the topological nodes by analyzing the data of OSPF protocol [5]. Link-State Algorithm. In OSPF protocol, routers use link state advertisements () to describe the link state information. If we can obtain the, we can get the information of the network topology. s are exchanged by flooding in autonomous system (AS). Flooding means that a router generates packets and transfers them to all its neighboring OSPF routers. Neighboring OSPF routers update their link state database (LSD) according to the received packets. After that these neighboring OSPF routers transfer these packets to their neighboring routers. This process continues till the packets are transferred to all the OSPF routers and the network go into a stable statement. Then all the OSPF routers calculate their routing table according to their LSD. In order to simplify routing table and improve the operation speed of router, OSPF protocol divides an AS into many areas. Each area is connected by the area border router (ABR). s only floods in the one area. This flooding method makes sure that every router can obtain all the s from other routers in the same area. In other words, every will go through the link between any two routers in the same area. Thus, only one probe is needed to set up and then the whole s will be grabbed in an area. Classifications of OSPF Protocol Packet. There are five different types of OSPF protocol packets. Firstly, the hello packets. They are used to build up connections to their neighbor nodes. Secondly, the database description (DBD) packets. They are used to test the synchronization of the link state database. Thirdly, the link state request (LSR) packets. Fourthly, the link state update (LSU) packets. Fifthly, the link state acknowledgement (ck) packets. LSU packets. The fourth type of OSPF protocol packet, LSU, plays an important role in the OSPF protocol because all the s are encapsulated in it. The format of LSU packet is shown in Fig.1. 1100

0 7 15 31 Version 4 Packet length Router ID Area ID Checksum Authentication type Authentication Number of s Fig.1 The format of LSU packet Fig.1 shows that all OSPF packets have a 24 byte header, and every LSU packet can carry more than one. Each has a 20 byte header. And the load size of varies due to different type. At present, OSPF has defined 11 kinds of s, but only two types of them can be used in topology discovery. There are router and network. Router. Every router generates router. Router is the most important in the network topology discovery. What s more, router only transfers in one area and doesn t go through the ABR. when it comes to the ABR, ABR works for more than one area. ABR will generate one per area. Specially, this describes the information between the ABR and the corresponding area, but not the whole information between the ABR and all its linking areas. The format of router is shown in Fig.2. 0 7 15 31 LSage options 1 Link state ID Advertising router LS sequence number LS checksum Length 0 VEB 0 Links Link ID Link data Type TOS Metric Link ID Link data Type TOS Metric Fig.2 The format of router Router describes a link with five elements. They are type, link ID, link data, metric and type of service (TOS). One router can include couples of arrays with these five elements but no more than the number of the link the router has. We can get two nodes and one link by analyzing the router header and the array with the five elements. One node comes from the advertising router field of the router header. When type field equals to 1, link ID must be a router which connect to the advertising router. When type field equals to 2, one transit connecting to the advertising router can be discovered. And this transit includes link ID and link data. When type field equals to 3, a subnet known by link ID and link data can be discovered. And this subnet connects to the advertising router. When type field equals to 4, link ID can be discovered as a router which connects to the advertising router by a virtual link. 1101

Network. Network is generated by the designed router (DR) in the transit network. It is used to describe the routing information of the transit. Also it transfers in one area and doesn t go through the ABR. There are three important fields in the network. They are advertising router, network mask and attached router. Network mask is the mask of the transit. Attached routers are the router IDs of the routers forming the transit network. The format of network is shown in Fig.3. 0 7 15 31 LSage options 2 Link state ID Advertising router LS sequence number LS checksum Length Network mask Attached router Fig.3 The format of network By analyzing the network, we can discover one node, the advertising router. Also we can discover the attached router from the transit network and the network mask field of the transit network. Algorithm Design Protocol data acquisition. Protocol data acquisition is the basis of the network discovery technology based on OSPF protocol. Before we obtain the protocol data, we learn how the basic algorithm of OSPF protocol works. Update. The OSPF protocol provides a lot of updates. Here are three common updates. 1. Router initialization update. When a router is newly added to the network, the router will generate a. 2. Triggered update. When the network state changes (such as increasing or reducing routers and link state change), routers will detect the changes and send triggered updates. This triggered update ensure the real-time characteristic of the network topology discovery. 3. Periodic updates. A has its living time (link state refresh time, 30mins). When living time is up, routers will send periodic updates. Thus, we can obtain all the s in the target network in 30 minutes. Periodic updates ensure the integrity of the network topology discovery. The main flow of network topology discovery algorithm based on OSPF protocol is shown in Fig.4. In this algorithm, router and network are collected and analyzed. Different actions are taken due to the kind of the. When all the s are analyzed, the algorithm ends. Fig.4 is the main flow of this algorithm. 1102

Beginning N Initialize node queue and connection queue Read OSPF packet and judge whether it is a LSU packet Y Read and add advertising router into the node queue unrepeatedly Judge the type of Network- R- N Add link ID into node queue unrepeatedly and set the node type router PTP Transit Add link ID into node queue unrepeatedly and set the node type transit Judge the link type of router Stub Add link ID /link data into node queue unrepeatedly and set the node type stub Virtual Add link ID /link data into node queue unrepeatedly and set the node type virtual Add advertising router and attached router into node queue unrepeatedly and set the node type router Y Add advertising router and link ID into connection queue unrepeatedly and set the connection PTP Add advertising router and link ID into connection queue unrepeatedly and set the connection transit Add advertising router and link ID into connection queue unrepeatedly and set the connection stub Add advertising router and link ID into connection queue unrepeatedly and set the connection virtual Add advertising router/network mask into node queue and set the connection transit The last? Fig.4 The main flow of network topology discovery based On OSPF protocol Experiment Implement. We have realized the network topology discovery technology based on OSPF protocol. This technology has achieved good results in the practical engineering. The function of the network topology discovery system can be divided into three parts. More details of the system are shown in Fig.5. 1103

Fig.5 The topology discovery system Monitor of routing data. Every OSPF area in the target network deploys one monitor of routing data. This monitor can record the LSU packets of the OSPF protocol and send them to the routing data analysis server. Then the server will analyze the data. Routing data analysis server. Routing data analysis server collects and analyzes the OSPF packets sent from the monitors, and then the server records the protocol field into the database. In the database, two tables are created. One is for router, and one for network. Both of the tables have a link state age (LSage) field. When receiving the updates, the server will check whether the updates are the same with the records in the database. No operation if they are the same. If they are not the same, the server will record the updates into the database and notice the topology discovery clients that new link information are found. Topology discovery client. The main flow of the algorithm in Fig.4 is carried out in the client. The topology discovery clients read the topological data from the database in the server and analyze it to obtain the network nodes and their connections. And then the clients automatically draw a network topology. The client keep in touch with the server. When receiving updates, the server will notice the clients and the clients will read the updates. This method can ensure the real-time characteristic of the topology discovery. Fig.6 is the result of the network topology discovery. 1104

Conclusion Fig.6 The result of the network topology discovery In this paper we show the network topology discovery technology based on OSPF. This technology gets the topology information through analyzing Router-s and Network-s which are carried by LSU packet in OSPF protocol to realize network topology. Network topology discovery based on OSPF protocol uses passive monitoring method to obtain the data. This discovery technology has the characteristics of low load. What's more, OSPF protocol itself can ensure the accuracy, integrity and real-time of topology discovery. The OSPF protocol has become one of the largest and most widely used interior gateway protocol (IGP) routing protocols which are used in wide area network and the enterprise network in the Internet. Network topology discovery technology based on OSPF protocol has broad application prospect. In the future, we will study the network topology discovery technology based on the comprehensive analysis of multiple routing protocols, especially for the comprehensive analysis of the OSPF, border gateway protocol (BGP) to adapt to more large-scale network topology discovery. References [1] J. van der Geer, J.A.J. Hanraads, R.A. Lupton, The art of writing a scientific article, J. Sci. Commun. 163 (2000) 51-59. [1] YANG An-yi, ZHU Hua-qing, WANG Ji-Iong. Improved SNMP-based network topology discovery algorithm and its implementation [J]. Computer Applications, 2009, 27(10): 2412-2419. [2] SHI Yong-ge, CHEN Xiao-fan. Analyses and improvement of topological discovery algorithm based on network [J]. Computer Engineering and Design, 2007, 28(12): 2848-2850. [3] WANG Hui, LUO Jun-yong, KOU Xiao-rui. Network Topology Algorithm Based on OSPF Protocol Packet [J]. Computer Engineering, 2008, 34(6): 103-105. 1105

[4] NI Yong, SHI Huai-zhou, ZHU Pei-dong. Construct Network Topology Based on OSPF Database [J]. Computer Technology and Development, 2009, 19(3): 1-4. [5] Moy J.OSPF Version 2,RFC 2328[S]. The Internet Society:Network Working Group, 1998. 1106