Research On The Policy Of Slot Assignment In TDMA System

With the continuous development of network technology and the increasing popularity of network applications.the high-quality care and services gradually become the subject of study.The Quality of Service (QoS) and network allocation of bandwidth are closely related.The allocation of bandwidth is related to packet scheduling algorithm.Therefore packet scheduling algorithm should be able to ensure real-time traffic delay requirements and high fairness for each traffic services.This paper presents a new loop scheduling algorithm MURR (Modified Uniform Round Robin). MURR algorithm is based on URR (Uniform Round Robin) algorithm. simulation results show that the MURR algorithm has high fairness and low latency performance and can be applied to high-speed network. My efforts are as follows:(1) Through the comparison and simulation of six scheduling algorithms. the fairness and delay performance of existing algorithms need to be improved. the necessity of a new cycle scheduling algorithms has been obtained.(2) Through the simulation and analysis of the new loop scheduling algorithm.this program has some advantages of the existing algorithms in fairness and delay performance.