Proceedings ArticleDOI
Cost Minimization Planning for Passive Optical Networks
Ji Li,Gangxiang Shen +1 more
- pp 1-3
TLDR
In this paper, an efficient heuristic is proposed, which can reduce 50%~70% PON network deployment costs compared to a benchmark sectoring approach, and can reduce the total cost of the network.Abstract:
We plan PON network deployment to minimize its total cost. An efficient heuristic is proposed, which can reduce 50%~70% PON network deployment costs compared to a benchmark sectoring approach.read more
Citations
More filters
Journal ArticleDOI
Cost Minimization Planning for Greenfield Passive Optical Networks
Ji Li,Gangxiang Shen +1 more
TL;DR: This work proposes an efficient heuristic called the Recursive Association and Relocation Algorithm (RARA) to solve the optimization problem of greenfield PON networks and can significantly reduce PON network deployment costs compared to an intuitive random-cut sectoring approach.
Journal ArticleDOI
Design and optimization of fiber optic small-cell backhaul based on an existing fiber-to-the-node residential access network
Chathurika Ranaweera,Mauricio G. C. Resende,Kenneth C. Reichmann,Patrick P. Iannone,P. Henry,Byoung-Jo Kim,Pete Magill,Kostas N. Oikonomou,Rakesh K. Sinha,Sheryl L. Woodward +9 more
TL;DR: An efficient fiber backhaul strategy for a small-cell network, which leverages facilities associated with an existing FTTN residential access network is described, which is only feasible if the carrier has a legacy local fiber network.
Journal ArticleDOI
Geography- and infrastructure-aware topology design methodology for broadband access networks (FTTx)
TL;DR: 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.
Journal ArticleDOI
Design of cost-optimal passive optical networks for small cell backhaul using installed fibers [invited]
Chathurika Ranaweera,Patrick P. Iannone,Kostas N. Oikonomou,Kenneth C. Reichmann,Rakesh K. Sinha +4 more
TL;DR: An optimization framework for planning a cost-minimized backhaul for a small cell network, which is based on the deployment of passive optical networks on top of the existing infrastructure and can halve the costs associated with small cell backhaul deployment.
Journal ArticleDOI
Optimization of multiple PON deployment costs and comparison between GPON, XGPON, NGPON2 and UDWDM PON
TL;DR: The optimal network deployment in a series of different minimum guaranteed bit rate demand scenarios is evaluated, employing realistic maps of a large city in order to compare costs and portrait some reference points for deciding in which scenario a specific technology constitutes the best choice.
References
More filters
A Review of Routing and Wavelength Assignment Approaches for Wavelength- Routed Optical WDM Networks
TL;DR: In this paper, a distributed relative capacity loss (DRCL) scheme is proposed for wavelength-routed optical WDM networks, which works well in distributed controlled networks and demonstrates the performance of DRCL through simulation.
Journal ArticleDOI
Lightpath communications: an approach to high bandwidth optical WAN's
TL;DR: It is shown that although the problem of optimally establishing lightpaths is NP-complete, simple heuristics provide near optimal substitutes for several of the basic problems motivated by a lightpath-based architecture.
Journal ArticleDOI
Steiner Minimal Trees
E. N. Gilbert,H. O. Pollak +1 more
TL;DR: A Steiner minimal tree for given points in the plane is a tree which interconnects these points using lines of shortest possible total length as mentioned in this paper, where the length of the shortest possible line is chosen.
Journal ArticleDOI
Some principles for designing a wide-area WDM optical network
TL;DR: In this paper, the authors explore design principles for next-generation optical wide-area networks, employing wavelength-division multiplexing (WDM) and targeted to nationwide coverage, and formulate the virtual topology design problem as an optimization problem with one of two possible objective functions: (1) for a given traffic matrix, minimize the networkwide average packet delay (corresponding to a solution for present traffic demands), or (2) maximize the scale factor by which the traffic matrix can be scaled up (to provide the maximum capacity upgrade for future traffic demands).