Towards a Unified Theory of Policy-Based Routing
Chi-Kin Chau, Richard Gibbens, Timothy G. Griffin · 2006
We use the term policy-based routing to refer collec- tively to the Stable Paths Problem, Sobrinho's Routing Algebras, and to classical Path Algebras (semi-rings used to generalise minimum-weight routing). These theories all contain sufficient conditions that ensure the existence of solutions (stable routings) for labelled graphs. We attempt to provide a unified theory from which all of these seemingly disparate sufficient conditions can be derived. Our theory is based purely on abstract relations and their properties and not on the syntactic or axiomatic details of the policy-based theories.