Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computing Minimum-Weight Perfect Matchings
INFORMS Journal on Computing
Evolving Greenfield Passive Optical Networks
BT Technology Journal
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
Practical Deployment of Passive Optical Networks
IEEE Communications Magazine
Technoeconomic evaluation of the major telecommunication investment options for European players
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
We present a topology design methodology for broadband (FTTx) access networks. The calculations are based on real geographic data (digital maps) and infrastructural information of the targeted area, using detailed and realistic cost models in order to provide results of practical interest. The developed heuristics offer low time consumption and nearly optimal solutions for the highly complex problem of minimal cost network deployment, due to the properly chosen and customized heuristic algorithms for the various network technologies. We review the specific properties of the FTTx network technologies, present a formal representation of the problem including a detailed cost function and network model and discuss complexity issues. The various solution techniques are presented along with case studies of real-life scenarios in order to show the potential of the methodology. The developed heuristic algorithms offer an approximation of the optimum within 10---15%, while time consumption remains in the range of a few minutes, even for large-scale scenarios with 10,000s of customers. Beyond topology design, the results provided by these methods are useful for a preliminary CAPEX estimation and techno-economic comparison.