• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IEEE Conference on Computer Communications >Verifying Policy-based Routing at Internet Scale
【24h】

Verifying Policy-based Routing at Internet Scale

机译：在Internet规模上验证基于策略的路由

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Routing policy configuration plays a crucial role in determining the path that network traffic takes to reach a destination. Network administrators/operators typically decide the routing policy for their networks/routers independently. The paths/routes resulted from these independently configured routing policies might not necessarily meet the intent of the network administrators/operators. Even the very basic networkwide properties of the routing policies such as reachability between a pair of nodes need to be verified.In this paper, we propose a scheme that characterizes routingpolicy verification problems into a Satisfiability Modulo Theories (SMT) problems. The key idea is to formulate the SMT model in a policy-aware manner so as to reduce/eliminate the mutual dependencies between variables as much as possible. Further, we reduce the size of the generated SMT model through pruning. We implement and evaluate the policy-aware model through an outof-box SMT solver. The experimental results show that the policyaware model can reduce the time it takes to perform verification by as much as 100x even under a modest topology size. It takes only a few minutes to answer a query for a topology containing tens of thousands of nodes.
机译：路由策略配置在确定网络流量到达目的地所采用的路径中起着至关重要的作用。网络管理员/运营商通常独立地为其网络/路由器决定路由策略。由这些独立配置的路由策略产生的路径/路由不一定满足网络管理员/运营商的意图。甚至还需要验证路由策略的非常基本的网络范围属性，例如一对节点之间的可达性。在本文中，我们提出了一种将路由策略验证问题特征化为可满足性模块理论（SMT）问题的方案。关键思想是以策略感知的方式制定SMT模型，以便尽可能减少/消除变量之间的相互依赖性。此外，我们通过修剪减少了生成的SMT模型的大小。我们通过现成的SMT求解器来实现和评估策略感知模型。实验结果表明，即使在适当的拓扑大小下，策略感知模型也可以将执行验证所需的时间减少多达100倍。只需几分钟即可回答包含成千上万个节点的拓扑的查询。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号