DocumentCode
1294889
Title
Global Access Network Evolution
Author
Chamberland, Steven
Author_Institution
Ecole Polytech. de Montreal, Montreal, QC, Canada
Volume
18
Issue
1
fYear
2010
Firstpage
136
Lastpage
149
Abstract
In this paper, we propose to tackle the problem of updating the access network in order to connect new subscribers and to satisfy the new class of service requirements for the existing subscribers to offer, for instance, new services such as high-definition television (HDTV) over the Internet protocol (IPTV). Four important access network architectures/technologies are considered: the digital subscriber line (xDSL) technologies deployed directly from the central office (CO), the fiber-to-the-node (FTTN), the fiber-to-the-micro-node (FTTn) and the fiber-to-the-premises (FTTP). An integer mathematical programming model is proposed for this network planning problem. Next, a heuristic algorithm based on the tabu search principle is proposed to find ??good?? feasible solutions within a reasonable amount of computational time. Finally, numerical results are presented and analyzed. To assess the quality of the solutions found with the proposed algorithm, they are compared to the optimal solutions found using a commercial implementation of the branch-and-bound algorithm.
Keywords
digital subscriber lines; integer programming; optical fibre subscriber loops; search problems; telecommunication network planning; FTTN; FTTP; FTTn; digital subscriber line; fiber-to-the-micro-node; fiber-to-the-node; fiber-to-the-premises; global access network evolution; heuristic algorithm; integer mathematical programming model; network planning; tabu search principle; xDSL; Access network evolution problem; branch-and-bound; digital subscriber line (xDSL) technologies; fiber-to-the-micro-node (FTTn); fiber-to-the-node (FTTN); fiber-to-the-premises (FTTP); integer mathematical programming; tabu search; xDSL from the central office (CO);
fLanguage
English
Journal_Title
Networking, IEEE/ACM Transactions on
Publisher
ieee
ISSN
1063-6692
Type
jour
DOI
10.1109/TNET.2009.2021430
Filename
5200326
Link To Document