使用标记距离的最短多路径路由

C. Balasubramanian, J. Garcia-Luna-Aceves
{"title":"使用标记距离的最短多路径路由","authors":"C. Balasubramanian, J. Garcia-Luna-Aceves","doi":"10.1109/MAHSS.2004.1392170","DOIUrl":null,"url":null,"abstract":"We present and verify SMLDR (Shortest Multipath Labeled Distance Routing), an on-demand loop free multipath routing protocol. It extends Labeled Distance Routing (LDR) to the multipath domain and enables loop freedom by maintaining the ordering of distance invariants. By modifying the route update conditions of LDR and by using the concept of limiting distance we demonstrate shortest multipath routing. Further we describe the fundamental multipath concepts for on-demand routing protocols and elucidate how SMLDR exercises each of these concepts in its routing mechanisms. The performance of SMLDR is compared against the performance of LDR, AODV and its multipath variant AOMDV. The simulation results corroborate the need for shortest multipath routing in terms of higher performance for the chosen metrics.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"Shortest Multipath Routing using Labeled Distances\",\"authors\":\"C. Balasubramanian, J. Garcia-Luna-Aceves\",\"doi\":\"10.1109/MAHSS.2004.1392170\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present and verify SMLDR (Shortest Multipath Labeled Distance Routing), an on-demand loop free multipath routing protocol. It extends Labeled Distance Routing (LDR) to the multipath domain and enables loop freedom by maintaining the ordering of distance invariants. By modifying the route update conditions of LDR and by using the concept of limiting distance we demonstrate shortest multipath routing. Further we describe the fundamental multipath concepts for on-demand routing protocols and elucidate how SMLDR exercises each of these concepts in its routing mechanisms. The performance of SMLDR is compared against the performance of LDR, AODV and its multipath variant AOMDV. The simulation results corroborate the need for shortest multipath routing in terms of higher performance for the chosen metrics.\",\"PeriodicalId\":150940,\"journal\":{\"name\":\"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-10-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MAHSS.2004.1392170\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MAHSS.2004.1392170","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

摘要

我们提出并验证SMLDR(最短多路径标记距离路由),一个按需循环自由的多路径路由协议。它将标记距离路由(LDR)扩展到多路径域,并通过保持距离不变量的顺序来实现环路自由。通过修改LDR的路由更新条件,利用限制距离的概念,给出了最短多径路由。此外,我们还描述了按需路由协议的基本多路径概念,并阐明SMLDR如何在其路由机制中应用这些概念。将SMLDR的性能与LDR、AODV及其多路径变体AOMDV的性能进行了比较。仿真结果证实了对于所选指标而言,需要最短的多路径路由以获得更高的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Shortest Multipath Routing using Labeled Distances
We present and verify SMLDR (Shortest Multipath Labeled Distance Routing), an on-demand loop free multipath routing protocol. It extends Labeled Distance Routing (LDR) to the multipath domain and enables loop freedom by maintaining the ordering of distance invariants. By modifying the route update conditions of LDR and by using the concept of limiting distance we demonstrate shortest multipath routing. Further we describe the fundamental multipath concepts for on-demand routing protocols and elucidate how SMLDR exercises each of these concepts in its routing mechanisms. The performance of SMLDR is compared against the performance of LDR, AODV and its multipath variant AOMDV. The simulation results corroborate the need for shortest multipath routing in terms of higher performance for the chosen metrics.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信