Optimal design of GPON/FTTH networks using mixed integer linear programming

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

13 Scopus citations

Abstract

FTTx access networks offer inherent advantages such as very high bandwidth, immunity against electromagnetic interference and low cost, making them attractive to telecoms operators. With the bandwidth-intensive services such as High Definition TV over IPTV, online gaming, high speed Internet, etc., the deployment of FTTx networks is probably one of the best choices to deliver the required services. However, designs of FTTx networks are typically created manually. Quality of designs often varies based on the planners' experience. Complexity and time constraints make it impossible for the planners to produce an optimal design. In this paper, a mixed integer linear programming (MILP) approach is proposed to demonstrate how this technique can be applied to automate the FTTH designs, hence reducing the capital expenditure (CAPEX) of telecoms companies. Different network examples illustrating optimal or near optimal placement of network elements such as splitters and distribution points and cable assignments for different network elements will be provided.

Original languageBritish English
Title of host publication16th European Conference on Networks and Optical Communications, NOC 2011
Pages137-140
Number of pages4
StatePublished - 2011
Event16th European Conference on Networks and Optical Communications, NOC 2011 - Newcastle-Upon-Tyne, United Kingdom
Duration: 20 Jul 201122 Jul 2011

Publication series

Name16th European Conference on Networks and Optical Communications, NOC 2011

Conference

Conference16th European Conference on Networks and Optical Communications, NOC 2011
Country/TerritoryUnited Kingdom
CityNewcastle-Upon-Tyne
Period20/07/1122/07/11

Fingerprint

Dive into the research topics of 'Optimal design of GPON/FTTH networks using mixed integer linear programming'. Together they form a unique fingerprint.

Cite this