Performance Analysis and Route Optimization: Redistribution between EIGRP, OSPF & BGP Routing Protocols

This Research paper implemented the stability of OSPF LSAs-types in IXP by utilizing the complexity area with a high-speed data rate. The multiple stubs, discontiguous areas, and multiple routing protocols are deployed to be intended for ISP/IXP. When the stubby which managed the entering external or internal information database of LSA are analyzed and changed the LSAs-types, router types, and routing protocol. And then, the redistribution or External summary are applied to communicate different Routing Information protocol as (IGP, EGP). The RIPv2 and EIGRP routing protocol are configured to examine the external routing protocol. Furthermore, Totally NSSA and the Totally stubs operations are described as a coherent system in this system. The end-to-end throughputs are better improved, after using a stub, NSSA. And then, the security of routing information is safe and some IP was been the hidden system for each section. The OSPF algorithm with SPF is link update and boost routing information protocol table, database system.

Recent studies reveal that the routing structures of operational networks are much more complex than a simple BGP/IGP hierarchy, highlighted by the presence of many distinct instances of routing protocols. However, the glue (how routing protocol instances interact and exchange routes among themselves) is still little understood or studied. For example, although Route Redistribution (RR), the implementation of the glue in router software, has been used in the Internet for more than a decade, it was only recently shown that RR is extremely vulnerable to anomalies similar to the permanent route oscillations in BGP. This paper takes an important step toward understanding how RR is used and how fundamental the role RR plays in practice. We developed a complete model and associated tools for characterizing interconnections between routing instances based on analysis of router configuration data. We analyzed and characterized the RR usage in more than 1600 operational networks. The findings are: (i) RR is indeed widely used; (ii) operators use RR to achieve important design objectives not realizable with existing routing protocols alone; (iii) RR configurations can be very diverse and complex. These empirical discoveries not only confirm that the RR glue constitutes a critical component of the current Internet routing architecture, but also emphasize the urgent need for more research to improve its safety and flexibility to support important design objectives.

Dynamic Multipoint Virtual Private Network (DMVPN) technology is one of Cisco's solutions to overcome the limitations of VPN scalability. DMVPN has a combination of components: Next hop resolution protocol (NHRP), Multipoint Generic Routing Encapsulation (mGRE) and Routing protocol. This research implements a simple network consisting of Hub, Spoke1, Spoke2, Lan1, Lan2 and Lan3 using the GNS3 simulator. This study compares the performance of IPSec and without IPsec on DMVPN using the BGP Routing protocol on performance parameters namely delay, throughput, jitter and packet loss to evaluate the security impact of the DMVPN network. The results of this study indicate that IPSec DMVPN has an effect on sending UDP packets which have a throughput value without IPSec of 5082.18 kbit/s while IPSec's throughput is 5034.40 kbit/s. The value of packet loss without IPSec has a value of 7.54% while IPSec has a value of 4.79%. The results of the jitter value have the same value. The delay value without IPSec has a value of 0.183s while the IPSec delay value is 0.410s. TCP packet delivery has a throughput value without IPSec is 1139.16 kbit/s while the IPSec throughput value is 1105.20 kbit/s. The results of the packet loss value and the jitter value have the same value. The delay value without IPSec has a value of 0.185s while the IPSec delay value is 0.187s.

If a problem with IP communication occurs, IP network operators refer to the routing tables of the affected routers to check the routes to the destinations. There are a number of methods currently used for referring to routing tables. However, operators cannot refer to past routing tables using existing methods. The past routing tables are useful for IP network operation. For example, operators can find out how the influence of a network problem on routes spreads to the network by checking fluctuations in each routerpsilas routing table. In this paper, we propose a method of collecting every routerpsilas routing table within a domain based on the monitoring of routing protocols. In our method, we collect routing protocol messages and calculate all routerspsila routing tables within a domain in a concentrated manner using the same way where each router within a domain calculates its routing table. Routing tables are calculated whenever route status in IP networks changes, and calculated routing tables are stored so that operators can refer to them at any time in the future.

Ad Hoc Routing with Distributed Ordered Sequences

Simultaneous link failures are common in IP networks [1]. In this paper, we develop a technique for locating multiple failures in Service Provider or Enterprise IP networks using active measurement. We propose a two-phased approach that minimizes both the additional traffic due to probe messages and the measurement infrastructure costs. In the first phase, using elements from max-plus algebra theory, we show that the optimal set of probes can be determined in polynomial time, and we provide an algorithm to find this optimal set of probes. In the second phase, given the optimal set of probes, we compute the location of a minimal set of measurement points (beacons) that can generate these probes. We show that the beacon placement problem is NP-hard and propose a constant factor approximation algorithm for this problem. We then apply our algorithms to existing ISP networks using topologies inferred by the Rocketfuel tool [2]. We study in particular the difference between the number of probes and beacons that are required for multiple and single failure(s) diagnosis.

Routing is one of the key problems in Wireless Sensor Network (WSN). A routing protocol based on routing table named SPBT (Sensor protocol based on routing table) was put forward. In the routing protocol, route tables were used to simplify the data transmission process to save energy, and the strategy for equilibrium of using energy and route optimization was used to establish routes. In order to improve the reliability of data transmission, the strategy of trace-back was adopted. In simulation, the table-based protocol was compared with the protocol SPIN. The results show that the protocol SPBT can use energy effectively with equilibrium of using energy and shortened delay.

Adhoc network computing is necessary in the present IT business since adhoc networks play such a huge role in it. Making computer talents connected to information technology available on demand using the pay-as-you-use payment model is the practice under question (PAYU). It is conceptualized as a collection of computational resources that has been developed rationally. Only virtualization, a crucial component, makes it feasible to provide ad hoc network computing services. By utilizing the underlying physical computing resources, such as processing power, memory, servers, programs, and other essential resources for calculation, this approach enables the creation of logical or virtual resources (instances). Due to the cost savings associated with virtualization, Adhoc Network service providers could be able to reduce their initial investments. It results in more efficient use of the available computational resources. When employing a virtualization approach to generate many resources or instances, it is vitally crucial for the users to determine whether these virtual resources satisfy, the criteria that have been set users have set outtake several forms, one of which is the creation of Routing Protocols (VMs). When multiple Routing Protocols are created by utilizing the underlying physical computing resources, it is essential for the user that these Routing Protocols perform processing without interrupting the other, as well as without any interruption from outsiders such as intrusions, malware, hackers, etc., It is essential for the user that these Routing Protocols perform processing without interrupting the other It is necessary for the user that these Routing Protocols perform processing without interrupting the other It is of the utmost importance to have a thorough understanding of how to prevent assaults, incursions, and system failures. In this article, we introduce several different approaches, each of which makes use of a variety of security components, such as a security watchdog, an IDSIPS system, a security framework, an access control framework, a security supervisor, etc., to provide the required level of security for the Routing Protocols and their required resources. This is accomplished by enabling the Routing Protocols to function normally and without any problems from the outside or the inside of the working environment, all while making use of the accessible.

The wider  scope of a network, it cannot be denied that the number of nodes on the network will increase. This of course will affect the performance of the routing protocol used. So it is necessary to do research to determine the performance of the routing protocol used when given the number of routers on the network to be built. In this study the author tries to analyze the comparison of different routing protocols, OSPF and RIPv2 if given variations in the number of routers running on MPLS and without using MPLS Networks in the GNS3 simulator.  The research was conducted by simulating networks that have been configured OSPF and RIPv2 routing protocols with MPLS and without MPLS in the GNS3 simulator. Testing is done by taking data as much as ten repetitions by generating UDP packets. In testing given different bandwidth variations. Based on the results of the study, it was found that MPLS technology can improve the performance of the OSPF and RIPv2 routing protocols.

A Mobile Ad-hoc Network (MANET) is a wireless network in which nodes, in the absence of fixed access points, communicate via single or multi-hop paths. Each node in a MANET should thus be able to perform necessary routing functions, and a MANET routing protocol should be able to adapt fast and effectively to sudden changes in network layout. Providing trustworthy Quality of Service guarantees in a MANET is very challenging due to the dynamic and uncertain nature of these networks

This chapter introduces a greedy approach for delay monitoring of IP networks. It proposed two-phased monitoring scheme that ensures complete coverage of the network from both links and paths point of views, and it minimizes the monitoring overhead on the underlying production network. In the first phase it computes the locations of monitoring stations such that all network links or paths are covered by the minimal number of stations. Subsequently, in the second phase, it computes the minimal set of probe messages to be sent by each station such that the latency of every routing path can be measured. Unfortunately, both the station selection and the probe assignment problems are NP-hard. However, by using greedy approximation algorithms the scheme finds solutions close to the best possible approximations to both the station selection and the probe assignment problems. Further, the experimental results demonstrate the effectiveness of the presented algorithms for accurately monitoring large networks with very few monitoring stations and probe messages close to the number of network links.

Local Area Network (LAN) is a group of computers connected in an area that is not so broad in one office or building. The routing protocol makes the network more efficient in exchanging data, the EIGRP routing protocol is a distance vector routing protocol that uses metric calculations like EIGRP. Activities in SMK AL-KHAIRIYAH 1 have used a computer as a tool, and do not have a LAN network. The problem is that data sharing is limited, no computer server connects to make it easier to store data and backup in an organized manner. The data collection techniques used direct observation at SMK Al-Kahiriyah 1 and interviewing the principal. The result of the research is that the LAN network system uses the EIGRP routing protocol that allow all necessary data to stored on the server and facilitate data exchange and processing.

A Mobile Ad Hoc Network (MANET) protocol requires proper settings to perform data transmission optimally. To overcome this problem, it is necessary to select the correct routing protocol and use the routing protocol’s default parameter values. This study examined the effect of route request parameters, such as RREQ_RETRIES and MAX_RREQ_TIMOUT, on the Ad Hoc On-demand Distance Vector (AODV) protocol, which was then compared with the default AODV performance Optimized Link State Routing (OLSR) protocols. The performance metrics used for measuring performance were Packet Delivery Ratio (PDR), throughput, delay, packet loss, energy consumption, and routing overhead. The results show that the OLSR protocol has a smaller delay than the AODV protocol, while in other measurements, the AODV protocol is better than OLSR. By reducing the combination value of RREQ_RETRIES, MAX_RREQ_TIMEOUT in AODV routing to (2, 10 s) and (3, 5 s), the protocol’s performance can be improved. The two combinations result in an average increase in throughput performance of 3.09%, a decrease in delay of 17.7%, a decrease in packet loss of 27.15%, and an increase in PDR of 4.8%. For variations in the speed of movement of nodes, 20 m/s has the best performance, while 5 m/s has the worst performance.

UNUD GDLN building located in UNUD Sudirman campus acts as an information and communication technology service center as an internet access service provider, radio broadcast and online learning. The UNUD Campus network currently uses a static hybrid routing protocol, where the static routing protocol has the disadvantage that the network administrator must always reconfigure the network if there is a topology change. The Open Shortest Path First (OSPF) dynamic routing protocol can be used as a solution to overcome the weaknesses of static routing protocols because it is more suitable for larger networks and has the advantage of automatically determining the best route. This research aims to analyze the application of OSPF routing protocol in UNUD Denpasar Campus with GNS3 simulation. This research uses Quality of Service (QoS) parameters to analyze network performance, and test scenarios by PING with large data transmission that imitates YouTube video streaming. The results showed that OSPF dynamic routing protocol has better performance and has met the TIPHON standard with very good results for packet loss, throughput, and delay parameters and good results for jitter parameters. Tests on static routing protocol simulations and OSPF routing protocols are carried out by comparing the transmission process based on the resolution on YouTube video streaming imitation, starting with 360p, 480p, 720p and 1080p resolutions. Based on the results of the study, it can be concluded that OSPF routing is more suitable and produces better parameter values when transmitting streaming video with a resolution of 480p, 720p and 1080p, while the transmission of streaming video with a resolution of 360p is more suitable for static routing which is more suitable for transmission with lower resolutions.

Service providers and enterprises all over the world are rapidly deploying Voice over IP (VoIP) networks because of reduced capital and operational expenditure, and easy creation of new services. Voice traffic has stringement requirements on the quality of service, like strict delay and loss requirements, and 99.999% network availability. However, IP networks have not been designed to easily meet the above requirements. Thus, service providers need service quality management tools that can proactively detect and mitigate service quality degradation of VoIP traffic. In this paper, we present active and passive probes that enable service providers to detect service impairments. We use the probes to compute the network parameters (delay, loss and jitter) that can be used to compute the call quality as a Mean Opinion Score using a voice quality metric, E-model. These tools can be used by service providers and enterprises to identify network impairments that cause service quality degradation and take corrective measures in real time so that the impact on the degradation perceived by end-users is minimal