Loading…

Distance-adaptive, Low CAPEX Cost p -Cycle Design Without Candidate Cycle Enumeration in Mixed-Line-Rate Optical Networks

Even though elastic optical networks (EONs) are promising to provision increasingly dynamic and heterogeneous traffic, the requirements on bandwidth-variable optical devices bring upgrading challenges in current wavelength-division multiplexing (WDM) optical networks. Mixed-line-rate (MLR) optical n...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of lightwave technology 2016-06, Vol.34 (11), p.2663-2676
Main Authors:	Ju, Min, Zhou, Fen, Zhu, Zuqing, Xiao, Shilin
Format:	Article
Language:	English
Subjects:	Algorithm design and analysis Algorithms Computational modeling Computer simulation Cost engineering Devices Distance-adaptive Enumeration Expenditures Mixed Integer Linear Programming (MILP) Mixed Line Rates (MLR) Optical Networks Optical communication Optical network units Partitioning algorithms Pre-Configured-Cycle (p-Cycle) Traffic flow Transponders Wavelength division multiplexing
Citations:	Items that this one cites Items that cite this one
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

cited_by	cdi_FETCH-LOGICAL-c296t-4b87ead07be92ed4babeaa44c70ec134e8574b117bc60869facf5a50794008e43
cites	cdi_FETCH-LOGICAL-c296t-4b87ead07be92ed4babeaa44c70ec134e8574b117bc60869facf5a50794008e43
container_end_page	2676
container_issue	11
container_start_page	2663
container_title	Journal of lightwave technology
container_volume	34
creator	Ju, Min Zhou, Fen Zhu, Zuqing Xiao, Shilin
description	Even though elastic optical networks (EONs) are promising to provision increasingly dynamic and heterogeneous traffic, the requirements on bandwidth-variable optical devices bring upgrading challenges in current wavelength-division multiplexing (WDM) optical networks. Mixed-line-rate (MLR) optical networks offer a transitional solution that allows several coexisting line rates (e.g., 10/40/100 Gb/s). In this paper, we investigate distance-adaptive preconfigured-cycle (pCycle) protection scheme in MLR optical networks. Path-length-limited p-cycles are designed to be assigned line rate depending on the length of each protection path. Instead of conventional candidate cycle enumeration, a mixed integer linear programming (MILP) model is formulated to directly generate the optimal p-cycles with the minimum capital expenditures (CAPEX) cost. We also develop two algorithms to make the proposed MILP model scalable. Simulation results indicate that the algorithms are time efficient for solving the MILP-based p-cycle design. We further compare our p-cycle design method with other schemes, and demonstrate that our method largely reduces the CAPEX cost for more than 40%, mainly in transponder cost. To the best of our knowledge, this is the first time that distance-adaptive p-cycle design without candidate cycle enumeration is proposed for MLR optical networks.
doi_str_mv	10.1109/JLT.2016.2549642
format	article
fullrecord	<record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_ieee_primary_7445814</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>7445814</ieee_id><sourcerecordid>1816002477</sourcerecordid><originalsourceid>FETCH-LOGICAL-c296t-4b87ead07be92ed4babeaa44c70ec134e8574b117bc60869facf5a50794008e43</originalsourceid><addsrcrecordid>eNo9kD1PwzAURS0EEqWwI7F4ZMDFdl5iZ6xC-VKgCBXBFjnOKxjSpMQupf-eVq2Y7nDPvcMh5FTwgRA8vbzPJwPJRTKQMaQJyD3SE3GsmZQi2ic9rqKIaSXhkBx5_8m5ANCqR1ZXzgfTWGSmMvPgfvCC5u2SZsOn0RvNWh_onLJsZWukV-jde0NfXfhoF4FmpqlcZQLSbT1qFjPsTHBtQ11DH9wvVix3DbLnDTRev1tT00cMy7b78sfkYGpqjye77JOX69Eku2X5-OYuG-bMyjQJDEqt0FRclZhKrKA0JRoDYBVHKyJAHSsohVClTbhO0qmx09jEXKXAuUaI-uR8-zvv2u8F-lDMnLdY16bBduELoUXCuQSl1ijforZrve9wWsw7NzPdqhC82Fgu1paLjeViZ3k9OdtOHCL-4wog1gKiP0VleMU</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1816002477</pqid></control><display><type>article</type><title>Distance-adaptive, Low CAPEX Cost p -Cycle Design Without Candidate Cycle Enumeration in Mixed-Line-Rate Optical Networks</title><source>IEEE Electronic Library (IEL) Journals</source><creator>Ju, Min ; Zhou, Fen ; Zhu, Zuqing ; Xiao, Shilin</creator><creatorcontrib>Ju, Min ; Zhou, Fen ; Zhu, Zuqing ; Xiao, Shilin</creatorcontrib><description>Even though elastic optical networks (EONs) are promising to provision increasingly dynamic and heterogeneous traffic, the requirements on bandwidth-variable optical devices bring upgrading challenges in current wavelength-division multiplexing (WDM) optical networks. Mixed-line-rate (MLR) optical networks offer a transitional solution that allows several coexisting line rates (e.g., 10/40/100 Gb/s). In this paper, we investigate distance-adaptive preconfigured-cycle (pCycle) protection scheme in MLR optical networks. Path-length-limited p-cycles are designed to be assigned line rate depending on the length of each protection path. Instead of conventional candidate cycle enumeration, a mixed integer linear programming (MILP) model is formulated to directly generate the optimal p-cycles with the minimum capital expenditures (CAPEX) cost. We also develop two algorithms to make the proposed MILP model scalable. Simulation results indicate that the algorithms are time efficient for solving the MILP-based p-cycle design. We further compare our p-cycle design method with other schemes, and demonstrate that our method largely reduces the CAPEX cost for more than 40%, mainly in transponder cost. To the best of our knowledge, this is the first time that distance-adaptive p-cycle design without candidate cycle enumeration is proposed for MLR optical networks.</description><identifier>ISSN: 0733-8724</identifier><identifier>EISSN: 1558-2213</identifier><identifier>DOI: 10.1109/JLT.2016.2549642</identifier><identifier>CODEN: JLTEDG</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; Algorithms ; Computational modeling ; Computer simulation ; Cost engineering ; Devices ; Distance-adaptive ; Enumeration ; Expenditures ; Mixed Integer Linear Programming (MILP) ; Mixed Line Rates (MLR) Optical Networks ; Optical communication ; Optical network units ; Partitioning algorithms ; Pre-Configured-Cycle (p-Cycle) ; Traffic flow ; Transponders ; Wavelength division multiplexing</subject><ispartof>Journal of lightwave technology, 2016-06, Vol.34 (11), p.2663-2676</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c296t-4b87ead07be92ed4babeaa44c70ec134e8574b117bc60869facf5a50794008e43</citedby><cites>FETCH-LOGICAL-c296t-4b87ead07be92ed4babeaa44c70ec134e8574b117bc60869facf5a50794008e43</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/7445814$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>315,786,790,27957,27958,55147</link.rule.ids></links><search><creatorcontrib>Ju, Min</creatorcontrib><creatorcontrib>Zhou, Fen</creatorcontrib><creatorcontrib>Zhu, Zuqing</creatorcontrib><creatorcontrib>Xiao, Shilin</creatorcontrib><title>Distance-adaptive, Low CAPEX Cost p -Cycle Design Without Candidate Cycle Enumeration in Mixed-Line-Rate Optical Networks</title><title>Journal of lightwave technology</title><addtitle>JLT</addtitle><description>Even though elastic optical networks (EONs) are promising to provision increasingly dynamic and heterogeneous traffic, the requirements on bandwidth-variable optical devices bring upgrading challenges in current wavelength-division multiplexing (WDM) optical networks. Mixed-line-rate (MLR) optical networks offer a transitional solution that allows several coexisting line rates (e.g., 10/40/100 Gb/s). In this paper, we investigate distance-adaptive preconfigured-cycle (pCycle) protection scheme in MLR optical networks. Path-length-limited p-cycles are designed to be assigned line rate depending on the length of each protection path. Instead of conventional candidate cycle enumeration, a mixed integer linear programming (MILP) model is formulated to directly generate the optimal p-cycles with the minimum capital expenditures (CAPEX) cost. We also develop two algorithms to make the proposed MILP model scalable. Simulation results indicate that the algorithms are time efficient for solving the MILP-based p-cycle design. We further compare our p-cycle design method with other schemes, and demonstrate that our method largely reduces the CAPEX cost for more than 40%, mainly in transponder cost. To the best of our knowledge, this is the first time that distance-adaptive p-cycle design without candidate cycle enumeration is proposed for MLR optical networks.</description><subject>Algorithm design and analysis</subject><subject>Algorithms</subject><subject>Computational modeling</subject><subject>Computer simulation</subject><subject>Cost engineering</subject><subject>Devices</subject><subject>Distance-adaptive</subject><subject>Enumeration</subject><subject>Expenditures</subject><subject>Mixed Integer Linear Programming (MILP)</subject><subject>Mixed Line Rates (MLR) Optical Networks</subject><subject>Optical communication</subject><subject>Optical network units</subject><subject>Partitioning algorithms</subject><subject>Pre-Configured-Cycle (p-Cycle)</subject><subject>Traffic flow</subject><subject>Transponders</subject><subject>Wavelength division multiplexing</subject><issn>0733-8724</issn><issn>1558-2213</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><recordid>eNo9kD1PwzAURS0EEqWwI7F4ZMDFdl5iZ6xC-VKgCBXBFjnOKxjSpMQupf-eVq2Y7nDPvcMh5FTwgRA8vbzPJwPJRTKQMaQJyD3SE3GsmZQi2ic9rqKIaSXhkBx5_8m5ANCqR1ZXzgfTWGSmMvPgfvCC5u2SZsOn0RvNWh_onLJsZWukV-jde0NfXfhoF4FmpqlcZQLSbT1qFjPsTHBtQ11DH9wvVix3DbLnDTRev1tT00cMy7b78sfkYGpqjye77JOX69Eku2X5-OYuG-bMyjQJDEqt0FRclZhKrKA0JRoDYBVHKyJAHSsohVClTbhO0qmx09jEXKXAuUaI-uR8-zvv2u8F-lDMnLdY16bBduELoUXCuQSl1ijforZrve9wWsw7NzPdqhC82Fgu1paLjeViZ3k9OdtOHCL-4wog1gKiP0VleMU</recordid><startdate>20160601</startdate><enddate>20160601</enddate><creator>Ju, Min</creator><creator>Zhou, Fen</creator><creator>Zhu, Zuqing</creator><creator>Xiao, Shilin</creator><general>IEEE</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>7U5</scope><scope>8FD</scope><scope>H8D</scope><scope>L7M</scope></search><sort><creationdate>20160601</creationdate><title>Distance-adaptive, Low CAPEX Cost p -Cycle Design Without Candidate Cycle Enumeration in Mixed-Line-Rate Optical Networks</title><author>Ju, Min ; Zhou, Fen ; Zhu, Zuqing ; Xiao, Shilin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c296t-4b87ead07be92ed4babeaa44c70ec134e8574b117bc60869facf5a50794008e43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Algorithm design and analysis</topic><topic>Algorithms</topic><topic>Computational modeling</topic><topic>Computer simulation</topic><topic>Cost engineering</topic><topic>Devices</topic><topic>Distance-adaptive</topic><topic>Enumeration</topic><topic>Expenditures</topic><topic>Mixed Integer Linear Programming (MILP)</topic><topic>Mixed Line Rates (MLR) Optical Networks</topic><topic>Optical communication</topic><topic>Optical network units</topic><topic>Partitioning algorithms</topic><topic>Pre-Configured-Cycle (p-Cycle)</topic><topic>Traffic flow</topic><topic>Transponders</topic><topic>Wavelength division multiplexing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ju, Min</creatorcontrib><creatorcontrib>Zhou, Fen</creatorcontrib><creatorcontrib>Zhu, Zuqing</creatorcontrib><creatorcontrib>Xiao, Shilin</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998–Present</collection><collection>IEEE Xplore</collection><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Solid State and Superconductivity Abstracts</collection><collection>Technology Research Database</collection><collection>Aerospace Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>Journal of lightwave technology</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ju, Min</au><au>Zhou, Fen</au><au>Zhu, Zuqing</au><au>Xiao, Shilin</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Distance-adaptive, Low CAPEX Cost p -Cycle Design Without Candidate Cycle Enumeration in Mixed-Line-Rate Optical Networks</atitle><jtitle>Journal of lightwave technology</jtitle><stitle>JLT</stitle><date>2016-06-01</date><risdate>2016</risdate><volume>34</volume><issue>11</issue><spage>2663</spage><epage>2676</epage><pages>2663-2676</pages><issn>0733-8724</issn><eissn>1558-2213</eissn><coden>JLTEDG</coden><notes>ObjectType-Article-1</notes><notes>SourceType-Scholarly Journals-1</notes><notes>ObjectType-Feature-2</notes><notes>content type line 23</notes><abstract>Even though elastic optical networks (EONs) are promising to provision increasingly dynamic and heterogeneous traffic, the requirements on bandwidth-variable optical devices bring upgrading challenges in current wavelength-division multiplexing (WDM) optical networks. Mixed-line-rate (MLR) optical networks offer a transitional solution that allows several coexisting line rates (e.g., 10/40/100 Gb/s). In this paper, we investigate distance-adaptive preconfigured-cycle (pCycle) protection scheme in MLR optical networks. Path-length-limited p-cycles are designed to be assigned line rate depending on the length of each protection path. Instead of conventional candidate cycle enumeration, a mixed integer linear programming (MILP) model is formulated to directly generate the optimal p-cycles with the minimum capital expenditures (CAPEX) cost. We also develop two algorithms to make the proposed MILP model scalable. Simulation results indicate that the algorithms are time efficient for solving the MILP-based p-cycle design. We further compare our p-cycle design method with other schemes, and demonstrate that our method largely reduces the CAPEX cost for more than 40%, mainly in transponder cost. To the best of our knowledge, this is the first time that distance-adaptive p-cycle design without candidate cycle enumeration is proposed for MLR optical networks.</abstract><pub>IEEE</pub><doi>10.1109/JLT.2016.2549642</doi><tpages>14</tpages></addata></record>
fulltext	fulltext
identifier	ISSN: 0733-8724
ispartof	Journal of lightwave technology, 2016-06, Vol.34 (11), p.2663-2676
issn	0733-8724 1558-2213
language	eng
recordid	cdi_ieee_primary_7445814
source	IEEE Electronic Library (IEL) Journals
subjects	Algorithm design and analysis Algorithms Computational modeling Computer simulation Cost engineering Devices Distance-adaptive Enumeration Expenditures Mixed Integer Linear Programming (MILP) Mixed Line Rates (MLR) Optical Networks Optical communication Optical network units Partitioning algorithms Pre-Configured-Cycle (p-Cycle) Traffic flow Transponders Wavelength division multiplexing
title	Distance-adaptive, Low CAPEX Cost p -Cycle Design Without Candidate Cycle Enumeration in Mixed-Line-Rate Optical Networks
url	http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-09-22T02%3A24%3A58IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Distance-adaptive,%20Low%20CAPEX%20Cost%20p%20-Cycle%20Design%20Without%20Candidate%20Cycle%20Enumeration%20in%20Mixed-Line-Rate%20Optical%20Networks&rft.jtitle=Journal%20of%20lightwave%20technology&rft.au=Ju,%20Min&rft.date=2016-06-01&rft.volume=34&rft.issue=11&rft.spage=2663&rft.epage=2676&rft.pages=2663-2676&rft.issn=0733-8724&rft.eissn=1558-2213&rft.coden=JLTEDG&rft_id=info:doi/10.1109/JLT.2016.2549642&rft_dat=%3Cproquest_ieee_%3E1816002477%3C/proquest_ieee_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c296t-4b87ead07be92ed4babeaa44c70ec134e8574b117bc60869facf5a50794008e43%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1816002477&rft_id=info:pmid/&rft_ieee_id=7445814&rfr_iscdi=true