Heuristics-based PON deployment

This letter proposes a simple greedy algorithm and three of its variants for the passive optical network (PON) deployment on an arbitrary grid. The algorithms guarantee a result of 2-approximation to the optimal solution with worst case running time of O(n/sup 2/+m/sup 2/). This improves upon the be...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE communications letters 2005-09, Vol.9 (9), p.847-849
1. Verfasser:	Khan, S.U.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Computer simulation Cost engineering Costs Density functional theory Equipment costs Exact sciences and technology Graphs Greedy algorithms Optical communication equipment Optical devices Optical fiber communication Optical fiber communications Optical fiber devices Optical fiber networks Optical telecommunications Optimization Optimization methods Passive optical networks Population density Running Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Transmission and modulation (techniques and equipments)
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	This letter proposes a simple greedy algorithm and three of its variants for the passive optical network (PON) deployment on an arbitrary grid. The algorithms guarantee a result of 2-approximation to the optimal solution with worst case running time of O(n/sup 2/+m/sup 2/). This improves upon the best previously known result of 3-approximation with worst case running time of O(n/sup 5/). We also improve the simulation study by introducing the concept of population density function embedded graphs. The experimental results reveal that the proposed algorithms save 45-65% of the deployment cost (fiber, equipment, etc.) on average.
ISSN:	1089-7798 1558-2558
DOI:	10.1109/LCOMM.2005.1506723