کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10338161 | 693443 | 2005 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Near-optimal tree-based access network design
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
Among various access network topologies, the tree topology is the most popular due to its simplicity and relatively low cost. A salient example is the CATV network. In this paper, we consider the tree-based access network design problem where the operational cost and the fixed installation cost are jointly minimized. The problem is formulated as a combinatorial optimization problem, where the difficulty of solving a Steiner tree problem typically encountered in a tree-based topological design problem is particularly circumvented. The basic approach to the algorithm development is Lagrangean relaxation and the subgradient method. In the computational experiments, the proposed algorithm calculates near-optimal solutions within 3.2% of an optimal solution in 1Â min of CPU time for test networks of up to 26 nodes.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computer Communications - Volume 28, Issue 2, 10 February 2005, Pages 236-245
Journal: Computer Communications - Volume 28, Issue 2, 10 February 2005, Pages 236-245
نویسندگان
Hong-Hsu Yen, Frank Yeong-Sung Lin,