## Revision d5aa08f5 bgp_model/bgp_model.tex

View differences:

bgp_model/bgp_model.tex
108 108

109 109
\section{Node Policy}

110 110
Nodes evaluate route \acp{ADV} with a function $\Gamma: R \to [0,100]\cap \mathbb{N}$, where $R$ is the set of routes.

111
Given two routes $r_1,r_2$, a node prefers $r_1$ if $\Gamma(r_1)\geq \Gamma(r_2)$ and $r_2$ otherwise.

111 112

112 113
As noted before, $r\in R$ is a couple $(d, \xi)$ of destination and attributes.

113 114
The simplest form of policy returns the (possibly weighted) length of the \ac{AS} path indicated in the attributes $\xi$ (hop distance to $d$).


Also available in: Unified diff