基于SCTP-CMT的接收端数据乱序问题研究

发布时间：2018-02-08 17:48

本文关键词： SCTP-CMT 数据乱序数据调度算法接收缓存占用大小乱序长度　出处：《东北大学》2014年硕士论文　论文类型：学位论文

【摘要】：随着网络的发展,多流和多宿主的网络环境越来越普及,使得现有的传输层协议无法很好的满足不断提高的传输要求,流控制传输协议SCTP取代TCP和UDP成为下一代互联网的传输协议已经成为必然趋势。为了能够更好的利用网络资源,聚合带宽,提高网络吞吐量,在SCTP的基础上,研究人员提出了多路同时传输(Concurrent Multipath Transfer, CMT)技术,它通过扩展SCTP的多宿主特性,实现了端到端的多路径并行数据传输,达到灵活、高效利用异构网络资源的目标。但是由于路径带宽、时延的动态变化导致的接收端数据乱序影响了SCTP-CMT传输的性能,因此研究接收端数据乱序问题具有重要的理论意义和应用价值。首先,从标准的SCTP入手,分析了SCTP及SCTP-CMT技术的国内外研究现状,分析了其对多路同时传输的支持及限制,分析了接收端数据乱序产生的原因、影响及现有解决方案。在此基础上,考虑端到端路径可用带宽和传播时延的动态变化,提出一种基于反馈和M/G/1结构的数据调度算法,该算法通过对路径可用带宽的分析,将每条传输路径上的子业务流等效成一个M/G/1排队模型,同时利用路径的反馈信息和业务流分配方法在发送端对业务流进行分流及数据调度,最大程度的解决接收端的数据乱序问题。在提出基于反馈和M/G/1结构的数据调度算法之前,为了直观体现反馈的思想,提出一种基于反馈的数据调度算法,该算法考虑路径传播时延的动态变化,通过路径传播时延的反馈信息动态的调整路径参数,同时在发送端对数据进行合理的调度。为了验证所提算法的合理性和有效性,选用NS-2软件进行仿真。在仿真实验中,以接收缓存占用大小和乱序长度作为主要的性能指标,将所设计的算法与原有的算法做对比。仿真结果表明：基于反馈和M/G/1结构的数据调度算法在路径时延和带宽动态变化下能够有效的降低接收端的数据乱序,提高了端到端的传输效率。最后,对课题工作进行了总结,并对下一步的研究方向进行了展望。
[Abstract]:With the development of network, multi-stream and multi-host network environment is becoming more and more popular, which makes the existing transport layer protocol can not meet the increasing requirements of transmission. In order to make better use of network resources, aggregate bandwidth and improve network throughput, stream control transport protocol (SCTP) has become an inevitable trend to replace TCP and UDP as the transport protocol of next generation Internet. In order to make better use of network resources, aggregate bandwidth and improve network throughput, it is based on SCTP. Researchers put forward the concurrent Multipath transfer (CMT) technology, which can realize end-to-end multipath parallel data transmission by extending the multi-host characteristic of SCTP. The target of efficient utilization of heterogeneous network resources. However, due to the dynamic change of path bandwidth and delay, the receiving end data disorder affects the performance of SCTP-CMT transmission. Therefore, it is of great theoretical significance and practical value to study the problem of data disordering at the receiving end. Firstly, starting with the standard SCTP, the research status of SCTP and SCTP-CMT technology at home and abroad is analyzed, and its support and limitation to multi-channel simultaneous transmission are analyzed. Based on the analysis of the causes, effects and existing solutions of the data disorder at the receiving end, a data scheduling algorithm based on feedback and M / G / 1 structure is proposed, considering the dynamic changes of the available bandwidth and propagation delay of the end-to-end path. By analyzing the available bandwidth of the path, the sub-traffic on each transmission path is equivalent to an M / G / 1 queueing model. At the same time, the routing feedback information and the traffic flow assignment method are used to split the traffic and schedule the traffic at the sending end. Before putting forward the data scheduling algorithm based on feedback and M / G / 1 structure, in order to reflect the idea of feedback, a data scheduling algorithm based on feedback is proposed. Considering the dynamic change of path propagation delay, the algorithm dynamically adjusts path parameters through feedback information of path propagation delay, and carries out reasonable scheduling of data at the sending end, in order to verify the rationality and effectiveness of the proposed algorithm. The NS-2 software is selected for simulation. In the simulation experiment, the size of the receiving buffer and the disordered length are taken as the main performance indexes. The simulation results show that the data scheduling algorithm based on feedback and M / G / 1 structure can effectively reduce the data disorder in the receiver under the dynamic changes of path delay and bandwidth. The end-to-end transmission efficiency is improved. Finally, the research work is summarized and the future research direction is prospected.
【学位授予单位】：东北大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TN915.04

【相似文献】