Results 1 to 10 of about 60,272 (312)
Hybride traffic engineering : from constraint shortest path first to least path interference
This paper presents a new approach for routing flows in IP networks. The approach referred to as the <I>Least Path Interference (LPI)</I> is based on a route optimisation model which (1) moves the traffic away from path interfering links (the
Bagula, Antoine B.,
core
Due to an urgent need to reduce the fast-progressing climate changes, a rapid, standardized and replicable solution for the infrastructure restructuring of the heat demand coverage of buildings at the district and city levels must be developed.
Aneta Strzalka +2 more
doaj +1 more source
Pengaruh Model Jaringan Terhadap Optimasi Routing Open Shortest Path First (OSPF)
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.
Kasim, Muhammad Luthfi
core
Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs
The restoration lemma by Afek, Bremler-Barr, Kaplan, Cohen, and Merritt [Dist. Comp. '02] proves that, in an undirected unweighted graph, any replacement shortest path avoiding a failing edge can be expressed as the concatenation of two original shortest
Parter, Merav, Bodwin, Greg
core
Evaluación de un algoritmo de control para video adaptativo empleando enrutamiento tradicional y SDN
Actualmente, según el Cisco Annual Internet Report, entre el 80% y el 85% del tráfico de datos en Internet es generado por contenido en video. Esto hace imperativo desarrollar métodos o algoritmos que permitan una transmisión eficiente de contenido ...
Marlon Gomezcoello Rodríguez +2 more
doaj +1 more source
At the core of enterprise networks lies routing protocols that make forwarding decisions based on a set of rules and metrics. One of the most popular and widely used routing protocols is the Open Shortest Path First (OSPF).
Rebeen Rebwar Hama Amin
doaj +1 more source
In Software-Defined Networks (SDNs), determining how to efficiently achieve Quality of Service (QoS)-aware routing is challenging but critical for significantly improving the performance of a network, where the metrics of QoS can be defined as, for ...
Wei Zhou +6 more
doaj +1 more source
Optimization in the Shortest Path First Computation for the Software Routing GNU Zebra
Routing protocols are a critical component in IP networks. Among these, the Open Shortest Path First (OSPF) has been a widely used routing protocol in IP networks for some years.
RUSSO I +4 more
core +1 more source
Constraint Programming Methods for Optimization of Single Shortest Path Routing
In this thesis, we propose methods based on constraint programming (CP) for solving an optimization problem in telecommunications, the single shortest path routing problem.
Wallander, Mats Petter
core +1 more source
Engineering Nature-Inspired Heuristics for the Open Shortest Path First Weight Setting Problem [PDF]
Thesis (PHD)--University of Pretoria, 2018.In the thesis of “Mohammed Aijaz Mohiuddin”, Engineering Nature-Inspired Heuristics for the Open Shortest Path First Weight Setting Problem, nature inspired heuristics were developed.
core

