ODL BGP currently implements a fixed policy for both learned and advertised routes, where all routes that don't violate BGP rules are propagated. There are instances where we want more flexible policy on a per-peer basis. This may be as simple as "don't advertise any routes to this peer" or "ignore all routes advertised by this peer".

we should probably compare the complexity of implementing the above two simple policies with that of implementing a full routing policy language.

it may be that long term we wish to implement RPSL.