Loading…

Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks

This paper addresses the problem of routing and wavelength assignment (RWA) of scheduled lightpath demands (SLDs) in wavelength routed optical networks with no wavelength converters. The objective is to minimize the number of wavelengths used. This problem has been shown to be NP-complete so heurist...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE journal on selected areas in communications 2006-08, Vol.24 (8), p.2-15
Main Author:	Skorin-Kapov, N.
Format:	Article
Language:	English
Subjects:	Algorithms Demand Heuristic algorithms Heuristic methods Intelligent networks Marketing Optical communication Optical fiber networks Optical wavelength conversion Routing (telecommunications) Scheduling algorithm Superluminescent diodes Tabu search Telecommunication network topology Wavelength assignment Wavelength division multiplexing Wavelength routing Wavelengths
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-c2821-d425caa176afcf00c8e0c02601eb23df4305e4eb027824a4d79f01b1cfdd0b393
cites	cdi_FETCH-LOGICAL-c2821-d425caa176afcf00c8e0c02601eb23df4305e4eb027824a4d79f01b1cfdd0b393
container_end_page	15
container_issue	8
container_start_page	2
container_title	IEEE journal on selected areas in communications
container_volume	24
creator	Skorin-Kapov, N.
description	This paper addresses the problem of routing and wavelength assignment (RWA) of scheduled lightpath demands (SLDs) in wavelength routed optical networks with no wavelength converters. The objective is to minimize the number of wavelengths used. This problem has been shown to be NP-complete so heuristic algorithms have been developed to solve it suboptimally. Suggested is a tabu search algorithm along with two simple and fast greedy algorithms for the RWA SLD problem. We compare the proposed algorithms with an existing tabu search algorithm for the same problem and with lower bounds derived in this paper. Results indicate that the suggested algorithms not only yield solutions superior in quality to those obtained by the existing algorithm, but have drastically shorter execution times
doi_str_mv	10.1109/JSAC.2006.1677251
format	article
fullrecord	<record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_896197439</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1677251</ieee_id><sourcerecordid>896197439</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2821-d425caa176afcf00c8e0c02601eb23df4305e4eb027824a4d79f01b1cfdd0b393</originalsourceid><addsrcrecordid>eNpdkUtr3DAUhUVpodM0PyB0I7LpypMr-SUvw5DmQSCLJmuhka5spbY0keSE_vt6MgOFrO7ifOdw4SPkjMGaMegu7n5fbtYcoFmzpm15zT6RFatrUQCA-ExW0JZlIVrWfCXfUnoGYFUl-Iq83OAcXcpOUzX2Ibo8TInaEGkekMYwZ-d7qryhb-oVR_R9HqhKyfV-Qp9psDTpAc08oqGj64e8UwthcFo6iTpPw24ZVyP1mN9C_JO-ky9WjQlPj_eEPP26etzcFPcP17eby_tCc8FZYSpea6VY2yirLYAWCBp4Awy3vDS2KqHGCrfAW8ErVZm2s8C2TFtjYFt25Qn5edjdxfAyY8pycknjOCqPYU5SdA3r2uqdPP9APoc5-uU5KZq6KRmIeoHYAdIxpBTRyl10k4p_JQO5VyD3CuRegTwqWDo_Dh2HiP_5Y_oPJKmEVA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>865631085</pqid></control><display><type>article</type><title>Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks</title><source>IEEE Xplore (Online service)</source><creator>Skorin-Kapov, N.</creator><creatorcontrib>Skorin-Kapov, N.</creatorcontrib><description>This paper addresses the problem of routing and wavelength assignment (RWA) of scheduled lightpath demands (SLDs) in wavelength routed optical networks with no wavelength converters. The objective is to minimize the number of wavelengths used. This problem has been shown to be NP-complete so heuristic algorithms have been developed to solve it suboptimally. Suggested is a tabu search algorithm along with two simple and fast greedy algorithms for the RWA SLD problem. We compare the proposed algorithms with an existing tabu search algorithm for the same problem and with lower bounds derived in this paper. Results indicate that the suggested algorithms not only yield solutions superior in quality to those obtained by the existing algorithm, but have drastically shorter execution times</description><identifier>ISSN: 0733-8716</identifier><identifier>EISSN: 1558-0008</identifier><identifier>DOI: 10.1109/JSAC.2006.1677251</identifier><identifier>CODEN: ISACEM</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Demand ; Heuristic algorithms ; Heuristic methods ; Intelligent networks ; Marketing ; Optical communication ; Optical fiber networks ; Optical wavelength conversion ; Routing (telecommunications) ; Scheduling algorithm ; Superluminescent diodes ; Tabu search ; Telecommunication network topology ; Wavelength assignment ; Wavelength division multiplexing ; Wavelength routing ; Wavelengths</subject><ispartof>IEEE journal on selected areas in communications, 2006-08, Vol.24 (8), p.2-15</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2006</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2821-d425caa176afcf00c8e0c02601eb23df4305e4eb027824a4d79f01b1cfdd0b393</citedby><cites>FETCH-LOGICAL-c2821-d425caa176afcf00c8e0c02601eb23df4305e4eb027824a4d79f01b1cfdd0b393</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1677251$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,54796</link.rule.ids></links><search><creatorcontrib>Skorin-Kapov, N.</creatorcontrib><title>Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks</title><title>IEEE journal on selected areas in communications</title><addtitle>J-SAC</addtitle><description>This paper addresses the problem of routing and wavelength assignment (RWA) of scheduled lightpath demands (SLDs) in wavelength routed optical networks with no wavelength converters. The objective is to minimize the number of wavelengths used. This problem has been shown to be NP-complete so heuristic algorithms have been developed to solve it suboptimally. Suggested is a tabu search algorithm along with two simple and fast greedy algorithms for the RWA SLD problem. We compare the proposed algorithms with an existing tabu search algorithm for the same problem and with lower bounds derived in this paper. Results indicate that the suggested algorithms not only yield solutions superior in quality to those obtained by the existing algorithm, but have drastically shorter execution times</description><subject>Algorithms</subject><subject>Demand</subject><subject>Heuristic algorithms</subject><subject>Heuristic methods</subject><subject>Intelligent networks</subject><subject>Marketing</subject><subject>Optical communication</subject><subject>Optical fiber networks</subject><subject>Optical wavelength conversion</subject><subject>Routing (telecommunications)</subject><subject>Scheduling algorithm</subject><subject>Superluminescent diodes</subject><subject>Tabu search</subject><subject>Telecommunication network topology</subject><subject>Wavelength assignment</subject><subject>Wavelength division multiplexing</subject><subject>Wavelength routing</subject><subject>Wavelengths</subject><issn>0733-8716</issn><issn>1558-0008</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><recordid>eNpdkUtr3DAUhUVpodM0PyB0I7LpypMr-SUvw5DmQSCLJmuhka5spbY0keSE_vt6MgOFrO7ifOdw4SPkjMGaMegu7n5fbtYcoFmzpm15zT6RFatrUQCA-ExW0JZlIVrWfCXfUnoGYFUl-Iq83OAcXcpOUzX2Ibo8TInaEGkekMYwZ-d7qryhb-oVR_R9HqhKyfV-Qp9psDTpAc08oqGj64e8UwthcFo6iTpPw24ZVyP1mN9C_JO-ky9WjQlPj_eEPP26etzcFPcP17eby_tCc8FZYSpea6VY2yirLYAWCBp4Awy3vDS2KqHGCrfAW8ErVZm2s8C2TFtjYFt25Qn5edjdxfAyY8pycknjOCqPYU5SdA3r2uqdPP9APoc5-uU5KZq6KRmIeoHYAdIxpBTRyl10k4p_JQO5VyD3CuRegTwqWDo_Dh2HiP_5Y_oPJKmEVA</recordid><startdate>200608</startdate><enddate>200608</enddate><creator>Skorin-Kapov, N.</creator><general>IEEE</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>7SP</scope><scope>8FD</scope><scope>L7M</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>200608</creationdate><title>Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks</title><author>Skorin-Kapov, N.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2821-d425caa176afcf00c8e0c02601eb23df4305e4eb027824a4d79f01b1cfdd0b393</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Algorithms</topic><topic>Demand</topic><topic>Heuristic algorithms</topic><topic>Heuristic methods</topic><topic>Intelligent networks</topic><topic>Marketing</topic><topic>Optical communication</topic><topic>Optical fiber networks</topic><topic>Optical wavelength conversion</topic><topic>Routing (telecommunications)</topic><topic>Scheduling algorithm</topic><topic>Superluminescent diodes</topic><topic>Tabu search</topic><topic>Telecommunication network topology</topic><topic>Wavelength assignment</topic><topic>Wavelength division multiplexing</topic><topic>Wavelength routing</topic><topic>Wavelengths</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Skorin-Kapov, N.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) Online</collection><collection>IEEE/IET Electronic Library</collection><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE journal on selected areas in communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Skorin-Kapov, N.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks</atitle><jtitle>IEEE journal on selected areas in communications</jtitle><stitle>J-SAC</stitle><date>2006-08</date><risdate>2006</risdate><volume>24</volume><issue>8</issue><spage>2</spage><epage>15</epage><pages>2-15</pages><issn>0733-8716</issn><eissn>1558-0008</eissn><coden>ISACEM</coden><abstract>This paper addresses the problem of routing and wavelength assignment (RWA) of scheduled lightpath demands (SLDs) in wavelength routed optical networks with no wavelength converters. The objective is to minimize the number of wavelengths used. This problem has been shown to be NP-complete so heuristic algorithms have been developed to solve it suboptimally. Suggested is a tabu search algorithm along with two simple and fast greedy algorithms for the RWA SLD problem. We compare the proposed algorithms with an existing tabu search algorithm for the same problem and with lower bounds derived in this paper. Results indicate that the suggested algorithms not only yield solutions superior in quality to those obtained by the existing algorithm, but have drastically shorter execution times</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/JSAC.2006.1677251</doi><tpages>14</tpages><oa>free_for_read</oa></addata></record>
fulltext	fulltext
identifier	ISSN: 0733-8716
ispartof	IEEE journal on selected areas in communications, 2006-08, Vol.24 (8), p.2-15
issn	0733-8716 1558-0008
language	eng
recordid	cdi_proquest_miscellaneous_896197439
source	IEEE Xplore (Online service)
subjects	Algorithms Demand Heuristic algorithms Heuristic methods Intelligent networks Marketing Optical communication Optical fiber networks Optical wavelength conversion Routing (telecommunications) Scheduling algorithm Superluminescent diodes Tabu search Telecommunication network topology Wavelength assignment Wavelength division multiplexing Wavelength routing Wavelengths
title	Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks
url	http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T03%3A28%3A21IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Heuristic%20algorithms%20for%20the%20routing%20and%20wavelength%20assignment%20of%20scheduled%20lightpath%20demands%20in%20optical%20networks&rft.jtitle=IEEE%20journal%20on%20selected%20areas%20in%20communications&rft.au=Skorin-Kapov,%20N.&rft.date=2006-08&rft.volume=24&rft.issue=8&rft.spage=2&rft.epage=15&rft.pages=2-15&rft.issn=0733-8716&rft.eissn=1558-0008&rft.coden=ISACEM&rft_id=info:doi/10.1109/JSAC.2006.1677251&rft_dat=%3Cproquest_cross%3E896197439%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c2821-d425caa176afcf00c8e0c02601eb23df4305e4eb027824a4d79f01b1cfdd0b393%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=865631085&rft_id=info:pmid/&rft_ieee_id=1677251&rfr_iscdi=true