AccessNets. Third International Conference on Access Networks, AccessNets 2008, Las Vegas, NV, USA, October 15-17, 2008. Revised Papers

Research Article

Planning Multitechnology Access Networks with Performance Constraints

Download
409 downloads
  • @INPROCEEDINGS{10.1007/978-3-642-04648-3_31,
        author={Steven Chamberland},
        title={Planning Multitechnology Access Networks with Performance Constraints},
        proceedings={AccessNets. Third International Conference on Access Networks, AccessNets 2008, Las Vegas, NV, USA, October 15-17, 2008. Revised Papers},
        proceedings_a={ACCESSNETS},
        year={2012},
        month={5},
        keywords={Access network planning digital subscriber line (xDSL) technologies xDSL from the central office fiber-to-the-node (FTTN) fiber-to-the-micro-node (FTTn) fiber-to-the-premises (FTTP) integer mathematical programming branch-and-bound algorithm},
        doi={10.1007/978-3-642-04648-3_31}
    }
    
  • Steven Chamberland
    Year: 2012
    Planning Multitechnology Access Networks with Performance Constraints
    ACCESSNETS
    Springer
    DOI: 10.1007/978-3-642-04648-3_31
Steven Chamberland1,*
  • 1: École Polytechnique de Montréal
*Contact email: steven.chamberland@polymtl.ca

Abstract

Considering the number of access network technologies and the investment needed for the “last mile” of a solution, in today’s highly competitive markets, planning tools are crucial for the service providers to optimize the network costs and accelerate the planning process. In this paper, we propose to tackle the problem of planning access networks composed of four technologies/architectures: 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). A mathematical programming model is proposed for this planning problem that is solved using a commercial implementation of the branch-and-bound algorithm. Next, a detailed access network planning example is presented followed by a systematic set of experiments designed to assess the performance of the proposed approach.