一种识别链路故障的算法方法

Mohit Lad, Akash Nanavati, D. Massey, Lixia Zhang
{"title":"一种识别链路故障的算法方法","authors":"Mohit Lad, Akash Nanavati, D. Massey, Lixia Zhang","doi":"10.1109/PRDC.2004.1276549","DOIUrl":null,"url":null,"abstract":"Due to the Internet's sheer size, complexity, and various routing policies, it is difficult if not impossible to locate the causes of large volumes of BGP update messages that occur from time to time. To provide dependable global data delivery we need diagnostic tools that can pinpoint the exact connectivity changes. We describe an algorithm, called MVSChange that can pin down the origin of routing changes due to any single link failure or link restoration. Using a simplified model of BGP, called simple path vector protocol (SPVP), and a graph model of the Internet, MVSChange takes as input the SPVP update messages collected from multiple vantage points and accurately locates the link that initiated the routing changes. We provide theoretical proof for the correctness of the design.","PeriodicalId":383639,"journal":{"name":"10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings.","volume":"293 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"44","resultStr":"{\"title\":\"An algorithmic approach to identifying link failures\",\"authors\":\"Mohit Lad, Akash Nanavati, D. Massey, Lixia Zhang\",\"doi\":\"10.1109/PRDC.2004.1276549\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Due to the Internet's sheer size, complexity, and various routing policies, it is difficult if not impossible to locate the causes of large volumes of BGP update messages that occur from time to time. To provide dependable global data delivery we need diagnostic tools that can pinpoint the exact connectivity changes. We describe an algorithm, called MVSChange that can pin down the origin of routing changes due to any single link failure or link restoration. Using a simplified model of BGP, called simple path vector protocol (SPVP), and a graph model of the Internet, MVSChange takes as input the SPVP update messages collected from multiple vantage points and accurately locates the link that initiated the routing changes. We provide theoretical proof for the correctness of the design.\",\"PeriodicalId\":383639,\"journal\":{\"name\":\"10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings.\",\"volume\":\"293 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-03-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"44\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PRDC.2004.1276549\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PRDC.2004.1276549","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 44

摘要

由于Internet的规模、复杂性和路由策略的多样性,导致BGP更新消息的数量频繁出现,很难定位其原因。为了提供可靠的全球数据传输,我们需要能够精确定位连接变化的诊断工具。我们描述了一种称为MVSChange的算法,它可以确定由于任何单个链路故障或链路恢复而导致的路由变化的起源。MVSChange通过简化BGP的SPVP (simple path vector protocol)模型和Internet的图模型,将从多个有利位置收集到的SPVP更新消息作为输入,精确定位引起路由变化的链路。为设计的正确性提供了理论依据。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An algorithmic approach to identifying link failures
Due to the Internet's sheer size, complexity, and various routing policies, it is difficult if not impossible to locate the causes of large volumes of BGP update messages that occur from time to time. To provide dependable global data delivery we need diagnostic tools that can pinpoint the exact connectivity changes. We describe an algorithm, called MVSChange that can pin down the origin of routing changes due to any single link failure or link restoration. Using a simplified model of BGP, called simple path vector protocol (SPVP), and a graph model of the Internet, MVSChange takes as input the SPVP update messages collected from multiple vantage points and accurately locates the link that initiated the routing changes. We provide theoretical proof for the correctness of the design.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信