Dynamic survivable multipath routing and spectrum allocation in OFDM-based flexible optical networks
Compared to traditional wavelength division multiplexing (WDM) networks, orthogonal frequency division multiplexing (OFDM)-based flexible optical networks provide better spectral efficiency due to their flexible bandwidth allocation capability and fine granularity. Survivability is a crucial issue i...
Gespeichert in:
Veröffentlicht in: | Journal of optical communications and networking 2014-01, Vol.6 (1), p.77-85 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 85 |
---|---|
container_issue | 1 |
container_start_page | 77 |
container_title | Journal of optical communications and networking |
container_volume | 6 |
creator | Ruan, Lu Zheng, Yanwei |
description | Compared to traditional wavelength division multiplexing (WDM) networks, orthogonal frequency division multiplexing (OFDM)-based flexible optical networks provide better spectral efficiency due to their flexible bandwidth allocation capability and fine granularity. Survivability is a crucial issue in OFDM-based flexible optical networks. Recently we proposed a new survivable multi-path provisioning scheme (MPP) that efficiently supports demands with flexible protection requirement in OFDM-based optical networks and studied the static survivable multipath routing and spectrum allocation (SM-RSA) problem, which aims to accommodate a given set of demands with minimum utilized spectrum. We have showed that the MPP scheme achieves higher spectral efficiency than the traditional single-path provisioning (SPP) scheme. In this paper, we study the dynamic SM-RSA problem, which selects multiple routes and allocates spectrum on these routes for a given demand as it arrives at the network. We develop an integer linear programming (ILP) model as well as a heuristic algorithm for the dynamic SM-RSA problem. We conduct simulations to study the advantage of MPP over SPP for the dynamic traffic scenario in terms of blocking performance and fairness. We also compare the performance of the MPP heuristic algorithm and the ILP model. |
doi_str_mv | 10.1364/JOCN.6.000077 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_6725826</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6725826</ieee_id><sourcerecordid>1513460795</sourcerecordid><originalsourceid>FETCH-LOGICAL-c384t-382884854d639a62b09ae9af2e8e69b7e7eb52204d41e43aea8e95a33263936d3</originalsourceid><addsrcrecordid>eNpd0D1PwzAQBuAIgQQURiYWSywsKXbsOM6IWsqHgC4wW5fkCgYnDrbDx78nVVEHbrkbHp1evUlywuiUcSku7pazx6mc0nGKYic5YKXgKZW83N3eGd1PDkN4o1QWjOUHSTP_6aA1NQmD_zSfUFkk7WCj6SG-Eu-GaLoXAl1DQo919ENLwFpXQzSuI6Yjy8X8Ia0gYENWFr_N-oHro6nBkg7jl_Pv4SjZW4ENePy3J8nz4uppdpPeL69vZ5f3ac2ViClXmVJC5aIZM4PMKloClrDKUKEsqwILrPIso6IRDAUHBIVlDpxno-ey4ZPkfPO39-5jwBB1a0KN1kKHbgia5YwLSYsyH-nZP_rmBt-N6TQTJWe0UJKPKt2o2rsQPK50700L_kczqted63XnWupN56M_3XiDiFsriyxXY8ZfCrZ9Jw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1493107863</pqid></control><display><type>article</type><title>Dynamic survivable multipath routing and spectrum allocation in OFDM-based flexible optical networks</title><source>IEEE Electronic Library (IEL)</source><creator>Ruan, Lu ; Zheng, Yanwei</creator><creatorcontrib>Ruan, Lu ; Zheng, Yanwei</creatorcontrib><description>Compared to traditional wavelength division multiplexing (WDM) networks, orthogonal frequency division multiplexing (OFDM)-based flexible optical networks provide better spectral efficiency due to their flexible bandwidth allocation capability and fine granularity. Survivability is a crucial issue in OFDM-based flexible optical networks. Recently we proposed a new survivable multi-path provisioning scheme (MPP) that efficiently supports demands with flexible protection requirement in OFDM-based optical networks and studied the static survivable multipath routing and spectrum allocation (SM-RSA) problem, which aims to accommodate a given set of demands with minimum utilized spectrum. We have showed that the MPP scheme achieves higher spectral efficiency than the traditional single-path provisioning (SPP) scheme. In this paper, we study the dynamic SM-RSA problem, which selects multiple routes and allocates spectrum on these routes for a given demand as it arrives at the network. We develop an integer linear programming (ILP) model as well as a heuristic algorithm for the dynamic SM-RSA problem. We conduct simulations to study the advantage of MPP over SPP for the dynamic traffic scenario in terms of blocking performance and fairness. We also compare the performance of the MPP heuristic algorithm and the ILP model.</description><identifier>ISSN: 1943-0620</identifier><identifier>EISSN: 1943-0639</identifier><identifier>DOI: 10.1364/JOCN.6.000077</identifier><identifier>CODEN: JOCNBB</identifier><language>eng</language><publisher>Piscataway: Optica Publishing Group</publisher><subject>Algorithms ; Allocations ; Bandwidth ; Bandwidths ; Computer networks ; Demand ; Dynamic routing and spectrum allocation ; Equations ; Fiber optic networks ; Flexible optical networks ; Heuristic algorithms ; Multipath provisioning ; Networks ; OFDM ; Optical communication ; Optical fiber networks ; Optical OFDM ; Orthogonal Frequency Division Multiplexing ; Protection ; Resource management ; Routing ; Routing (telecommunications) ; Wavelength division multiplexing</subject><ispartof>Journal of optical communications and networking, 2014-01, Vol.6 (1), p.77-85</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jan 2014</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c384t-382884854d639a62b09ae9af2e8e69b7e7eb52204d41e43aea8e95a33263936d3</citedby><cites>FETCH-LOGICAL-c384t-382884854d639a62b09ae9af2e8e69b7e7eb52204d41e43aea8e95a33263936d3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6725826$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27903,27904,54736</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6725826$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Ruan, Lu</creatorcontrib><creatorcontrib>Zheng, Yanwei</creatorcontrib><title>Dynamic survivable multipath routing and spectrum allocation in OFDM-based flexible optical networks</title><title>Journal of optical communications and networking</title><addtitle>jocn</addtitle><description>Compared to traditional wavelength division multiplexing (WDM) networks, orthogonal frequency division multiplexing (OFDM)-based flexible optical networks provide better spectral efficiency due to their flexible bandwidth allocation capability and fine granularity. Survivability is a crucial issue in OFDM-based flexible optical networks. Recently we proposed a new survivable multi-path provisioning scheme (MPP) that efficiently supports demands with flexible protection requirement in OFDM-based optical networks and studied the static survivable multipath routing and spectrum allocation (SM-RSA) problem, which aims to accommodate a given set of demands with minimum utilized spectrum. We have showed that the MPP scheme achieves higher spectral efficiency than the traditional single-path provisioning (SPP) scheme. In this paper, we study the dynamic SM-RSA problem, which selects multiple routes and allocates spectrum on these routes for a given demand as it arrives at the network. We develop an integer linear programming (ILP) model as well as a heuristic algorithm for the dynamic SM-RSA problem. We conduct simulations to study the advantage of MPP over SPP for the dynamic traffic scenario in terms of blocking performance and fairness. We also compare the performance of the MPP heuristic algorithm and the ILP model.</description><subject>Algorithms</subject><subject>Allocations</subject><subject>Bandwidth</subject><subject>Bandwidths</subject><subject>Computer networks</subject><subject>Demand</subject><subject>Dynamic routing and spectrum allocation</subject><subject>Equations</subject><subject>Fiber optic networks</subject><subject>Flexible optical networks</subject><subject>Heuristic algorithms</subject><subject>Multipath provisioning</subject><subject>Networks</subject><subject>OFDM</subject><subject>Optical communication</subject><subject>Optical fiber networks</subject><subject>Optical OFDM</subject><subject>Orthogonal Frequency Division Multiplexing</subject><subject>Protection</subject><subject>Resource management</subject><subject>Routing</subject><subject>Routing (telecommunications)</subject><subject>Wavelength division multiplexing</subject><issn>1943-0620</issn><issn>1943-0639</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpd0D1PwzAQBuAIgQQURiYWSywsKXbsOM6IWsqHgC4wW5fkCgYnDrbDx78nVVEHbrkbHp1evUlywuiUcSku7pazx6mc0nGKYic5YKXgKZW83N3eGd1PDkN4o1QWjOUHSTP_6aA1NQmD_zSfUFkk7WCj6SG-Eu-GaLoXAl1DQo919ENLwFpXQzSuI6Yjy8X8Ia0gYENWFr_N-oHro6nBkg7jl_Pv4SjZW4ENePy3J8nz4uppdpPeL69vZ5f3ac2ViClXmVJC5aIZM4PMKloClrDKUKEsqwILrPIso6IRDAUHBIVlDpxno-ey4ZPkfPO39-5jwBB1a0KN1kKHbgia5YwLSYsyH-nZP_rmBt-N6TQTJWe0UJKPKt2o2rsQPK50700L_kczqted63XnWupN56M_3XiDiFsriyxXY8ZfCrZ9Jw</recordid><startdate>20140101</startdate><enddate>20140101</enddate><creator>Ruan, Lu</creator><creator>Zheng, Yanwei</creator><general>Optica Publishing Group</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20140101</creationdate><title>Dynamic survivable multipath routing and spectrum allocation in OFDM-based flexible optical networks</title><author>Ruan, Lu ; Zheng, Yanwei</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c384t-382884854d639a62b09ae9af2e8e69b7e7eb52204d41e43aea8e95a33263936d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Algorithms</topic><topic>Allocations</topic><topic>Bandwidth</topic><topic>Bandwidths</topic><topic>Computer networks</topic><topic>Demand</topic><topic>Dynamic routing and spectrum allocation</topic><topic>Equations</topic><topic>Fiber optic networks</topic><topic>Flexible optical networks</topic><topic>Heuristic algorithms</topic><topic>Multipath provisioning</topic><topic>Networks</topic><topic>OFDM</topic><topic>Optical communication</topic><topic>Optical fiber networks</topic><topic>Optical OFDM</topic><topic>Orthogonal Frequency Division Multiplexing</topic><topic>Protection</topic><topic>Resource management</topic><topic>Routing</topic><topic>Routing (telecommunications)</topic><topic>Wavelength division multiplexing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ruan, Lu</creatorcontrib><creatorcontrib>Zheng, Yanwei</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Journal of optical communications and networking</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Ruan, Lu</au><au>Zheng, Yanwei</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Dynamic survivable multipath routing and spectrum allocation in OFDM-based flexible optical networks</atitle><jtitle>Journal of optical communications and networking</jtitle><stitle>jocn</stitle><date>2014-01-01</date><risdate>2014</risdate><volume>6</volume><issue>1</issue><spage>77</spage><epage>85</epage><pages>77-85</pages><issn>1943-0620</issn><eissn>1943-0639</eissn><coden>JOCNBB</coden><abstract>Compared to traditional wavelength division multiplexing (WDM) networks, orthogonal frequency division multiplexing (OFDM)-based flexible optical networks provide better spectral efficiency due to their flexible bandwidth allocation capability and fine granularity. Survivability is a crucial issue in OFDM-based flexible optical networks. Recently we proposed a new survivable multi-path provisioning scheme (MPP) that efficiently supports demands with flexible protection requirement in OFDM-based optical networks and studied the static survivable multipath routing and spectrum allocation (SM-RSA) problem, which aims to accommodate a given set of demands with minimum utilized spectrum. We have showed that the MPP scheme achieves higher spectral efficiency than the traditional single-path provisioning (SPP) scheme. In this paper, we study the dynamic SM-RSA problem, which selects multiple routes and allocates spectrum on these routes for a given demand as it arrives at the network. We develop an integer linear programming (ILP) model as well as a heuristic algorithm for the dynamic SM-RSA problem. We conduct simulations to study the advantage of MPP over SPP for the dynamic traffic scenario in terms of blocking performance and fairness. We also compare the performance of the MPP heuristic algorithm and the ILP model.</abstract><cop>Piscataway</cop><pub>Optica Publishing Group</pub><doi>10.1364/JOCN.6.000077</doi><tpages>9</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1943-0620 |
ispartof | Journal of optical communications and networking, 2014-01, Vol.6 (1), p.77-85 |
issn | 1943-0620 1943-0639 |
language | eng |
recordid | cdi_ieee_primary_6725826 |
source | IEEE Electronic Library (IEL) |
subjects | Algorithms Allocations Bandwidth Bandwidths Computer networks Demand Dynamic routing and spectrum allocation Equations Fiber optic networks Flexible optical networks Heuristic algorithms Multipath provisioning Networks OFDM Optical communication Optical fiber networks Optical OFDM Orthogonal Frequency Division Multiplexing Protection Resource management Routing Routing (telecommunications) Wavelength division multiplexing |
title | Dynamic survivable multipath routing and spectrum allocation in OFDM-based flexible optical networks |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T01%3A44%3A14IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Dynamic%20survivable%20multipath%20routing%20and%20spectrum%20allocation%20in%20OFDM-based%20flexible%20optical%20networks&rft.jtitle=Journal%20of%20optical%20communications%20and%20networking&rft.au=Ruan,%20Lu&rft.date=2014-01-01&rft.volume=6&rft.issue=1&rft.spage=77&rft.epage=85&rft.pages=77-85&rft.issn=1943-0620&rft.eissn=1943-0639&rft.coden=JOCNBB&rft_id=info:doi/10.1364/JOCN.6.000077&rft_dat=%3Cproquest_RIE%3E1513460795%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1493107863&rft_id=info:pmid/&rft_ieee_id=6725826&rfr_iscdi=true |