scholarly journals PERBANDINGAN ROUTING PROTOCOL EXTERIOR BGP VERSI 4 DENGAN ROUTING INTERIOR EIGRP PADA ALGORITMA LINKSTATE MENGGUNAKAN PARAMETER PACKET LOSS

2019 ◽  
Vol 3 (2) ◽  
pp. 185
Author(s):  
Muhammad Ikhsan Azhari ◽  
Tengku Mohd. Diansyah ◽  
Ari Usman

Abstract - Computer networks very influential on the speed of transferring data from one computer to another computer by using a PC or server, in this case, the routing configuration is very influential. The best routing route selection is the solution to determine the most rapid and efficient routing, and as the best routing consideration,  the researcher has examined two routings, namely BGP (Border Gateway Protocol) routing and EIGRP (Enhanced Interior Gateway Routing Protocol) using the Cisco Paket Traccer application. After the researcher was done an experiment, the researcher gets the result of the average EIGRP delay that is 54.619 and the packet loss result between EIGRP and BGP is not available (successful packet delivery).  Keywords -  BGP Routing Protocol Exterior, EIGRP Interior Routing, Algorithm Link state, Packet loss Abstrak - Jaringan komputer sangat berpengaruh pada kecepatan transfer data antar satu komputer ke komputer lain baik itu pc maupun server, dalam hal ini konfigurasi routing sangat berpengaruh. Pemilihan jalur routing terbaik merupakan solusi untuk menentukan routing yang paling cepat dan efisien, dan sebagai bahan pertimbangan routing terbaik penulis meneliti dua routing yakni routing BGP (Border Gateway Protocol) dan routing EIGRP (Enhanced Interior Gateway Routing Protocol) mengguanakan aplikasi Cisco Packet Traccer. Setelah dilakukannya percobaan yang penulis perbuat, maka didapatkan hasil dari rata-rata delay EIGRP yaitu 54,619 dan hasil dari packetloss antara EIGRP dan BGP tidak ada (pengiriman paket sukses). Kata Kunci - Routing Protocol Exterior BGP, Routing Interior EIGRP, Algoritma Link state,  Packet loss.

Author(s):  
Hari Antoni Musril

An autonomous system (AS) is the collection of networks having the same set of routing policies. Each AS has administrative control to its own inter-domain routing policy. Computer networks consisting of a bunch of AS's with different routing will not be able to interconnecttion one another. This is causes communication in the network to be inhibited. For that we need a protocol that can connect each different AS. Border Gateway Protocol (BGP) is an inter-domain routing protocol i.e. between different AS  that is used to exchange routing information between them. In a typical inter-network (and in the Internet) each autonomous system designates one or more routers that run BGP software. BGP routers in each AS are linked to those in one or more other AS. The ability to exchange table routing information between Autonomous System (AS) is one of the advantages BGP. BGP implements routing policies based a set of attributes accompanying each route used to pick the “shortest” path across multiple ASs, along with one or more routing policies. BGP uses an algorithm which cannot be classified as a pure "Distance Vector", or pure "Link State". It is a path vector routing protocol as it defines a route as a collection of a number of AS that is passes through from source AS to destination AS. This paper discusses the implementation of the BGP routing protocol in the network that have different AS in order to interconnect. Its application using Packet Tracer 7.0 software for prototyping and simulating network. So that later can be applied to the actual network. Based on experiments that have been carried out, the BGP routing protocol can connect two routers that have different autonomous system.


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.


2018 ◽  
Vol 7 (2.31) ◽  
pp. 203
Author(s):  
Arushi Agarwal ◽  
Ayushi Pandey

Border Gateway Protocol (BGP) is an exterior gateway routing protocol used between various autonomous systems across the internet. BGP helps in selecting the best route for the transmission of data among the users. The transmission policy followed by BGP should be such that it should increase BGP routing performances. This work aims to reduce the convergence time of the network with the improvement of QOS (Quality of Service) in the routing of Border Gateway Protocol. Our results show that we can obtain a reduced framework environment which has a best routing path with better energy and quality, along with reduction in convergence time. 


2018 ◽  
Vol 9 (1) ◽  
pp. 51-65
Author(s):  
Soumen Saha ◽  
Utpal Roy ◽  
D.D. Sinha

Vehicular ad-hoc networks or VANETs are a new method of training an ad-hoc network in traffic. The authors have numbers of routing algorithms on a MANET. But none of them works efficiently in a VANET with respect to being a safe and secure transport system. The authors have proposed a modification on an AODV routing algorithm for VANET with the introduction of the double-ended queue or dqAODV in a request packet header. A comparable good result was found in the throughput. In the present work, the authors introduce a modification of an original AODV by applying a partial re-broadcast of the request packet (RREQ) of an AODV. They found a comparable result in the throughput of the packet delivery aspect for this work with the original algorithm and dqAODV. This is compared to the complexity in the original AODV algorithm.


2019 ◽  
Vol 1 (2) ◽  
Author(s):  
Gede Andika Loka

Router is the network equipment for route the packet from one network segment to another in a bigscale network. Router can route packet because there is a routing table in router configuration. Routing table is anaddress list of source and destination address where the packet will be routed. There are two methods of routing tableconfiguration, static routing and dynamic routing. Static routing is a routing table configuration method where all ofrouting table content is configured manually, usually for a small scale of network. Dynamic network is a routing tableconfiguration method by the router automatically, usually for a big scale of network. A dynamic routing is built fromthe routing information collected by the routing algorithm. There are two routing algorithm, link-state and distancevector algorithm. This simulation will be built in GNS3 simulation software. Goal of this research is to compare theperformance between that two algorithm from two routing protocol that using each of those two algorithm. Thecomparison will be running between OSPF routing protocol on the link state routing protocol and EIGRP on thedistance vector routing protocol side. The result of this analysis and comparison of those two routing protocol isexpected to be a reference of choosing better routing protocol in building a network


Author(s):  
Linna Oktaviana Sari ◽  
Agusurio Azmi ◽  
Ery Safrianti ◽  
Feranita Jalil

Pekanbaru city is a large area, therefore traffic congestion often occurs due to the density of society’s vehicles. From this problem, it is needed a technology that can exchange information between vehicles. Information Technology that can involve many vehicles with special network types without dependence on an infrastructure is Ad Hoc Network. One type of this network is Vehicular Ad Hoc Network (VANET). VANET is a new concept in enabling communication between Vehicle to Vehicle (V2V). For efficient data packet delivery, VANET requires a routing protocol. In this research, for simulated and analyzed performance is used the Dynamic Source Routing (DSR) and Temporally Ordered Routing Algorithm (TORA) protocol. NS-2 is used to simulated a moved nodes, SUMO software is used to simulated real map of SKA Mall crossroad and parameter the quality of performance routing protocol DSR can determined by End to End Delay, Packet Delivery Ratio (PDR) and Routing Overhead (RO). This simulation uses scenario 100 nodes, 150 nodes, 200 nodes and 250 nodes. The simulation results with the scenario of changing the number of nodes, the DSR routing protocol produces better performance with an average of  End to End Delay is 0.1066 s, average of PDR is 95.45% and average of RO is 1.0076. While the TORA routing protocol has an average of End to End Delay is 0.1163s, average of PDR is 93.49% and average of RO is 1.0801. And in the scenario of node speed changes, the TORA routing protocol produces better performance with an average of End to End Delay is 0.0861 s and average of PDR 97.37%. While the DSR routing protocol is better with an average of RO is 1.0076.


Author(s):  
Muhammad Nur Alfani ◽  
Bambang Sugiantoro

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.


2021 ◽  
Vol 13 (1) ◽  
pp. 32
Author(s):  
Hendra Bayu Susueno ◽  
Imam Tri Wibowo ◽  
Siti Ummi Masruroh ◽  
Dewi Khairani ◽  
I’im Umamil Khoiri

In the digital era is , the internet becomes a necessity . the increasing number of internet usage by various parties encourages ISPs to improve their service quality . To overcome the problem the IETF has introduced a service Multiprotcol . MPLS-TE allows for schemes TE where the tip router of the label switched path (LSP) can calculate the many routes efficiently through the network to the router tip of the tail of the LSP. TE consists of three steps principal that is the size , model, and control . MPLS-TE allows for schemes TE where the tip router of the label switched path (LSP) can calculate the many routes efficiently through the network to the router tip of the tail of the LSP. ISIS is one of the routing protocol that was created for the OSI mode, using the method of link state as a method of collecting the route , ISIS also will perform the collection of information and the status of all the links that exist in the network . Analysis of the IS-IS routing protocol with the Multiprotocol label switch Traffic Engineering based on the parameters of quality of service (QoS), namely throughput and packet loss where the simulation uses the GNS3 network emulator. The test results prove that the values of throughput and packet loss are not much different.


2013 ◽  
Vol 11 (10) ◽  
pp. 3065-3070
Author(s):  
Roopali Garg ◽  
Guneet Kaur

Mobile ad hoc network is an assembly of mobile nodes with no centralized server. Due to mobility of nodes and decentralized network it is difficult to maintain the quality of service (QoS) in routing the packets from source to destination.  QoS can be defined in terms of various metrics like delay, bandwidth, packet loss, routing overhead, jitter. Routing can be unicast, multicast or multipath.  This paper presents the description about the QoS multipath routing algorithm.


Sign in / Sign up

Export Citation Format

Share Document