bina, darma (2022) IMPLEMENTASI ALGORITMA DIJKSTRA PADA PROTOKOL ROUTING OPEN SHORTEST PATH FIRST DENGAN MENGGUNAKAN SIMULASI GNS3. MPLEMENTASI ALGORITMA DIJKSTRA PADA PROTOKOL ROUTING OPEN SHORTEST PATH FIRST DENGAN MENGGUNAKAN SIMULASI GNS3.
|
Text
JURNAL SITI.pdf Download (831kB) | Preview |
Abstract
A process in a computer network that is very important for data communications can run well called routing. In the routing process requires a routing algorithm that serves to direct and determine the best path or alternative path if there is a path that is broken (down) to be passed the data packets from the source node to the destination node. There are many routing algorithms used in computer networks, and one of them is the Dijkstra Algorithm which is also known as link-state algorithm. In this research will discuss about work system Dijkstra Algorithm on OSPF routing protocol. For the manufacture of Dijkstra Algorithm simulation, using GNS3 software, while to calculate the quality of the network through QoS which aims to know the management of bandwidth, packet loss, and response time. Measurement of parameters that m using the packet monitoring application that is Axenetools by means of sending ICMP packets on each client is determined by time, after which time the researcher finished observing the number of packets received during the delivery of the ICMP packet. With this research is expected to be a reference about routing algorithms in general and Dijkstra Algorithm in particular.
| Item Type: | Article |
|---|---|
| Subjects: | T Technology > T Technology (General) |
| Divisions: | Faculty of Engineering, Science and Mathematics > School of Electronics and Computer Science |
| Depositing User: | Mr Edi Surya Negara |
| Date Deposited: | 19 Jun 2022 12:31 |
| Last Modified: | 19 Jun 2022 12:31 |
| URI: | http://eprints.binadarma.ac.id/id/eprint/12436 |
Actions (login required)
 |
View Item |
