Routing and wavelength/sub-wavelength path assignment to maximizing accommodated traffic demands on optical networks

DOI 機関リポジトリ HANDLE Web Site 参考文献6件
  • WATANABE Yosuke
    Graduate School of Systems and Information Engineering, University of Tsukuba
  • ISHII Kiyo
    National Institute of Advanced Industrial Science and Technology (AIST)
  • SATO Toshiki
    Graduate School of Systems and Information Engineering, University of Tsukuba
  • TAKEFUSA Atsuko
    National Institute of Advanced Industrial Science and Technology (AIST)
  • KUDOH Tomohiro
    National Institute of Advanced Industrial Science and Technology (AIST) Information Technology Center, University of Tokyo
  • SHIGENO Maiko
    Graduate School of Systems and Information Engineering, University of Tsukuba
  • YOSHISE Akiko
    Graduate School of Systems and Information Engineering, University of Tsukuba

抄録

Wavelength division multiplexing (WDM) technology transmits multiple optical communication channels in an optical fiber. Routing and wavelength assignment (RWA) problems on WDM network have widely attracted interest of many researchers. Recently, so called sub-wavelength paths which are smaller granular paths than the wavelength-paths are discussed. In this paper, we deal with the RWA problem with considering sub-wavelength assignment on optical networks. One of the purpose of our study is to investigate active rates for optical networks. We formulate a sub-wavelength path assignment problem maximizing accommodated traffic demands by integer programming and solve it by a cutting plane algorithm. Since, in actuality, RWA is done individually for each demand on the time when the demand occurs, we consider a greedy type on-line algorithm. Numerical experiments show the efficiency of our algorithms and give some observation for active rates. Moreover, we verify the efficiency of our greedy-type algorithm on realistic situations which follow 10/40/100 Gbps system used for the current communication on optical networks. Our experimental results conclude that the active rates are depending on the configurations of the underlying graphs, and that our greedy-type algorithm is efficient for several kinds of instances.

収録刊行物

参考文献 (6)*注記

もっと見る

関連プロジェクト

もっと見る

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ