On the Computational Complexity of Policy Routing

Abstract

Abstract. With the advent of new network architectures, like Software Defined Networks, the rules governing the way traffic is routed through the network are becoming increasingly complex. In this paper, we revisit the theoretic underpinnings of policy routing in the light of the new requirements. We show that certain simple but plausible algebraic properties already induce intractable path selection instances, and we extend the algebraic description of policies for which the related path selection problem is guaranteed to be tractable with a new class, called polynomial finite algebras, which captures many real-life application domains.

Closest Paths in Graph Drawings under an Elastic Metric

“…The minimum weighted average path search is performed using the generalized Dijkstra algorithm for routing algebras (Dijkstra, 1959;Sobrinho, 2002;2003;2005). In this work a simplified notion of a routing algebra is used, as described by Zubor et al (2014). A similar technique can be found in the work of Wang et al (2005), where a minimum (non-weighted) average path algorithm is described.…”

“…In the work ofZubor et al (2014) these properties are called, respectively, 'non-decreasing' and 'monotone'. The more common choice of words is used in the main text of this article.…”