计算机科学 ›› 2013, Vol. 40 ›› Issue (8): 100-108.

• 信息安全 • 上一篇    下一篇

基于ASSFR的DTN弹性质量自适应模型

刘振,戚湧,李千目,韩荟,张宏   

  1. 南京理工大学计算机科学与技术学院 南京210094;南京理工大学计算机科学与技术学院 南京210094;南京理工大学计算机科学与技术学院 南京210094;南京理工大学计算机科学与技术学院 南京210094;南京理工大学计算机科学与技术学院 南京210094
  • 出版日期:2018-11-16 发布日期:2018-11-16
  • 基金资助:
    本文受国家自然科学基金(60903027,9),航天一院高校创新基金(CALT201102),江苏省自然科学基金(BK2011370),连云港科技攻关项目(CG1124)资助

DTN Resilience Quality Adaptive Prototype System Based on ASSFR

LIU Zhen,QI Yong,LI Qian-mu,HAN Hui and ZHANG Hong   

  • Online:2018-11-16 Published:2018-11-16

摘要: 针对DTN中支持时效性和资源敏感型服务的质量保证问题,引入INSIGNIA跨层思想和PBNM模式,设计出一种分布式服务质量保证系统——DTN弹性质量自适应原型系统,并针对原型系统,对以往路由协议进行改进,提出自适应种子喷射和焦点路由协议。最后运用ONE网络仿真软件对原型系统的性能进行分析和评估。实验结果表明:与MaxProp协议和Epidemic协议相比,运用弹性质量自适应原型系统,能够降低消息的丢包率、端到端时延和路由开销,提高消息发送的成功率。

关键词: DTN,ASSFR,弹性质量

Abstract: Taking supporting the timeliness and resources sensitive service quality assurance in DTN as research background,this paper integrated the cross layer ideas of INSIGNIA architecture and intelligent management mode of PBNM architecture to design a distributed quality assurance system -- DTN resilience quality adaptive system.What’s more,this paper improved previous routing protocol,proposed a new routing protocol,called Adaptive Seed Spray and Focus Routing.Lastly,this paper used ONE network simulation software to analyze and estimate the performance of prototype system. The result indicates that compared with the MaxProp routing protocol and Epidemic routing protocol,the prototype system can reduce the messages lose rate,end-to-end delay,routing overhead,and improve message delivery successful rate.

Key words: DTN,ASSFR,Resilience quality

[1] Spyropoulos T,Psounis K,et al.Spray and Wait:An EfficientRouting Scheme for Intermittently Connected Mobile Networks[C]∥Proceedings of the ACM SIGCOMM 2005Workshop on Delay Tolerant Networks.2005
[2] Lee S B,Gahng-Seop A,Zhang X,et al.An IP-based quality of service framework for mobile ad hoc networks [J].Journal of parallel and Distributed Conputing,2000,60(4):374-406
[3] 王海涛,刘晓明.带内信令机制及其改进措施[J].数据通信,2005(2):1-5
[4] McCloghrie M,Seligson K,et al.Framework Policy Information Base[EB/OL].RFC 3318.March 2003
[5] 徐佳,孙力娟,等.机会网络中基于种子喷雾的自适应路由协议[J].电子学报,2010,38(10)
[6] Spyropoulos T,Psounis K,Raghavendra C.Spray and Focus:Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility[C]∥Proceedings of IEEE PERCOM on ICMAN.2007
[7] Spyropoulos T,Psounis K,Raghavendra C.Efficient Routing in Intermittently Connected Mobile Networks:The Single-Copy Case[J].IEEE/ACM transation on networking,2008,16(1)
[8] Spyropoulos T,Turletti T,Obrazcka K.Utility-based MessageReplication for Intermittently Connected Heterogeneous Wireless Networks[C]∥Proceedings of IEEE WoWMoM Workshop on AOC.2007
[9] Balasubramanian A,et al.DTN Routing as a Resource Alloca-tion Problem[C]∥ACM SIGCOMM Conference on Computer Communications.2007:373-384
[10] Nicolo D.Performance limits of real delay tolerant networks[C]∥5th Annual Conference on Wireless on Demand Network Systems and Services.2008:149-155
[11] Scott K,Burleigh S.Bundle Protocol Specification[EB/OL].IETF RFC 5050.November 2007
[12] Ramadas M,et al.Licklider Transmission Protocol Specification[EB/OL].IETF RFC 5326.September 2008
[13] Balasubramanian A,Levine B N,et al.DTN Routing as a Re-source Allocation Problem[C]∥ACM SIGCOMM Conference on Computer Communications.2007:373-384
[14] Padma H,Mundur H,Sookyoung H,et al.Routing in intermittent network topologies[C]∥International Workshop on Mo-deling Analysis and Simulation of Wireless and Mobile Systems.2006:385-389
[15] 刘蕴络,胡佳慧,冯艳娟,等.一种基于水声DTN网络的QoS路由算法[J].计算机科学,2011,38(11):37-39
[16] 卓翠敏,李鲁群.面向DTN无线传感网移动节点的动态资源调度模型的研究 [J].计算机科学,2011,38(10):356-358
[17] 樊秀梅,单志广,张宝贤,等.容迟网络体系结构及其关键技术研究[J].电子学报,2008,36(1):161-170
[18] 熊永平,孙利民,牛建伟,等.机会网络[J].软件学报,2009,20(1):124-137
[19] 薛静锋,陆慧梅,石琳.基于概率延迟的DTN路由算法的设计[J].北京理工大学学报,2008,28(8):687-691
[20] 徐昌彪,王宇,祁彦.DTN中基于服务等级的Push-Pull拥塞控制研究[J].计算机应用研究,2010,27(10)

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!