长RTD信道Q叉树形冲突分解算法研究  

Q-ary Tree Collision Resolution Algorithms Over Long RTD HFC Networks

作　　者：高飞[1] 杨怡怀 李琰[1] 

机构地区：[1]云南民族学院信息与电气工程系,昆明650031 [2]昆明理工大学信电工程学院,昆明650051

出　　处：《通信技术》2001年第6期57-60,共4页Communications Technology

基　　金：云南省自然科学基金资助(基金号2000F0065M)

摘　　要：研究了集中控制式HFC双向传输网络长往返时延(round-tripdelay,RTD)信道的基本特点,指出用于立即反馈(immediatefeedback)信道(RTD≤1时隙)的冲突分解算法不适合于长RTD信道,讨论了Q叉树形交织(interleaving)算法的基本原理,导出了当RTD=2时隙时,二叉树和三叉树形冲突分解交织算法的解析表达式,进行了计算机仿真实验,获得了一些有意义的结果。In this paper, the authors analyzed the characteristics of the long round-trip delay (RTD) channel over the centralized control bi-direction hybrid fiber/coaxial (HFC) networks,and showed the collision resolution algorithms used in immediate feedback channel( RTD≤1 slot) don′t adapt to the long RTD channel. Based on the study of the basic principle of Q-ary tree collision resolution algorithm, by introducing interleaving scheme, we derived the analytical expression when Q=2, Q=3 and RTD=2(slots) . Also, some significant conclusions were obtained from analyzing the theory value and the computer simulation experiment results in this paper.

关 键 词：HFC网络 冲突分解 Q叉树形算法 通信网 RTD信道 

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