Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 786 papers for “Open Shortest Path First”

Open Shortest Path First IGP S. Hegde

Internet-draft P. Sarkar · 2015

draft-hegde-ospf-link-overload-00 Many OSPFv2 or OSPFv3 deployments run on overlay networks provisioned by means of pseudo-wires or L2-circuits. when the devices in the underlying network go for maintenance, it is useful to divert the traffic away from the node before the maintenance is actually scheduled. Since the nodes in the underlying network are not visible to OSPF, existing stub router mechanism described in [RFC3137] cannot be used. It is useful for routers in OSPFv2 or OSPFv3 routing domain to be able to advertise a link being in overload state to indicate impending maintenance activity in the underlying network devices. This document describes the protocol extensions to disseminate link overload information in OSPFv2 and OSPFv3 protocol.

Cited by 0

Konfigurace směrovacího protokolu Open Shortest Path First

Wolf, Jakub · Brno University of Technology Digital Library (Brno University of Technology) · 2011

Diplomová práca popisuje možnosti smerovacieho protokolu Open Short Path First (OSPF) v základnej konfigurácii a implementáciu do autonómneho systému. Teoretická časť rozoberá základny počítačových sietí a rozdelenie podľa rôznych kritérií. Ďalej popisuje spôsob adresovania v sieti Internet pomocou Internet Protocol (IP) adries a využívané princípy delenia rozsahov IP adries. Praktická časť pozostáva z dvoch projektov vytovrených v simulačnom programe. Prvý simuluje počítačovú učebňu so všetkými sieťovými zariadeniami a počítačovými stanica. Druhý projekt je úloha pre študentov, zameraná na simuláciu protokolu OSPF v autonómnom systéme. V úlohe je využité rozšírenie simlačného programu, ktoré umožňuje kooperatívnu prácu študentov na viacerých počítačoch pre realizáciu úlohy. V závere práce sú použité postupy zdokumentované. Súčasťou diplomovej práce je webová prezentácia.

Cited by 0Open access

Configuration of Open Shortest Path First routing protocol

Wolf, Jakub · Brno University of Technology Digital Library (Brno University of Technology) · 2011

A diploma thesis introduces possibilities of the routing protocol OSPF, basic configurations and implementation into an autonomous system. A Theoretical part shows computer networks fundamentals and divide them into several groups according to standarts. It also include a part about addressing scheme in the Internet network and the ways how to subneted networks. A practical part consists of two project, that are create in a simulation program. The first simulates classroom, all the network devices and the computers are included. The second is an exam made for student to introduce OSPF in the autonomous system. The Exam uses new type of an extension, that allow student cooperate together by solving the exam. A summary contains all technique disposed in both simulations and a web presentation.

Cited by 0

Open shortest path first (OSPF) routing protocol simulation

Deepinder P. Sidhu, Tayang Fu, Shukri Abdallah et al. · 1993

Open Shortest Path First (OSPF) is a dynamic, hierarchical routing protocol designed to support routing in TCP/IP networks. A simulation of the OSPF Election Protocol shows three results: (1) The Designated Router (DR) can be elected in constant time. (2) If a router has a limited number of input buffers, a competition for buffers between the Election and the Flooding Protocols increases the election time and causes an oscillatory behavior.At each router, the Router-ID of the DR continuously changes causing instability. (3) In the worst case, when the DR and the BDR fail at the same time, the DR-agreement-time is bounded above by twice the HelloInterval. A simulation of the OSPF Flooding Protocol, using 20, 50 and 80 router point-to-point networks, shows three results: (1) For the 50 router network, as link speed exceeds 4000 Kbps, the probability of overflowing the input buffers increases causing retransmissions. The increase in bootup-convergence-time from retransmissions is bounded by two and three times the RxmtInterval for link speeds of 4000 to 6000 Kbps and above 50 Mbps respectively. The increase in the bootup-convergence-time is due to large number of unacknowledged flooding packets received within RxmtInterval. (2) For 20 and 50 router networks, the input buffer size has little impact on the bootup-convergence-time. For the 80 router network, a small change in the input buffer size drastically changes the bootup-convergence-time. (3) Reducing the value of the RxmtInterval lowers the bootup-convergence-time at high link speeds.

Cited by 35Open access

SIMULASI ALGORITMA DIJKSTRAPADA PROTOKOL ROUTING OPEN SHORTEST PATH FIRST

Eman Suherman, Sudjadi Sudjadi, Agung Budi Prasetijo · 2011

Perkembangan teknologi perutean data pada jaringan komputer pada dasarnya bertujuan untuk mengoptimalkan kemampuan memilih rute terbaik pada sekumpulan jaringan komputer. Teknologi perutean data yang digunakan di Internet saat ini adalah protokol routing Open Shortest Path First. Jenis algoritma routing yang digunakan protokol routing open shortest path first adalah routing keadaan link, dimana routing keadaan link membentuk peta jaringan dalam tiga tahap. Tahap pertama setiap router mengenali seluruh tetangganya. Tahap berikutnya, router-router saling bertukar informasi keadaan link, dan tahap terakhir setiap router menghitung jarak terpendek ke setiap tujuan menggunakan algoritma Dijkstra Tugas akhir ini mensimulasikan algoritma Dijkstra dalam menentukan (menghitung) rute terpendek ke setiap host tujuan dalam suatu topologi jaringan. Dalam menentukan (menghitung) rute terpendek ke setiap host tujuan dalam suatu topologi jaringan, hasil simulasi dibandingkan dengan algoritma Dijkstra secara teori.

Cited by 2

Extending Open Shortest Path First for Mobile Ad Hoc Network Routing

Katherine E. Isaacs, Julie Hsieh, Melody Moh · 2012

Mobile ad hoc networks (MANETs) face many challenges due to the diverse nature of their nodes and the fluidity of their topology. Routing is central to the efficiency and scalability of MANETs. Open Shortest Path is the most widely used intradomain routing protocol on the Internet. Routing—the determination of paths for data flow throughout the network—is especially challenging in a MANET. The wide variety of devices, topologies, and other network characteristics alters the issues the routing algorithm must address. With limited resources, the demands for efficiency and scalability are heightened. The most common way to classify a protocol is based on whether they store all possible routes. If a routing scheme constantly keeps an up-to-date routing table, it is called proactive or static. If it only searches for routes on-demand, it is called reactive, dynamic, or adaptive.

Cited by 0Open access

Adaptive Optimized Open Shortest Path First Algorithm using Enhanced Moth Flame Algorithm

Pertik Garg, Asuh Gupta · Indian Journal of Science and Technology · 2017

Objective: To builds up a versatile algorithm in view of Open Shortest Path First (OSPF) algorithm by using improved moth flame optimization. The designed algorithm gives the upgraded performance even with dynamic topology. Methods/Statistical Analysis: The optimized OSPF algorithm utilizes the directing conduct of moth to exchange the information from source to destination. The optimized OSPF algorithm performs well however the execution debases with frequently change in topology. This work upgrades the optimized OSPF by changing the path of moth based on the delay parameter. Additionally, the neighbor determination criteria have been changed to diminish the delay. Findings: The analysis of the adaptive optimized OSPF algorithm for the dynamic network has been finished by utilizing delay and energy consumption. The performance of the outlined algorithm is done with existing OSPF, modified OSPF and the optimized OSPF algorithm. The reduced delay and energy consumption as contrasted with optimized OSPF and OSPF based algorithms demonstrates the significance of algorithm. Application/Improvements: The adaptive optimized OSPF can be used for routing for the dynamic networks. The algorithm can be utilized where dependable information conveyance is required with least deferral. Keywords: Adaptive, Delay, Moth-Flame, Optimized OSPF, Routing

Cited by 4Open access

Optimasi Simulasi Routing OSPF (Open Shortest Path First) di Bandara Soekarno Hatta

Lady Silk Moonlight · Jurnal Penelitian · 2018

Bandar Udara Internasional Soekarno-Hatta adalah bandara terbesar di Indonesia dengan luas mencapai 18 km2, dengan rute penerbangan mencapai 1657 penerbangan setiap hari, yang merupakan penerbangan terbanyak se-Indonesia. PT. Angkasa Pura II merupakan Badan Usaha Milik Negara yang mengelola pelayanan jasa kebandar-udaraan di Bandara Soekarno Hatta. Bandara ini memiliki 3 Terminal Penumpang yaitu T1, T2, dan T3. Masing-masing terminal tersebut mempunyai beberapa sub terminal. Oleh karena begitu luas area pengelolaan dan begitu padat aktifitas penerbangan di Bandara Soekarno-Hatta, maka perlu adanya topologi dan konfigurasi jaringan yang tepat untuk mengoptimalkan koneksi antar terminal di Bandara Soekarno Hatta. Pada Penelitian ini, digunakan routing OSPF (Open Shortest Path First) dengan berbagai jenis topologi dan konfigurasi area untuk menentukan routing yang paling optimal yang dapat diterapkan di Bandara Soekarno Hatta.

Cited by 0Open access

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

Mochamad Wahyudi, Firmansyah Firmansyah · Matrik Jurnal Manajemen Teknik Informatika dan Rekayasa Komputer · 2022

Quality of Service (QoS) di dalam sebuah layanan jaringan menjadi faktor terpenting untuk memastikan kapasitas transfer paket data. Salah satunya pemilihan protokol routing yang akan digunakan. Routing Protokol Open Short Path First (OSPF) menggunakan metode Cost Manipulation mampu menjadi sebuah alternatif solusi untuk mamastikan QoS di dalam layanan jaringan dikarenakan metode Cost Manipulation mampu memilih jalan terbaik menuju network tujuan tanpa mempertimbangkan kembali metrik yang seharusnya, baik shortest path ke network tujuan ataupun bandwidth-nya. Hasil pengujian tracerroute sebelum pengimplementasian OSPF cost manipulation didapatkan hanya menggunakan 1 (satu) single line saja dan packet loss yang didapatkan saat terjadinya link failure dengan pengiriman 907 packet data adalah 1,4 packet loss. Sedangkan setelah pengimplementasi OSPF cost manipulation dapat menggunakan 2 (dua) dual line sebagai load balancing dan packet loss yang didapatkan menurun dengan hasil rata-rata sebesar 0,6 packet loss dan pengimplementasian cost manipulation mampu membagi transfer paket data dengan sama rata.

Cited by 0Open access

ANALISIS QOS VLAN BERBASIS ALGORITMA DIJKSTRA PADAROUTING OPEN SHORTEST PATH FIRST (OSPF)

Muhammad Nur Alfani · 2016

As an institution engaged in education SMK Muhammadiyah Yogyakarta 03 requires adequate 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 routing 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. Making paths made by considering various aspects of the parameters that affect network traffic. OSPF can minimize down on network infrastructure caused by the burden 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 obtained from the measurement parameter delay 150 ms, packet loss (0%), and bandwidth has a very good 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 OPSF protocol.

Cited by 0

Optimasi Jaringan Routing Open Shortest Path First Dengan Menggunakan Multiprotocol Label Switching

Ronald David Marcus, Rahmad Anjar Saputro, Fandi Yulian Pamuji · Briliant Jurnal Riset dan Konseptual · 2020

Routing adalah sebuah proses dimana item dapat disampaikan melalui sebuah rute jaringan yang terkonfigurasi untuk mencapai titik tujuan dari suatu lokasi. Universitas Merdeka Malang masih menggunakan static routing dalam jaringan yang berskala bersekala besar. Sehingga administrator menghadapi masalah dalam proses pengelolaan ip router, rumit dalam menentukan pengiriman paket data yang harusnya diutamakan. Untuk dapat mengatasi masalah tersebut maka diperlukan penerapan teknologi Multiprotocol Label Switching (MPLS) diguna menyempurnakan dari sebuah routing Open Shortest Path First (OSPF). Penelitian ini menggunakan Metode Pengumpulan Data, Observasi dan Analisis masalah. Rancangan jaringan MultiProtocol label Switching yang diterapkan pada rancangan desain topologi jaringan menggunakan pendekatan hybrid, Dengan menggunakan router mikrotik RB951i-2nD dengan konfigurasi routing Open Shortest Path First (OSPF) berbasis MultiProtocol label Switching . Hasil dari penelitian ini adalah bahwa MultiProtocol label Switching (MPLS) dapat mengoptimalkan kinerja routing Open Shortest Path First pada jaringan backbone menggunakan pendekatan hybrid sehingga mengurangi banyaknya proses pengolahan IP router dalam mengefesiensi proses pengiriman suatu paket data.

Cited by 1Open access