Loading…

Routing and wavelength assignment in optical networks from edge disjoint path algorithms

Routing and wavelength assignment (RWA) problems in wavelength-routed optical networks are typically solved using a combination of integer programming and graph coloring. Such techniques are complex and make extensive use of heuristics. We explore an alternative solution technique in the well-known...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE communications letters 2002-05, Vol.6 (5), p.211-213
Main Authors:	Manohar, P., Manjunath, D., Shevgaonkar, R.K.
Format:	Article
Language:	English
Subjects:	Algorithms Applied sciences Computer networks Exact sciences and technology Graphs Greedy algorithms Heuristic Humans Integer programming Intelligent networks Linear programming Mathematical programming Network topology Optical communication Optical fiber networks Optical wavelength conversion Routing (telecommunications) Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Teletraffic Wavelength assignment 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-c374t-c1124fa81937b47f2412c8df958c94b3fd4e7eb149de801c83c44c0a43f482f73
cites	cdi_FETCH-LOGICAL-c374t-c1124fa81937b47f2412c8df958c94b3fd4e7eb149de801c83c44c0a43f482f73
container_end_page	213
container_issue	5
container_start_page	211
container_title	IEEE communications letters
container_volume	6
creator	Manohar, P. Manjunath, D. Shevgaonkar, R.K.
description	Routing and wavelength assignment (RWA) problems in wavelength-routed optical networks are typically solved using a combination of integer programming and graph coloring. Such techniques are complex and make extensive use of heuristics. We explore an alternative solution technique in the well-known maximum edge disjoint paths (EDP) problem which can be naturally adapted to the RWA problem. Maximum EDP is NP-hard, but now it is known that simple greedy algorithms for it are as good as any of the more complex heuristic solutions. In this paper we investigate the performance of a simple greedy maximum edge disjoint paths algorithm applied to the RWA problem and compare it with a previously known solution method.
doi_str_mv	10.1109/4234.1001667
format	article
fullrecord	<record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1671417075</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1001667</ieee_id><sourcerecordid>1671417075</sourcerecordid><originalsourceid>FETCH-LOGICAL-c374t-c1124fa81937b47f2412c8df958c94b3fd4e7eb149de801c83c44c0a43f482f73</originalsourceid><addsrcrecordid>eNp90cFLHDEUBvChVKhVb715CYWKh47mZd5sMkcRbQuCIAq9DdnMy5h1Jtkms4r_vRl2oaUHL0kOv_eF5CuKL8DPAHhzjqLCM-AcFgv5odiHulalyMvHfOaqKaVs1Kfic0orzrkSNewXv-_CZnK-Z9p37EU_00C-nx6ZTsn1fiQ_MedZWE_O6IF5ml5CfErMxjAy6npinUur4DJb63ls6EN00-OYDos9q4dER7v9oHi4vrq__Fne3P74dXlxU5pK4lQaAIFWK2gquURpBYIwqrNNrUyDy8p2SJKWgE1HioNRlUE0XGNlUQkrq4PiZJu7juHPhtLUji4ZGgbtKWxSK1StQHKR4em7EBYSMEtZZ_r1P7oKm-jzM1qlEJUS1Zz3fYtMDClFsu06ulHH1xZ4O9fRznW0uzoy_7bL1Cl_pY3aG5f-zsxXc1xkd7x1joj-idymvAG2kJHF</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>884488232</pqid></control><display><type>article</type><title>Routing and wavelength assignment in optical networks from edge disjoint path algorithms</title><source>IEEE Xplore (Online service)</source><creator>Manohar, P. ; Manjunath, D. ; Shevgaonkar, R.K.</creator><creatorcontrib>Manohar, P. ; Manjunath, D. ; Shevgaonkar, R.K.</creatorcontrib><description>Routing and wavelength assignment (RWA) problems in wavelength-routed optical networks are typically solved using a combination of integer programming and graph coloring. Such techniques are complex and make extensive use of heuristics. We explore an alternative solution technique in the well-known maximum edge disjoint paths (EDP) problem which can be naturally adapted to the RWA problem. Maximum EDP is NP-hard, but now it is known that simple greedy algorithms for it are as good as any of the more complex heuristic solutions. In this paper we investigate the performance of a simple greedy maximum edge disjoint paths algorithm applied to the RWA problem and compare it with a previously known solution method.</description><identifier>ISSN: 1089-7798</identifier><identifier>EISSN: 1558-2558</identifier><identifier>DOI: 10.1109/4234.1001667</identifier><identifier>CODEN: ICLEF6</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Algorithms ; Applied sciences ; Computer networks ; Exact sciences and technology ; Graphs ; Greedy algorithms ; Heuristic ; Humans ; Integer programming ; Intelligent networks ; Linear programming ; Mathematical programming ; Network topology ; Optical communication ; Optical fiber networks ; Optical wavelength conversion ; Routing (telecommunications) ; Systems, networks and services of telecommunications ; Telecommunications ; Telecommunications and information theory ; Teletraffic ; Wavelength assignment ; Wavelength routing ; Wavelengths</subject><ispartof>IEEE communications letters, 2002-05, Vol.6 (5), p.211-213</ispartof><rights>2002 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2002</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c374t-c1124fa81937b47f2412c8df958c94b3fd4e7eb149de801c83c44c0a43f482f73</citedby><cites>FETCH-LOGICAL-c374t-c1124fa81937b47f2412c8df958c94b3fd4e7eb149de801c83c44c0a43f482f73</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1001667$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,54796</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=14170046$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Manohar, P.</creatorcontrib><creatorcontrib>Manjunath, D.</creatorcontrib><creatorcontrib>Shevgaonkar, R.K.</creatorcontrib><title>Routing and wavelength assignment in optical networks from edge disjoint path algorithms</title><title>IEEE communications letters</title><addtitle>COML</addtitle><description>Routing and wavelength assignment (RWA) problems in wavelength-routed optical networks are typically solved using a combination of integer programming and graph coloring. Such techniques are complex and make extensive use of heuristics. We explore an alternative solution technique in the well-known maximum edge disjoint paths (EDP) problem which can be naturally adapted to the RWA problem. Maximum EDP is NP-hard, but now it is known that simple greedy algorithms for it are as good as any of the more complex heuristic solutions. In this paper we investigate the performance of a simple greedy maximum edge disjoint paths algorithm applied to the RWA problem and compare it with a previously known solution method.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Computer networks</subject><subject>Exact sciences and technology</subject><subject>Graphs</subject><subject>Greedy algorithms</subject><subject>Heuristic</subject><subject>Humans</subject><subject>Integer programming</subject><subject>Intelligent networks</subject><subject>Linear programming</subject><subject>Mathematical programming</subject><subject>Network topology</subject><subject>Optical communication</subject><subject>Optical fiber networks</subject><subject>Optical wavelength conversion</subject><subject>Routing (telecommunications)</subject><subject>Systems, networks and services of telecommunications</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Teletraffic</subject><subject>Wavelength assignment</subject><subject>Wavelength routing</subject><subject>Wavelengths</subject><issn>1089-7798</issn><issn>1558-2558</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2002</creationdate><recordtype>article</recordtype><recordid>eNp90cFLHDEUBvChVKhVb715CYWKh47mZd5sMkcRbQuCIAq9DdnMy5h1Jtkms4r_vRl2oaUHL0kOv_eF5CuKL8DPAHhzjqLCM-AcFgv5odiHulalyMvHfOaqKaVs1Kfic0orzrkSNewXv-_CZnK-Z9p37EU_00C-nx6ZTsn1fiQ_MedZWE_O6IF5ml5CfErMxjAy6npinUur4DJb63ls6EN00-OYDos9q4dER7v9oHi4vrq__Fne3P74dXlxU5pK4lQaAIFWK2gquURpBYIwqrNNrUyDy8p2SJKWgE1HioNRlUE0XGNlUQkrq4PiZJu7juHPhtLUji4ZGgbtKWxSK1StQHKR4em7EBYSMEtZZ_r1P7oKm-jzM1qlEJUS1Zz3fYtMDClFsu06ulHH1xZ4O9fRznW0uzoy_7bL1Cl_pY3aG5f-zsxXc1xkd7x1joj-idymvAG2kJHF</recordid><startdate>20020501</startdate><enddate>20020501</enddate><creator>Manohar, P.</creator><creator>Manjunath, D.</creator><creator>Shevgaonkar, R.K.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>RIA</scope><scope>RIE</scope><scope>IQODW</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>20020501</creationdate><title>Routing and wavelength assignment in optical networks from edge disjoint path algorithms</title><author>Manohar, P. ; Manjunath, D. ; Shevgaonkar, R.K.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c374t-c1124fa81937b47f2412c8df958c94b3fd4e7eb149de801c83c44c0a43f482f73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2002</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Computer networks</topic><topic>Exact sciences and technology</topic><topic>Graphs</topic><topic>Greedy algorithms</topic><topic>Heuristic</topic><topic>Humans</topic><topic>Integer programming</topic><topic>Intelligent networks</topic><topic>Linear programming</topic><topic>Mathematical programming</topic><topic>Network topology</topic><topic>Optical communication</topic><topic>Optical fiber networks</topic><topic>Optical wavelength conversion</topic><topic>Routing (telecommunications)</topic><topic>Systems, networks and services of telecommunications</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Teletraffic</topic><topic>Wavelength assignment</topic><topic>Wavelength routing</topic><topic>Wavelengths</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Manohar, P.</creatorcontrib><creatorcontrib>Manjunath, D.</creatorcontrib><creatorcontrib>Shevgaonkar, R.K.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) Online</collection><collection>IEEE/IET Electronic Library</collection><collection>Pascal-Francis</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 communications letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Manohar, P.</au><au>Manjunath, D.</au><au>Shevgaonkar, R.K.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Routing and wavelength assignment in optical networks from edge disjoint path algorithms</atitle><jtitle>IEEE communications letters</jtitle><stitle>COML</stitle><date>2002-05-01</date><risdate>2002</risdate><volume>6</volume><issue>5</issue><spage>211</spage><epage>213</epage><pages>211-213</pages><issn>1089-7798</issn><eissn>1558-2558</eissn><coden>ICLEF6</coden><abstract>Routing and wavelength assignment (RWA) problems in wavelength-routed optical networks are typically solved using a combination of integer programming and graph coloring. Such techniques are complex and make extensive use of heuristics. We explore an alternative solution technique in the well-known maximum edge disjoint paths (EDP) problem which can be naturally adapted to the RWA problem. Maximum EDP is NP-hard, but now it is known that simple greedy algorithms for it are as good as any of the more complex heuristic solutions. In this paper we investigate the performance of a simple greedy maximum edge disjoint paths algorithm applied to the RWA problem and compare it with a previously known solution method.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/4234.1001667</doi><tpages>3</tpages></addata></record>
fulltext	fulltext
identifier	ISSN: 1089-7798
ispartof	IEEE communications letters, 2002-05, Vol.6 (5), p.211-213
issn	1089-7798 1558-2558
language	eng
recordid	cdi_proquest_miscellaneous_1671417075
source	IEEE Xplore (Online service)
subjects	Algorithms Applied sciences Computer networks Exact sciences and technology Graphs Greedy algorithms Heuristic Humans Integer programming Intelligent networks Linear programming Mathematical programming Network topology Optical communication Optical fiber networks Optical wavelength conversion Routing (telecommunications) Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Teletraffic Wavelength assignment Wavelength routing Wavelengths
title	Routing and wavelength assignment in optical networks from edge disjoint path algorithms
url	http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T03%3A46%3A30IST&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=Routing%20and%20wavelength%20assignment%20in%20optical%20networks%20from%20edge%20disjoint%20path%20algorithms&rft.jtitle=IEEE%20communications%20letters&rft.au=Manohar,%20P.&rft.date=2002-05-01&rft.volume=6&rft.issue=5&rft.spage=211&rft.epage=213&rft.pages=211-213&rft.issn=1089-7798&rft.eissn=1558-2558&rft.coden=ICLEF6&rft_id=info:doi/10.1109/4234.1001667&rft_dat=%3Cproquest_cross%3E1671417075%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c374t-c1124fa81937b47f2412c8df958c94b3fd4e7eb149de801c83c44c0a43f482f73%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=884488232&rft_id=info:pmid/&rft_ieee_id=1001667&rfr_iscdi=true