ETRI-Knowledge Sharing Plaform

KOREAN
논문 검색
Type SCI
Year ~ Keyword

Detail

Conference Paper Heuristic Algorithms for Building Subscriber Lines in Telecommunication Networks
Cited 0 time in scopus Share share facebook twitter linkedin kakaostory
Authors
Jeong Tae Kim, So Young Park, Tae Han Kim, Tchang Hee Hyun
Issue Date
2006-07
Citation
Portland International Conference on Management of Engineering and Technology (PICMET) 2006, pp.2010-2014
Language
English
Type
Conference Paper
DOI
https://dx.doi.org/10.1109/PICMET.2006.296780
Abstract
We study the problem of building subscriber lines with minimal length of duct in telecommunication networks. For, designing physical distribution system or integrated circuit, this problem is known as the k-Minimum Spanning Tree or k-MST problem and it has been widely studied before. In this paper, we demonstrate that for building subscriber lines, general k-MST algorithms does not offer the suitable computing time, because they are based on greedy algorithm and there are many factors to calculate. Thus, we reformulate the problem in terms of minimizing the computing time, rather than the length of duct. We propose heuristic algorithms to compute good approximations for subscriber lines. Our simulation results show that the proposed heuristic algorithms offer affordable computing time compared with general k-MST algorithms without compromising over the length of duct. (c) 2006 PICMET.
KSP Keywords
Computing time, Distribution System, Greedy Algorithm, Heuristic algorithm, Integrated circuit, Many factors, Minimum spanning tree, Physical distribution, Telecommunication Network, k-MST, simulation results