J. Garcia-Luna-Aceves, Bradley R. Smith, Judith T. Samson
{"title":"基于优势距离向量的QoS路由","authors":"J. Garcia-Luna-Aceves, Bradley R. Smith, Judith T. Samson","doi":"10.1109/IWQoS54832.2022.9812900","DOIUrl":null,"url":null,"abstract":"The Dominant-Distance Routing Information Protocol (DRIP) is introduced for quality-of-service (QoS) routing based on multiple criteria and is proven to be loop-free at every instant and capable of converging to optimal routes if they exist. DRIP is based on the exchange of updates and queries stating reference routing-metric values for destinations. Simulation experiments based on ns3 are used to compare DRIP against the Non-Restarting Vectoring Protocol recently proposed by Sobrinho and Ferreira, as well as OSPF and RIPv2. The results demonstrate that DRIP provides loop-free routing based on multiple performance and policy criteria as efficiently as routing protocols for shortest-path routing.","PeriodicalId":353365,"journal":{"name":"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"QoS Routing Using Dominant-Distance Vectors\",\"authors\":\"J. Garcia-Luna-Aceves, Bradley R. Smith, Judith T. Samson\",\"doi\":\"10.1109/IWQoS54832.2022.9812900\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Dominant-Distance Routing Information Protocol (DRIP) is introduced for quality-of-service (QoS) routing based on multiple criteria and is proven to be loop-free at every instant and capable of converging to optimal routes if they exist. DRIP is based on the exchange of updates and queries stating reference routing-metric values for destinations. Simulation experiments based on ns3 are used to compare DRIP against the Non-Restarting Vectoring Protocol recently proposed by Sobrinho and Ferreira, as well as OSPF and RIPv2. The results demonstrate that DRIP provides loop-free routing based on multiple performance and policy criteria as efficiently as routing protocols for shortest-path routing.\",\"PeriodicalId\":353365,\"journal\":{\"name\":\"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWQoS54832.2022.9812900\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWQoS54832.2022.9812900","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Dominant-Distance Routing Information Protocol (DRIP) is introduced for quality-of-service (QoS) routing based on multiple criteria and is proven to be loop-free at every instant and capable of converging to optimal routes if they exist. DRIP is based on the exchange of updates and queries stating reference routing-metric values for destinations. Simulation experiments based on ns3 are used to compare DRIP against the Non-Restarting Vectoring Protocol recently proposed by Sobrinho and Ferreira, as well as OSPF and RIPv2. The results demonstrate that DRIP provides loop-free routing based on multiple performance and policy criteria as efficiently as routing protocols for shortest-path routing.