Open Shortest Path First Protocol Research Articles

ANALISIS KINERJA JARINGAN INTERNET FT-UNIMED DENGAN PROTOCOL ROUTING OPEN SHOTEST PATH FIRST (OSPF) DAN BORDER GATEWAY PROTOCOL (BGP)

The use of the internet network during the Corona Virus pandemic known as COVID-19 increased rapidly because learning had to be done online, one of which was experienced at Fakultas Teknik, Universitas Negeri Medan. Some network disturbances often occur because of the large data transmission requests from the data center. This problem occurs because the network being used is still using a static routing protocol where the data path configuration must be updated manually by the operator. The solution to this problem is proposed to change the routing protocol from static routing to dynamic routing. The proposed dynamic routing protocols are open shortest path first (OSPF) and border gateway protocol (BGP). The choice of these two types of protocols is because they have better performance and can be implemented on any type of hardware. In this article, we will discuss the analysis of the implementation of the OSPF and BGP protocols with simulations carried out using packet tracer software. The results obtained from the simulation are analyzed and it is known that the OSPF protocol has better performance than the previous protocol, namely static routing and BGP protocol. Based on the criteria of throughput, packet loss, delay and jitter, it is known that the OSPF protocol has better performance on throughput, delay and jitter.Keywords : Static routing, dynamic routing, OSPF, BGP

A Comparative Study by Simulation of OSPF and EIGRP Routing Protocols

Computer networks are based on technology that provides the technical infrastructure where routing protocols are used to transmit packets over the Internet. Routing protocols define how routers communicate with each other by distributing information. They are used to describe how routers communicate with each other, learn available routes, build routing tables, make routing decisions, and share information between neighbors. The main purpose of routing protocols is to determine the best route from source to destination. A particular case of a routing protocol operating within an autonomous system is called an internal routing protocol (IGP – Interior Gateway Protocol). The article analyzes the problem of correctly choosing a routing protocol. Open Shortest Path First (OSPF) and Enhanced Interior Gateway Routing Protocol (EIGRP) are considered leading routing protocols for real-time applications. For this they are chosen to be studied. The main objective of the study is to compare the proposed routing protocols and to evaluate them based on different performance indicators. This assessment is carried out theoretically – by analyzing their characteristics and action, and practically – through simulation experiments. After the study of the literature, the simulation scenarios and quantitative indicators by which the performance of the protocols is compared are defined. First, a network model with OSPF is designed and simulated using the OPNET Modeler simulator. Second, EIGRP is implemented in the same network scenario and a new simulation is done. The implementation of the scenarios shall collect the necessary results and analyze the operation of the two protocols. The data shall be derived and an assessment and conclusion shall be made against the defined quantitative indicators.

УДОСКОНАЛЕНИЙ АЛГОРИТМ МАРШРУТИЗАЦІЇ ПАКЕТІВ У ТЕЛЕКОМУНІКАЦІЙНИХ МЕРЕЖАХ

Packet routing efficiency is and will remain one of the major factors that have a major impact on a network performance and a quality of service. One of the most common routing protocols used in autonomous Internet systems is the Open Shortest Path First (OSPF) protocol. The OSPF protocol performs packet transmission using the shortest paths, calculated according to a certain, but only one criterion. Default criterion is channels bandwidth, but in general any criteria can be selected. The disadvantage here is that channels loading is not considered and thus packets are routed to a shortest but potentially overloaded path. In wider sense usage of single criteria may results in routing through paths suboptimal or even inappropriate by other criteria. The growth of the network traffic, and especially the increase of its multimedia component drives continuous improvement of routing methods in existing telecommunication networks. Network performance will benefit from more advanced routing methods, which would take into account several network characteristics, important for specific services quality. In given work a new algorithm of a gateway selection for the routing tables of autonomous Internet systems is proposed. The algorithm is based on the OSPF protocol but takes into account three criteria: channel bandwidth, the number of intermediate nodes in the path and the signal propagation delay. Weighting coefficient for each criteria is introduced. Besides that, the integral criterion is proposed based on optimal path weights for individual criteria and path weights found by two other criteria. The total relative deviation of the path weight from the path weights calculated according to individual criteria is used as the optimization criterion. The purpose of optimization is to minimize this deviation. Routing tables constructed using proposed algorithm ensure packets transmission through the optimal path, selected according to the integral criterion, taking into account the three criteria and their coefficients of importance. Further research may be conducted to expand the list of criteria used in the optimization process.

High-Performance Routing Emulation Technologies Based on a Cloud Platform

Currently, the emergence of edge computing provides low-latency and high-efficiency computing for the Internet of Things (IoT). However, new architectures, protocols, and security technologies of edge computing need to be verified and evaluated before use. Since network emulation based on a cloud platform has advantages in scalability and fidelity, it can provide an effective network environment for verifying and evaluating new edge computing technologies. Therefore, we propose a high-performance emulation technology supporting the routing protocol based on a cloud platform. First, we take OpenStack as a basic network environment. To improve the performance and scalability of routing emulation, we then design the routing emulation architecture according to the software-defined network (SDN) and design the cluster scheduling mechanism. Finally, the design of the Open Shortest Path First (OSPF) protocol can support communication with physical routers. Through extensive experiments, we demonstrate that this technology not only can provide a realistic OSPF protocol but also has obvious advantages in the overhead and performance of routing nodes compared with those of other network emulation technologies. Furthermore, the realization of the controller cluster improves the scalability in the emulation scale.

Network Topology Monitoring Method of Large Scale Autonomous System Based on OSPF Protocol

In order to monitor the OSPF (Open Shortest Path First) large-scale autonomous system in real time, for the shortcomings of current topology discovery methods based on OSPF protocol, firstly a hierarchical modelling method of OSPF large-scale autonomous system is proposed, which describes the autonomous system quantitatively. Secondly, a topology generation algorithm based on the link state database and an autonomous system model comparison algorithm are put forward in this paper. Finally, the experiment of monitoring the autonomous system in the actual network is carried out. The link state database is collected on any router in each OSPF area. The experiments show that the model and algorithm can be used to obtain the network topology map completely and accurately without the extra network burden, and to monitor the changes of network topology in real time. The model and algorithm proposed in this paper are helpful to realize the topology generation and monitoring of the large-scale autonomous system.

RIP VS. OSPF ROUTING PROTOCOLS: WHICH ONE IS THE BEST FOR A REAL-TIME COMPUTER NETWORK?

The development of modern computer networks for internet access makes routing protocols needed, and it has an essential role in a real-time system. Therefore, the best and most effective routes can be reached. In this short article, we discuss the comparison of two popular routing protocols, i.e., Routing Information Protocol (RIP) and Open Shortest Path First (OSPF) using two network simulators, i.e., Graphical Network Simulator-3 (GNS3) and Enterprise Network Simulation Platform (ENSP). Both of OSPF and RIP routing protocols can be used in the same topology and have differences in the connection time required to connect communication between routers. Thru GNS3 and ENSP, we obtained the comparison result at ideal condition; we found that the OSPF routing protocol (83 ms) has a faster time or efficient in connection than RIP (177 ms). Besides, we found that compared to GNS3 network simulators (329 ms), the ENSP has a relatively more rapid average time (94 ms). This work suggests that a Huawei router with ENSP is faster than a Cisco router which is used by GNS3. Hopefully, this information can be refereed by internet network administrators to build real-time computer networks.

Routers Perspective Simulation-Based Analysis of EIGRP and OSPF Routing Protocol for an Organizational Model

Routing protocol bears the responsibility of maintaining standards which provide means for routers to establish and sustain proper communication among themselves as well as direct the packets towards the best traveling route present between an end node and a basis. Enhanced Interior Gateway Routing Protocol (EIGRP) and Open Shortest Path First (OSPF) are the highly valuable protocols in the computer networking field. Keep in view the implementation of routing protocols (RP); architectural differences lie between both of these protocols. Still, both of them do not have the same delays in processing regarding finding the best route, adaptability, and ability to achieve convergence. The author carried out studies via simulations in OPNET for estimating the performance of OSPF and EIGRP protocols and have drawn comparisons later on. Studies estimated the performance of OSPF and EIGRP by taking into consideration two network models. The 1ST model configured with OSPF, and the 2ND model is set-up with EIGRP. By sending and receiving traffic via the simulated network paradigm, the author estimated RPs based on quantitative metrics, including End-to-End delay, Packet dropped, Throughput, Processing delay, and CPU utilization. After gathering and studying the results, the author observed that EIGRP and OSPF both have different results. EIGRP has given better performance concerning some parameters, but on the other side, OSPF has shown better performance concerning some other parameters.

A Fast Failure Recovery Scheme for Fibbing Networks

Fibbing is a network technology that can provide flexible routing in IP networks. In a Fibbing network, the network controller cleverly broadcasts link state advertisements (LSAs) of the open shortest path first (OSPF) protocol to generate fake nodes. These fake nodes enlarge the physical topology and turn the network into a virtual network. Although the routers still follow the shortest path routing in the virtual network, the flows are steered along the desired paths in the physical network. Even though a Fibbing network is capable of flexible routing, methods to achieve fast failure recovery have not been well studied. Conventionally, an IP network running the OSPF protocol takes a long time to converge after a failure occurs. The IETF proposed loop-free alternate (LFA) IP fast reroute technology to speed up failovers. However, we discovered that LFA technology is incompatible with Fibbing. The direct application of LFA technology in a Fibbing network will generate traffic loops. In this work, we propose a novel monitoring-cycle-based approach for fast failure recovery. By examining the liveness of the monitoring cycles, the system controller can promptly identify a failed link or a failed node and then perform traffic rerouting. Due to the properties of IP packet forwarding, a monitoring cycle in an IP network must be a simple cycle. We prove that any network that is both 2-vertex- and 3-edge-connected (2V3E) possesses a set of monitoring cycles that can be used to detect and identify any single link failure. In conjunction with the status pattern provided by the monitoring cycles, any single node failure can be detected by introducing an additional probe message. We propose an algorithm to obtain these monitoring cycles and design and implement a Fibbing controller for the network. To evaluate the performance of the proposed approach, we construct a physical testbed and an emulation network. The experimental results show that the proposed system works stably and can achieve a fast failover within a short period of time.

Campus network Throughput improvement through metric modification of OSPF routing mechanism

OSPF (Open Shortest Path First) is routing protocol that are widely used in computer networks. Selection of routing protocols is very important in improving network performance. Calculation of OSPF metrics will determine the performance of data packet delivery. It based on Shortest Path Tree. To find the best route from source to destination, it must determine the shortest path between itself and each router in the network. The router creates this perspective by taking the information in the LSDB and transforming it into a shortest path first tree or SPF tree. It is an algorithmic calculation to construct logical network view performed by the computer within the router. To speed the construction of network tree, buffer on next hop, distance (RTT – round trip time), and direction of next hop (getting closer or away) variable is proposed to increase the speed of data packet communication among routers. This research was using OPNet modeler software, simulations were made on a campus network whose PDU variables were modified to obtain the optimum network tree with OSPF routing protocol. The weighted testing parameters in this study is time delay values. Hopefully, the value of redistribution delay is 1% better depending on traffic density. Main route retrieval and alternative package delivery are based on the smallest cost and metric values in the OSPF protocol.

Analysis of QOS VLAN Based on Djikstra’s Algorithm on Open Shortest Path First(OSPF)

As an institution engaged in SMK Muhammadiyah 03 Yogyakarta requires network infrastructure as a medium of communication. Infrastructure in SMK Muhammadiyah based VLAN but still using static routing and star topologies as a medium of communication between router. This leads to the main router performance overburdened which makes the network infrastructure down. It is necessary to reform the network, especially in the communication protocol on the router by using protocol Open Shortest Path First(OSPF). OSPF is a link state-based routing protocol that uses Dijkstra’s algorithm to find the best path is taken as a communication medium. Makin paths made by considering various aspects of the parameters that affect network traffic. OSPF can minimize down on network infrastructure caused by the buren of a huge traffic to maintain the stability of traffic on communication lines. The results using the method QOS on infrastructure with the OSPF protocol can be classified very nice. It is obtaine from the measurement parameter delay <150 ms, packet loss (0%), an bandwidth has a very goo category based on the standard TIPHON. From the results of the QOS parameters also obtained a decrease in delay value by 31% on infrastructure with the OSPF protocol. This proves that the network traffic is more stable when using OSPF protocol.

Dynamic metric OSPF-based routing protocol for Software Defined Networks

Routing protocols are needed in networking to find the optimal path to reach the destination. However, networks are changing both their use finality and their technology. Paradigms like Software Defined Networks (SDNs) introduce the possibility and the necessity to improve the routing protocols. In this paper, a modification of the Open Shortest Path First (OSPF) routing protocol is proposed in order to allow the protocol to change the metric calculation dynamically according to the network requirements. Experiments, which compare our proposal against the OSPF protocol, are performed in five different scenarios. In these scenarios, the performance of the multimedia traffic has been increased 33% in terms of bandwidth utilization, 80% of loss rate reduction and delay reduction on VoIP communications.

Open shortest path first routing under random early detection

In this article, we consider a variant of Open Shortest Path First (OSPF) routing that accounts for Random Early Detection (RED), an Active Queue Management method for backbone networks. In the version of OSPF we consider in this article we only require a single network path be available between each origin and destination, a simplification of the OSPF protocol. We formulate a mixed integer non‐linear program to determine the data paths, referred to as a routing policy. We prove that determining an optimal OSPF routing policy that accounts for RED is NP‐Hard. Furthermore, in order for the generated routing policies to be real‐world implementable, referred to as realizable, we must determine weights for all arcs in the network such that solving the all‐pairs shortest path problem using these weights reproduces the routing policies. We show that determining if a set of all‐pairs routes is realizable is also NP‐Hard. Fortunately, using traffic data from three real‐world backbone networks, we are able to find realizable routing policies for these networks that account for RED, using an off‐the‐shelf solver, and policies found perform better than those used in each network at the time the data was collected.

RIP and OSPF protocols Analysis through GNS-3 and OPNET UMTS Model Suite

Directing concerning astuteness packages proceed with one concerning Great key systems in amazing web. A coordination tradition demontrâtes Great procedure for correspondance among switches used as a section concerning noteworthy undirected toward affiliation concerning frameworks. On the off chance that you will organizing customs Application Virtualization web like OSPF, RIP, EIGRP, OPNET, IGRP, in like way so on. Great continuation reprobation Convention (RIP) goes down from separation route tally in like way noteworthy. Open Shortest Path First (OSPF) proceed with an affiliation distance planning estimation. Third time (3G) remote frameworks are impressive coordinated toward give spot on remote Internet win, Impressive frameworks are planned for mixed media pacified (Voiced, essence in like way make a recording), enormous core gauge associations, bundle core associations as an outcome area associations. In UMTS fundamental need concerning system proceed coordinated toward give achievable unflactuating concerning Qi’s, for giving Great put down for unflactuating concerning associations, noteworthy UMTS required a fit procedure in like way an apparatus stage. In any case regarding amazing certainty all together that RIP in like way EIGRP depend on upon essentially indistinguishable segment state coordination, Great capabilities in noteworthy convention execution methods can escort coordinated toward fundamental show differentials. Impressive conventions are inspected in light concerning ‘activity sent (packs/seconds)’ in like way ’advancement had gotten (bunches/seconds), past moving amazing sum concerning undirected towards, rate in like way break time.

Trust routing algorithm based on multiple decision factor theory in OSPF protocol

This paper presents a novel trust model based on multiple decision factor theory (MDFT) and a trust routing algorithm based on MDFT to exactly evaluate routing node trust and establish a trustworthy routing path. MDFT integrates four dimensional trust decision factors including behavior, state, recommend and node liveness to realize an exactly finer-grained trust evaluation. On the basis of MDFT, a trust routing algorithm is presented and validated in open shortest path first (OSPF) protocol. Simulation results show that the algorithm can reflect the routing node trust accurately and has better dynamic response ability. Under the circumstance of existing deceptive nodes, the algorithm has better anti-deception performance and higher attack node detection rate than conventional algorithm.

An Optimized OSPF Routing Protocol for Mobile Ad-hoc Networks

In this paper, we propose an Optimized OSPF（Open Shortest Path First）protocol for MANETs (Mobile Ad-hoc Networks). MANETs are multi-hop ad-hoc wireless networks where nodes can move arbitrarily in the topology. The network has no given infrastructure and can be set up quickly in any environment. Traditional OSPF is not also well used in multi-hop wireless networks. The optimized OSPF we proposed in this paper is a routing protocol which is more efficient for such mobile ad hoc networks. This paper describes and designs an optimized routing protocol for MANET referring to certain extensions to OSPF for MANET and OLSR routing protocol. The path selection optimization scheme we propose is aiming at reducing the number of redundant retransmissions while diffusing a broadcast message in the network and reducing overall overhead of control traffic。In conclusion, the optimized OSPF protocol improves the performance when using in MANETs as the experiment results show.

Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty

AbstractThe desire for configuring well‐managed open shortest path first (OSPF) routes to handle the communication needs in the contemporary business world with larger networks and changing service requirements has opened the way to use traffic engineering tools with the OSPF protocol. Moreover, anticipating possible shifts in expected traffic demands while using network resources efficiently has started to gain more attention. We take these two crucial issues into consideration and study the weight setting problem for OSPF routing problem with polyhedral demands. Our motivation is to optimize the link weight metric such that the minimum cost routing uses shortest paths with equal cost multipath splitting and the routing decisions are robust to possible fluctuations in demands. In addition to a compact mixed integer programming model, we provide an algorithmic approach with two variations to tackle the problem. We present several test results for these two strategies and discuss whether we could make our weight‐managed OSPF comparable to unconstrained routing under polyhedral demand uncertainty. © 2012 Wiley Periodicals, Inc. NETWORKS, 2012

OSPF Over Multi-Hop AD HoC Wireless Communications

Efficient OSPF (Open Shortest Path First) operation on multi-hop ad hoc wireless networks has become desirable, as wireless community mesh networks and vehicular networks emerge using OLSR (Optimized Link State Routing), a link state MANET routing protocol similar to OSPF in many aspects. OSPF is already extensively deployed and well known in wired IP networks, and could provide simple, seamless unification of wired and wireless IP networking routing-wise, if extended to operate efficiently on ad hoc networks. The IETF has thus proposed three different MANET extensions to the OSPF protocol, allowing heterogeneous networks encompassing both wired and wireless routers, which may self-organize as multi-hop wireless subnetworks, and be mobile. Two of these extensions are based on techniques derived from multi-point relaying (MPR). In the following, we compare and analyze these two extensions and we propose a unique, merged approach which out-performs the existing extensions.

Comparison and performance of routing protocols in SONET based networks

In this paper, comparison of various protocols used in the SONET based networks has been investigated in terms of the performance characteristics like end-to-end queuing delay, end-to-end link throughput, link utilization, etc. By creating a model to simulate the packet flow within a SONET DCC network characteristics of two routing protocols, the RIP (routing information protocol) and OSPF (open shortest path first) defined in the G.7712 standard are analyzed. Finally on comparing all the performance characteristics of the two routing protocol it is observed that OSPF protocol achieves better performance and is the least obtrusive on network operations.

Providing QoS in OSPF based best effort network using load sensitive routing

In an open shortest path first (OSPF) based best effort network, when a packet experiences congestion, the routing subsystem cannot send it through an alternate path. Thus, it fails to provide desired quality of service (QoS) during congestion. In order to provide QoS we have reported three different load sensitive routing (LSR) protocols in [A. Sahoo, An OSPF based load-sensitive QoS routing algorithm using alternate paths, in: IEEE International Conference on Computer Communication Networks, October 2002; A. Tiwari, A. Sahoo, Providing QoS support in OSPF based best effort network, in: IEEE International Conference on Networks, November 2005; A. Tiwari, A. Sahoo, A local coefficient based load sensitive routing protocol for providing QoS, in: IEEE International Conference on Parallel and Distributed Systems, July 2006]. The LSR protocol forwards packets through alternate paths in case of congestion. The number of alternate paths at any node depends on the value of operating parameter or coefficient used for alternate path calculation. Though the basic protocol in these cases was the same, the methods of choosing operating parameter were different. We referred to these three methods as LSR [A. Sahoo, An OSPF based load-sensitive QoS routing algorithm using alternate paths, in: IEEE International Conference on Computer Communication Networks, October 2002], E-LSR [A. Tiwari, A. Sahoo, Providing QoS support in OSPF based best effort network, in: IEEE International Conference on Networks, November 2005] and L-LSR [A. Tiwari, A. Sahoo, A local coefficient based load sensitive routing protocol for providing QoS, in: IEEE International Conference on Parallel and Distributed Systems, July 2006] coefficient methods. In this paper, we present the LSR protocol along with the three coefficient calculation methods pointing out the reason for going from one method to the next. The main strength of our LSR protocol is that it provides loop free alternate paths in the event of congestion and can interwork with routers running vanilla OSPF protocol. We show through simulation that the LSR protocol based on any of the three different coefficient calculation methods performs much better than OSPF and that out of the three methods proposed by us, L-LSR performs the best.

Traffic engineering and congestion control for open shortest path first networks

Open shortest path first (OSPF) is the most widely used intra-domain Internet routing protocol. The OSPF protocol directs the Internet traffic along the shortest paths that are defined by the links weight. Traffic engineering is responsible for improving the network performance, for instance, the objective function that minimizes the maximal link utilization which is usually adopted to avoid the network congestion. This paper formulates the model of OSPF routing, and further evaluates the performance of different approaches. We also propose a heuristic algorithm to solve the routing problems by optimizing OSPF weights. Computational results indicated that the proposed algorithm could lead to good load balancing, and make efficient utilization of network resources.