Log in

Relevant bibliographies by topics / Open Shortest Path First / Journal articles

To see the other types of publications on this topic, follow the link: Open Shortest Path First.

Journal articles on the topic 'Open Shortest Path First'

Author: Grafiati

Published: 4 June 2021

Last updated: 16 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Open Shortest Path First.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

P, Anu, and Vimala S. "Reputation based Malicious Node Detection and Elimination in Open Shortest Path First." Journal of Advanced Research in Dynamical and Control Systems 11, no. 11-SPECIAL ISSUE (2019): 855–60. http://dx.doi.org/10.5373/jardcs/v11sp11/20193107.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

S, Vishesh, Ranjan Ravishankar, Nandhishwara BN, Hema R, Nagabhushan HS, and Bhaskar V. "Open Shortest Path First- A Case Study." IJARCCE 6, no. 6 (2017): 533–37. http://dx.doi.org/10.17148/ijarcce.2017.6696.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Sidhu, Deepinder, Tayang Fu, Shukri Abdallah, Raj Nair, and Rob Coltun. "Open shortest path first (OSPF) routing protocol simulation." ACM SIGCOMM Computer Communication Review 23, no. 4 (1993): 53–62. http://dx.doi.org/10.1145/167954.166243.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Pióro, M., Á. Szentesi, J. Harmatos, A. Jüttner, P. Gajowniczek, and S. Kozdrowski. "On open shortest path first related network optimisation problems." Performance Evaluation 48, no. 1-4 (2002): 201–23. http://dx.doi.org/10.1016/s0166-5316(02)00036-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Liu, Jiaxin, and Stanko Dimitrov. "Open shortest path first routing under random early detection." Networks 71, no. 2 (2017): 120–35. http://dx.doi.org/10.1002/net.21792.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Kavitha, J., and S. Palaniammal. "Efficient Path Selection and Data Transmission Using Queue in Open Shortest Path First." International Journal of Computer Science and Application 3, no. 4 (2014): 139. http://dx.doi.org/10.14355/ijcsa.2014.0304.01.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

ManarYounisKashmola, Dr, and ZenaNatiq Abdul-Kader. "Less Congested Open Shortest Path First Algorithm for Computer Networks(Arbic)." AL-Rafdain Engineering Journal (AREJ) 21, no. 1 (2013): 91–101. http://dx.doi.org/10.33899/rengj.2013.67349.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Tian, An Hong, and Cheng Biao Fu. "The Research of Virtualization Emulator Based on Open Shortest Path First." Applied Mechanics and Materials 411-414 (September 2013): 729–32. http://dx.doi.org/10.4028/www.scientific.net/amm.411-414.729.

Full text

Abstract:

Computer network is one of the compulsory course for computer professional students, but students are boring for abstract network concepts, in order to improve the innovation of students, a virtual simulation tools named Packet Tracer is introduced into the classroom teaching, which can provide network simulation environment as real life with enough network equipment. This paper presents the configuration example of Open Shortest Path Firs Protocol, and proves the network connectivity simulation results, this is an efficient method for teaching and learning by visual emulator.

APA, Harvard, Vancouver, ISO, and other styles

9

Wen, Ue-Pyng, Wei-Chih Wang, and Chyi-Bao Yang. "Traffic engineering and congestion control for open shortest path first networks." Omega 35, no. 6 (2007): 671–82. http://dx.doi.org/10.1016/j.omega.2006.03.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Musril, Hari Antoni. "Desain Virtual Private Network (VPN) Berbasis Open Shortest Path First (OSPF)." InfoTekJar (Jurnal Nasional Informatika dan Teknologi Jaringan) 3, no. 2 (2019): 83–88. http://dx.doi.org/10.30743/infotekjar.v3i2.1055.

Full text

Abstract:

Akses terhadap sebuah jaringan lokal yang bersifat terbatas untuk pihak tertentu dapat dilakukan dari jaringan publik dengan memanfaatkan Virtual Private Network (VPN). Akses tersebut dilakukan melalui internet dengan memanfaatkan VPN. Hal itu membuat pengguna bisa memanfaatkan semua resources jaringan lokal yang dapat diakses tanpa batasan waktu dan lokasi. OSPF routing diperlukan untuk menghubungkan semua router dalam jaringan yang menggunakan VPN. OSPF routing pada jaringan VPN bisa saling mengkoneksikan beberapa gedung di lokasi yang berbeda dengan satu jaringan. Penelitian ini menghasilkan prototipe skema jaringan yang menghubungkan dua lokasi yang dipisahkan oleh jarak yang jauh, namun dapat terhubung baik secara nyata maupun secara virtual.

APA, Harvard, Vancouver, ISO, and other styles

11

Musril, Hari Antoni. "PENERAPAN OPEN SHORTEST PATH FIRST (OSPF) UNTUK MENENTUKAN JALUR TERBAIK DALAM JARINGAN." Jurnal Elektro dan Telekomunikasi Terapan 4, no. 1 (2017): 421. http://dx.doi.org/10.25124/jett.v4i1.989.

Full text

Abstract:

Jaringan komputer skala besar sering kali menghadapi masalah dalam komunikasi data. Transmisidatanya membutuhkan waktu yang lama karena pemilihan protokol routing yang tidak tepat.Protokol routing yang dipilih tidak dapat memberikan alternatif jalur terbaik untuk melewatkanpaket data. Penelitian ini menguji kemampuan protokol routing Open Shortest Path First (OSPF)dalam pemilihan jalur terbaik. Sebagai protokol routing pembanding dipilihlah RoutingInformation Protocol version 2 (RIPv2). Penelitian ini membandingkan jalur terbaik yangdihasilkan oleh OSPF dan RIPv2. OSPF merupakan protokol routing yang sering digunakan dalamjaringan skala menengah dan besar. OSPF mendistribusikan informasi routing antara router-routerautonomous system (AS). OSPF merupakan protokol routing yang menggunakan algoritma linkstate untuk membangun dan mengitung jalur terbaik ke semua tujuan yang diketahui. Algoritmalink-state juga dikenal dengan algoritma dijkstra atau algoritma shortest path first (SPF). Algoritmadijkstra diterapkan dalam protokol OSPF untuk memilih rute terbaik yang harus ditempuh olehsuatu paket data dari suatu alamat asal agar sampai di alamat tujuan dengan nilai satuan beban (costmetric) terkecil. Dalam teori graf, algoritma dijkstra dimanfaatkan untuk memilih lintasanterpendek antara dua simpul dari suatu graf yang merupakan representasi topologi jaringan.Sedangkan RIPv2 merupakan protokol distance vector yang menggunakan hitungan lompatandalam pengukurannya. Jalur yang memiliki hop count yang lebih rendah akan dipilih untukmelewatkan paket data. Berdasarkan pada percobaan yang telah dilakukan, protokol routing OSPFdapat memberikan pilihan jalur terbaik (best path) dalam mengantarkan paket data. SementaraRIPv2 secara spesifik tidak dapat menghasilkan jalur terbaik.

APA, Harvard, Vancouver, ISO, and other styles

12

Adrian, Ronald. "Optimasi Cost pada Open Shortest Path First di Jaringan Software Defined-Network." Techno.Com 16, no. 4 (2017): 421–34. http://dx.doi.org/10.33633/tc.v16i4.1532.

Full text

Abstract:

Seiring bertumbuhnya pengguna internet maka tingkat kompleksitas jaringan yang ada didalamnya juga meningkat, seperti routing. Pada kondisi lain, saat ini tengah berkembang teknologi SDN yang merupakan teknologi jaringan baru yang didalamnya dilakukan pemisahan bagian infrastruktur perangkat jaringan menjadi bagian control plane dan data plane. Hal tersebut berdampak pada pembuatan kebijakan routing yang dilakukan terpusat melalui kontroler dan dijalankan switch OpenFlow. Pengontrolan jaringan terpusat oleh SDN membuat pengaturan jaringan lebih mudah. Pada makalah ini dilakukan implementasi dan analisis kinerja QoS dan waktu konvergensi dari protokol routing OSPF yang pada jaringan SDN dan konvesional berdasarkan penggunaan dan tanpa penggunaan cost dengan perangkat MikroTik serta RouteFlow. Hal tersebut dikarenakan pada protokol ruting OSPF menggunakan LSA sehingga nilai cost akan menjadi penentu rute yang akan dipilih atau digunakan. Pengukuran didasarkan atas parameter QoS (Delay, PLR, Jitter, dan Throughput) serta waktu konvergensi dengan dialiri traffic background yang bertingkat. Selanjutnya nilai performa dari kedua jenis teknologi, antara konvensional dan SDN dibandingkan. Penelitian ini diharapkan akan dihasilkan keluaran dapat menentukan pilihan terbaik dalam menentukan routing protocol yang digunakan dalam jaringan berdasar parameter yang dihasilkan. Kata Kunci: SDN, Routing Protocol, OSPF, RouteFlow, Cost.

APA, Harvard, Vancouver, ISO, and other styles

13

Moonlight, Lady Silk. "Optimasi Simulasi Routing OSPF (Open Shortest Path First) di Bandara Soekarno Hatta." Jurnal Penelitian 3, no. 4 (2018): 29–42. http://dx.doi.org/10.46491/jp.v3e4.117.29-42.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

14

Broström, Peter, and Kaj Holmberg. "Valid cycles: A source of infeasibility in open shortest path first routing." Networks 52, no. 4 (2008): 206–15. http://dx.doi.org/10.1002/net.20232.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Friyanto, Angga, Adam Mukharil Bachtiar, and Abdu Sofyan Baihaqi. "ANALISA PEMANFAATAN MULTIPROTOCOL LABEL SWITCHING PADA ROUTING PROTOCOL OPEN SHORTEST PATH FIRST." Majalah Ilmiah UNIKOM 18, no. 2 (2020): 59–64. http://dx.doi.org/10.34010/miu.v18i2.3937.

Full text

Abstract:

Transformasi digital diberbagai sektor membuat peningkatan kebutuhan infrastruktur jaringan untuk menopang tingginya trafik. Ketersedian sumber daya jaringan menjadi komponen penting dalam proses bisnis pada era digital. Selain penambahan infrastruktur, solusi yang dapat dilakukan untuk memenuhi kebutuhan tersebut adalah optimasi. OSPF (Open Shortest Path First) sebagai salah satu mekanisme penentuan jalur pengiriman data secara dinamis memiliki fitur dan performa yang baik dengan kalkulasi secara otomatis menggunakan algoritma yang memperhitungkan lebar bandwith. Dalam transmisi data, MPLS (Multiprotocol Label Switching) merupakan metode pengiriman paket data menggunakan label dalam proses penerusan pengiriman paket data. Penelitian ini menganalisis optimalisasi pemanfaatan MPLS sebagai mekanisme pengiriman paket data untuk komunikasi protokol routing OSPF. Pada penelitian ini, metode yang digunakan adalah dengan eksperimen. Analisa yang dilakukan dengan membandingkan data hasil uji coba sistem jaringan OSPF yang menggunakan MPLS dan sistem jaringan OSPF tanpa MPLS. Dari analisa yang dilakukan dengan membandingkan delay dan packet loss disimpulkan sistem jaringan yang menggunakan MPLS lebih efisien dan lebih cepat dalam komunikasi data. Kata Kunci: Data Transmisi, MPLS, OSPF, Rekayasa Trafik, Routing

APA, Harvard, Vancouver, ISO, and other styles

16

Garg, Pertik, and Asuh Gupta. "Adaptive Optimized Open Shortest Path First Algorithm using Enhanced Moth Flame Algorithm." Indian Journal of Science and Technology 10, no. 21 (2017): 1–7. http://dx.doi.org/10.17485/ijst/2017/v10i23/112150.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Marcus, Ronald David, Rahmad Anjar Saputro, and Fandi Yulian Pamuji. "Optimasi Jaringan Routing Open Shortest Path First Dengan Menggunakan Multiprotocol Label Switching." Briliant: Jurnal Riset dan Konseptual 5, no. 3 (2020): 612. http://dx.doi.org/10.28926/briliant.v5i3.486.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Sabirin, Febrianto, and Ryan Permana. "Perbedaan Routing Menggunakan Routing Information Protocol (RIP) Dengan Open Shortest Path First (OSPF)." CYBERNETICS 1, no. 02 (2017): 120. http://dx.doi.org/10.29406/cbn.v1i02.748.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

CHANG, EE-CHIEN, SUNG WOO CHOI, DO YONG KWON, HYUNGJU PARK, and CHEE K. YAP. "SHORTEST PATH AMIDST DISC OBSTACLES IS COMPUTABLE." International Journal of Computational Geometry & Applications 16, no. 05n06 (2006): 567–90. http://dx.doi.org/10.1142/s0218195906002191.

Full text

Abstract:

An open question in Exact Geometric Computation is whether there are transcendental computations that can be made "geometrically exact". Perhaps the simplest such problem in computational geometry is that of computing the shortest obstacle-avoiding path between two points p,q in the plane, where the obstacles are a collection of n discs. This problem can be solved in O(n2 log n) time in the Real RAM model, but nothing was known about its computability in the standard (Turing) model of computation. We first give a direct proof of the Turing-computability of this problem, provided the radii of the discs are rationally related. We make the usual assumption that the numerical input data are real algebraic numbers. By appealing to effective bounds from transcendental number theory, we further show a single-exponential time upper bound when the input numbers are rational. Our result appears to be the first example of a non-algebraic combinatorial problem which is shown computable. It is also a rare example of transcendental number theory yielding positive computational results.

APA, Harvard, Vancouver, ISO, and other styles

20

Kaffashi, Esmail. "A New Attack on Link-State Database in Open Shortest Path First Routing Protocol." Journal of Electrical and Electronic Engineering 3, no. 2 (2015): 39. http://dx.doi.org/10.11648/j.jeee.s.2015030201.19.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Sandaruwan Ranaweera, Ravindra, Islam Mohammad Kamrul, and Eiji Oki. "Preventive start‐time optimisation of open shortest path first link weights for hose model." IET Networks 3, no. 2 (2014): 143–49. http://dx.doi.org/10.1049/iet-net.2012.0226.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Moawed, Emad R., Fayez W. Zaki, and Khameis M. El-shennawy. "A Complete Mechanism for Tolerating Multiple Failures Using Open Shortest Path First Protocol (OSPF)." Menoufia Journal of Electronic Engineering Research 21, no. 2 (2011): 130–46. http://dx.doi.org/10.21608/mjeer.2011.66818.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Alfani, Muhammad Nur, and Bambang Sugiantoro. "Analysis of QOS VLAN Based on Djikstra’s Algorithm on Open Shortest Path First(OSPF)." IJID (International Journal on Informatics for Development) 7, no. 2 (2019): 23. http://dx.doi.org/10.14421/ijid.2018.07205.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

24

Malik, S. U., S. K. Srinivasan, and S. U. Khan. "Convergence time analysis of open shortest path first routing protocol in internet scale networks." Electronics Letters 48, no. 19 (2012): 1188. http://dx.doi.org/10.1049/el.2012.2310.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Mohiuddin, Mohammad Aijaz, Salman A. Khan, and Andries P. Engelbrecht. "Fuzzy particle swarm optimization algorithms for the open shortest path first weight setting problem." Applied Intelligence 45, no. 3 (2016): 598–621. http://dx.doi.org/10.1007/s10489-016-0776-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Nurhaida, Ida, Desi Ramayanti, and Imay Nur. "Performance Comparison based on Open Shortest Path First (OSPF) Routing Algorithm for IP Internet Networks." Communications on Applied Electronics 7, no. 31 (2019): 12–25. http://dx.doi.org/10.5120/cae2019652838.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Verma, Abhishek, and Neha Bhardwaj. "A Review on Routing Information Protocol (RIP) and Open Shortest Path First (OSPF) Routing Protocol." International Journal of Future Generation Communication and Networking 9, no. 4 (2016): 161–70. http://dx.doi.org/10.14257/ijfgcn.2016.9.4.13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Moza, Meenakshi, and Suresh Kumar. "Routing in Networks using Genetic Algorithm." Bulletin of Electrical Engineering and Informatics 6, no. 1 (2017): 88–98. http://dx.doi.org/10.11591/eei.v6i1.574.

Full text

Abstract:

With the increase in traffic, internet service providers are trying their best to provide maximum utilization of resources available. The current traffic load has to be taken into account for computation of paths in routing protocols. Network applications; require the shortest paths to be used for communication purposes. Addressing the selection of path, from a known source to destination is the basic aim of this paper. This paper proposes a method of calculating the shortest path for a network using a combination of Open shortest path first and Genetic Algorithm (OSGA). Genetic Algorithm is used in this paper for optimization of routing. It helps in enhancing the performance of the routers.

APA, Harvard, Vancouver, ISO, and other styles

29

Zhang, Ning, and Mao Chang Ge. "Research on New Routing Technology in WDM Network System." Advanced Materials Research 204-210 (February 2011): 2180–83. http://dx.doi.org/10.4028/www.scientific.net/amr.204-210.2180.

Full text

Abstract:

In this paper, a new routing design is presented. Interior gateway Protocols (IGPs), particularly Open Shortest Path First (OSPF), uses a simple single metric component, cost, which is based on the bandwidth of the link. Most large IP networks run Interior Gateway Protocols (IGPs) such as Open Shortest Path First (OSPF) or Intermediate System-Intermediate System (IS-IS) that select paths based on static link weights. Enhanced Interior Gateway Routing Protocol (EIGRP) is slightly more aware of the link characteristics in that it calculates a metric based on cumulative delay (delay is simply an arbitrary assigned value) and the minimum bandwidth value encountered between the source and destination. Routing technology can better the network operation efficiently.

APA, Harvard, Vancouver, ISO, and other styles

30

Wang, Hongping, Xi Lu, Xiaoge Zhang, Qing Wang, and Yong Deng. "A Bio-Inspired Method for the Constrained Shortest Path Problem." Scientific World Journal 2014 (2014): 1–11. http://dx.doi.org/10.1155/2014/271280.

Full text

Abstract:

The constrained shortest path (CSP) problem has been widely used in transportation optimization, crew scheduling, network routing and so on. It is an open issue since it is a NP-hard problem. In this paper, we propose an innovative method which is based on the internal mechanism of the adaptive amoeba algorithm. The proposed method is divided into two parts. In the first part, we employ the original amoeba algorithm to solve the shortest path problem in directed networks. In the second part, we combine thePhysarumalgorithm with a bio-inspired rule to deal with the CSP. Finally, by comparing the results with other method using an examples in DCLC problem, we demonstrate the accuracy of the proposed method.

APA, Harvard, Vancouver, ISO, and other styles

31

Dundjerski, Dejan, and Milo Tomašević. "Graphical processing unit-based parallelization of the Open Shortest Path First and Border Gateway Protocol routing protocols." Concurrency and Computation: Practice and Experience 27, no. 1 (2014): 237–51. http://dx.doi.org/10.1002/cpe.3223.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Mohiuddin, Mohammed A., Salman A. Khan, and Andries P. Engelbrecht. "Simulated evolution and simulated annealing algorithms for solving multi-objective open shortest path first weight setting problem." Applied Intelligence 41, no. 2 (2014): 348–65. http://dx.doi.org/10.1007/s10489-014-0523-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Li, Xiaoling, and Hai Hu. "QoS Routing Algorithm Based on Entropy Granularity in the Network Transmission." Cybernetics and Information Technologies 19, no. 4 (2019): 61–72. http://dx.doi.org/10.2478/cait-2019-0036.

Full text

Abstract:

Abstract With the rapid development of computer networks, more hosts are connected to the Internet where they could communicate with each other. The need for network service has exceeded the service capacity of the network, and the Quality of Service (QoS) is gradually declining. Based on existing Shortest Path First (SPF) algorithm, this paper proposes a new QoS required transmission path approach by considering the overhead balance of network resources. This paper uses the entropy granularity as the main line in the application of routing protocols. Firstly, it researches the optimization of routing algorithms for network load balancing resources, routing algorithms based on link traffic distributing weights, link weight optimization based on adaptive genetic algorithm and computational intelligence based on entropy granularity theory. This research proposes a method to apply entropy granularity to Open Shortest Path First (OSPF) routing, including the implementation of the method. After that, a case study is presented by using some examples.

APA, Harvard, Vancouver, ISO, and other styles

34

Bi, Yuanguo, Guangjie Han, Chuan Lin, Yan Peng, Huayan Pu, and Yazhou Jia. "Intelligent Quality of Service Aware Traffic Forwarding for Software-Defined Networking/Open Shortest Path First Hybrid Industrial Internet." IEEE Transactions on Industrial Informatics 16, no. 2 (2020): 1395–405. http://dx.doi.org/10.1109/tii.2019.2946045.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Diansyah, T. M., Divi Handoko, Ilham Faisal, Annisa Yunianti, Kalvin Chiuloto, and Risko Liza. "Design Analysis of OSPF (Open Shortest Path First) Routing by Calculating Packet Loss Of Network WAN (Wide Area Network)." Journal of Physics: Conference Series 1361 (November 2019): 012087. http://dx.doi.org/10.1088/1742-6596/1361/1/012087.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Danquah (Ph.D), Paul, Benjamin Peh, and Victor Gordon. "A simulated comparison of performance beyond inherent metrics for Open Shortest Path First (OSPF) and Exterior Gateway Routing Protocol (EIGRP)." Advances in Multidisciplinary & Scientific Research Journal Publication 6, no. 4 (2018): 35–48. http://dx.doi.org/10.22624/aims/digital/v6n4p3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Rahmatullah, Sidik. "PERANCANGAN JARINGAN LOCAL AREA NETWORK (LAN) DAN DNS SERVER MENGGUNAKAN ROUTING PROTOKOL OPEN SHORTEST PATH FIRST (OSPF) PADA BUMIPUTERA BANDAR JAYA." Jurnal Informasi dan Komputer 4, no. 2 (2017): 37–54. http://dx.doi.org/10.35959/jik.v4i2.49.

Full text

Abstract:

Jaringan komputer merupakan suatu sistem yang terdiri dari komputer dan perangkat lainnya yang dirancang untuk dapat bekerja bersama-sama dalam berbagai manfaat dan tujuan antara lain untuk berkomunikasi, akses informasi, menerima maupun memberikan layanan. Bagian yang menerima layanan disebut Client dan bagian yang memberikan layanan disebut Server. Sistem ini dikenal sebagai sistem client-server yang sudah digunakan pada hampir seluruh aplikasi jaringan komputer. Saat ini banyak instansi tertentu yang menggunakan jaringan LAN (Local Area Network). LAN merupakan suatu kumpulan komputer, dimana terdapat beberapa unit komputer (client) dan satu unit komputer untuk bank data (server). Tahapan-tahapan yang dilakukan pada tugas akhir ini memiliki beberapa tahapan, yaitu mencari dan mengumpulkan data apa saja yang dibutuhkan untuk merancang sebuah jaringan komputer LAN dengan DNS Server menggunakan routing protokol OSPF setelah data yang diperlukan terkumpul adalah melakukan proses lebih lanjut data tersebut diolah sebagai masukan untuk merancang sebuah jaringan sederhana, setelah itu tahapan selanjutnya adalah menentukan kebutuhan sistem dan melakukan simulasi terlebih dahulu. Jaringan komputer yang dirancang pada Kantor Bumiputera Bandar Jaya sangat membantu mempermudah proses kinerja staff dan karyawan untuk dapat saling bertukar data dan informasi, Efektifitas jaringan komputer akan meningkat jika menggunakan metode dan konfigurasi yang tepat.

APA, Harvard, Vancouver, ISO, and other styles

38

Harits, Andi, Moch Fahru Rizal, and Periyadi Periyadi. "Performance Analysis of Frame Relay Network Using OSPF (Open Shortest Path First) and MPLS (Multi-Protocol Label Switching) based on GNS3." IJAIT (International Journal of Applied Information Technology) 1, no. 02 (2017): 1. http://dx.doi.org/10.25124/ijait.v1i02.869.

Full text

Abstract:

enterprise networks. This research focuses on combining advantages from Frame Relay, MPLS and OSPF into a modeled multi-site network. The combination is compared to th original OSPF network and analyzed for its throughput, packet loss, and delay. To meet the demand for efficient and resilient network, and to emphasize the advantages of MPLS-OSP as well as to avoid traffic shifting, specific network topology models are applied: full mesh with virtual circuit in core network connected to OSPF nodes for the rest. From analysis and comparison of network quality values obtained at, this combination attests to be reliable and robust network architecture without trading off its efficiency. The average throughput value of the combination networks was 18.47 bps, which is better compared to the OSPF. The average delay and packet loss from combination network also show better results, which are 59.90ms and 2.01% respectively. The results shows that the combination of Frame Relay, OSPF andMPLS generates better performance as well as significant improvement in networksecurity.

APA, Harvard, Vancouver, ISO, and other styles

39

Liskevych, R. I., O. I. Liskevych, K. M. Obelovska, and R. P. Panchyshyn R. P. "IMPROVED ALGORITHM FOR THE PACKET ROUTING IN TELECOMMUNICATION NETWORKS." Ukrainian Journal of Information Technology 3, no. 1 (2021): 114–19. http://dx.doi.org/10.23939/ujit2021.03.114.

Full text

Abstract:

Packet routing efficiency is and will remain one of the major factors that have a major impact on a network performance and a quality of service. One of the most common routing protocols used in autonomous Internet systems is the Open Shortest Path First (OSPF) protocol. The OSPF protocol performs packet transmission using the shortest paths, calculated according to a certain, but only one criterion. Default criterion is channels bandwidth, but in general any criteria can be selected. The disadvantage here is that channels loading is not considered and thus packets are routed to a shortest but potentially overloaded path. In wider sense usage of single criteria may results in routing through paths suboptimal or even inappropriate by other criteria. The growth of the network traffic, and especially the increase of its multimedia component drives continuous improvement of routing methods in existing telecommunication networks. Network performance will benefit from more advanced routing methods, which would take into account several network characteristics, important for specific services quality. In given work a new algorithm of a gateway selection for the routing tables of autonomous Internet systems is proposed. The algorithm is based on the OSPF protocol but takes into account three criteria: channel bandwidth, the number of intermediate nodes in the path and the signal propagation delay. Weighting coefficient for each criteria is introduced. Besides that, the integral criterion is proposed based on optimal path weights for individual criteria and path weights found by two other criteria. The total relative deviation of the path weight from the path weights calculated according to individual criteria is used as the optimization criterion. The purpose of optimization is to minimize this deviation. Routing tables constructed using proposed algorithm ensure packets transmission through the optimal path, selected according to the integral criterion, taking into account the three criteria and their coefficients of importance. Further research may be conducted to expand the list of criteria used in the optimization process.

APA, Harvard, Vancouver, ISO, and other styles

40

Zhang, Chuanwei, Feiyan Han, and Wu Zhang. "A cutting sequence optimization method based on tabu search algorithm for complex parts machining." Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture 233, no. 3 (2018): 745–55. http://dx.doi.org/10.1177/0954405417752527.

Full text

Abstract:

Defining the cutting sequence of each cutter scientifically in the process of removing the allowance has an important influence on the machining efficiency for complex parts, which have multiple machining features. In order to satisfy the needs of high efficiency for rough machining, after determining the tool path of the machining region, a cutting sequence optimization method based on the tabu search algorithm is presented to define the cutting order in rough machining of complex parts. First, a cutting sequence optimization mathematical model is established, which relates to the shortest total length of the tool path. Second, through the problem analysis, the cutting sequence optimization model is converted into an open and constrained traveling salesman problem. And then, the optimization model is solved by dealing with an open and constrained traveling salesman problem using the tabu search algorithm. Finally, the optimal cutting sequence of machining a casing part is calculated, and a simulation and experiment are carried out. The result shows that the optimization approach presented in this article can optimize the cutting sequence and cutter position of advance and retract. Compared with the non-optimized cutting sequence method, the total length of tool path is reduced by 16.7%, the cutter lifting times are reduced to 26, and the efficiency is increased by 21.62%.

APA, Harvard, Vancouver, ISO, and other styles

41

Indah, Nur, Yulita Salim, and Ramdan Satra. "ANALISIS PERBANDINGAN ROUTING PROTOKOL OPEN SHORTES PATH FIRST (OSPF) DENGAN ENHANCED INTERIOR GATEWAY ROUTING PROTOCOL (EIGRP)." ILKOM Jurnal Ilmiah 10, no. 1 (2018): 92–99. http://dx.doi.org/10.33096/ilkom.v10i1.205.92-99.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Dembin, Barbara. "Regularity of the time constant for a supercritical Bernoulli percolation." ESAIM: Probability and Statistics 25 (2021): 109–32. http://dx.doi.org/10.1051/ps/2021005.

Full text

Abstract:

We consider an i.i.d. supercritical bond percolation on ℤd, every edge is open with a probability p > pc(d), where pc(d) denotes the critical parameter for this percolation. We know that there exists almost surely a unique infinite open cluster 𝒞p. We are interested in the regularity properties of the chemical distance for supercritical Bernoulli percolation. The chemical distance between two points x, y ∈ 𝒞p corresponds to the length of the shortest path in 𝒞p joining the two points. The chemical distance between 0 and nx grows asymptotically like nμp(x). We aim to study the regularity properties of the map p → μp in the supercritical regime. This may be seen as a special case of first passage percolation where the distribution of the passage time is Gp = pδ1 + (1 − p)δ∞, p > pc(d). It is already known that the map p → μp is continuous.

APA, Harvard, Vancouver, ISO, and other styles

43

Li, Xiao Hua, Ren Long Zhang, Yu Jie Wang, Li Yang, Juan Nie, and Quan Yue Yang. "GNS-Based Simulation and Analysis of OSPFv2 Neighbor Authentication." Advanced Materials Research 989-994 (July 2014): 4603–7. http://dx.doi.org/10.4028/www.scientific.net/amr.989-994.4603.

Full text

Abstract:

Routing information release is a kind of promise from the router for network reachability. Illegal routing information may have disastrous effects on the normal work of the network. Open Shortest Path First (OSPF) protocol provides authentication methods to protect the authenticity and integrity of the routing traffic. This paper describes two authentication types of OSPFv2, analyzes the realization mechanism and packet header format of each authentication respectively. Based on GNS3, a typical network topology was designed, and with the aid of it functional verification and security analysis are carried out. The simulation can provide a reference for building an OSPF network. Experimental results show that the configuration of OSPFv2 routing authentication can effectively prevent the router from receiving unauthorized or malicious routing updates, thereby improving network safety.

APA, Harvard, Vancouver, ISO, and other styles

44

Li, Xiao Hua, Xian Gang Zhao, Ren Long Zhang, Shu Yan Xu, and Li Yang. "Simulation and Analysis of OSPFv2 Neighbor Authentication Based on GNS." Advanced Engineering Forum 6-7 (September 2012): 876–81. http://dx.doi.org/10.4028/www.scientific.net/aef.6-7.876.

Full text

Abstract:

Routing information release is a kind of promise from the router for network reachability. Illegal routing information may have disastrous effects on the normal work of the network. Open Shortest Path First (OSPF) protocol provides authentication methods to protect the authenticity and integrity of the routing traffic. This paper describes two authentication types of OSPFv2, analyzes the realization mechanism and packet header format of each authentication respectively. Based on GNS3, a typical network topology was designed, and with the aid of it we carried out functional verification and security analysis. The simulation can provide a reference for building an OSPF network. Experimental results show that the configuration of OSPFv2 routing authentication can effectively prevent the router from receiving unauthorized or malicious routing updates, thereby improving network safety.

APA, Harvard, Vancouver, ISO, and other styles

45

Taruk, Medi, Masna Wati, and Eny Maria. "Model Optimasi Routing Protocol OSPF Pada Jaringan Wireless Mesh Dengan MPLS Traffic Engineering." Informatika Mulawarman : Jurnal Ilmiah Ilmu Komputer 14, no. 1 (2019): 45. http://dx.doi.org/10.30872/jim.v14i1.1923.

Full text

Abstract:

Proses pertukaran informasi dan komunikasi data antar pengguna internet yang dilakukan di lokasi berbeda dan dalam waktu yang bersamaan dapat mengakibatkan semakin tinggi lalu lintas pertukaran informasi dalam suatu jaringan internet. Oleh karena itu, diperlukan adanya suatu mekanisme untuk menentukan dan pemilihan jalur lalu lintas data terbaik untuk dilalui paket data ketika proses pertukaran informasi dan komunikasi data berlangsung. Salah satu mekanisme untuk menentukan dan pemilihan jalur lalu lintas data tersebut adalah dengan menerapkan aturan pada perangkat router. OSPF (Open Shortest Path First) merupakan salah satu routing protocol yang memiliki lisensi kode terbuka (open source), OSPF menggunakan mekanisme routing link-state, kinerja OSPF ditentukan pada kebutuhan dan konsumsi bandwidth. Model optimasi yang dilakukan pada penelitian ini akan memberikan gambaran awal bagaimana suatu routing protocol OSPF bekerja dengan menerapkan teknologi traffic engineering pada wireless mesh network (WMN) menggunakan model multi protokol label switching (MPLS). Kemudian dilakukan analisis dan penilaian terhadap faktor-faktor terkait optimasi routing protocol OSPF dengan membuat rancangan topologi routing protokol OSPF pada jaringan wireless mesh dengan model jaringan MPLS menggunakan tools simulator jaringan.

APA, Harvard, Vancouver, ISO, and other styles

46

Zhang, Jun, and Fu Xiang Peng. "Routing Strategy and Quality of Service (QoS) Realization Research of Guangxi Meteorology Network." Advanced Engineering Forum 6-7 (September 2012): 919–23. http://dx.doi.org/10.4028/www.scientific.net/aef.6-7.919.

Full text

Abstract:

Large cover area and long distance transmission are main characteristics of a meteorological communication network. A satellite communication technology has been mainly adopted in the field of meteorological communication for a long time, because an optical communication technology has become the important support technology during a new network transformation, meteorological departments establish a nationwide meteorological broadband network. The paper aims at the structure of the Guangxi meteorological broadband network, points out how to use a routing strategy which combines a border gateway protocol (BGP) with an open shortest path first interior gateway protocol (OSPF) to solve the problem of entire network routing flapping and provides a basic method to dynamically realize the quality of service (QoS) guarantee of various kinds of service data in the meteorological broadband communication network by combining meteorological data services and class based queueing (CBQ).

APA, Harvard, Vancouver, ISO, and other styles

47

ARYANTA, DWI, and BAYU AGUNG PRANATA. "Perancangan dan Analisis Redistribution Routing Protocol OSPF dan EIGRP." ELKOMIKA: Jurnal Teknik Energi Elektrik, Teknik Telekomunikasi, & Teknik Elektronika 2, no. 2 (2014): 85. http://dx.doi.org/10.26760/elkomika.v2i2.85.

Full text

Abstract:

ABSTRAKOSPF (Open Shortest Path First) dan EIGRP (Enhanced Interior Gateway Routing Protocol) adalah dua routing protokol yang banyak digunakan dalam jaringan komputer. Perbedaan karakteristik antar routing protokol menimbulkan masalah dalam pengiriman paket data. Teknik redistribution adalah solusi untuk melakukan komunikasi antar routing protokol. Dengan menggunakan software Cisco Packet Tracer 5.3 pada penelitian ini dibuat simulasi OSPF dan EIGRP yang dihubungkan oleh teknik redistribution, kemudian dibandingkan kualitasnya dengan single routing protokol EIGRP dan OSPF. Parameter pengujian dalam penelitian ini adalah nilai time delay dan trace route. Nilai trace route berdasarkan perhitungan langsung cost dan metric dibandingkan dengan hasil simulasi. Hasilnya dapat dilakukan proses redistribution OSPF dan EIGRP. Nilai delay redistribution lebih baik 1% dibanding OSPF dan 2-3% di bawah EIGRP tergantung kepadatan traffic. Dalam perhitungan trace route redistribution dilakukan 2 perhitungan, yaitu cost untuk area OSPF dan metric pada area EIGRP. Pengambilan jalur utama dan alternatif pengiriman paket berdasarkan nilai cost dan metric yang terkecil, hal ini terbukti berdasarkan perhitungan dan simulasi.Kata kunci: OSPF, EIGRP, Redistribution, Delay, Cost, Metric.ABSTRACTOSPF (Open Shortest Path First) and EIGRP (Enhanced Interior Gateway Routing Protocol) are two routing protocols are widely used in computer networks. Differences between the characteristics of routing protocols pose a problem in the delivery of data packets. Redistribution technique is the solution for communication between routing protocols. By using the software Cisco Packet Tracer 5.3 in this study were made simulating OSPF and EIGRP redistribution linked by technique, then compared its quality with a single EIGRP and OSPF routing protocols. Testing parameters in this study is the value of the time delay and trace route. Value trace route based on direct calculation of cost and metric compared with the simulation results. The result can be OSPF and EIGRP redistribution process. Value delay redistribution 1% better than OSPF and EIGRP 2-3% under traffic density dependent. In calculating the trace route redistribution is done 2 calculations, the cost for OSPF area and the area of the EIGRP metric. Making primary and alternate paths based on the packet delivery rate and the cost of the smallest metric, it is proved by calculation and simulation.Keywords: OSPF, EIGRP, Redistribution, Delay, Cost, Metric.

APA, Harvard, Vancouver, ISO, and other styles

48

Amuda, Sahril, Muhamad Femy Mulya, and Felix Indra Kurniadi. "Analisis dan Perancangan Simulasi Perbandingan Kinerja Jaringan Komputer Menggunakan Metode Protokol Routing Statis, Open Shortest Path First (OSPF) dan Border Gateway Protocol (BGP) (Studi Kasus Tanri Abeng University)." Jurnal SISKOM-KB (Sistem Komputer dan Kecerdasan Buatan) 4, no. 2 (2021): 53–63. http://dx.doi.org/10.47970/siskom-kb.v4i2.189.

Full text

Abstract:

Network is a communication between two devices to communicate with each other either using wire or wireless media. The LAN network topology used at Tanri Abeng Unversity still uses a static routing topology, where the routing process is still done manually, so that if there is an addition of a new network, it will be difficult to configure the routing table. In this research, a network topology with dynamic routing methods will be built that will help improve network performance at Tanri Abeng University. The purpose of this research is to analyze the comparison of network performance at Tanri Abeng Unversity in sending data packets using static routing protocols, OSPF, and BGP based on the parameters used. In this research also, the ping process was carried out using the cisco packet tracer 100 times with the size of the data packet sent of 32 bytes for each routing method to be compared. Then in this research, the test scenario was carried out eight times on each parameter of throughput, packet loss, delay, and jitter in the hope of determining which routing method is more optimal among static routing, OSPF, and BGP at Tanri Abeng University. The test results show that BGP routing for throughput and packet loss parameters is superior to other routing methods, while OSPF routing for delay and jitter parameters is superior to other routing methods.

APA, Harvard, Vancouver, ISO, and other styles

49

Monita, Vivi, Indrarini Dyah Irawati, and Rohmat Tulloh. "Comparison of routing protocol performance on multimedia services on software defined network." Bulletin of Electrical Engineering and Informatics 9, no. 4 (2020): 1612–19. http://dx.doi.org/10.11591/eei.v9i4.2389.

Full text

Abstract:

Software defined network (SDN) is a new paradigm in network engineering, where control plane and data plane are separated. Data plane is carried out on each node, while a control plane is centrally located. In conventional networks, the planes are implemented in the firmware of the router. In this paper, we implemented multimedia services on SDN using exterior and interior routing protocols, such as open shortest path first (OSPF), border gateway protocol (BGP) and routing information protocol (RIP), measured the quality of service (QoS), and analyze the measurement results. The test results showed that the greater the background traffic provided, the smaller the throughput. Traffic on the network will be congested, so the available bandwidth is also increasingly used up so that the number of bits sent every second decrease. Mean opinion score (MOS) test results are 4 showing good categories based on ITU-T standards.

APA, Harvard, Vancouver, ISO, and other styles

50

Jain, Neha, Ashish Payal, and Aarti Jain. "Effect of data packet size on the performance of RIP and OSPF routing protocols in hybrid networks." International Journal of Pervasive Computing and Communications 17, no. 4 (2021): 361–76. http://dx.doi.org/10.1108/ijpcc-02-2021-0036.

Full text

Abstract:

Purpose The purpose of this study is to calculate the effect of different packet sizes 256, 512, 1,024 and 2,048 bytes on a large-scale hybrid network and analysis and identifies which routing protocol is best for application throughput, application delay and network link parameters for different packet sizes. As the routing protocol is used to select the optimal path to transfer data packets from source to destination. It is always important to consider the performance of the routing protocol before the final network configuration. From the literature, it has been observed that RIP (Routing Information Protocol) and OSPF (Open Shortest Path First) are the most popular routing protocols, and it has always been a challenge to select between these routing protocols, especially for hybrid networks. The efficiency of routing protocol mainly depends on resulting throughput and delay. Also, it has been observed that data packet size also plays an essential role in determining the efficiency of routing protocol. Design/methodology/approach To analyse the effect of different packet sizes using two routing protocols, routing information protocol (RIP) and open shortest path first (OSPF) on the hybrid network, require detailed planning. Designing the network for simulate and then finally analysing the results requires proper study. Each stage needs to be understood well for work accomplishment. Thus, the network’s simulation and evaluation require implementing the proposed work step by step, saving time and cost. Here, the proposed work methodology is defined in six steps or stages. Findings The simulation results show that both routing protocols – RIP and OSPF are equally good in terms of network throughput for all different packet sizes. However, OSPF performs better in terms of network delay than RIP routing protocol in different packet size scenarios. Research limitations/implications In this paper, a fixed network of 125 objects and only RIP and OSPF routing protocol have been used for analysis. Therefore, in the future, a comparison of different network sizes can be considered by increasing or decreasing the number of objects in the proposed network. Furthermore, the other routing protocols can be used for performance evaluation on the same proposed network. Originality/value The analysis can be conducted by simulation of the network, enabling us to develop a network environment without restricting the selection of parameters as it minimizes cost, network deployment overhead, human resources, etc. The results are analysed, calculated and compared for each packet size on different routing protocol networks individually and the conclusion is made.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!