HFC 케이블 TV 망에서 노드선택을 위한 Greedy 휴리스틱 연구 = Greedy Heuristics for Selecting Nodes on HFC Cable TV Network

다국어 초록 (Multilingual Abstract)

The CATV network has traditionally delivered downward broadcasting signals from distribution centers to subscribers. Recently, the increased utilization of upward channels has expanded broadband services such as Internet and telephone services. This upward channel is vulnerable to ingress noises. When the noises from the children nodes accumulated in an amplifier exceeds a certain level, the signal can no longer be separated from the noise. In this case, the node has to be cut off to prevent the noise from propagating further. When each node has some profit value, the node selection problem(NSP) is to select nodes so that the noise in each node does not exceed the given threshold value and the sum of those profits can be maximized. The NSP has shown to be NP-hard. Thus if the number of nodes on the network is large, it is impossible to find the optimal solution as the execution time for finding the optimal solution grows exponentially. In this paper, we have proposed greedy heuristics to find the near-optimal solution for NSP and has shown experimental results.