• DocumentCode
    762457
  • Title

    On Hamiltonian cycles as optimal p-cycles

  • Author

    Schupke, Dominic A.

  • Author_Institution
    Inf. & Commun., Siemens AG, Munich, Germany
  • Volume
    9
  • Issue
    4
  • fYear
    2005
  • fDate
    4/1/2005 12:00:00 AM
  • Firstpage
    360
  • Lastpage
    362
  • Abstract
    Using Hamiltonian p-cycles, it can be shown that p-cycle design is able to reach the logical redundancy bound of 1/(d~-1) where d~ is the average node degree. We formulate two conditions on which the design is able to reach this bound if and only if Hamiltonian p-cycles are used.
  • Keywords
    telecommunication links; telecommunication network topology; Hamiltonian p-cycle; logical redundancy bound; optimal network design; protection; Circuits; Communication networks; Communications technology; Costs; Electronic mail; Mathematical model; Network topology; Optimization methods; Protection switching; Wavelength division multiplexing;
  • fLanguage
    English
  • Journal_Title
    Communications Letters, IEEE
  • Publisher
    ieee
  • ISSN
    1089-7798
  • Type

    jour

  • DOI
    10.1109/LCOMM.2005.1413634
  • Filename
    1413634
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=762457