北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2010, Vol. 33 ›› Issue (4): 88-92.doi: 10.13190/jbupt.201004.88.liuql

• 论文 • 上一篇    下一篇

延迟容忍网络中基于复制率的拥塞控制算法

刘期烈1,2,潘英俊1,李云2,赵玲2   

  1. 1重庆大学 光电技术及系统教育部重点实验室, 重庆 400044; 2重庆邮电大学 移动通信重点实验室, 重庆 400065
  • 收稿日期:2009-10-14 修回日期:2010-03-18 出版日期:2010-08-28 发布日期:2010-05-21
  • 通讯作者: 刘期烈 E-mail:liuql@cqupt.edu.cn
  • 基金资助:

    国家级.国家自然科学基金项目;国家级.国家自然科学基金重大研究计划项目

Congestion Control Strategy Based on Copy Rate in DTN

  • Received:2009-10-14 Revised:2010-03-18 Online:2010-08-28 Published:2010-05-21

摘要:

为了解决延迟容忍网络中现有DropFront(DF)、DropOldest(DO)等拥塞控制算法吞 吐量较低的问题,提出了一种在传统的传染路由协议下基于复制率的拥塞控制算法. 当节点 接收新数据包缓存发生拥塞时,节点根据数据包的复制次数和已经过的生命周期估算各数据 包的复制率,并丢弃复制率最大的数据包,从而缓解拥塞. 仿真结果表明,该算法较DF和DO 算法降低了网络的丢包率,提高了网络的吞吐量,有效地缓解了拥塞.

关键词: 延迟容忍网络, 传染路由, 拥塞控制, 复制率

Abstract:

In order to solve the problem of the low throughput of the dropfront (DF) and dropoldest (DO) in delay tolerant networks (DTN), an enhanced congestion contr ol strategy is proposed under conventional epidemic routing, that is called drop copy rate (DCR). When the congestion of node happening, the copy rates of packe ts stored in buffer and arrived at this node at the same time are calculated, ac cording to the copy numbers , the lapse time and the packet that has the highest copy rate will be deleted, and then the congestion can be relieved. Simulations indicate that DCR decreases the packet loss ratio, and improves the throughput, and relieves congestion effectively of the networks compared to DF and DO.

Key words: delay tolerant network, epidemic routing, congestion control, copy rate