一种通用的时隙环网时隙调度机制

提出一种新颖的时隙环网公平机制——环分布式时隙调度(DTSR), 该机制是分布式的, 适合所有目的节点剥离业务的时隙环网。DTSR通过在单向信道上循环传输的时隙控制头(TCH)内增加一个简单的域, 实现对环上“饿死”节点信息的动态收集, 协调各个节点占用资源的时间, 确保各节点之间的公平性; 在发现环上有“饿死”节点后, DTSR利用时隙环网空间重用的特性, 调度相关节点向不经过“饿死”节点的其他节点发送数据, 充分利用了环网资源; 此外DTSR机制具有良好的算法收敛性, 且接入时延较传统算法更小。最后,对DTSR的性能进行仿真, 并和几个典型的时隙环网的公平机制进行了比较。

A General Timeslot Scheduling Mechanism for Timeslot Ring Network

A distributed timeslot scheduling for ring (DTSR) is presented for all timeslot ring networks based on the destination node stripping. DTSR achieves the dynamic information collection of “starve” nodes in the ring, coordinates the time occupied by nodes, and ensures the fairness each node with increasing a simple field in timeslot control header transmitted circularly in one-way channel. After “starve” nodes are found in ring, DTSR ultilizes the timeslot ring network with spatial reuse, transfers their data to other nodes which are not via “starve” nodes, and therefore makes full use of the ring network resources. In addition, DTSR mechanism has a good convergence of the algorithm, and a smaller access delay than the traditional methods. The performance of DTSR is simulated and compared with the other typical timeslot ring networks.