• DocumentCode
    458609
  • Title

    On the Oriented Network Design Problem

  • Author

    Zerovnik, Janez

  • Author_Institution
    FME, Maribor Univ.
  • Volume
    3
  • fYear
    2006
  • fDate
    38869
  • Firstpage
    109
  • Lastpage
    111
  • Abstract
    The cost of a network with a routing is defined as a sum of arc costs that depend on the capacity only. The capacity corresponds to the number of paths of the routing that traverse the arc. We sketch some simple observations that may give insight in the partial order among possible network designs
  • Keywords
    graph theory; telecommunication network routing; network design problem; network routing; Application software; Computer science; Containers; Cost function; Electronic mail; Graph theory; Routing; Synchronous digital hierarchy; Telecommunication traffic; Tree graphs; SDH; concave cost; network design;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Transparent Optical Networks, 2006 International Conference on
  • Conference_Location
    Nottingham
  • Print_ISBN
    1-4244-0235-2
  • Electronic_ISBN
    1-4244-0236-0
  • Type

    conf

  • DOI
    10.1109/ICTON.2006.248413
  • Filename
    4013810
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=458609