• DocumentCode
    2599599
  • Title

    A new dynamic path computation algorithm for multi-domain optical networks

  • Author

    Benhaddou, Driss ; Dandu, Satish ; Ghani, Nasir ; Subhlok, Jaspal

  • Author_Institution
    Univ. of Houston, Houston, TX
  • fYear
    2008
  • fDate
    11-13 Dec. 2008
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    Several emerging applications such as storage area networks, multimedia, video, and digital services demand high bandwidth. Although optical networks are deployed to provide high bandwidth at reduced costs, they are not flexible and not efficiently utilized. Such applications require end-to-end delivery of information and flexible bandwidth allocation; therefore provisioning in optical networks need to be dynamic, flexible and consider provisioning in multiple domains. This paper presents a novel dynamic path computation algorithm for optical multi-domain networks. This algorithm updates the inter-domain paths and domainpsilas egress node dynamically after visiting an intermediate domain between the source and the destination. Simulation results show that the performance of the proposed algorithm is better than existing source routing algorithm for provisioning circuits in optical multi-domain networks.
  • Keywords
    optical computing; domain´s egress node; dynamic path computation algorithm; high bandwidth; interdomain paths; multidomain optical networks; Bandwidth; Channel allocation; Circuit simulation; Computational modeling; Computer networks; Costs; Heuristic algorithms; Optical computing; Optical fiber networks; Storage area networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Mediterranean Winter, 2008. ICTON-MW 2008. 2nd ICTON
  • Conference_Location
    Marrakech
  • Print_ISBN
    978-1-4244-3484-8
  • Electronic_ISBN
    978-1-4244-3485-5
  • Type

    conf

  • DOI
    10.1109/ICTONMW.2008.4773100
  • Filename
    4773100