An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks
The construction of overlay or broadcast networks, based on spanning trees, over WDM optical networks with SRLG information, has important applications in telecommunications. In this paper we propose a bicriteria optimization model for calculating communication spanning trees over WDM networks the o...
Gespeichert in:
| Veröffentlicht in: | Telecommunication systems 2016-06, Vol.62 (2), p.327-346 |
|---|---|
| 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 | 346 |
|---|---|
| container_issue | 2 |
| container_start_page | 327 |
| container_title | Telecommunication systems |
| container_volume | 62 |
| creator | Craveirinha, José M. F. Clímaco, João C. N. Martins, Lúcia M. R. A. Pascoal, Marta M. B. |
| description | The construction of overlay or broadcast networks, based on spanning trees, over WDM optical networks with SRLG information, has important applications in telecommunications. In this paper we propose a bicriteria optimization model for calculating communication spanning trees over WDM networks the objectives of which are the minimization of the total number of different SRLGs of the tree links (seeking to maximise reliability) and the minimization of the total bandwidth usage cost. An exact algorithm for generating the whole set of non-dominated solutions and methods for selecting a final solution in various decision environments are put forward. An extensive experimental study on the application of the model, including two sets of experiments based on reference transport network topologies, with random link bandwidth occupations and with random SRLG assignments to the links, is also presented, together with a discussion on potential advantages of the model. |
| doi_str_mv | 10.1007/s11235-015-0066-x |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1816086003</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>4042244501</sourcerecordid><originalsourceid>FETCH-LOGICAL-c349t-8f306a8a4334c90da6ea047bd6bb268a23995a08205b0113dd668ce9ce6f3be3</originalsourceid><addsrcrecordid>eNp1kE1LxDAQhoMouK7-AG8FL17qTpo2TY_LoquwIOjeQ5qma9c2qUmq6783pQoieBjmg-cdZl6ELjHcYIB84TBOSBYDDgGUxocjNMNZnsRFmuHjUANmccpoeorOnNsDjKpihvhSR-ogpI865V9MFdXGRtJo5-0gfaN3UdfophNtGDq_-GmenzbryPVC6xHxVikXmXdlI9P7RgZAK_9h7Ks7Rye1aJ26-M5ztL273a7u483j-mG13MSSpIWPWU2ACiZSQlJZQCWoEpDmZUXLMqFMJKQoMgEsgawEjElVUcqkKqSiNSkVmaPraW1vzdugnOdd46RqW6GVGRzHDFNgFIAE9OoPujeD1eE4jnOWFRQyAoHCEyWtcc6qmvc2fG4_OQY-escnx3lwnI-O80PQJJPGBVbvlP21-V_RF5xhhFI</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1785960530</pqid></control><display><type>article</type><title>An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks</title><source>Springer Nature - Complete Springer Journals</source><creator>Craveirinha, José M. F. ; Clímaco, João C. N. ; Martins, Lúcia M. R. A. ; Pascoal, Marta M. B.</creator><creatorcontrib>Craveirinha, José M. F. ; Clímaco, João C. N. ; Martins, Lúcia M. R. A. ; Pascoal, Marta M. B.</creatorcontrib><description>The construction of overlay or broadcast networks, based on spanning trees, over WDM optical networks with SRLG information, has important applications in telecommunications. In this paper we propose a bicriteria optimization model for calculating communication spanning trees over WDM networks the objectives of which are the minimization of the total number of different SRLGs of the tree links (seeking to maximise reliability) and the minimization of the total bandwidth usage cost. An exact algorithm for generating the whole set of non-dominated solutions and methods for selecting a final solution in various decision environments are put forward. An extensive experimental study on the application of the model, including two sets of experiments based on reference transport network topologies, with random link bandwidth occupations and with random SRLG assignments to the links, is also presented, together with a discussion on potential advantages of the model.</description><identifier>ISSN: 1018-4864</identifier><identifier>EISSN: 1572-9451</identifier><identifier>DOI: 10.1007/s11235-015-0066-x</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algorithms ; Artificial Intelligence ; Bandwidths ; Business and Management ; Communication ; Computer Communication Networks ; Computer networks ; Cost engineering ; Failure ; Graph theory ; Heuristic ; IT in Business ; Linear programming ; Links ; Mathematical models ; Network topologies ; Networks ; Optimization ; Peer to peer computing ; Probability Theory and Stochastic Processes ; Telecommunications systems ; Virtual private networks ; Wavelength division multiplexing</subject><ispartof>Telecommunication systems, 2016-06, Vol.62 (2), p.327-346</ispartof><rights>Springer Science+Business Media New York 2015</rights><rights>Springer Science+Business Media New York 2016</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c349t-8f306a8a4334c90da6ea047bd6bb268a23995a08205b0113dd668ce9ce6f3be3</citedby><cites>FETCH-LOGICAL-c349t-8f306a8a4334c90da6ea047bd6bb268a23995a08205b0113dd668ce9ce6f3be3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11235-015-0066-x$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11235-015-0066-x$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,776,780,27901,27902,41464,42533,51294</link.rule.ids></links><search><creatorcontrib>Craveirinha, José M. F.</creatorcontrib><creatorcontrib>Clímaco, João C. N.</creatorcontrib><creatorcontrib>Martins, Lúcia M. R. A.</creatorcontrib><creatorcontrib>Pascoal, Marta M. B.</creatorcontrib><title>An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks</title><title>Telecommunication systems</title><addtitle>Telecommun Syst</addtitle><description>The construction of overlay or broadcast networks, based on spanning trees, over WDM optical networks with SRLG information, has important applications in telecommunications. In this paper we propose a bicriteria optimization model for calculating communication spanning trees over WDM networks the objectives of which are the minimization of the total number of different SRLGs of the tree links (seeking to maximise reliability) and the minimization of the total bandwidth usage cost. An exact algorithm for generating the whole set of non-dominated solutions and methods for selecting a final solution in various decision environments are put forward. An extensive experimental study on the application of the model, including two sets of experiments based on reference transport network topologies, with random link bandwidth occupations and with random SRLG assignments to the links, is also presented, together with a discussion on potential advantages of the model.</description><subject>Algorithms</subject><subject>Artificial Intelligence</subject><subject>Bandwidths</subject><subject>Business and Management</subject><subject>Communication</subject><subject>Computer Communication Networks</subject><subject>Computer networks</subject><subject>Cost engineering</subject><subject>Failure</subject><subject>Graph theory</subject><subject>Heuristic</subject><subject>IT in Business</subject><subject>Linear programming</subject><subject>Links</subject><subject>Mathematical models</subject><subject>Network topologies</subject><subject>Networks</subject><subject>Optimization</subject><subject>Peer to peer computing</subject><subject>Probability Theory and Stochastic Processes</subject><subject>Telecommunications systems</subject><subject>Virtual private networks</subject><subject>Wavelength division multiplexing</subject><issn>1018-4864</issn><issn>1572-9451</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNp1kE1LxDAQhoMouK7-AG8FL17qTpo2TY_LoquwIOjeQ5qma9c2qUmq6783pQoieBjmg-cdZl6ELjHcYIB84TBOSBYDDgGUxocjNMNZnsRFmuHjUANmccpoeorOnNsDjKpihvhSR-ogpI865V9MFdXGRtJo5-0gfaN3UdfophNtGDq_-GmenzbryPVC6xHxVikXmXdlI9P7RgZAK_9h7Ks7Rye1aJ26-M5ztL273a7u483j-mG13MSSpIWPWU2ACiZSQlJZQCWoEpDmZUXLMqFMJKQoMgEsgawEjElVUcqkKqSiNSkVmaPraW1vzdugnOdd46RqW6GVGRzHDFNgFIAE9OoPujeD1eE4jnOWFRQyAoHCEyWtcc6qmvc2fG4_OQY-escnx3lwnI-O80PQJJPGBVbvlP21-V_RF5xhhFI</recordid><startdate>20160601</startdate><enddate>20160601</enddate><creator>Craveirinha, José M. F.</creator><creator>Clímaco, João C. N.</creator><creator>Martins, Lúcia M. R. A.</creator><creator>Pascoal, Marta M. B.</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7SP</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>L.-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M2P</scope><scope>P5Z</scope><scope>P62</scope><scope>PHGZM</scope><scope>PHGZT</scope><scope>PKEHL</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQGLB</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>Q9U</scope></search><sort><creationdate>20160601</creationdate><title>An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks</title><author>Craveirinha, José M. F. ; Clímaco, João C. N. ; Martins, Lúcia M. R. A. ; Pascoal, Marta M. B.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c349t-8f306a8a4334c90da6ea047bd6bb268a23995a08205b0113dd668ce9ce6f3be3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Algorithms</topic><topic>Artificial Intelligence</topic><topic>Bandwidths</topic><topic>Business and Management</topic><topic>Communication</topic><topic>Computer Communication Networks</topic><topic>Computer networks</topic><topic>Cost engineering</topic><topic>Failure</topic><topic>Graph theory</topic><topic>Heuristic</topic><topic>IT in Business</topic><topic>Linear programming</topic><topic>Links</topic><topic>Mathematical models</topic><topic>Network topologies</topic><topic>Networks</topic><topic>Optimization</topic><topic>Peer to peer computing</topic><topic>Probability Theory and Stochastic Processes</topic><topic>Telecommunications systems</topic><topic>Virtual private networks</topic><topic>Wavelength division multiplexing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Craveirinha, José M. F.</creatorcontrib><creatorcontrib>Clímaco, João C. N.</creatorcontrib><creatorcontrib>Martins, Lúcia M. R. A.</creatorcontrib><creatorcontrib>Pascoal, Marta M. B.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>ABI/INFORM Professional Advanced</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>ABI/INFORM Global</collection><collection>Science Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central (New)</collection><collection>ProQuest One Academic (New)</collection><collection>ProQuest One Academic Middle East (New)</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Applied & Life Sciences</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central Basic</collection><jtitle>Telecommunication systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Craveirinha, José M. F.</au><au>Clímaco, João C. N.</au><au>Martins, Lúcia M. R. A.</au><au>Pascoal, Marta M. B.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks</atitle><jtitle>Telecommunication systems</jtitle><stitle>Telecommun Syst</stitle><date>2016-06-01</date><risdate>2016</risdate><volume>62</volume><issue>2</issue><spage>327</spage><epage>346</epage><pages>327-346</pages><issn>1018-4864</issn><eissn>1572-9451</eissn><abstract>The construction of overlay or broadcast networks, based on spanning trees, over WDM optical networks with SRLG information, has important applications in telecommunications. In this paper we propose a bicriteria optimization model for calculating communication spanning trees over WDM networks the objectives of which are the minimization of the total number of different SRLGs of the tree links (seeking to maximise reliability) and the minimization of the total bandwidth usage cost. An exact algorithm for generating the whole set of non-dominated solutions and methods for selecting a final solution in various decision environments are put forward. An extensive experimental study on the application of the model, including two sets of experiments based on reference transport network topologies, with random link bandwidth occupations and with random SRLG assignments to the links, is also presented, together with a discussion on potential advantages of the model.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s11235-015-0066-x</doi><tpages>20</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1018-4864 |
| ispartof | Telecommunication systems, 2016-06, Vol.62 (2), p.327-346 |
| issn | 1018-4864 1572-9451 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1816086003 |
| source | Springer Nature - Complete Springer Journals |
| subjects | Algorithms Artificial Intelligence Bandwidths Business and Management Communication Computer Communication Networks Computer networks Cost engineering Failure Graph theory Heuristic IT in Business Linear programming Links Mathematical models Network topologies Networks Optimization Peer to peer computing Probability Theory and Stochastic Processes Telecommunications systems Virtual private networks Wavelength division multiplexing |
| title | An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-19T09%3A13%3A03IST&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=An%20exact%20method%20for%20constructing%20minimal%20cost/minimal%20SRLG%20spanning%20trees%20over%20optical%20networks&rft.jtitle=Telecommunication%20systems&rft.au=Craveirinha,%20Jos%C3%A9%20M.%20F.&rft.date=2016-06-01&rft.volume=62&rft.issue=2&rft.spage=327&rft.epage=346&rft.pages=327-346&rft.issn=1018-4864&rft.eissn=1572-9451&rft_id=info:doi/10.1007/s11235-015-0066-x&rft_dat=%3Cproquest_cross%3E4042244501%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=1785960530&rft_id=info:pmid/&rfr_iscdi=true |