Multi-Period Network Design With Incremental Routing

In this paper, we study a special case of multiperiod network design (MPND) problems, multiperiod network design with incremental routing (MPNDI), as applied to the transmission layer of an optical network. We optimize simultaneously the network architecture and the link dimensioning under discrete...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Networks 2007-08, Vol.50 (1), p.109-117
Hauptverfasser: Lardeux, Benoit, Nace, Dritan, Geffard, Jérôme
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 117
container_issue 1
container_start_page 109
container_title Networks
container_volume 50
creator Lardeux, Benoit
Nace, Dritan
Geffard, Jérôme
description In this paper, we study a special case of multiperiod network design (MPND) problems, multiperiod network design with incremental routing (MPNDI), as applied to the transmission layer of an optical network. We optimize simultaneously the network architecture and the link dimensioning under discrete cost functions in order to route all traffic demands in line with traffic growth over a discrete time horizon. Because of operational requirements, routing paths used at a given period to route some traffic demands have to be preserved over subsequent periods; this is called incremental routing with respect to incremental flow. To handle the high dimensionality, a compact formulation omitting explicitly written flow variables is given. We examine the dominant polyhedron of the incremental multicommodity flow and provide a polyhedral study of it. Finally, a solution approach taking advantage of the polyhedral structure of MPNDI is proposed, and computational results for a range of instances with 8 and 10 nodes are provided. © 2007 Wiley Periodicals, Inc. NETWORKS, Vol. 50(1), 109–117 2007
doi_str_mv 10.1002/net.20171
format Article
fullrecord <record><control><sourceid>hal</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_00342728v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>oai_HAL_hal_00342728v1</sourcerecordid><originalsourceid>FETCH-hal_primary_oai_HAL_hal_00342728v13</originalsourceid><addsrcrecordid>eNqVjssKwjAUBYMoWB8L_yBbF633pi2tS_FBBRURwWUIGttom0qaKv69FfwBVwdmZnEIGSF4CMAmWlqPAUbYIg7CNHIB_KhNnMbFrg9B2CW9qroBIIYYOyTY1rlV7l4aVV7oTtpXae50ISuVanpSNqNrfTaykNqKnB7K2iqdDkjnKvJKDn_bJ-PV8jhP3Ezk_GFUIcybl0LxZLbhX9acCFjE4if6_7Qf8U49fw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Multi-Period Network Design With Incremental Routing</title><source>Wiley Journals</source><creator>Lardeux, Benoit ; Nace, Dritan ; Geffard, Jérôme</creator><creatorcontrib>Lardeux, Benoit ; Nace, Dritan ; Geffard, Jérôme</creatorcontrib><description>In this paper, we study a special case of multiperiod network design (MPND) problems, multiperiod network design with incremental routing (MPNDI), as applied to the transmission layer of an optical network. We optimize simultaneously the network architecture and the link dimensioning under discrete cost functions in order to route all traffic demands in line with traffic growth over a discrete time horizon. Because of operational requirements, routing paths used at a given period to route some traffic demands have to be preserved over subsequent periods; this is called incremental routing with respect to incremental flow. To handle the high dimensionality, a compact formulation omitting explicitly written flow variables is given. We examine the dominant polyhedron of the incremental multicommodity flow and provide a polyhedral study of it. Finally, a solution approach taking advantage of the polyhedral structure of MPNDI is proposed, and computational results for a range of instances with 8 and 10 nodes are provided. © 2007 Wiley Periodicals, Inc. NETWORKS, Vol. 50(1), 109–117 2007</description><identifier>ISSN: 0028-3045</identifier><identifier>EISSN: 1097-0037</identifier><identifier>DOI: 10.1002/net.20171</identifier><language>eng</language><publisher>Wiley</publisher><subject>Computer Science ; Networking and Internet Architecture ; Operations Research</subject><ispartof>Networks, 2007-08, Vol.50 (1), p.109-117</ispartof><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><orcidid>0000-0003-3914-2463 ; 0000-0003-3914-2463</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,314,780,784,885,27924,27925</link.rule.ids><backlink>$$Uhttps://hal.science/hal-00342728$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Lardeux, Benoit</creatorcontrib><creatorcontrib>Nace, Dritan</creatorcontrib><creatorcontrib>Geffard, Jérôme</creatorcontrib><title>Multi-Period Network Design With Incremental Routing</title><title>Networks</title><description>In this paper, we study a special case of multiperiod network design (MPND) problems, multiperiod network design with incremental routing (MPNDI), as applied to the transmission layer of an optical network. We optimize simultaneously the network architecture and the link dimensioning under discrete cost functions in order to route all traffic demands in line with traffic growth over a discrete time horizon. Because of operational requirements, routing paths used at a given period to route some traffic demands have to be preserved over subsequent periods; this is called incremental routing with respect to incremental flow. To handle the high dimensionality, a compact formulation omitting explicitly written flow variables is given. We examine the dominant polyhedron of the incremental multicommodity flow and provide a polyhedral study of it. Finally, a solution approach taking advantage of the polyhedral structure of MPNDI is proposed, and computational results for a range of instances with 8 and 10 nodes are provided. © 2007 Wiley Periodicals, Inc. NETWORKS, Vol. 50(1), 109–117 2007</description><subject>Computer Science</subject><subject>Networking and Internet Architecture</subject><subject>Operations Research</subject><issn>0028-3045</issn><issn>1097-0037</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><recordid>eNqVjssKwjAUBYMoWB8L_yBbF633pi2tS_FBBRURwWUIGttom0qaKv69FfwBVwdmZnEIGSF4CMAmWlqPAUbYIg7CNHIB_KhNnMbFrg9B2CW9qroBIIYYOyTY1rlV7l4aVV7oTtpXae50ISuVanpSNqNrfTaykNqKnB7K2iqdDkjnKvJKDn_bJ-PV8jhP3Ezk_GFUIcybl0LxZLbhX9acCFjE4if6_7Qf8U49fw</recordid><startdate>200708</startdate><enddate>200708</enddate><creator>Lardeux, Benoit</creator><creator>Nace, Dritan</creator><creator>Geffard, Jérôme</creator><general>Wiley</general><scope>1XC</scope><orcidid>https://orcid.org/0000-0003-3914-2463</orcidid><orcidid>https://orcid.org/0000-0003-3914-2463</orcidid></search><sort><creationdate>200708</creationdate><title>Multi-Period Network Design With Incremental Routing</title><author>Lardeux, Benoit ; Nace, Dritan ; Geffard, Jérôme</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-hal_primary_oai_HAL_hal_00342728v13</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Computer Science</topic><topic>Networking and Internet Architecture</topic><topic>Operations Research</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Lardeux, Benoit</creatorcontrib><creatorcontrib>Nace, Dritan</creatorcontrib><creatorcontrib>Geffard, Jérôme</creatorcontrib><collection>Hyper Article en Ligne (HAL)</collection><jtitle>Networks</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Lardeux, Benoit</au><au>Nace, Dritan</au><au>Geffard, Jérôme</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Multi-Period Network Design With Incremental Routing</atitle><jtitle>Networks</jtitle><date>2007-08</date><risdate>2007</risdate><volume>50</volume><issue>1</issue><spage>109</spage><epage>117</epage><pages>109-117</pages><issn>0028-3045</issn><eissn>1097-0037</eissn><abstract>In this paper, we study a special case of multiperiod network design (MPND) problems, multiperiod network design with incremental routing (MPNDI), as applied to the transmission layer of an optical network. We optimize simultaneously the network architecture and the link dimensioning under discrete cost functions in order to route all traffic demands in line with traffic growth over a discrete time horizon. Because of operational requirements, routing paths used at a given period to route some traffic demands have to be preserved over subsequent periods; this is called incremental routing with respect to incremental flow. To handle the high dimensionality, a compact formulation omitting explicitly written flow variables is given. We examine the dominant polyhedron of the incremental multicommodity flow and provide a polyhedral study of it. Finally, a solution approach taking advantage of the polyhedral structure of MPNDI is proposed, and computational results for a range of instances with 8 and 10 nodes are provided. © 2007 Wiley Periodicals, Inc. NETWORKS, Vol. 50(1), 109–117 2007</abstract><pub>Wiley</pub><doi>10.1002/net.20171</doi><orcidid>https://orcid.org/0000-0003-3914-2463</orcidid><orcidid>https://orcid.org/0000-0003-3914-2463</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 0028-3045
ispartof Networks, 2007-08, Vol.50 (1), p.109-117
issn 0028-3045
1097-0037
language eng
recordid cdi_hal_primary_oai_HAL_hal_00342728v1
source Wiley Journals
subjects Computer Science
Networking and Internet Architecture
Operations Research
title Multi-Period Network Design With Incremental Routing
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T08%3A41%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-hal&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Multi-Period%20Network%20Design%20With%20Incremental%20Routing&rft.jtitle=Networks&rft.au=Lardeux,%20Benoit&rft.date=2007-08&rft.volume=50&rft.issue=1&rft.spage=109&rft.epage=117&rft.pages=109-117&rft.issn=0028-3045&rft.eissn=1097-0037&rft_id=info:doi/10.1002/net.20171&rft_dat=%3Chal%3Eoai_HAL_hal_00342728v1%3C/hal%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true