PENGARUH MODEL JARINGAN TERHADAP OPTIMASI ROUTING OPEN SHORTEST PATH FIRST (OSPF)
Main Authors: | Moonlight, Lady Silk, Suhardi, Suhardi |
---|---|
Format: | Article info application/pdf eJournal |
Bahasa: | eng |
Terbitan: |
Universitas Pesantren Tinggi Darul 'Ulum (Unipdu) Jombang
, 2012
|
Online Access: |
http://journal.unipdu.ac.id:8080/index.php/teknologi/article/view/56 http://journal.unipdu.ac.id:8080/index.php/teknologi/article/view/56/48 |
ctrlnum |
article-56 |
---|---|
fullrecord |
<?xml version="1.0"?>
<dc schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><title lang="en-US">PENGARUH MODEL JARINGAN TERHADAP OPTIMASI ROUTING OPEN SHORTEST PATH FIRST (OSPF)</title><creator>Moonlight, Lady Silk</creator><creator>Suhardi, Suhardi</creator><description lang="en-US">ABSTRAK Routing merupakan proses mengirim data dari satu network ke network lain. Dengan dynamic routing maka mekanisme routing dilakukan secara dinamis dengan menentukan jarak terpendek secara cepat dan akurat antara peralatan pengirim dan penerima. Open Shortest Path First (OSPF) merupakan salah satu protokol dynamic routing yang menggunakan algoritma link-state untuk membangun dan menghitung jalur terpendek ke semua tujuan yang diketahui. OSPF mendistribusikan informasi routing antara router-router autonomous system (AS). OSPF memiliki titik berat pada kinerja processor, kebutuhan memori dan konsumsi bandwidth. Oleh karena itu perlu mengoptimalkan kinerja protokol routing OSPF terutama masalah pengaruh bandwith dengan menentukan model dan area jaringan routing OSPF. Kata kunci : routing, rynamic routing, OSPF ABSTRACT Data sending processes from one to the other networks is called to be Routing. Using the dynamic routing, the routing mechanism is dynamically done by swiftly and accurately determining the shortest route between sender and receiver. One of the dynamic routing protocols is the Open shortest path first (OSPF) using link-state algorithm to build and count the shortest route to the all known destination. OSPF distributes routing information between system autonomous routers (AS). The focus of OSPF is in the processor activity, memory needs and bandwidth consumption.  There are needs to optimize OSPF routing protocol activity by determining OSPF routing network area and model especially to the bandwidth influence. Key words: routing, dynamic routing, OSPF</description><publisher lang="en-US">Universitas Pesantren Tinggi Darul 'Ulum (Unipdu) Jombang</publisher><contributor lang="en-US"/><date>2012-05-07</date><type>Journal:Article</type><type>Other:info:eu-repo/semantics/publishedVersion</type><type>Journal:Article</type><type>File:application/pdf</type><identifier>http://journal.unipdu.ac.id:8080/index.php/teknologi/article/view/56</identifier><identifier>10.26594/teknologi.v1i2.56</identifier><source lang="id-ID">TEKNOLOGI: Jurnal Ilmiah Sistem Informasi; Vol 1, No 2 (2011): July</source><source lang="en-US">Teknologi: Jurnal Ilmiah Sistem Informasi; Vol 1, No 2 (2011): July</source><source>2527-3671</source><source>2087-8893</source><language>eng</language><relation>http://journal.unipdu.ac.id:8080/index.php/teknologi/article/view/56/48</relation><recordID>article-56</recordID></dc>
|
language |
eng |
format |
Journal:Article Journal Other:info:eu-repo/semantics/publishedVersion Other File:application/pdf File Journal:eJournal |
author |
Moonlight, Lady Silk Suhardi, Suhardi |
title |
PENGARUH MODEL JARINGAN TERHADAP OPTIMASI ROUTING OPEN SHORTEST PATH FIRST (OSPF) |
publisher |
Universitas Pesantren Tinggi Darul 'Ulum (Unipdu) Jombang |
publishDate |
2012 |
url |
http://journal.unipdu.ac.id:8080/index.php/teknologi/article/view/56 http://journal.unipdu.ac.id:8080/index.php/teknologi/article/view/56/48 |
contents |
ABSTRAK Routing merupakan proses mengirim data dari satu network ke network lain. Dengan dynamic routing maka mekanisme routing dilakukan secara dinamis dengan menentukan jarak terpendek secara cepat dan akurat antara peralatan pengirim dan penerima. Open Shortest Path First (OSPF) merupakan salah satu protokol dynamic routing yang menggunakan algoritma link-state untuk membangun dan menghitung jalur terpendek ke semua tujuan yang diketahui. OSPF mendistribusikan informasi routing antara router-router autonomous system (AS). OSPF memiliki titik berat pada kinerja processor, kebutuhan memori dan konsumsi bandwidth. Oleh karena itu perlu mengoptimalkan kinerja protokol routing OSPF terutama masalah pengaruh bandwith dengan menentukan model dan area jaringan routing OSPF. Kata kunci : routing, rynamic routing, OSPF ABSTRACT Data sending processes from one to the other networks is called to be Routing. Using the dynamic routing, the routing mechanism is dynamically done by swiftly and accurately determining the shortest route between sender and receiver. One of the dynamic routing protocols is the Open shortest path first (OSPF) using link-state algorithm to build and count the shortest route to the all known destination. OSPF distributes routing information between system autonomous routers (AS). The focus of OSPF is in the processor activity, memory needs and bandwidth consumption. There are needs to optimize OSPF routing protocol activity by determining OSPF routing network area and model especially to the bandwidth influence. Key words: routing, dynamic routing, OSPF |
id |
IOS3567.article-56 |
institution |
Universitas Pesantren Tinggi Darul Ulum Jombang |
institution_id |
470 |
institution_type |
library:university library |
library |
Perpustakaan UNIPDU Jombang |
library_id |
582 |
collection |
TEKNOLOGI: Jurnal Ilmiah Sistem Informasi |
repository_id |
3567 |
subject_area |
Program Komputer dan Teknologi Informasi Rekayasa |
city |
JOMBANG |
province |
JAWA TIMUR |
repoId |
IOS3567 |
first_indexed |
2016-09-22T18:44:30Z |
last_indexed |
2020-08-18T13:26:35Z |
recordtype |
dc |
_version_ |
1685971972296540160 |
score |
17.607508 |