Mesh topology design in overlay virtual private networks
The mesh topology design problem in overlay virtual private networks is studied. Given a set of customer nodes and an associated traffic matrix, tunnels that connect node pairs through a service provider network are determined such that the total multi-hopped traffic is minimised. A tabu search base...
Gespeichert in:
| Veröffentlicht in: | Electronics letters 2002-08, Vol.38 (16), p.1-1 |
|---|---|
| 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 | 1 |
|---|---|
| container_issue | 16 |
| container_start_page | 1 |
| container_title | Electronics letters |
| container_volume | 38 |
| creator | Karasan, E Ekin-Karasan, O Akar, N Pinar, M C |
| description | The mesh topology design problem in overlay virtual private networks is studied. Given a set of customer nodes and an associated traffic matrix, tunnels that connect node pairs through a service provider network are determined such that the total multi-hopped traffic is minimised. A tabu search based heuristic is proposed. |
| format | Article |
| fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_miscellaneous_1651414989</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1651414989</sourcerecordid><originalsourceid>FETCH-LOGICAL-p619-a2f2debcacdc13ebd31bf4ed8b4b2111c6a03766e566dcc9e2713c91ffa4119c3</originalsourceid><addsrcrecordid>eNpdzktLxDAUBeAgCtbR_xBw46bQm1ebpQy-YMTNLNwNaXIzdoxNTdrK_HsLzsrV4cDH4ZyRArisSg3wfk6KqgJeStDiklzlfFgq07ouSPOK-YOOcYgh7o_UYe72Pe16GmdMwRzp3KVxMoEOqZvNiLTH8Semz3xNLrwJGW9OuSLbx4ft-rncvD29rO835aBAl4Z55rC1xjoLHFvHofUCXdOKlgGAVabitVIolXLWamQ1cKvBeyMAtOUrcvc3O6T4PWEed19dthiC6TFOeQdKggChG73Q23_0EKfUL-cWxaRQdS2A_wLGg1KE</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1625467741</pqid></control><display><type>article</type><title>Mesh topology design in overlay virtual private networks</title><source>Alma/SFX Local Collection</source><creator>Karasan, E ; Ekin-Karasan, O ; Akar, N ; Pinar, M C</creator><creatorcontrib>Karasan, E ; Ekin-Karasan, O ; Akar, N ; Pinar, M C</creatorcontrib><description>The mesh topology design problem in overlay virtual private networks is studied. Given a set of customer nodes and an associated traffic matrix, tunnels that connect node pairs through a service provider network are determined such that the total multi-hopped traffic is minimised. A tabu search based heuristic is proposed.</description><identifier>ISSN: 0013-5194</identifier><identifier>EISSN: 1350-911X</identifier><identifier>CODEN: ELLEAK</identifier><language>eng</language><publisher>Stevenage: John Wiley & Sons, Inc</publisher><subject>Customer satisfaction ; Heuristic ; Networks ; Tabu search ; Topology ; Traffic engineering ; Traffic flow ; Virtual private networks</subject><ispartof>Electronics letters, 2002-08, Vol.38 (16), p.1-1</ispartof><rights>Copyright The Institution of Engineering & Technology Aug 1, 2002</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784</link.rule.ids></links><search><creatorcontrib>Karasan, E</creatorcontrib><creatorcontrib>Ekin-Karasan, O</creatorcontrib><creatorcontrib>Akar, N</creatorcontrib><creatorcontrib>Pinar, M C</creatorcontrib><title>Mesh topology design in overlay virtual private networks</title><title>Electronics letters</title><description>The mesh topology design problem in overlay virtual private networks is studied. Given a set of customer nodes and an associated traffic matrix, tunnels that connect node pairs through a service provider network are determined such that the total multi-hopped traffic is minimised. A tabu search based heuristic is proposed.</description><subject>Customer satisfaction</subject><subject>Heuristic</subject><subject>Networks</subject><subject>Tabu search</subject><subject>Topology</subject><subject>Traffic engineering</subject><subject>Traffic flow</subject><subject>Virtual private networks</subject><issn>0013-5194</issn><issn>1350-911X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2002</creationdate><recordtype>article</recordtype><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNpdzktLxDAUBeAgCtbR_xBw46bQm1ebpQy-YMTNLNwNaXIzdoxNTdrK_HsLzsrV4cDH4ZyRArisSg3wfk6KqgJeStDiklzlfFgq07ouSPOK-YOOcYgh7o_UYe72Pe16GmdMwRzp3KVxMoEOqZvNiLTH8Semz3xNLrwJGW9OuSLbx4ft-rncvD29rO835aBAl4Z55rC1xjoLHFvHofUCXdOKlgGAVabitVIolXLWamQ1cKvBeyMAtOUrcvc3O6T4PWEed19dthiC6TFOeQdKggChG73Q23_0EKfUL-cWxaRQdS2A_wLGg1KE</recordid><startdate>20020801</startdate><enddate>20020801</enddate><creator>Karasan, E</creator><creator>Ekin-Karasan, O</creator><creator>Akar, N</creator><creator>Pinar, M C</creator><general>John Wiley & Sons, Inc</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L6V</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>7SP</scope><scope>8FD</scope><scope>F28</scope><scope>FR3</scope><scope>L7M</scope></search><sort><creationdate>20020801</creationdate><title>Mesh topology design in overlay virtual private networks</title><author>Karasan, E ; Ekin-Karasan, O ; Akar, N ; Pinar, M C</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p619-a2f2debcacdc13ebd31bf4ed8b4b2111c6a03766e566dcc9e2713c91ffa4119c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2002</creationdate><topic>Customer satisfaction</topic><topic>Heuristic</topic><topic>Networks</topic><topic>Tabu search</topic><topic>Topology</topic><topic>Traffic engineering</topic><topic>Traffic flow</topic><topic>Virtual private networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Karasan, E</creatorcontrib><creatorcontrib>Ekin-Karasan, O</creatorcontrib><creatorcontrib>Akar, N</creatorcontrib><creatorcontrib>Pinar, M C</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>Electronics letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Karasan, E</au><au>Ekin-Karasan, O</au><au>Akar, N</au><au>Pinar, M C</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Mesh topology design in overlay virtual private networks</atitle><jtitle>Electronics letters</jtitle><date>2002-08-01</date><risdate>2002</risdate><volume>38</volume><issue>16</issue><spage>1</spage><epage>1</epage><pages>1-1</pages><issn>0013-5194</issn><eissn>1350-911X</eissn><coden>ELLEAK</coden><abstract>The mesh topology design problem in overlay virtual private networks is studied. Given a set of customer nodes and an associated traffic matrix, tunnels that connect node pairs through a service provider network are determined such that the total multi-hopped traffic is minimised. A tabu search based heuristic is proposed.</abstract><cop>Stevenage</cop><pub>John Wiley & Sons, Inc</pub><tpages>1</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0013-5194 |
| ispartof | Electronics letters, 2002-08, Vol.38 (16), p.1-1 |
| issn | 0013-5194 1350-911X |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1651414989 |
| source | Alma/SFX Local Collection |
| subjects | Customer satisfaction Heuristic Networks Tabu search Topology Traffic engineering Traffic flow Virtual private networks |
| title | Mesh topology design in overlay virtual private networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T19%3A40%3A01IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Mesh%20topology%20design%20in%20overlay%20virtual%20private%20networks&rft.jtitle=Electronics%20letters&rft.au=Karasan,%20E&rft.date=2002-08-01&rft.volume=38&rft.issue=16&rft.spage=1&rft.epage=1&rft.pages=1-1&rft.issn=0013-5194&rft.eissn=1350-911X&rft.coden=ELLEAK&rft_id=info:doi/&rft_dat=%3Cproquest%3E1651414989%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1625467741&rft_id=info:pmid/&rfr_iscdi=true |