TDMA系统中的时隙分配策略研究

发布时间：2019-04-26 12:39

【摘要】：随着网络技术的不断发展和网络应用的日益普及,为用户提供高质量的服务逐渐成为人们关心和研究的课题。用户业务的服务质量(QoS)与网络带宽资源的分配密切相关。而带宽资源的分配与分组调度算法是相关的,因此分组调度算法应该能够确保实时业务的时延要求,能够公平地为各个业务流服务。本文提出了一种新的循环调度算法MURR (Modified Uniform Round Robin), MURR算法是在URR (Uniform Round Robin)算法的基础上改进的。经过仿真验证,结果表明MURR算法具有高公平,低时延的性能并且可以应用到高速网络中。本文的主要工作如下： (1)比较和仿真了多种调度算法,总结得出,现有的算法公平性和时延性能有待改善,引入新的循环调度算法的是势在必行的。 (2)通过对新的循环调度算法的仿真和分析,确定了该方案比已有的算法在时延和公平性的实现方面有一定的优越性。
[Abstract]:With the continuous development of network technology and the increasing popularity of network applications, providing high-quality services for users has gradually become a subject of concern and research. The quality of service (QoS) of user service is closely related to the allocation of network bandwidth resources. The allocation of bandwidth resources is related to the packet scheduling algorithm, so the packet scheduling algorithm should be able to ensure the delay requirements of real-time traffic and serve each traffic flow fairly. This paper presents a new cyclic scheduling algorithm, MURR (Modified Uniform Round Robin), MURR algorithm, which is improved on the basis of URR (Uniform Round Robin) algorithm. The simulation results show that the MURR algorithm has high fairness, low delay and can be used in high-speed networks. The main work of this paper is as follows: (1) A variety of scheduling algorithms are compared and simulated. It is concluded that the fairness and delay performance of the existing algorithms need to be improved. It is imperative to introduce a new round-robin scheduling algorithm. (2) through the simulation and analysis of the new cyclic scheduling algorithm, it is confirmed that the proposed scheme has some advantages over the existing algorithms in the implementation of delay and fairness.
【学位授予单位】：西安电子科技大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TN929.532

【相似文献】