Open Shortest Path First Routing Under Random Early Detection
Loading...
Date
2018-03-01
Authors
Liu, Jiaxin
Dimitrov, Stanko
Journal Title
Journal ISSN
Volume Title
Publisher
Wiley
Abstract
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 protocol. We formulate a mixed integer non‐linear program to determine the data paths, referred to as a routing policy. We prove that determining an optimal OSPF routing policy that accounts for RED is NP‐Hard. Furthermore, in order for the generated routing policies to be real‐world implementable, referred to as realizable, we must determine weights for all arcs in the network such that solving the all‐pairs shortest path problem using these weights reproduces the routing policies. We show that determining if a set of all‐pairs routes is realizable is also NP‐Hard. Fortunately, using traffic data from three real‐world backbone networks, we are able to find realizable routing policies for these networks that account for RED, using an off‐the‐shelf solver, and policies found perform better than those used in each network at the time the data was collected.
Description
This is the peer reviewed version of the following article: Liu, J. and Dimitrov, S. (2018), Open shortest path first routing under random early detection. NETWORKS, 71: 120-135., which has been published in final form at https://doi.org/10.1002/net.21792. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions.
Keywords
all‐pairs routing, complexity, application, backbone networks, OSPF, RED