FTTH Network Optimization

• Autorzy: Nghia Le H.
• Języki publikacji: EN

Abstrakty

EN

Fiber To The Home (FTTH) is the most ambitious among optical technologies applied in the access segment of telecommunications networks. The main issues of deploying FTTH are the device price and the installation cost. Whilst the costs of optical devices are gradually decreasing, the cost of optical cable installation remains challenging. In this paper, the problem of optimization that has practical application for FTTH networks is presented. Because the problem is Non-deterministic polynomial-time hard (NP-hard), an approximation algorithm to solve it is proposed. The author has developed the algorithm in a C# program in order to analyze its performance. The analysis confirms that the algorithm gains near-optimal results with acceptable time consumption. Therefore, the algorithm to be applied in a network design tool for FTTH network planning is proposed.

Słowa kluczowe

EN

cost optimization; development optimization; FTTH; optical technology; telecommunications network

• Wydawca: Instytut Łączności - Państwowy Instytut Badawczy
• Czasopismo: Journal of Telecommunications and Information Technology
• Rocznik: 2014
• Tom: nr 4
• Strony: 88--99
• Opis fizyczny: Bibliogr. 16 poz., rys.

Twórcy

autor

Nghia Le H.

• Suntech S.A., Warsaw, Poland

Bibliografia

• [1] B. Williams, “FTTH council global alliance updates”, in Proc. 2013 FTTH LATAM Ann. Conf., Sao Paulo, Brazil, 2013.
• [2] B. Deutsch, R. Whitman, and C. Mazzali, “Optimization of FTTH passive optical networks continues”, Lightwave Mag., Jan. 2005 [Online]. Available: http://www.lightwaveonline.com/articles/2005/01/optimization-of-ftth-passive-optical-networks-continues-53911092.html
• [3] M. Chardy and C. Hervet, “FTTH network design under OA&M constraints”, in Proc. 5th Int. Conf. on Netw. Optimiz. INOC’11, Hamburg, Germany, 2011, pp. 98–104.
• [4] S. van Loggerenberg, L. Grobler, and F. Terblanche, “Optimization of PON planning for FTTH deployment based on coverage”, in Proc. Southern African Telecommun. and Netw. Access Conf. SATNAC 2012, Fancourt in George, Sth. Africa, 2012.
• [5] M. Gr ¨otschel, C. Raack, and A. Werner, “Towards optimizing the deployment of optical access networks”, EURO J. Comput. Optimiz., vol. 2, no. 1–2, 2013.
• [6] M. Chardy, M.-C. Costa, A. Faye, and M. Trampont, “Optimizing splitter and fiber location in a multilevel optical FTTH network”, Eur. J. Operat. Res., vol. 222, no. 3, 2012.
• [7] C. Hervet, A. Faye, M. Costa, M. Chardy, and S. Francfort, “Solving the two-stage robust FTTH network design problem under demand uncertainty”, Elec. Notes in Discrete Mathem., vol. 41, 2013.
• [8] D. Kadhim and N. Hussain, “Link and cost optimization of FTTH network implementation through GPON technology”, Commun. and Netw., vol. 5, 2013.
• [9] M. Brazil, “On the history of the Euclidean Steiner tree problem”, Archive for History of Exact Sciences, vol. 68, no. 3, 2014.
• [10] S. Arora, “Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems”, J. of the ACM, vol. 45, no. 5, 1998.
• [11] L. Chung-Wei et al., “Efficient obstacle-avoiding rectilinear Steiner tree construction”, in Proc. Int. Symp. on Physical Design ISPD’07, Austin, TX, USA, 2007.
• [12] M. Zachariasen and P. Winter, “Obstacle-avoiding Euclidean Steiner trees in the plane: an exact algorithm”, in Algorithm Engineering and Experimentation, M. T. Goodrich, C. C. McGeoch, Eds., LNCS, vol. 1619, pp. 286–299. Springer, 1999.
• [13] M. Garey, “The complexity of computing Steiner minimal trees”, SIAM J. of Appl. Mathem., vol. 32, no. 4, 1977.
• [14] J. W. Van Laarhoven. “Exact and heuristic algorithms for the Euclidean Steiner tree problem”, PhD thesis, University of Iowa, 2010.
• [15] K. Mehlhorn. “A faster approximation algorithm for the Steiner problem in graphs”, Inform. Process. Lett., vol. 27, no. 3, 1988.
• [16] V. V. Vazirani, Approximation Algorithms. Berlin: Springer, 2001.