Routing and wavelength/sub-wavelength path assignment to maximizing accommodated traffic demands on optical networks
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 gran...
| Main Authors: | , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
The Japan Society of Mechanical Engineers
2016-07-01
|
| Series: | Journal of Advanced Mechanical Design, Systems, and Manufacturing |
| Subjects: | |
| Online Access: | https://www.jstage.jst.go.jp/article/jamdsm/10/3/10_2016jamdsm0038/_pdf/-char/en |
| _version_ | 1811225618168152064 |
|---|---|
| author | Yosuke WATANABE Kiyo ISHII Toshiki SATO Atsuko TAKEFUSA Tomohiro KUDOH Maiko SHIGENO Akiko YOSHISE |
| author_facet | Yosuke WATANABE Kiyo ISHII Toshiki SATO Atsuko TAKEFUSA Tomohiro KUDOH Maiko SHIGENO Akiko YOSHISE |
| author_sort | Yosuke WATANABE |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-12T09:10:25Z |
| format | Article |
| id | doaj.art-5687444972d2474a90c64b7741078cb2 |
| institution | Directory Open Access Journal |
| issn | 1881-3054 |
| language | English |
| last_indexed | 2024-04-12T09:10:25Z |
| publishDate | 2016-07-01 |
| publisher | The Japan Society of Mechanical Engineers |
| record_format | Article |
| series | Journal of Advanced Mechanical Design, Systems, and Manufacturing |
| spelling | doaj.art-5687444972d2474a90c64b7741078cb22022-12-22T03:38:59ZengThe Japan Society of Mechanical EngineersJournal of Advanced Mechanical Design, Systems, and Manufacturing1881-30542016-07-01103JAMDSM0038JAMDSM003810.1299/jamdsm.2016jamdsm0038jamdsmRouting and wavelength/sub-wavelength path assignment to maximizing accommodated traffic demands on optical networksYosuke WATANABE0Kiyo ISHII1Toshiki SATO2Atsuko TAKEFUSA3Tomohiro KUDOH4Maiko SHIGENO5Akiko YOSHISE6Graduate School of Systems and Information Engineering, University of TsukubaNational Institute of Advanced Industrial Science and Technology (AIST)Graduate School of Systems and Information Engineering, University of TsukubaNational Institute of Advanced Industrial Science and Technology (AIST)National Institute of Advanced Industrial Science and Technology (AIST)Graduate School of Systems and Information Engineering, University of TsukubaGraduate School of Systems and Information Engineering, University of TsukubaWavelength 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.https://www.jstage.jst.go.jp/article/jamdsm/10/3/10_2016jamdsm0038/_pdf/-char/enoptical networkrouting and wavelength assignmentsub-wavelength assignmentinteger programmingcutting plane methodgreedy algorithm |
| spellingShingle | Yosuke WATANABE Kiyo ISHII Toshiki SATO Atsuko TAKEFUSA Tomohiro KUDOH Maiko SHIGENO Akiko YOSHISE Routing and wavelength/sub-wavelength path assignment to maximizing accommodated traffic demands on optical networks Journal of Advanced Mechanical Design, Systems, and Manufacturing optical network routing and wavelength assignment sub-wavelength assignment integer programming cutting plane method greedy algorithm |
| title | Routing and wavelength/sub-wavelength path assignment to maximizing accommodated traffic demands on optical networks |
| title_full | Routing and wavelength/sub-wavelength path assignment to maximizing accommodated traffic demands on optical networks |
| title_fullStr | Routing and wavelength/sub-wavelength path assignment to maximizing accommodated traffic demands on optical networks |
| title_full_unstemmed | Routing and wavelength/sub-wavelength path assignment to maximizing accommodated traffic demands on optical networks |
| title_short | Routing and wavelength/sub-wavelength path assignment to maximizing accommodated traffic demands on optical networks |
| title_sort | routing and wavelength sub wavelength path assignment to maximizing accommodated traffic demands on optical networks |
| topic | optical network routing and wavelength assignment sub-wavelength assignment integer programming cutting plane method greedy algorithm |
| url | https://www.jstage.jst.go.jp/article/jamdsm/10/3/10_2016jamdsm0038/_pdf/-char/en |
| work_keys_str_mv | AT yosukewatanabe routingandwavelengthsubwavelengthpathassignmenttomaximizingaccommodatedtrafficdemandsonopticalnetworks AT kiyoishii routingandwavelengthsubwavelengthpathassignmenttomaximizingaccommodatedtrafficdemandsonopticalnetworks AT toshikisato routingandwavelengthsubwavelengthpathassignmenttomaximizingaccommodatedtrafficdemandsonopticalnetworks AT atsukotakefusa routingandwavelengthsubwavelengthpathassignmenttomaximizingaccommodatedtrafficdemandsonopticalnetworks AT tomohirokudoh routingandwavelengthsubwavelengthpathassignmenttomaximizingaccommodatedtrafficdemandsonopticalnetworks AT maikoshigeno routingandwavelengthsubwavelengthpathassignmenttomaximizingaccommodatedtrafficdemandsonopticalnetworks AT akikoyoshise routingandwavelengthsubwavelengthpathassignmenttomaximizingaccommodatedtrafficdemandsonopticalnetworks |