Key-for-Any-Route，一个弹性路由系统

2016 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshop (DSN-W) Pub Date : 2016-06-01 DOI:10.1109/DSN-W.2016.11

Rodolfo R. Gomes, A. Liberato, C. Dominicini, M. Ribeiro, M. Martinello

{"title":"Key-for-Any-Route，一个弹性路由系统","authors":"Rodolfo R. Gomes, A. Liberato, C. Dominicini, M. Ribeiro, M. Martinello","doi":"10.1109/DSN-W.2016.11","DOIUrl":null,"url":null,"abstract":"This paper proposes KAR (Key-for-Any-Route), a new intra-domain resilient routing system in which edge-nodes set a route ID to select any existing route as an alternative to safely forward packets to their destination. In KAR routing system, a route is defined as the remainder of the division between a route ID and a set of switch IDs along the path(s) between a pair of nodes. KAR-enabled switches explore the existing routes by using special properties of Residue Number System as our encoding technique. Packets are deviated from the faulty link (liveness condition) with routing deflections. Deflected packets are guided to their original destination due to resilient forwarding paths added to the route ID. Three deflection methods are discussed along emulation experiments. Results show that KAR efficiently allows deflected packets to automatically reach their destination, imposing a bound on packets disordering measured in TCP throughput.","PeriodicalId":184154,"journal":{"name":"2016 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshop (DSN-W)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"KAR: Key-for-Any-Route, a Resilient Routing System\",\"authors\":\"Rodolfo R. Gomes, A. Liberato, C. Dominicini, M. Ribeiro, M. Martinello\",\"doi\":\"10.1109/DSN-W.2016.11\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes KAR (Key-for-Any-Route), a new intra-domain resilient routing system in which edge-nodes set a route ID to select any existing route as an alternative to safely forward packets to their destination. In KAR routing system, a route is defined as the remainder of the division between a route ID and a set of switch IDs along the path(s) between a pair of nodes. KAR-enabled switches explore the existing routes by using special properties of Residue Number System as our encoding technique. Packets are deviated from the faulty link (liveness condition) with routing deflections. Deflected packets are guided to their original destination due to resilient forwarding paths added to the route ID. Three deflection methods are discussed along emulation experiments. Results show that KAR efficiently allows deflected packets to automatically reach their destination, imposing a bound on packets disordering measured in TCP throughput.\",\"PeriodicalId\":184154,\"journal\":{\"name\":\"2016 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshop (DSN-W)\",\"volume\":\"106 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshop (DSN-W)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DSN-W.2016.11\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshop (DSN-W)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DSN-W.2016.11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 10

摘要

本文提出了一种新的域内弹性路由系统KAR (Key-for-Any-Route)，在该系统中，边缘节点通过设置路由ID来选择任何现有的路由作为备选路由，从而安全地将数据包转发到目的地。在KAR路由系统中，路由被定义为沿一对节点之间的路径的路由ID和一组交换机ID之间划分的剩余部分。使能卡尔交换机利用剩余数系统的特殊性质作为编码技术来探索现有的路由。报文从故障链路(活跃状态)偏离路由偏转。由于路由ID中增加了弹性转发路径，使得偏转的报文被引导到原来的目的地。通过仿真实验讨论了三种偏转方法。结果表明，KAR有效地允许偏离的数据包自动到达目的地，并对TCP吞吐量测量的数据包无序程度施加限制。

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

查看原文本刊更多论文

KAR: Key-for-Any-Route, a Resilient Routing System

This paper proposes KAR (Key-for-Any-Route), a new intra-domain resilient routing system in which edge-nodes set a route ID to select any existing route as an alternative to safely forward packets to their destination. In KAR routing system, a route is defined as the remainder of the division between a route ID and a set of switch IDs along the path(s) between a pair of nodes. KAR-enabled switches explore the existing routes by using special properties of Residue Number System as our encoding technique. Packets are deviated from the faulty link (liveness condition) with routing deflections. Deflected packets are guided to their original destination due to resilient forwarding paths added to the route ID. Three deflection methods are discussed along emulation experiments. Results show that KAR efficiently allows deflected packets to automatically reach their destination, imposing a bound on packets disordering measured in TCP throughput.

求助全文

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

来源期刊

2016 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshop (DSN-W)

自引率

0.00%

发文量