I. van Beijnum, J. Crowcroft, F. Valera, M. Bagnulo
{"title":"通过传播最长路径实现多路径BGP的环自由","authors":"I. van Beijnum, J. Crowcroft, F. Valera, M. Bagnulo","doi":"10.1109/ICCW.2009.5207968","DOIUrl":null,"url":null,"abstract":"The concurrent use of multiple paths through a communications network has the potential to provide many benefits, including better utilisation of the network and increased robustness. A key part of a multipath network architecture is the ability for routing protocols to install multiple routes over multiple paths in the routing table. In this paper we propose changes to local BGP processing that allow a BGP router to use multiple paths concurrently without compromising loop-freeness.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"Loop-Freeness in Multipath BGP through Propagating the Longest Path\",\"authors\":\"I. van Beijnum, J. Crowcroft, F. Valera, M. Bagnulo\",\"doi\":\"10.1109/ICCW.2009.5207968\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The concurrent use of multiple paths through a communications network has the potential to provide many benefits, including better utilisation of the network and increased robustness. A key part of a multipath network architecture is the ability for routing protocols to install multiple routes over multiple paths in the routing table. In this paper we propose changes to local BGP processing that allow a BGP router to use multiple paths concurrently without compromising loop-freeness.\",\"PeriodicalId\":271067,\"journal\":{\"name\":\"2009 IEEE International Conference on Communications Workshops\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Conference on Communications Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCW.2009.5207968\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Conference on Communications Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCW.2009.5207968","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Loop-Freeness in Multipath BGP through Propagating the Longest Path
The concurrent use of multiple paths through a communications network has the potential to provide many benefits, including better utilisation of the network and increased robustness. A key part of a multipath network architecture is the ability for routing protocols to install multiple routes over multiple paths in the routing table. In this paper we propose changes to local BGP processing that allow a BGP router to use multiple paths concurrently without compromising loop-freeness.