Principles of Safe Policy Routing Dynamics
MetadataShow full item record
Citation (published version)Epstein, Sam; Mattar, Karim; Matta, Ibrahim. "Principles of Safe Policy Routing Dynamics", Technical Report BUCS-TR-2009-013, Computer Science Department, Boston University, April 21, 2009. [Available from: http://hdl.handle.net/2144/1737]
We introduce the Dynamic Policy Routing (DPR) model that captures the propagation of route updates under arbitrary changes in topology or path preferences. DPR introduces the notion of causation chains where the route flap at one node causes a flap at the next node along the chain. Using DPR, we model the Gao-Rexford (economic) guidelines that guarantee the safety (i.e., convergence) of policy routing. We establish three principles of safe policy routing dynamics. The non-interference principle provides insight into which ASes can directly induce route changes in one another. The single cycle principle and the multi-tiered cycle principle provide insight into how cycles of routing updates can manifest in any network. We develop INTERFERENCEBEAT, a distributed algorithm that propagates a small token along causation chains to check adherence to these principles. To enhance the diagnosis power of INTERFERENCEBEAT, we model four violations of the Gao-Rexford guidelines (e.g., transiting between peers) and characterize the resulting dynamics.