• DocumentCode
    1983011
  • Title

    Multiperiod Planning with Controlled Shortest Path Routing

  • Author

    Kronberger, Clara ; Schupke, Dominic A. ; Eberspächer, Jörg

  • Author_Institution
    Nokia Siemens Networks, Munich, Germany
  • fYear
    2010
  • fDate
    6-10 Dec. 2010
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    For simplified network operations, demands are often routed on shortest paths, e.g., with physical length as metric. We propose a new controlled shortest path routing concept for multiperiod planned networks, formulated as optimization model. This routing concept minimizes the network costs (capital expenditures) under the constraint of using shortest path routing within the lit fiber network. Within a single optimization step, fibers on candidate topology edges are chosen to become lit, constituting a (lit) fiber network, such that cost-optimal results are obtained under shortest path routing within this selected fiber network. In case studies our new routing and dimensioning approach is compared with shortest path routing in the candidate topology and general cost-optimal routing. For lightly to medium loaded networks, case studies show that controlled shortest path routing can achieve significantly lower cost results than shortest path routing, while being comparable in cost to cost-optimal routing.
  • Keywords
    optical fibre networks; optimisation; telecommunication network planning; telecommunication network routing; telecommunication network topology; candidate topology edges; controlled shortest path routing; dimensioning approach; general cost-optimal routing; lit fiber network; multiperiod planned networks; network costs; optimization model; single optimization step; Network topology; Optical switches; Optimization; Peer to peer computing; Planning; Routing; Topology;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE
  • Conference_Location
    Miami, FL
  • ISSN
    1930-529X
  • Print_ISBN
    978-1-4244-5636-9
  • Electronic_ISBN
    1930-529X
  • Type

    conf

  • DOI
    10.1109/GLOCOM.2010.5683269
  • Filename
    5683269