Results 31 to 40 of about 15,889 (249)

Proposal of Load Aware Routing for OSPF Routing Protocol

open access: yesCommunications, 2013
This paper deals with route cost assignment using one of the most commonly used routing protocols - Open Shortest Path First (OSPF). The limitation of this protocol is that the algorithm does not take actual link load into consideration.
Tomas Macha, Radko Krkos, Vit Novotny
doaj   +1 more source

One More Weight is Enough: Toward the Optimal Traffic Engineering with OSPF

open access: yes, 2010
Traffic Engineering (TE) leverages information of network traffic to generate a routing scheme optimizing the traffic distribution so as to advance network performance.
Liu, Hongying   +3 more
core   +1 more source

Experimental Evaluation of Wireless Mesh Networks: A Case Study and Comparison [PDF]

open access: yes, 2013
Price of WiFi devices has decreased dramatically in recent years, while new standards, as 802.11n, have multiplied its performance. This has fostered the deployment of Wireless Mesh networks (WMN), putting into practice concepts evolved from more than a ...
Cerdà-Alabern, Llorenç   +2 more
core   +1 more source

S-OSPF: A Traffic Engineering Solution for OSPF Based Best Effort Networks [PDF]

open access: yesIEEE GLOBECOM 2007-2007 IEEE Global Telecommunications Conference, 2007
Open Shortest Path First (OSPF) is one of the most widely used intra-domain routing protocol. It is well known that OSPF protocol does not provide flexibility in terms of packet forwarding to achieve any network optimization objective. Because of the high cost of network assets and commercial and competitive nature of Internet service provisioning ...
SAHOO, ANIRUDHA, MISHRA, ADITYA KUMAR
openaire   +2 more sources

Study on OSPF Algebraic Formal Modelling Using ACP

open access: yesElektronika ir Elektrotechnika, 2018
OSPF is a commonly used link state routing protocol in order to interconnect network devices inside an Autonomous System. This paper focuses on achieving a detailed modelling for OSPF by performing manual algebraic derivations according to Algebra of ...
Pedro Juan Roig   +3 more
doaj   +1 more source

AI-Assisted Framework for Green-Routing and Load Balancing in Hybrid Software-Defined Networking: Proposal, Challenges and Future Perspective

open access: yesIEEE Access, 2020
The explosive growth of IP networks, the advent of cloud computing, and the rapid progress in wireless communications witnessed today reflect significant progress towards meeting the explosive data traffic demands.
Richard Etengu   +4 more
doaj   +1 more source

Fast emergency paths schema to overcome transient link failures in ospf routing

open access: yes, 2012
A reliable network infrastructure must be able to sustain traffic flows, even when a failure occurs and changes the network topology. During the occurrence of a failure, routing protocols, like OSPF, take from hundreds of milliseconds to various seconds ...
Barreto, Fernando   +2 more
core   +1 more source

Nghiên cứu sự ảnh hưởng của bộ định thời Timer tới quá trình hội tụ mạng và hiệu suất xử lý của CPU khi triển khai OSPF-v3 trong hạ tầng IPV6

open access: yesTạp chí Khoa học, 2023
Hiện nay giao thức định tuyến Open Shortest Path First (OSPF) được sử dụng rất phổ biến trong hạ tầng mạng IPv6. OSPF sử dụng nhiều kiểu Timer để giảm lượng bản tin Overhead.
Lê Hoàng Hiệp, Hồ Mậu Việt, Dương Thị Quy   +3 more
doaj   +1 more source

Network-wide Configuration Synthesis

open access: yes, 2017
Computer networks are hard to manage. Given a set of high-level requirements (e.g., reachability, security), operators have to manually figure out the individual configuration of potentially hundreds of devices running complex distributed protocols so ...
AY Halevy   +12 more
core   +1 more source

Lying Your Way to Better Traffic Engineering

open access: yes, 2016
To optimize the flow of traffic in IP networks, operators do traffic engineering (TE), i.e., tune routing-protocol parameters in response to traffic demands.
Chiesa Marco   +6 more
core   +1 more source

Home - About - Disclaimer - Privacy