Design Analysis of OSPF (Open Shortest Path First) Routing by Calculating Packet Loss Of Network WAN (Wide Area Network)

Abstract

In companies both large and small, they must always communicate and exchange data to other divisions at a considerable distance. In carrying out the process of data exchange, it is not uncommon for the data to suffer damage and some do not even reach the destination, the incident is known as packet loss. Therefore, a routing protocol is needed to solve the problem. OSPF routing is the right routing to be implemented. Because, OSPF routing uses Dijkstra’s algorithm to find the closest distance, OSPF determines the best path based on the lowest cost and OSPF also divides its network into several levels, so the information dissemination on each router becomes that has been done, messages time from PC to PC get a range of values of 0.25%. Based on the analysis table of packet loss, the packet is categorized very well, because the packet sent is not much lost.

Energy Access in the Village of Gunung Arba, Jango Village from the Perspective of Environmental Justice in Central Lombok District Community

“…Invention well oil moment This controlled by entrepreneurs coal around Lombok middle In 2018 level realization production oil reached 30,000 BPOD or 109% above the company target of 25,649 BPOD. For realization Gas production reaches 50 MMSCFD (Million Standard cubic feet per day or million cubic feet of gas per day) or equivalent with 120% above the RKAP target of 588 MMSCFD (Diansyah et al, 2019). Based on this data prove that source Power nature in the field oil and natural gas is very large.…”

Analisis Performa Open Shortest Path First Load Balancing dengan Metode Cost Manipulation

“…Kegagalan transfer paket data dalam suatu jaringan menjadi sebuah ancaman yang besar, baik disebabkan oleh kegagalan link maupun beban traffic yang padat [4][5][6][7]. Load Balancing merupakan sebuah teknik yang digunakan untuk melakukan distribusi beban traffic pada dua ataupun lebih jalur konektifitas secara seimbang, dengan tujuan mengoptimalkan jaringan, memaksimalkan throughput, serta memperkecil terjadinya delay pada jaringan dan meminimalisir terjadinya overload terhadap salah satu jalur koneksi [8][9][10][11][12][13].…”

“…Serta pada penelitian lainnya, didapatkan hasil Routing protokol MPLS OSPF menghasilkan kinerja baik pada parameter delay dengan nilai delay terbesar yang didapat 11 milidetik dan memiliki penurunan throughput pada saat dilakukan gangguan link failure [10]. Pengujian kinerja routing protokol OSPF dikatagorikan sangat baik setelah melakukan beberapa pengiriman paket dan didapatkan packet loss yang didapatkan dengan rata-rata 2,09% [11].Perbedaan dengan penelitian ini, jika terjadi link failure maka packet loss yang didapatkan sebesar 3 packet loss dengan rata-rata packet loss yang terjadi sebesar 0,6 packet. Pengujian lainnya adalah pengujian lama waktu router melakukan konvergensi kembali ketika terjadi perubahan jaringan atau link utama jalur paket putus, pengujian ini berdasarkan client adalah streaming video didapatkan protokol OSPF menggunakan cost sebagai metriknya [14].…”

Minimizing the Number of Distrustful Nodes on the Path of IP Packet Transmission

“…These are works of a system-wide nature, which analyze, for example, static and dynamic routing 2 of 16 or centralized and decentralized routing [2,3], as well as works that analyze, compare, and improve specific protocols under certain conditions. In particular, many works are devoted to the implementation of the widely used OSPF protocol in Wide Area Networks (WANs) [4][5][6][7][8][9]. Different tools are used for routing research, such as the Riverbed Modeler [10], the GNS3 [7], the Cisco Packet Tracer simulator [11], etc.…”