## Revision d5aa08f5

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$).

specs/bgp_graphml.tex
40 40
\item \mandatory{type}: \{transit, peer\}, which for a couple $(i, j)\in V\times V$, indicates whether there is a customer-provider or peer-to-peer relationship among $i$ and $j$.

41 41
\item \mandatory{customer}: $z\in V$, in case the edge $(i,j)$ type is \textit{transit}, $z$ identifies the customer among $i,j$ (the relationship provider is hence the other node). It is set to 'none' in the case the edge type is not \textit{transit};

42 42

43
\item mrai: [interval] in seconds, it indicates the per link $(i,j)$ minimum route \ac{ADV} interval. Note, node-based mrai setup (Fabrikant gadget) can be described by setting all its mrai edge intervals to the same value.

43
\item termination1: $i\in (i,j)$;

44
\item termination2: $j\in (i,j)$;

45
\item mrai1: [interval] in seconds, it indicates the per link $(i,j)$ minimum route \ac{ADV} interval for node \textit{termination1}. Note, node-based mrai setup (Fabrikant gadget) can be described by setting all its mrai edge intervals to the same value.

46
\item mrai2: [interval] in seconds, it indicates the per link $(i,j)$ minimum route \ac{ADV} interval for node \textit{termination2}.

44 47
\end{itemize}

45 48

46 49
\section{Example}


Also available in: Unified diff