{'fraction_non_alphanumeric': 0.019927536231884056, 'fraction_numerical': 0.0, 'mean_word_length': 5.278409090909091, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
On the Detection of Policy Conflicts in Interdomain Routing

The dynamic policy routing model (DPR) was re- cently introduced to explicitly model the dynamics of policy routing. DPR extends the formalism of the stable paths problem with discrete synchronous time to capture the propagation of path changes in any dynamic network using a structure called the causation chain. In this work, we extend DPR by introducing several novel structures, namely, causation fences and policy digraphs that provide further insight into how the dynamics of policy routing manifest in the network. Using our extensions to DPR, we solve a fundamental problem: policy conflict detection. We show how the root cause of any cycle of routing update messages, under any routing policy configuration, can be precisely inferred as either a transient route flap or a policy conflict. We also develop SAFETYPULSE, a token-based distributed algorithm to detect policy conflicts in any dynamic network. SAFETYPULSE has several novel characteristics, namely, it is privacy preserving, computationally efficient and provably correct.