본문 바로가기
  • Home

Heuristics for Selecting Nodes on Cable TV Network

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2008, 13(4), pp.133-140
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Kyun Rak Chong 1

1홍익대학교

Accredited

ABSTRACT

The cable TV network has delivered downward broadcasting signals from distribution centers to subscribers. Since the traditional coaxial cable has been upgraded by the Hybrid Fiber Coaxial(HFC) cable, the upward channels has expanded broadband services such as Internet. This upward channel is vulnerable to ingress noises. When the noises from the children nodes accumulated in an amplifier exceeds a certain level, that node has to be cut off to prevent the noise propagation. The node selection problem(NSP) is defined to select nodes so that the noise in each node does not exceed the given threshold value and the sum of profits of selected nodes can be maximized. The NSP has shown to be NP-hard. In this paper, we have proposed heuristics to find the near-optimal solution for NSP. The experimental results show that interval partitioning is better than greedy approach. Our heuristics can be used by the HFC network management system to provide privileged services to the premium subscribers on HFC networks.

Citation status

* References for papers published after 2022 are currently being built.