A Fast Rerouting Approach to Reduce Packet Loss during IP Routing Protocols Convergence

Author(s):  
Fernando Barreto ◽  
Emilio C.G. Wille ◽  
Luiz Nacamura
Author(s):  
Unung Verawardina

In a dynamic routing setting a routing protocol is required to perform the settings to find the shortest and best path. Routing protocols are of two types: vector distance and link state. Use of EIGRP routing that includes long-range vectors and link state OSPF Link link state coverage, peg well to be implemented in complex network because it can adapt well. In this research is the method used for routing and speed of time available EIGRP routing and OSPF routing through simulator GNS3 and wireshark application, then analyze the difference of peformance with speed of routing table and speed of time. While for Quality of Service (QoS) compare network service quality from EIGRP and OSPF routing which include delay, packet loss, and throughput. Based on the results of the research shows the EIGRP routing table is better in the selection path, EIGRP smaller time tansfer data then its data transfer faster than the OSPF. Overall Quality Of Service (Qos) delay, packetloss and throughput on EIGRP and OSPF are well balanced and good.


2020 ◽  
Vol 9 (3) ◽  
pp. 40 ◽  
Author(s):  
Afsana Ahamed ◽  
Hamid Vakilzadian

A vehicular ad hoc network (VANET) is a technology in which moving cars are used as routers (nodes) to establish a reliable mobile communication network among the vehicles. Some of the drawbacks of the routing protocol, Ad hoc On-Demand Distance Vector (AODV), associated with VANETs are the end-to-end delay and packet loss. We modified the AODV routing protocols to reduce the number of route request (RREQ) and route reply (RREP) messages by adding direction parameters and two-step filtering. The two-step filtering process reduces the number of RREQ and RREP packets, reduces the packet overhead, and helps to select the stable route. In this study, we show the impact of the direction parameter in reducing the end-to-end delay and the packet loss in AODV. The simulation results show a 1.4% reduction in packet loss, an 11% reduction in the end-to-end delay, and an increase in throughput.


2018 ◽  
Vol 215 ◽  
pp. 01005
Author(s):  
Indra Warman ◽  
Alex Franozal

Every year, the availability of public IPv4 addresses is running low. However, the IETF (Internet Engineering Task Force) has set a new addressing standard called IPv6 (Internet Protocol version 6). IPv6 implementations can not be immediately performed on all end-to-end lines, a transition phase is required, one of which is the GRE tunneling method. IPv6 has some differences with IPv4, then in line with the presence of IPv6 will required the protocol that compatible with IPv6, among which is the routing protocol. Some dynamic routing protocols are created to support and can run on IPv6 such as RIPng and OSPFv3. Aim of this study is examines OSPFv3 routing protocols and RIPng routing protocols in terms of Quality of Service (QoS). The test is done by using seven routers with three scenarios in each routing protocol, ie scenario with best path active condition, when the network changes in other words best path down, and the scenario with best path condition has changed and the network has returned to normal. Testing is done by testing QoS parameters (delay, packet loss, and throughput) when the client computer downloads files with the .iso extension from the server. Downloaded files have different sizes, from 100 Mega Byte to 1 Giga Byte. From the results obtained that OSPFv3 provides better QoS (delay, packet loss, and throughput) than RIPng on integrated IPv6 network using GRE tunnel and can be a reference when going to transition from IPv4 to IPv6 using GRE Tunnel.


2020 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Mohammed S. Al-kahtani ◽  
Lutful Karim ◽  
Nargis Khan

Designing an efficient routing protocol that opportunistically forwards data to the destination node through nearby sensor nodes or devices is significantly important for an effective incidence response and disaster recovery framework. Existing sensor routing protocols are mostly not effective in such disaster recovery applications as the networks are affected (destroyed or overused) in disasters such as earthquake, flood, Tsunami and wildfire. These protocols require a large number of message transmissions to reestablish the clusters and communications that is not energy efficient and result in packet loss. This paper introduces ODCR - an energy efficient and reliable opportunistic density clustered-based routing protocol for such emergency sensor applications. We perform simulation to measure the performance of ODCR protocol in terms of network energy consumptions, throughput and packet loss ratio. Simulation results demonstrate that the ODCR protocol is much better than the existing TEEN, LEACH and LORA protocols in term of these performance metrics.


Sign in / Sign up

Export Citation Format

Share Document