基于安全多方计算的BGP策略冲突检测算法  

An Approach to Seeking BGP Policy Confliction Based on Secure Multi-Party Computation

作　　者：朱珂[1] 姚重俭[1] 朱培栋[1] 卢锡城[1] 

机构地区：[1]国防科技大学计算机学院,湖南长沙410073

出　　处：《计算机工程与科学》2006年第12期85-89,共5页Computer Engineering & Science

基　　金：国家自然科学基金资助项目(90204005);国家863计划资助项目(2003AA121510);现代通信国家重点实验室基金资助项目(51436050605KG0102)

摘　　要：边界网关协议BGP是当前因特网域间路由协议的事实标准,基于策略的路由选择过程使它不再是严格意义上的距离矢量协议,也不再具有距离矢量协议的收敛性。Varadhan指出,自治系统各自为政的策略配置方式会导致全局策略冲突,引起永久性的路由振荡。针对该问题,Griffin利用稳定路径问题SPP模型形式化地抽象出BGP协议行为,并以此为基础提出了一种分布式的策略冲突检测算法,尽管该算法完全避免了传统方法的缺陷,但仍然存在泄漏策略信息、对BGP协议改动太大以及浪费网络资源的问题。本文提出了一种基于安全多方计算的检测路由策略冲突的方法,用于在怀疑BGP路由发生振荡时,动态地检测系统中是否存在策略冲突。该方法采纳了Griffin的理论基础,同时由于巧妙地运用了安全多方计算协议,可以完全解决Griffin算法的问题,具有很好的实用性。The Border Gateway Protocol, BGP, is currently the only inter-domain routing protocol employed on the Internet. BGP is a path-vector protocol that allows each autonomous system to override dlstance-based metrics with policybased metrics when choosing the best routes. Varadhan has shown that it is possible for a group of autonomous systems to independently define BGP policies that together lead to BGP protocol oscillations that never converge on a stable routing. Based on analyzing BGP with the Stable Path Problem （SPP） model, Griffin proposed an efficient algorithm that can find policy conflicts. But this algorithm faces several impediments. In this paper we present a new method which inherits Griffin＇s merits and eliminates his impediments at the same time. With secure multi-party computation, our algorithm can work well and has a significant practical value.

关 键 词：边界网关协议 路由震荡 安全多方计算 稳定路径问题 路由策略 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]