An optimal algorithm for maximal connectivity of HFC network
- Authors
- Lee, J.H.; Pyo, C.; Chong, K.-R.; Lee, J.-Y.
- Issue Date
- 2003
- Publisher
- Springer Verlag
- Citation
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v.2662, pp.868 - 875
- Journal Title
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- Volume
- 2662
- Start Page
- 868
- End Page
- 875
- URI
- https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/26603
- DOI
- 10.1007/978-3-540-45235-5_85
- ISSN
- 0302-9743
- Abstract
- Since traditional pure coaxial cable based cable television network has been upgraded with Hybrid Fiber Coaxial(HFC) technology, the upstream channel from subscribers to a distribution center has made high speed data access available to cable TV subscribers. However, the presence of much higher levels of noise in the upstream than in the downstream, presents major challenges to the design of effective HFC data access networks. When noise from children nodes accumulated in an amplifier exceeds a certain level, the signal can no longer be separated from the noise. This paper presents an optimal noise control algorithm for HFC network management system(NMS) that minimizes the number of nodes to be cut off to keep the noise under a certain level. For a case where all nodes have equal profits, an optimal algorithm of time complexity of O(n2) is presented. The described algorithms can be used for providing privileged service for premium subscribers in HFC networks. © Springer-Verlag Berlin Heidelberg 2003.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > Computer Engineering > Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/26603)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.