• DocumentCode
    170675
  • Title

    Restorable logical topology in the face of no or partial traffic demand knowledge

  • Author

    Cohen, Reuven ; Nakibly, Gabi

  • Author_Institution
    Technion - Israel Inst. of Technol., Haifa, Israel
  • fYear
    2014
  • fDate
    April 27 2014-May 2 2014
  • Firstpage
    1626
  • Lastpage
    1634
  • Abstract
    The construction of a logical network on top of a physical (optical) infrastructure involves two intertwined tasks: logical link selection - deciding which pairs of routers will be connected by logical links (lightpaths), and logical link routing - deciding how to route each logical link across the optical network. The operator of such networks is often required to maximize the available throughput while guaranteeing its restorability. This paper is the first to combine these seemingly conflicting goals into one optimization criterion: maximizing the restorable throughput of the end-to-end paths. We address this problem in three cases: when the operator has no knowledge of the future bandwidth demands, when it has partial knowledge, and when it has full knowledge. We present efficient algorithms for each of these cases and use extensive simulations to compare their performance.
  • Keywords
    optical links; optimisation; telecommunication network routing; telecommunication network topology; logical link routing; logical link selection; logical topology; optical network; optimization criterion; restorable network throughput; traffic demand knowledge; Approximation algorithms; Approximation methods; Bandwidth; Optical fiber networks; Routing; Throughput;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    INFOCOM, 2014 Proceedings IEEE
  • Conference_Location
    Toronto, ON
  • Type

    conf

  • DOI
    10.1109/INFOCOM.2014.6848099
  • Filename
    6848099