ddn中喷雾和等待路由协议的缓冲区管理策略

E. Wang, Yongjian Yang, Jie Wu, Wenbin Liu
{"title":"ddn中喷雾和等待路由协议的缓冲区管理策略","authors":"E. Wang, Yongjian Yang, Jie Wu, Wenbin Liu","doi":"10.1109/ICPP.2015.89","DOIUrl":null,"url":null,"abstract":"Due to unpredictable node mobility and the easily-interrupted connections, routing protocols in DTNs commonly utilize multiple message copies to improve the delivery ratio. A store-carry-and-forward paradigm is also designed to assist routing messages. However, excessive message copies lead to rapid consumption of the limited storage and bandwidth. The spray and Wait routing protocol has been proposed to reduce the network overload caused by the storage and transmission of unrestricted message copies. However, there still exist congestion problems when a node's buffer is quite constrained. In this paper, we propose a message Scheduling and Drop Strategy on spray and wait Routing Protocol (SDSRP). To improve the delivery ratio, first of all, SDSRP calculates the priority of each message by evaluating the impact of both replicating and dropping a message copy on delivery ratio. Subsequently, scheduling and drop decisions are made according to the priority. Finally, we conduct extensive simulations based on synthetic and real traces in ONE. The results show that, compared with other buffer management strategies, SDSRP achieves higher delivery ratio, similar average hop counts, and lower overhead ratio.","PeriodicalId":423007,"journal":{"name":"2015 44th International Conference on Parallel Processing","volume":"110 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"A Buffer Management Strategy on Spray and Wait Routing Protocol in DTNs\",\"authors\":\"E. Wang, Yongjian Yang, Jie Wu, Wenbin Liu\",\"doi\":\"10.1109/ICPP.2015.89\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Due to unpredictable node mobility and the easily-interrupted connections, routing protocols in DTNs commonly utilize multiple message copies to improve the delivery ratio. A store-carry-and-forward paradigm is also designed to assist routing messages. However, excessive message copies lead to rapid consumption of the limited storage and bandwidth. The spray and Wait routing protocol has been proposed to reduce the network overload caused by the storage and transmission of unrestricted message copies. However, there still exist congestion problems when a node's buffer is quite constrained. In this paper, we propose a message Scheduling and Drop Strategy on spray and wait Routing Protocol (SDSRP). To improve the delivery ratio, first of all, SDSRP calculates the priority of each message by evaluating the impact of both replicating and dropping a message copy on delivery ratio. Subsequently, scheduling and drop decisions are made according to the priority. Finally, we conduct extensive simulations based on synthetic and real traces in ONE. The results show that, compared with other buffer management strategies, SDSRP achieves higher delivery ratio, similar average hop counts, and lower overhead ratio.\",\"PeriodicalId\":423007,\"journal\":{\"name\":\"2015 44th International Conference on Parallel Processing\",\"volume\":\"110 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 44th International Conference on Parallel Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPP.2015.89\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 44th International Conference on Parallel Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPP.2015.89","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

由于不可预测的节点移动性和容易中断的连接,ddn中的路由协议通常使用多个消息副本来提高传递率。存储-携带-转发范例也被设计用来帮助路由消息。但是,过多的消息副本会导致有限的存储和带宽的快速消耗。为了减少由于存储和传输不受限制的消息副本而造成的网络过载,提出了喷雾和等待路由协议。然而,当节点的缓冲区非常受限时,仍然存在拥塞问题。本文提出了一种基于喷雾等待路由协议(SDSRP)的消息调度和丢弃策略。为了提高传递比率,首先,SDSRP通过评估复制和删除消息副本对传递比率的影响来计算每个消息的优先级。然后,根据优先级做出调度和放弃决策。最后,我们在ONE中进行了基于合成和真实轨迹的广泛模拟。结果表明,与其他缓冲管理策略相比,SDSRP实现了更高的投递率、相似的平均跳数和更低的开销率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Buffer Management Strategy on Spray and Wait Routing Protocol in DTNs
Due to unpredictable node mobility and the easily-interrupted connections, routing protocols in DTNs commonly utilize multiple message copies to improve the delivery ratio. A store-carry-and-forward paradigm is also designed to assist routing messages. However, excessive message copies lead to rapid consumption of the limited storage and bandwidth. The spray and Wait routing protocol has been proposed to reduce the network overload caused by the storage and transmission of unrestricted message copies. However, there still exist congestion problems when a node's buffer is quite constrained. In this paper, we propose a message Scheduling and Drop Strategy on spray and wait Routing Protocol (SDSRP). To improve the delivery ratio, first of all, SDSRP calculates the priority of each message by evaluating the impact of both replicating and dropping a message copy on delivery ratio. Subsequently, scheduling and drop decisions are made according to the priority. Finally, we conduct extensive simulations based on synthetic and real traces in ONE. The results show that, compared with other buffer management strategies, SDSRP achieves higher delivery ratio, similar average hop counts, and lower overhead ratio.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信