一种宽带接入网络中的节点接纳方法  

Method for node acceptance in broadband access networks

作　　者：齐晓鑫 张冰[1] 邱智亮[1] QI Xiaoxin;ZHANG Bing;QIU Zhiliang(State Key Laboratory of Integrated Service Networks,Xidian University,Xi’an 710071,China)

机构地区：[1]西安电子科技大学综合业务网理论及关键技术国家重点实验室,陕西西安710071

出　　处：《西安电子科技大学学报》2020年第6期99-105,共7页Journal of Xidian University

基　　金：国家重点研发计划(2018YFB1801402,2018YFB1801403)。

摘　　要：针对高性能同轴电缆宽带接入网络中由于共享信道冲突导致节点接纳时间长的问题,提出一种动态节点接纳方法。将信道划分为竞争期与训练期,在竞争期内设置数目可变的上行探测帧时隙,用于节点发送接纳请求;将节点接纳问题建模为一个马尔可夫决策过程,以最小化所有节点完成接纳所需的总时间为目标,采用价值迭代算法求解最优策略,根据当前网络中剩余待接纳的节点数,确定每个竞争期的上行探测帧时隙数和每个节点允许选择的上行探测帧时隙数。仿真结果表明,与固定时隙数目的节点接纳方法相比,所提方法能够显著地减少节点接纳竞争时间,提高信道的利用率。最优策略可以通过离线计算得到,从而以较低的在线计算开销加快节点接纳流程。In an HINOC(HIgh performance Network Over Coax)network,the node acceptance process takes a long time due to conflicts in the shared channel.To solve this problem,a dynamic method of node acceptance is proposed.The channel is divided into contention periods and training periods.Each contention period contains a variable number of uplink detection frame slots in which network nodes send acceptance requests.The node acceptance problem is formulated as a Markov decision process.The objective is to minimize the total time needed to complete the acceptance of all nodes.The optimal policy is obtained by the value iteration algorithm.According to the number of nodes remaining to be accepted in the current network,the number of uplink frame detection frame slots in each contention period and the number of slots that each node is allowed to select are determined.Simulation results show that,compared with the method with a fixed number of slots,the proposed method can significantly reduce the contention time for node acceptance and improve the channel utilization.The optimal policy can be calculated offline,which speeds up the node acceptance process with a lower online computing overhead.

关 键 词：宽带网络 节点接纳 马尔可夫决策过程 价值迭代 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]