• DocumentCode
    2972103
  • Title

    An efficient routing algorithm for all-optical networks with turn constraints

  • Author

    Soliman, Hamdy ; Peyton, Chad

  • fYear
    2002
  • fDate
    2002
  • Firstpage
    161
  • Lastpage
    166
  • Abstract
    In all-optical networks, adjacent link constraints (known as turn constraints) can model existing restrictions in all-optical networks with limited wavelength converters and blocking optical switches. We present two different concrete implementations for a shortest path routing algorithm that accounts for link and turn constraints in all-optical networks. The efficiency of our new algorithm implementation is proven and analyzed via the simulation of sparse network topologies.
  • Keywords
    directed graphs; network topology; optical fibre networks; photonic switching systems; telecommunication network routing; adjacent link constraints; all-optical networks; blocking optical switches; directed graph; shortest path routing algorithm; sparse network topologies; turn constraints; wavelength converters; wavelength cross connects; Algorithm design and analysis; All-optical networks; Analytical models; Computer science; Concrete; Costs; Joining processes; Optical switches; Optical wavelength conversion; Routing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Modeling, Analysis and Simulation of Computer and Telecommunications Systems, 2002. MASCOTS 2002. Proceedings. 10th IEEE International Symposium on
  • ISSN
    1526-7539
  • Print_ISBN
    0-7695-1840-0
  • Type

    conf

  • DOI
    10.1109/MASCOT.2002.1167073
  • Filename
    1167073
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2972103