2,011 research outputs found

    Modelling OSPF Routing Protocols Using OMNeT++ Simulator

    Get PDF
    Open Shortest Path First (OSPF) je dynamický, hierarchický směrovací protokol navrhnutý pro podporu směrovaní v sítích TCP/IP. Je tu potřeba pro rozsáhlé simulace protokolu OSPF, aby bylo možné lépe porozumět jeho dynamice. Obsahem této bakalářské práce je modelovaní a simulace protokolu OSPF v diskrétním simulačním systéme OMNeT++. Hlavní zaměření patří architektuře již existujíce implementaci v module OSPFRouting. Modul OSPFRouting je taktéž ověřeny vůči OSPF implementaci na reálních směrovačích. Dále je na konkrétných problémech demonstrované použití OSPF simulace.Open Shortest Path First (OSPF) is a dynamic, hierarchical routing protocol designed to support routing in TCP/IP networks. There is a deliberate need for large-scale simulation of OSPF protocol in order to understand its dynamics. Content of this bachelor's thesis is modeling and simulation of OSPF protocol in discrete event simulation system OMNeT++. The main focus is to give an insight of the architecture of the existing implementation in module OSPFRouting. The module OSPFRouting is also validated against OSPF implementation on the real routers. Next, the usage of OSPF simulation is demonstrated on the specific experiments.

    Open shortest path first (OSPF) routing protocol simulation

    Full text link

    Performance Analysis of RIP, EIGRP, and OSPF Using OPNET

    Get PDF
    Routing protocols are key elements of modern communication networks. Currently deployed dynamic routing protocols that are used to propagate network topology information to the neighboring routers are Routing Information Protocol (RIP), Enhanced Interior Gateway Routing Protocol (EIGRP), and the Open Shortest Path First (OSPF) protocol. The choice of the right routing protocol depends on a number of parameters. In this paper, we use OPNET Modeler to analyze the performance of RIP, EIGRP, and the OSPF protocols, which are commonly deployed in Internet Protocol (IP) networks. We designed various simulation scenarios to compare their performance. 1

    A Matrix Usage for Load Balancing in Shortest Path Routing

    Get PDF
    The Open Shortest Path First (OSPF) protocol is a hierarchical interior gateway protocol (IGP) for routing in Internet Protocol. Traffic flows routed along shortest path and splits the load equally at nodes where a number of outgoing links on the shortest paths to the same destination IP address. Network operator defines shortest paths based on a link weights value assigned to each link in the network. The OSPF link weight-setting problem seeks a set of link weights to optimize a cost function and network performance, typically associated with a network congestion measure. This research highlight the importance of managing network resource and avoiding congested point in the current widely deployed shortest path routing. The previous Evenly Balancing Method (EBM) and Re-Improved Balancing Method (R-IBM) used demand matrix, which requires constant monitoring of routers with high time executions in the optimization process. The problems are to find another matrix that can replace or minimize the usage of demand matrix with low time executions process. A new proposed Matrix Usage Method (MUM) is developed. MUM selects the shortest path routing in order to provide a balancing load and optimized the usage of link in the network. The simulation results show that the routing performance of the new proposed method MUM is better than the routing performance of the previous Evenly Balancing Methods (EBM) and Re-Improved Balancing Method (R-IBM) due to providing counting selection technique in the shortest path routing. MUM times executions are also improved comparing with the previous work

    Review Paper on Comparison of RIP, OSPF and EIGRP Protocols Using Simulation

    Get PDF
    Routing plays important role in internet communication and it is based on routing protocols, now a day's many routing protocols exist, among these routing protocols most famous are RIP (Routing information protocol) and OSPF (Open shortest path first). In this research work we analyze the performance of these protocols in term of their convergence, traffic, CPU utilization by changing special parameters within network. Cisco Packet Tracer simulation tool is used to design the network; analysis of the results is examined using standard tools

    Simulasi Dynamic Routing Dengan Menggunakan Protokol Routing OSPF dalam Implementasi Network

    Get PDF
    ABSTRAKSI: Pada dasarnya router merupakan alat yang menghubungkan antar dua jaringan atau lebih. Jenis router ada tiga macam, yaitu : router default, router statik dan router dinamik. Dari ketiga jenis router tersebut yang memilki keunggulan dalam me-mantanance jaringan dengan skala yang luas adalah router dinamik. Adapun sifat protokol routing pada router dinamik dibagi atas tiga macam, yaitu : distance-vektor, link state, dan hybrid. Dari ketiga protokol routing tesebut yang memiliki kedinamisan dalam memelihara jaringan yang berskala luas yaitu linkstate. Jenis protokol routing yang memiliki sifat link-state ada dua macam, yaitu OSPF (Open shortest Path First) dan IS-IS (intermediate system to intermediate system). Jenis protocol routing yang paling umum digunakan dalam suatu jaringan adalah OSPFPada Tugas Akhir ini dapat mengetahui pemilihan rute sesuai dengan sifat yang dimiliki OSPF. Simulasi dilakukan untuk mengetahui peng-update-an rute yang bekerja pada protocol routing OSPF. Desain topologi menggunakan jenis router dinamik dengan protokol routing OSPF. Pada topologi menggunakan 3 buah area, yaitu : area 0, area 1 dan area 2. memperlihatkan DR (designated router) dan BDR (backup designated router).mencari rute alternatif saat salah satu rute terjadi down. Selain itu, menjelaskan bahwa router OSPF juga dapat memilih jalur routing yang memiliki nilai cost matrik yang paling kecil. Hal ini disebabkan nilai cost matrik berbanding terbalik dengan lebar bandwidth. Selain cost matrik, pemilihan jalur routing juga dapat ditentukan dengan menempatkan area pada topologi yang digunakan. Hal ini disebabkan bandwidth pada router yang memiliki area yang sama dari router sumber ke router tujuan lebih besar dibandingkan bandwidth dengan router sumber yang berbeda area dengan router tujuan.Kata Kunci : OSPF, Router Dinamik, Protokol Routing, Cost Matrik, Area,ABSTRACT: In principle the router is a device which enables to connect between two or more network. There is three category or routers, which are: default router, static router and dynamic router. Among three categories, the dynamic router is able to fulfill high scale network maintenance. On the top of that, there are three characteristic of dynamic routing, which are divided into distance-vector, link state and hybrid. The link state routing category is able to accomplish the network maintenance dynamically among those three. We categorize the link state routing protocol into two characteristic, which are OSPF (Open Shortest Path First) and IS-IS (intermediate system to intermediate system). OSPF is the mostly applicable routing protocol.In this final project, it is to be understood the method of choosing the suitable path based on OSPF characteristic. We simulate the path update process in OSPF routing protocol. We also design the topology which use the dynamic router involved OSPF routing and use three kind of area, which are, area 0, area 1, and area 2. DR (designate route) and BDR (backup designate router) are also showed.Through the simulation result, we show that OSPF is able to search the alternative path when another path down. OSPF also able to choose the routing path which provides the lowest matrix cost. The matrix cost value is inversely proportional with bandwidth allocation. On the other hand, the choosing method of routing path is determined by placing the area in the corresponding topology. The bandwidth of the router which place in same area from the initial router to the destination router is larger than the bandwidth from the same different area with the destination router.Keyword: OSPF, Dynamic Router, Routing protocol, Cost matrix, Area
    corecore