{"title":"带自终止的标签交换路由","authors":"R. Cohen, Y. Ofek","doi":"10.1109/INFCOM.1993.253245","DOIUrl":null,"url":null,"abstract":"In networks that use label swapping routing, like asynchronous transfer mode (ATM), inconsistent routing tables, due to either incorrect setups or memory failures, can result in infinite looping of packets. A method for ensuring self-termination in such networks is proposed and analyzed. The method is based on imposing linear order on the labels chosen by the stations along the route during connection setup, and on a simple online check performed by every station upon taking routing decisions. the self-termination method along a simple route is then extended to routing over multicast trees.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"107 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Label swapping routing with self-termination\",\"authors\":\"R. Cohen, Y. Ofek\",\"doi\":\"10.1109/INFCOM.1993.253245\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In networks that use label swapping routing, like asynchronous transfer mode (ATM), inconsistent routing tables, due to either incorrect setups or memory failures, can result in infinite looping of packets. A method for ensuring self-termination in such networks is proposed and analyzed. The method is based on imposing linear order on the labels chosen by the stations along the route during connection setup, and on a simple online check performed by every station upon taking routing decisions. the self-termination method along a simple route is then extended to routing over multicast trees.<<ETX>>\",\"PeriodicalId\":166966,\"journal\":{\"name\":\"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings\",\"volume\":\"107 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOM.1993.253245\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.1993.253245","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In networks that use label swapping routing, like asynchronous transfer mode (ATM), inconsistent routing tables, due to either incorrect setups or memory failures, can result in infinite looping of packets. A method for ensuring self-termination in such networks is proposed and analyzed. The method is based on imposing linear order on the labels chosen by the stations along the route during connection setup, and on a simple online check performed by every station upon taking routing decisions. the self-termination method along a simple route is then extended to routing over multicast trees.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
