Local Optimality in Algebraic Path Problems
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Felix Fischer.
Due to complex policy constraints, some Internet routing protocols are associated with nonstandard metrics that fall outside of the approach to path problems based on semirings and “globally optimal” paths. Some of these exotic metrics can be captured by relaxing the semiring axioms to include algebras that are not distributive. A notion of “local optimality” can be defined for such algebras as a fixedpoint of a matrix equation. This is
the case with the Border Gateway Protocol (BGP) that is
used to implement worldwide Internet connectivity. In BGP metrics are derived from the economics of contracts between interacting networks.
This talk is part of the Optimization and Incentives Seminar series.
This talk is included in these lists:
Note that exdirectory lists are not shown.
