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

Abstract:

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.

Key words: broadband networks, node acceptance, Markov decision process, value iteration