首页 | 本学科首页   官方微博 | 高级检索  
     

基于关键节点的域内路由保护算法
引用本文:耿海军,施新刚,王之梁,尹霞,尹少平.基于关键节点的域内路由保护算法[J].计算机科学,2018,45(1):183-187.
作者姓名:耿海军  施新刚  王之梁  尹霞  尹少平
作者单位:山西大学软件学院 太原030006,清华大学网络科学与网络空间研究院 北京100084,清华大学网络科学与网络空间研究院 北京100084,清华大学计算机科学与技术系 北京100084,山西大学软件学院 太原030006
基金项目:本文受国家重点基础研究发展计划(863计划) 基金资助
摘    要:随着互联网规模的膨胀,大量的实时应用部署在互联网上,这些实时应用对网络时延提出了更加严格的要求。然而,目前互联网部署的域内路由协议无法满足实时应用对网络时延的要求,因此提高域内路由可用性成为了一项亟待解决的关键性科学问题。学术界和工业界提出利用路由保护方案来提高路由可用性,从而减少由于网络故障造成的网络中断和报文丢失。已有的路由保护方案将网络中的节点同等对待,没有考虑节点在网络中的重要程度,然而实际情况并非如此。因此,提出了一种基于关键节点的域内路由保护算法(Intra-domain Routing Protection Algorithm Based on Critical Nodes,RPBCN)。首先,建立路由可用性模型,以定量衡量路由可用性;其次,建立节点关键度模型,以定量衡量网络中节点的重要程度;最后,基于路由可用性模型和节点关键度模型,提出基于关键节点的域内路由保护方案。实验结果表明,RPBCN在保证路由可用性的前提下极大地降低了算法的计算开销,从而为ISP解决路由可用性问题提供了一种全新的高效解决方案。

关 键 词:域内路由  路由保护  关键节点  路由可用性
收稿时间:2016/12/4 0:00:00
修稿时间:2017/2/6 0:00:00

Intra-domain Routing Protection Algorithm Based on Critical Nodes
GENG Hai-jun,SHI Xin-gang,WANG Zhi-liang,YIN Xia and YIN Shao-ping.Intra-domain Routing Protection Algorithm Based on Critical Nodes[J].Computer Science,2018,45(1):183-187.
Authors:GENG Hai-jun  SHI Xin-gang  WANG Zhi-liang  YIN Xia and YIN Shao-ping
Affiliation:School of Software Technology,Shanxi University,Taiyuan 030006,China,Institute for Network Sciences and Cyberspace,Tsinghua University,Beijing 100084,China,Institute for Network Sciences and Cyberspace,Tsinghua University,Beijing 100084,China,Department of Computer Science & Technology,Tsinghua University,Beijing 100084,China and School of Software Technology,Shanxi University,Taiyuan 030006,China
Abstract:With the expansion of the Internet,a large number of real-time applications are deployed on the Internet,which places greater demands on network delay.However,the current deployed intra-domain routing protocol cannot meet the requirements of real-time application for network delay.Therefore,improving the Internet routing availability has become an urgent problem.Academia and industry employ routing protection schemes to quickly respond to network failures and improve Internet routing availability.The existing routing protection schemes do not consider the importance of nodes in the network.However,the importance of different nodes in the network is not the same in real networks.To solve this problem,an intra-domain routing protection algorithm based on critical nodes (RPBCN) was proposed.Firstly,an Internet routing availability model is built,which can quantitatively measure the Internet routing availa-bility.Then,a node criticality model is established,which can quantitatively measure the importance of nodes in the network.At last,RPBCN is proposed based on the Internet routing availability model and node criticality model.The experiment results show that RPBCN greatly improves the Internet routing availability while possessing low computation overhead,which provides an efficient solution for the ISP to solve the Internet route availability problem.
Keywords:Intra-domain routing  Routing protection  Critical node  Internet routing availability
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号