Solving the Passive Optical Network with Fiber Duct Sharing Planning Problem Using Discrete Techniques

doi:10.1016/j.endm.2013.05.111

Electronic Notes in Discrete Mathematics

Volume 41, 5 June 2013, Pages 343-350

https://doi.org/10.1016/j.endm.2013.05.111 Get rights and content

Abstract

Similar to the constrained facility location problem, the passive optical network (PON) planning problem necessitates the search for a subset of deployed facilities (splitters) and their allocated demand points (optical network units) to minimize the overall deployment cost. In this paper we use a mixed integer linear programming formulation stemming from network flow optimization to construct a heuristic based on limiting the total number of interconnecting paths when implementing fiber duct sharing. Then, a disintegration heuristic involving the construction of valid clusters from the output of a k means algorithm, reduce the time complexity while ensuring close to optimal results. The proposed heuristics are then evaluated using a real-world dataset, showing favourable performance.

References (6)

F. Effenberger et al.
An introduction to pon technologies [topics in optical communications]
Communications Magazine, IEEE
(2007)
D. Eppstein
Finding the k shortest paths
J. Li et al.
Cost minimization planning for greenfield passive optical networks
Optical Communications and Networking, IEEE/OSA Journal of
(2009)

There are more references available in the full text version of this article.

Cited by (10)

Fiber cable network design in tree networks
2018, European Journal of Operational Research
Citation Excerpt :
In an operational context, decisions of different types are successively questioned and validated: more precisely, the selection of a tree-structured set of connections (ducts within which cables will be deployed) is made prior to the cable scheme design. The reader can refer to Papaefthimiou, Tefera, Mihaylov, Guitierrez, and Jensen (2013), Yazar, Arslan, Karaşan, and Kara (2015) and van Loggerenberg, Grobler, and Terblanche (2013) for works related to the design/selection of civil engineering tree structure either from a copper network, which is usually sparse and connected, or in a greenfield context, where the main expense is the cost for digging trenches. This paper tackles a sub-problem of the FTTH network design problem, which consists in linking one equipment location (CO or splitters) to several others (respectively splitters or clients), using fiber cables, at minimal cost.
This work focuses on a fiber cable network design problem in the context of Fiber To The Home (FTTH) where separation techniques such as splicing and tapping are considered. Assuming the civil engineering structure is a tree, the problem is proven to be NP-hard and even hard to approximate. Two exact integer programming models taking into account some operator’s engineering rules are introduced. Enhancements are provided for both models leading to significant computing time reduction. Computational experiments are performed on real-life instances with real costs including both manpower and material costs incurred by the network operator.
A Case Study on Optical Fiber Network Current Situation and Future Vision in Sana'a City
2023, 2023 3rd International Conference on Emerging Smart Technologies and Applications, eSmarTA 2023
Fiber to the Home (FTTH) Automation Planning, Its Impact on Customer Satisfaction & Cost-Effectiveness
2021, Wireless Personal Communications
Optimization of multilayer design for FTTH networks based on geographical information
2020, IEEE International Conference on Industrial Engineering and Engineering Management
Warm-start heuristics for solving the passive optical network planning problem
2018, South African Journal of Industrial Engineering
Theoretical approach for a multi-operator synergistic utility planning and its real-life implications
2017, 2017 56th FITCE Congress, FITCE 2017

View all citing articles on Scopus

^☆: Research partially sponsored by the Telkom CoE, South Africa

View full text

Solving the Passive Optical Network with Fiber Duct Sharing Planning Problem Using Discrete Techniques☆

Abstract

An introduction to pon technologies [topics in optical communications]

Communications Magazine, IEEE

Finding the k shortest paths

Cost minimization planning for greenfield passive optical networks

Optical Communications and Networking, IEEE/OSA Journal of