Global Access Network Evolution

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.

[1]  Geraldo Robson Mateus,et al.  Model and heuristic for a generalized access network design problem , 2000, Telecommun. Syst..

[2]  G. Michael Schneider,et al.  An Algorithm for the Design of Multilevel Concentrator Networks , 1982, Comput. Networks.

[3]  Poon,et al.  Designing optimal FTTH and PON networks using new automatic methods , 1996 .

[4]  Erik Rolland,et al.  A Memory Adaptive Reasoning Technique for Solving the Capacitated Minimum Spanning Tree Problem , 1999, J. Heuristics.

[5]  J. Mellis,et al.  Successful Application of Genetic Algorithms to Network Design and Planning , 2000 .

[6]  Thomas L. Magnanti,et al.  Working Paper Alfred P. Sloan School of Management "models for Planning Capacity Expansion in Local Access Telecommunication Networks" "models for Planning Capacity Expansion in Local Access Telecommunication Networks" Models for Planning Capacity Expansion in Local Access Telecommunication Networks , 2008 .

[7]  Aaron Kershenbaum,et al.  Computing capacitated minimal spanning trees efficiently , 1974, Networks.

[8]  Hasan Pirkul,et al.  Topological Design of Centralized Computer Networks , 1997 .

[9]  Bezalel Gavish,et al.  Topological design of telecommunication networks-local access design methods , 1991, Ann. Oper. Res..

[10]  Thomas L. Magnanti,et al.  A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning , 1995, Oper. Res..

[11]  Hasan Pirkul,et al.  Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem , 1992 .

[12]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[13]  M. Goldstein,et al.  The One-Terminal TELPAK Problem , 1971, Oper. Res..

[14]  Hasan Pirkul,et al.  Hierarchical concentrator location problem , 1992, Comput. Commun..

[15]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[16]  Steven Chamberland,et al.  Topological expansion of multiple-ring metropolitan area networks , 1997, Networks.

[17]  Daniel Bienstock,et al.  Computational experience with an effective heuristic for some capacity expansion problems in local access networks , 1993, Telecommun. Syst..

[18]  S. I. Fisher,et al.  Fibre to the home – infrastructure deployment issues , 2002 .

[19]  P. McGregor,et al.  Network Design: An Algorithm for the Access Facility Location Problem , 1977, IEEE Trans. Commun..

[20]  Mohammed Atiquzzaman,et al.  Least cost heuristic for the delay-constrained capacitated minimum spanning tree problem , 2005, Comput. Commun..

[21]  Alexander Shulman,et al.  An algorithm for capacity expansion of local access networks , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[22]  Hasan Pirkul,et al.  Locating concentrators in centralized computer networks , 1992, Ann. Oper. Res..

[23]  R. Lehnert,et al.  A visual planning tool for hybrid fibre VDSL access networks with heuristic algorithms , 2005, DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005..