数据链网络节点入网时隙分配技术研究  

Research on Time Slot Allocation Technology of Data Link Network Node Entry

作　　者：田沿平 卢翰 田华明 TIAN Yanping;LU Han;TIAN Huaming(Qingdao Campus of Naval Aeronautical University,Qingdao 266041,China)

机构地区：[1]海军航空大学青岛校区,山东青岛266041

出　　处：《电声技术》2021年第6期60-64,共5页Audio Engineering

摘　　要：研究数据链网络节点入网时隙分配算法,通过OPNET仿真软件分别采用基于轮询机制的时隙分配算法和基于排队论的时隙分配算法,对数据链中的网络吞吐量和队列时延进行仿真分析。基于轮询机制的时隙分配算法的网络吞吐量大约0.20 Mb·s^(-1),网络的队列时延平均保持在0.33 s左右,可作为时隙分配的保底手段;基于排队论的时隙分配算法的网络吞吐量平均约为0.40 Mb·s^(-1),网络的队列时延一般在0.20 s左右,同时能够在短时间内达到系统稳定,可以作为对网络稳定性有较高要求的系统的有效手段。This paper focuses on the time slot allocation algorithm of data link network node entry.Through OPNET simulation software,the time slot allocation algorithm based on polling mechanism and the time slot allocation algorithm based on queuing theory are respectively adopted to simulate and analyze the network throughput and queue delay in data link.The network throughput of the time slot allocation algorithm based on polling mechanism is about 0.20 Mb·s^(-1).The queue delay of the network is maintained at about 0.33 s on average,which can be used as a guarantee method for slot allocation.The network throughput of the time slot allocation algorithm based on queuing theory is about 0.40 Mb·s^(-1) on average,the queue delay of the network is about 0.20 s generally,and the system stability can be achieved in a short time.Therefore,the time slot allocation algorithm based on queuing theory can be used as an effective means for the system with high requirements for network stability.

关 键 词：入网 轮询机制 排队论 

分 类 号：TN919.72[电子电信—通信与信息系统]