• DocumentCode
    3376757
  • Title

    Evaluating the Restorability inWDM Networks Based on Directional Cycle Decomposition Algorithm (DCDA)

  • Author

    Sue, Chuan-Ching ; Lee, Chao-Yang ; Hsu, Shih-Chang ; Yeh, Jun-Ying

  • Author_Institution
    Sci. & Inf. Eng., Nat. Cheng Kung Univ., Tainan
  • fYear
    2005
  • fDate
    21-24 Nov. 2005
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    The directional cycle decomposition algorithm (DCDA) is one method to achieve full restoration and tolerate as many faults as possible in wavelength division multiplexing (WDM) networks without the capability of wavelength conversion. This paper formulates the restorability computing in WDM network based on DCDA. Two methods are proposed to compute the restorability. One computes the restorability exactly using the information from the original network and its corresponding G+. Another computes approximately using the information only from the corresponding G+. The results indicate the restorability is decreasing very fast with more and more simultaneous faults. Moreover, the average error in the approximate method is limited from 8.37% on ArpaNet to 2.94% on Icosahedron.
  • Keywords
    graph theory; optical fibre networks; wavelength division multiplexing; WDM networks; directional cycle decomposition algorithm; restorability computing; ring cover set problem; wavelength conversion; wavelength division multiplexing networks; Chaos; Computer errors; Computer networks; Computer science; Optical fiber networks; Optical wavelength conversion; Protection; Signal restoration; WDM networks; Wavelength division multiplexing; DCDA; Ring cover set problem; WDM; full restoration; protection; restorability;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    TENCON 2005 2005 IEEE Region 10
  • Conference_Location
    Melbourne, Qld.
  • Print_ISBN
    0-7803-9311-2
  • Electronic_ISBN
    0-7803-9312-0
  • Type

    conf

  • DOI
    10.1109/TENCON.2005.300952
  • Filename
    4084916