Robust capacity assignment solutions for telecommunications networks with uncertain demands
We consider the capacity planning of telecommunications networks with linear investment costs and uncertain future traffic demands. Transmission capacities must be large enough to meet, with a high quality of service (QoS), the range of possible demands, after adequate routings of the traffic on the...
Gespeichert in:
Veröffentlicht in: | Networks 2013-12, Vol.62 (4), p.255-272 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 272 |
---|---|
container_issue | 4 |
container_start_page | 255 |
container_title | Networks |
container_volume | 62 |
creator | Babonneau, F. Vial, J.-P. Klopfenstein, O. Ouorou, A. |
description | We consider the capacity planning of telecommunications networks with linear investment costs and uncertain future traffic demands. Transmission capacities must be large enough to meet, with a high quality of service (QoS), the range of possible demands, after adequate routings of the traffic on the created network. We use the robust optimization methodology to balance the need for a given QoS with the cost of investment. Our model assumes that the traffic for each individual demand fluctuates in an interval around a nominal value. We use a refined version of affine decision rules based on a concept of demand proximity to model the routings as affine functions of the demand realizations. We then give a probabilistic analysis assuming the random variables follow a triangular distribution. Finally, we perform numerical experiments on network instances from Survivable fixed telecommunication Network Design Library (SNDlib) and measure the quality of the solutions by simulation. Copyright © 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 62(4), 255–272 2013 |
doi_str_mv | 10.1002/net.21515 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1541447820</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3110491381</sourcerecordid><originalsourceid>FETCH-LOGICAL-c3985-30549eab305b99ca1f1395be6f4ea06acf98eeb8b75dbef5459be56577acf78e3</originalsourceid><addsrcrecordid>eNp1kFFrFTEQhYMoeG198B8siKAP2yabZJN9lFJrobRWKoI-hGzurKbdTW4zWa733zd1ax-EPg3MfOfMmSHkDaMHjNLmMEA-aJhk8hlZMdqpmlKunpNVmemaUyFfkleI15SyAukV-fk19jPmytmNdT7vKovof4UJQq4wjnP2MWA1xFRlGMHFaZqDd3Zpl2XbmG6w2vr8u5qDg5StD9UaJhvWuE9eDHZEeP1Q98i3T8dXR5_rs4uT06OPZ7XjnZYllRQd2L7UvuucZQPjneyhHQRY2lo3dBqg172S6x4GKWTXg2ylUmWkNPA98n7x3aR4OwNmM3l0MI42QJzRMCmYEEo3tKBv_0Ov45xCSWcKInUrlOCF-rBQLkXEBIPZJD_ZtDOMmvs3m3K5-fvmwr57cLTo7DgkG5zHR0GjKW86fb_5cOG2foTd04bm_Pjqn3O9KDxm-POosOnGtIorab6fn5hGSN7wLz_MJb8DpuOcew</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1445864743</pqid></control><display><type>article</type><title>Robust capacity assignment solutions for telecommunications networks with uncertain demands</title><source>Wiley Online Library Journals Frontfile Complete</source><creator>Babonneau, F. ; Vial, J.-P. ; Klopfenstein, O. ; Ouorou, A.</creator><creatorcontrib>Babonneau, F. ; Vial, J.-P. ; Klopfenstein, O. ; Ouorou, A.</creatorcontrib><description>We consider the capacity planning of telecommunications networks with linear investment costs and uncertain future traffic demands. Transmission capacities must be large enough to meet, with a high quality of service (QoS), the range of possible demands, after adequate routings of the traffic on the created network. We use the robust optimization methodology to balance the need for a given QoS with the cost of investment. Our model assumes that the traffic for each individual demand fluctuates in an interval around a nominal value. We use a refined version of affine decision rules based on a concept of demand proximity to model the routings as affine functions of the demand realizations. We then give a probabilistic analysis assuming the random variables follow a triangular distribution. Finally, we perform numerical experiments on network instances from Survivable fixed telecommunication Network Design Library (SNDlib) and measure the quality of the solutions by simulation. Copyright © 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 62(4), 255–272 2013</description><identifier>ISSN: 0028-3045</identifier><identifier>EISSN: 1097-0037</identifier><identifier>DOI: 10.1002/net.21515</identifier><identifier>CODEN: NTWKAA</identifier><language>eng</language><publisher>Hoboken, NJ: Blackwell Publishing Ltd</publisher><subject>Applied sciences ; capacity assignment problem ; Computer networks ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Demand ; Exact sciences and technology ; Financing ; Inventory control, production control. Distribution ; Mathematical models ; Networks ; Operational research and scientific management ; Operational research. Management science ; Reliability theory. Replacement problems ; robust optimization ; Software ; Telecommunications ; telecommunications networks ; Traffic engineering ; Traffic flow</subject><ispartof>Networks, 2013-12, Vol.62 (4), p.255-272</ispartof><rights>Copyright © 2013 Wiley Periodicals, Inc.</rights><rights>2015 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c3985-30549eab305b99ca1f1395be6f4ea06acf98eeb8b75dbef5459be56577acf78e3</citedby><cites>FETCH-LOGICAL-c3985-30549eab305b99ca1f1395be6f4ea06acf98eeb8b75dbef5459be56577acf78e3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1002%2Fnet.21515$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1002%2Fnet.21515$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,776,780,1411,27901,27902,45550,45551</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=28032980$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Babonneau, F.</creatorcontrib><creatorcontrib>Vial, J.-P.</creatorcontrib><creatorcontrib>Klopfenstein, O.</creatorcontrib><creatorcontrib>Ouorou, A.</creatorcontrib><title>Robust capacity assignment solutions for telecommunications networks with uncertain demands</title><title>Networks</title><addtitle>NETWORKS</addtitle><description>We consider the capacity planning of telecommunications networks with linear investment costs and uncertain future traffic demands. Transmission capacities must be large enough to meet, with a high quality of service (QoS), the range of possible demands, after adequate routings of the traffic on the created network. We use the robust optimization methodology to balance the need for a given QoS with the cost of investment. Our model assumes that the traffic for each individual demand fluctuates in an interval around a nominal value. We use a refined version of affine decision rules based on a concept of demand proximity to model the routings as affine functions of the demand realizations. We then give a probabilistic analysis assuming the random variables follow a triangular distribution. Finally, we perform numerical experiments on network instances from Survivable fixed telecommunication Network Design Library (SNDlib) and measure the quality of the solutions by simulation. Copyright © 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 62(4), 255–272 2013</description><subject>Applied sciences</subject><subject>capacity assignment problem</subject><subject>Computer networks</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Demand</subject><subject>Exact sciences and technology</subject><subject>Financing</subject><subject>Inventory control, production control. Distribution</subject><subject>Mathematical models</subject><subject>Networks</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Reliability theory. Replacement problems</subject><subject>robust optimization</subject><subject>Software</subject><subject>Telecommunications</subject><subject>telecommunications networks</subject><subject>Traffic engineering</subject><subject>Traffic flow</subject><issn>0028-3045</issn><issn>1097-0037</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><recordid>eNp1kFFrFTEQhYMoeG198B8siKAP2yabZJN9lFJrobRWKoI-hGzurKbdTW4zWa733zd1ax-EPg3MfOfMmSHkDaMHjNLmMEA-aJhk8hlZMdqpmlKunpNVmemaUyFfkleI15SyAukV-fk19jPmytmNdT7vKovof4UJQq4wjnP2MWA1xFRlGMHFaZqDd3Zpl2XbmG6w2vr8u5qDg5StD9UaJhvWuE9eDHZEeP1Q98i3T8dXR5_rs4uT06OPZ7XjnZYllRQd2L7UvuucZQPjneyhHQRY2lo3dBqg172S6x4GKWTXg2ylUmWkNPA98n7x3aR4OwNmM3l0MI42QJzRMCmYEEo3tKBv_0Ov45xCSWcKInUrlOCF-rBQLkXEBIPZJD_ZtDOMmvs3m3K5-fvmwr57cLTo7DgkG5zHR0GjKW86fb_5cOG2foTd04bm_Pjqn3O9KDxm-POosOnGtIorab6fn5hGSN7wLz_MJb8DpuOcew</recordid><startdate>201312</startdate><enddate>201312</enddate><creator>Babonneau, F.</creator><creator>Vial, J.-P.</creator><creator>Klopfenstein, O.</creator><creator>Ouorou, A.</creator><general>Blackwell Publishing Ltd</general><general>Wiley</general><general>Wiley Subscription Services, Inc</general><scope>BSCLL</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>7SP</scope></search><sort><creationdate>201312</creationdate><title>Robust capacity assignment solutions for telecommunications networks with uncertain demands</title><author>Babonneau, F. ; Vial, J.-P. ; Klopfenstein, O. ; Ouorou, A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c3985-30549eab305b99ca1f1395be6f4ea06acf98eeb8b75dbef5459be56577acf78e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Applied sciences</topic><topic>capacity assignment problem</topic><topic>Computer networks</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Demand</topic><topic>Exact sciences and technology</topic><topic>Financing</topic><topic>Inventory control, production control. Distribution</topic><topic>Mathematical models</topic><topic>Networks</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Reliability theory. Replacement problems</topic><topic>robust optimization</topic><topic>Software</topic><topic>Telecommunications</topic><topic>telecommunications networks</topic><topic>Traffic engineering</topic><topic>Traffic flow</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Babonneau, F.</creatorcontrib><creatorcontrib>Vial, J.-P.</creatorcontrib><creatorcontrib>Klopfenstein, O.</creatorcontrib><creatorcontrib>Ouorou, A.</creatorcontrib><collection>Istex</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Electronics & Communications Abstracts</collection><jtitle>Networks</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Babonneau, F.</au><au>Vial, J.-P.</au><au>Klopfenstein, O.</au><au>Ouorou, A.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Robust capacity assignment solutions for telecommunications networks with uncertain demands</atitle><jtitle>Networks</jtitle><addtitle>NETWORKS</addtitle><date>2013-12</date><risdate>2013</risdate><volume>62</volume><issue>4</issue><spage>255</spage><epage>272</epage><pages>255-272</pages><issn>0028-3045</issn><eissn>1097-0037</eissn><coden>NTWKAA</coden><abstract>We consider the capacity planning of telecommunications networks with linear investment costs and uncertain future traffic demands. Transmission capacities must be large enough to meet, with a high quality of service (QoS), the range of possible demands, after adequate routings of the traffic on the created network. We use the robust optimization methodology to balance the need for a given QoS with the cost of investment. Our model assumes that the traffic for each individual demand fluctuates in an interval around a nominal value. We use a refined version of affine decision rules based on a concept of demand proximity to model the routings as affine functions of the demand realizations. We then give a probabilistic analysis assuming the random variables follow a triangular distribution. Finally, we perform numerical experiments on network instances from Survivable fixed telecommunication Network Design Library (SNDlib) and measure the quality of the solutions by simulation. Copyright © 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 62(4), 255–272 2013</abstract><cop>Hoboken, NJ</cop><pub>Blackwell Publishing Ltd</pub><doi>10.1002/net.21515</doi><tpages>18</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0028-3045 |
ispartof | Networks, 2013-12, Vol.62 (4), p.255-272 |
issn | 0028-3045 1097-0037 |
language | eng |
recordid | cdi_proquest_miscellaneous_1541447820 |
source | Wiley Online Library Journals Frontfile Complete |
subjects | Applied sciences capacity assignment problem Computer networks Computer science control theory systems Computer systems and distributed systems. User interface Demand Exact sciences and technology Financing Inventory control, production control. Distribution Mathematical models Networks Operational research and scientific management Operational research. Management science Reliability theory. Replacement problems robust optimization Software Telecommunications telecommunications networks Traffic engineering Traffic flow |
title | Robust capacity assignment solutions for telecommunications networks with uncertain 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-12T17%3A35%3A39IST&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=Robust%20capacity%20assignment%20solutions%20for%20telecommunications%20networks%20with%20uncertain%20demands&rft.jtitle=Networks&rft.au=Babonneau,%20F.&rft.date=2013-12&rft.volume=62&rft.issue=4&rft.spage=255&rft.epage=272&rft.pages=255-272&rft.issn=0028-3045&rft.eissn=1097-0037&rft.coden=NTWKAA&rft_id=info:doi/10.1002/net.21515&rft_dat=%3Cproquest_cross%3E3110491381%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1445864743&rft_id=info:pmid/&rfr_iscdi=true |