实现稳定、无环路的域间路由，不需要路径向量

Proceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing Pub Date : 2022-08-22 DOI:10.1145/3527974.3545718

J. Garcia-Luna-Aceves

{"title":"实现稳定、无环路的域间路由，不需要路径向量","authors":"J. Garcia-Luna-Aceves","doi":"10.1145/3527974.3545718","DOIUrl":null,"url":null,"abstract":"A sufficient condition for loop-free routing is introduced based on path labels. A path label consists of the identifier of the first node and hop-count length of a path to a destination. This condition is applied to the policy mechanisms used in BGP, which results in BGP-ELF (BGP Enhanced for Loop Freedom). BGP-ELF uses updates, queries, and replies based on path labels to attain multi-path loop-free and stable routing across autonomous systems without the need for path vectors.","PeriodicalId":294749,"journal":{"name":"Proceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Attaining stable and loop-free inter-domain routing without path vectors\",\"authors\":\"J. Garcia-Luna-Aceves\",\"doi\":\"10.1145/3527974.3545718\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A sufficient condition for loop-free routing is introduced based on path labels. A path label consists of the identifier of the first node and hop-count length of a path to a destination. This condition is applied to the policy mechanisms used in BGP, which results in BGP-ELF (BGP Enhanced for Loop Freedom). BGP-ELF uses updates, queries, and replies based on path labels to attain multi-path loop-free and stable routing across autonomous systems without the need for path vectors.\",\"PeriodicalId\":294749,\"journal\":{\"name\":\"Proceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-08-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3527974.3545718\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3527974.3545718","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

提出了基于路径标签的无环路路由的充分条件。路径标签由第一个节点的标识符和到达目的地路径的跳数长度组成。此条件应用到BGP的策略机制中，形成BGP- elf (BGP Enhanced for Loop Freedom)。BGP-ELF使用基于路径标签的更新、查询和应答，在自治系统之间实现无环、稳定的多路径路由，而不需要路径向量。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Attaining stable and loop-free inter-domain routing without path vectors

A sufficient condition for loop-free routing is introduced based on path labels. A path label consists of the identifier of the first node and hop-count length of a path to a destination. This condition is applied to the policy mechanisms used in BGP, which results in BGP-ELF (BGP Enhanced for Loop Freedom). BGP-ELF uses updates, queries, and replies based on path labels to attain multi-path loop-free and stable routing across autonomous systems without the need for path vectors.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing

自引率

0.00%

发文量