Routing and wavelength assignment of scheduled lightpath demands
We present algorithms that compute the routing and wavelength assignment (RWA) for scheduled lightpath demands in a wavelength-switching mesh network without wavelength conversion functionality. Scheduled lightpath demands are connection demands for which the setup and teardown times are known in ad...
Gespeichert in:
| Veröffentlicht in: | IEEE journal on selected areas in communications 2003-10, Vol.21 (8), p.1231-1240 |
|---|---|
| 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 | 1240 |
|---|---|
| container_issue | 8 |
| container_start_page | 1231 |
| container_title | IEEE journal on selected areas in communications |
| container_volume | 21 |
| creator | Kuri, J. Puech, N. Gagnaire, M. Dotaro, E. Douville, R. |
| description | We present algorithms that compute the routing and wavelength assignment (RWA) for scheduled lightpath demands in a wavelength-switching mesh network without wavelength conversion functionality. Scheduled lightpath demands are connection demands for which the setup and teardown times are known in advance. We formulate separately the routing problem and the wavelength assignment problem as spatio-temporal combinatorial optimization problems. For the former, we propose a branch and bound algorithm for exact resolution and an alternative tabu search algorithm for approximate resolution. A generalized graph coloring approach is used to solve the wavelength assignment problem. We compared the proposed algorithms to an RWA algorithm that sequentially computes the route and wavelength assignment for the scheduled lightpath demands. |
| doi_str_mv | 10.1109/JSAC.2003.816622 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_JSAC_2003_816622</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1234417</ieee_id><sourcerecordid>901709999</sourcerecordid><originalsourceid>FETCH-LOGICAL-c417t-446f4823ebfabf978dc8e78fd173d4b617fae21997aa1a550f7861e0af93843b3</originalsourceid><addsrcrecordid>eNp9kE1Lw0AQhhdRsFbvgpfgQU-pM7ub7OZmKX5SEPw4L5tktk1Jk5pNFP-9WyoIHpzLXJ73HeZh7BRhggjZ1ePLdDbhAGKiMU0532MjTBIdA4DeZyNQQsRaYXrIjrxfAaCUmo_Y9XM79FWziGxTRp_2g2pqFv0yst5Xi2ZNTR-1LvLFksqhpjKqq8Wy39hAlLQOGX_MDpytPZ387DF7u715nd3H86e7h9l0HhcSVR9LmbpwUFDubO4ypctCk9KuRCVKmaeonCWOWaasRZsk4JROkcC6TGgpcjFml7veTde-D-R7s658QXVtG2oHbzJABVmYQF78S3KdqEQiBvD8D7hqh64JXxitJU91InmAYAcVXet9R85sumptuy-DYLbmzda82Zo3O_MhcraLVET0i3MhgwrxDc-vfnU</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>884268542</pqid></control><display><type>article</type><title>Routing and wavelength assignment of scheduled lightpath demands</title><source>IEEE Electronic Library (IEL)</source><creator>Kuri, J. ; Puech, N. ; Gagnaire, M. ; Dotaro, E. ; Douville, R.</creator><creatorcontrib>Kuri, J. ; Puech, N. ; Gagnaire, M. ; Dotaro, E. ; Douville, R.</creatorcontrib><description>We present algorithms that compute the routing and wavelength assignment (RWA) for scheduled lightpath demands in a wavelength-switching mesh network without wavelength conversion functionality. Scheduled lightpath demands are connection demands for which the setup and teardown times are known in advance. We formulate separately the routing problem and the wavelength assignment problem as spatio-temporal combinatorial optimization problems. For the former, we propose a branch and bound algorithm for exact resolution and an alternative tabu search algorithm for approximate resolution. A generalized graph coloring approach is used to solve the wavelength assignment problem. We compared the proposed algorithms to an RWA algorithm that sequentially computes the route and wavelength assignment for the scheduled lightpath demands.</description><identifier>ISSN: 0733-8716</identifier><identifier>EISSN: 1558-0008</identifier><identifier>DOI: 10.1109/JSAC.2003.816622</identifier><identifier>CODEN: ISACEM</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Approximation ; Combinatorial analysis ; Computer networks ; Demand ; Lighting control ; Marketing ; Optical fiber networks ; Optical network units ; Processor scheduling ; Routing (telecommunications) ; Scheduling algorithm ; Telecommunication traffic ; Wavelength assignment ; Wavelength division multiplexing ; Wavelength routing ; Wavelengths ; WDM networks</subject><ispartof>IEEE journal on selected areas in communications, 2003-10, Vol.21 (8), p.1231-1240</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2003</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c417t-446f4823ebfabf978dc8e78fd173d4b617fae21997aa1a550f7861e0af93843b3</citedby><cites>FETCH-LOGICAL-c417t-446f4823ebfabf978dc8e78fd173d4b617fae21997aa1a550f7861e0af93843b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1234417$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1234417$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Kuri, J.</creatorcontrib><creatorcontrib>Puech, N.</creatorcontrib><creatorcontrib>Gagnaire, M.</creatorcontrib><creatorcontrib>Dotaro, E.</creatorcontrib><creatorcontrib>Douville, R.</creatorcontrib><title>Routing and wavelength assignment of scheduled lightpath demands</title><title>IEEE journal on selected areas in communications</title><addtitle>J-SAC</addtitle><description>We present algorithms that compute the routing and wavelength assignment (RWA) for scheduled lightpath demands in a wavelength-switching mesh network without wavelength conversion functionality. Scheduled lightpath demands are connection demands for which the setup and teardown times are known in advance. We formulate separately the routing problem and the wavelength assignment problem as spatio-temporal combinatorial optimization problems. For the former, we propose a branch and bound algorithm for exact resolution and an alternative tabu search algorithm for approximate resolution. A generalized graph coloring approach is used to solve the wavelength assignment problem. We compared the proposed algorithms to an RWA algorithm that sequentially computes the route and wavelength assignment for the scheduled lightpath demands.</description><subject>Algorithms</subject><subject>Approximation</subject><subject>Combinatorial analysis</subject><subject>Computer networks</subject><subject>Demand</subject><subject>Lighting control</subject><subject>Marketing</subject><subject>Optical fiber networks</subject><subject>Optical network units</subject><subject>Processor scheduling</subject><subject>Routing (telecommunications)</subject><subject>Scheduling algorithm</subject><subject>Telecommunication traffic</subject><subject>Wavelength assignment</subject><subject>Wavelength division multiplexing</subject><subject>Wavelength routing</subject><subject>Wavelengths</subject><subject>WDM networks</subject><issn>0733-8716</issn><issn>1558-0008</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2003</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp9kE1Lw0AQhhdRsFbvgpfgQU-pM7ub7OZmKX5SEPw4L5tktk1Jk5pNFP-9WyoIHpzLXJ73HeZh7BRhggjZ1ePLdDbhAGKiMU0532MjTBIdA4DeZyNQQsRaYXrIjrxfAaCUmo_Y9XM79FWziGxTRp_2g2pqFv0yst5Xi2ZNTR-1LvLFksqhpjKqq8Wy39hAlLQOGX_MDpytPZ387DF7u715nd3H86e7h9l0HhcSVR9LmbpwUFDubO4ypctCk9KuRCVKmaeonCWOWaasRZsk4JROkcC6TGgpcjFml7veTde-D-R7s658QXVtG2oHbzJABVmYQF78S3KdqEQiBvD8D7hqh64JXxitJU91InmAYAcVXet9R85sumptuy-DYLbmzda82Zo3O_MhcraLVET0i3MhgwrxDc-vfnU</recordid><startdate>20031001</startdate><enddate>20031001</enddate><creator>Kuri, J.</creator><creator>Puech, N.</creator><creator>Gagnaire, M.</creator><creator>Dotaro, E.</creator><creator>Douville, R.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><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>20031001</creationdate><title>Routing and wavelength assignment of scheduled lightpath demands</title><author>Kuri, J. ; Puech, N. ; Gagnaire, M. ; Dotaro, E. ; Douville, R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c417t-446f4823ebfabf978dc8e78fd173d4b617fae21997aa1a550f7861e0af93843b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Algorithms</topic><topic>Approximation</topic><topic>Combinatorial analysis</topic><topic>Computer networks</topic><topic>Demand</topic><topic>Lighting control</topic><topic>Marketing</topic><topic>Optical fiber networks</topic><topic>Optical network units</topic><topic>Processor scheduling</topic><topic>Routing (telecommunications)</topic><topic>Scheduling algorithm</topic><topic>Telecommunication traffic</topic><topic>Wavelength assignment</topic><topic>Wavelength division multiplexing</topic><topic>Wavelength routing</topic><topic>Wavelengths</topic><topic>WDM networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kuri, J.</creatorcontrib><creatorcontrib>Puech, N.</creatorcontrib><creatorcontrib>Gagnaire, M.</creatorcontrib><creatorcontrib>Dotaro, E.</creatorcontrib><creatorcontrib>Douville, R.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</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_linktorsrc</fulltext></delivery><addata><au>Kuri, J.</au><au>Puech, N.</au><au>Gagnaire, M.</au><au>Dotaro, E.</au><au>Douville, R.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Routing and wavelength assignment of scheduled lightpath demands</atitle><jtitle>IEEE journal on selected areas in communications</jtitle><stitle>J-SAC</stitle><date>2003-10-01</date><risdate>2003</risdate><volume>21</volume><issue>8</issue><spage>1231</spage><epage>1240</epage><pages>1231-1240</pages><issn>0733-8716</issn><eissn>1558-0008</eissn><coden>ISACEM</coden><abstract>We present algorithms that compute the routing and wavelength assignment (RWA) for scheduled lightpath demands in a wavelength-switching mesh network without wavelength conversion functionality. Scheduled lightpath demands are connection demands for which the setup and teardown times are known in advance. We formulate separately the routing problem and the wavelength assignment problem as spatio-temporal combinatorial optimization problems. For the former, we propose a branch and bound algorithm for exact resolution and an alternative tabu search algorithm for approximate resolution. A generalized graph coloring approach is used to solve the wavelength assignment problem. We compared the proposed algorithms to an RWA algorithm that sequentially computes the route and wavelength assignment for the scheduled lightpath demands.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/JSAC.2003.816622</doi><tpages>10</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0733-8716 |
| ispartof | IEEE journal on selected areas in communications, 2003-10, Vol.21 (8), p.1231-1240 |
| issn | 0733-8716 1558-0008 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_JSAC_2003_816622 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithms Approximation Combinatorial analysis Computer networks Demand Lighting control Marketing Optical fiber networks Optical network units Processor scheduling Routing (telecommunications) Scheduling algorithm Telecommunication traffic Wavelength assignment Wavelength division multiplexing Wavelength routing Wavelengths WDM networks |
| title | Routing and wavelength assignment of scheduled lightpath demands |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-05T01%3A04%3A18IST&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=Routing%20and%20wavelength%20assignment%20of%20scheduled%20lightpath%20demands&rft.jtitle=IEEE%20journal%20on%20selected%20areas%20in%20communications&rft.au=Kuri,%20J.&rft.date=2003-10-01&rft.volume=21&rft.issue=8&rft.spage=1231&rft.epage=1240&rft.pages=1231-1240&rft.issn=0733-8716&rft.eissn=1558-0008&rft.coden=ISACEM&rft_id=info:doi/10.1109/JSAC.2003.816622&rft_dat=%3Cproquest_RIE%3E901709999%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=884268542&rft_id=info:pmid/&rft_ieee_id=1234417&rfr_iscdi=true |