...
首页> 外文期刊>Computer Communications >Memory performance optimization of DTN relay node based on M/G/1
【24h】

Memory performance optimization of DTN relay node based on M/G/1

机译:基于M / G / 1的DTN中继节点的内存性能优化

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

Delay/Disruption Tolerant Networking offers a solution to communications in challenged networks despite the long propagation delay, and intermittent connectivity is commonly characteristic of deep-space communications. It combined with the actual application scenarios of M/G/1 queuing model and based on the data delivery mechanism of store-and-forward and retransmission under Bundle Protocol/Licklider Transmission Protocol in DTN. The data delivery time can be divided into two parts by the last round of LTP data segments transmission process, the custody queue length model of BP data unit (i.e. bundle) in relay nodes memory space is determined by calculating the retransmission time of LTP data segments spent in different delivery parts, which can directly measure the consumption and use of relay nodes memory resources. Without affecting the correct delivery of data and in order to obtain a more perfect memory resources allocation strategy, the optimized length of LTP data segment and the optimized number of bundles aggregated by per LTP block are proposed as the joint optimization scheme. The simulation results show that in deep-space channel environment where bundle arrival rate and bit error rate constantly change, the joint optimization scheme proposed in this paper can always maintain the shortest average queue length, which means, occupy less memory space. Compared with the queue without optimization, the queue length of the joint optimization scheme is reduced by 76.65%, which demonstrates the superior performance of this scheme, and realizes the reasonable optimization and utilization of the memory resources of the relay nodes in DTN.
机译:延迟/中断耐受网络提供了在挑战网络中通信的解决方案,尽管传播延迟长,并且间歇性连接是深空通信的共同特征。它结合了M / G / 1排队模型的实际应用场景,并基于DTN中的束协议/ Licklider传输协议下的存储和前进和重传数据传递机制。数据传送时间可以通过最后一轮LTP数据段传输过程划分为两个部分,通过计算LTP数据段的重传时间来确定中继节点存储空间中的BP数据单元(即捆绑)的托管队列长度模型花在不同的交付部件中,可以直接测量中继节点内存资源的消耗和使用。在不影响数据的正确传送和为了获得更完美的内存资源分配策略,提出了LTP数据段的优化长度和由LTP块聚合的优化数量的捆绑包作为联合优化方案。仿真结果表明,在深空通道环境中,在捆绑到达率和误码率不断变化的情况下,本文提出的联合优化方案总是可以保持最短的平均队列长度,这意味着,占用更少的内存空间。与没有优化的队列相比,联合优化方案的队列长度减少了76.65%,这证明了该方案的优越性,并实现了DTN中继节点的记忆资源的合理优化和利用。

著录项

  • 来源
    《Computer Communications》 |2021年第9期|24-32|共9页
  • 作者单位

    Liaoning Tech Univ Sch Elect & Informat Engn Huludao 125105 Liaoning Peoples R China|Liaoning Open Pit Equipment Profess Technol Innov Fuxing 123000 Liaoning Peoples R China;

    Liaoning Tech Univ Grad Sch Huludao 125105 Liaoning Peoples R China;

    Liaoning Tech Univ Sch Elect & Informat Engn Huludao 125105 Liaoning Peoples R China;

    Changshu Inst Technol Sch Phys & Elect Engn Suzhou 215500 Jiangsu Peoples R China;

    Liaoning Tech Univ Grad Sch Huludao 125105 Liaoning Peoples R China;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    DTN; BP; LTP; Queuing model; Memory performance optimization; M; G; 1;

    机译:DTN;BP;LTP;排队模型;记忆性能优化;M;G;1;

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号