Results 1 to 10 of about 261,538 (284)

Open Shortest Path First extension for the support of multiarea networks with arbitrary topologies

IET Networks
Open Shortest Path First (OSPF) currently supports multiarea networking with two severe limitations: the multiarea topology is restricted to a two‐level hierarchy, and globally optimal routing may not be achieved.
Xavier Gomes, João Fonseca, Rui Valadas
doaj   +2 more sources

Analysis of QOS VLAN Based on Djikstra’s Algorithm on Open Shortest Path First(OSPF)

IJID (International Journal on Informatics for Development), 2019
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 ...
Muhammad Nur Alfani, Bambang Sugiantoro
doaj   +3 more sources

Fuzzy particle swarm optimization algorithms for the open shortest path first weight setting problem [PDF]

Applied Intelligence, 2016
The open shortest path first (OSPF) routing protocol is a well-known approach for routing packets from a source node to a destination node. The protocol assigns weights (or costs) to the links of a network. These weights are used to determine the shortest paths between all sources to all destination nodes.
Salman A Khan, Andries Engelbrecht
exaly   +3 more sources

Optimasi Cost pada Open Shortest Path First di Jaringan Software Defined-Network

Techno.Com, 2017
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 ...
Ronald Adrian
doaj   +3 more sources

Preventive start‐time optimisation of open shortest path first link weights for hose model

IET Networks, 2014
Optimising link weights in an open shortest path first network is a challenging traffic engineering problem to reduce network congestion. Most of the previous studies have focused on the application of start‐time optimisation (SO) and run‐time optimisation on both pipe and hose models of link weight optimisation.
Eiji Oki
exaly   +2 more sources

Convergence time analysis of open shortest path first routing protocol in internet scale networks

Electronics Letters, 2012
Proposed is a novel method to compute the intra-area convergence time of open shortest path first (OSPF) based networks in the presence of designated routers (DRs) on Ethernet and non-broadcast multi-access segments. The capacity of the proposed method is demonstrated by evaluating the convergence time performance of OSFP on internet scale networks ...
Saif Ur Rehman Malik
exaly   +2 more sources

Multi-Objective Decision-Making Meets Dynamic Shortest Path: Challenges and Prospects

Algorithms, 2023
The Shortest Path (SP) problem resembles a variety of real-world situations where one needs to find paths between origins and destinations. A generalization of the SP is the Dynamic Shortest Path (DSP) problem, which also models changes in the graph at ...
Juarez Machado da Silva, Gabriel de Oliveira Ramos, Jorge Luis Victória Barbosa   +2 more
doaj   +1 more source

Routing Path Assignment for Joint Load Balancing and Fast Failure Recovery in IP Network

Applied Sciences, 2021
Distributed link-state routing protocols, including Open Shortest Path First (OSPF) and Intermediate System–Intermediate System (IS-IS), have successfully provided robust shortest path routing for IP networks. However, shortest path routing is inflexible
Tabinda Ashraf, Steven S. W. Lee, Muhammad Iqbal, Jen-Yi Pan   +3 more
doaj   +1 more source

Design and Implementation of Semi-Physical Platform for Label Based Frame Switching in Integrated Satellite Terrestrial Networks

Applied Sciences, 2022
With the explosion of traffic demand in recent years, the integration of satellite optical networks and terrestrial networks (ISTN) creates a promising networking solution for future low-latency, high-rate, and high-capacity communications.
Wei Zhou, Xing Jiang, Qingsong Luo, Shanguo Huang, Bingli Guo, Xiang Sun, Shaobo Li, Xiaochuan Tan, Mingyi Ma, Tianwen Fu   +9 more
doaj   +1 more source

Open shortest path first routing under random early detection [PDF]

Networks, 2017
In this article, we consider a variant of Open Shortest Path First (OSPF) routing that accounts for Random Early Detection (RED), an Active Queue Management method for backbone networks. In the version of OSPF we consider in this article we only require a single network path be available between each origin and destination, a simplification of the OSPF
Jiaxin Liu, Stanko Dimitrov
openaire   +2 more sources