Enrutamiento y asignación de longitud de onda: Nueva heurística snake-one para redes WDM bajo tráfico dinámico/Routing wavelength assignment: New snake-one heuristic for WDM networks with dynamic traffic

Enrutamiento y asignación de longitud de onda: Nueva heurística snake-one para redes WDM bajo tráfico dinámico/Routing wavelength assignment: New snake-one heuristic for WDM networks with dynamic traffic

In this paper is shown the simulation results of a new heuristic, called snake-one. The simulation was performed in the National Science Foundation NETwork (NSFNET-USA) under dynamic traffic and compared with other heuristics such as Simulated Annealing, Genetic Algorithms and Tabu Search previously...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Ingeniare : Revista Chilena de Ingenieria 2016-07, Vol.24 (3), p.412
Hauptverfasser: García, Arturo Rodríguez, Ravanales, Washington Fernández, López, Leonardo Ramírez
Format: Artikel
Sprache:spa
Schlagworte:
Genetic algorithms
Heuristic
Routing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue 3
container_start_page 412
container_title Ingeniare : Revista Chilena de Ingenieria
container_volume 24
creator García, Arturo Rodríguez
Ravanales, Washington Fernández
López, Leonardo Ramírez
description In this paper is shown the simulation results of a new heuristic, called snake-one. The simulation was performed in the National Science Foundation NETwork (NSFNET-USA) under dynamic traffic and compared with other heuristics such as Simulated Annealing, Genetic Algorithms and Tabu Search previously released, using the Blocking Probability indicator and Network Utilization. Comparing these heuristics, we can observe the improvement, of the blocking up to 130 Erlangs. Nevertheless, this results mean an increased and sustained use of the network. This behavior determines a partially good result, which determines the study of a modification of the Snake-one algorithm to improve both indicators.
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_1861773814</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>4308105411</sourcerecordid><originalsourceid>FETCH-proquest_journals_18617738143</originalsourceid><addsrcrecordid>eNqNjktOw0AMhkcIJMrjDpZYRyQNaVK2UMQGFgiJZWUyTjpp4inzaNTj9ACsOEIOwJWYIJBYsvIn2f6__0BM4jwpojSNs8Nfns6TY3FibRPH2XyWTSfic8HGO-wUsdOwA7SqZizV8MEgCVrNtXJejqxZ4jU8etoirMib4d06VSJYxjVFmgk2aBAMSbLwcvsAr9hocGbYV6rUIBUP-y7Q5ZP2TnENPW6pJa7dKmhHbxdKBAP1fzJHkxpFUGnzHcvkem3WFnoVPuWOQ_syeLAKnjNxVGFr6fxnnoqLu8XzzX20MfrNk3XLRnvDYbVMilmS52mRXKX_u_oC4Q1yKw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1861773814</pqid></control><display><type>article</type><title>Enrutamiento y asignación de longitud de onda: Nueva heurística snake-one para redes WDM bajo tráfico dinámico/Routing wavelength assignment: New snake-one heuristic for WDM networks with dynamic traffic</title><source>EZB-FREE-00999 freely available EZB journals</source><creator>García, Arturo Rodríguez ; Ravanales, Washington Fernández ; López, Leonardo Ramírez</creator><creatorcontrib>García, Arturo Rodríguez ; Ravanales, Washington Fernández ; López, Leonardo Ramírez</creatorcontrib><description>In this paper is shown the simulation results of a new heuristic, called snake-one. The simulation was performed in the National Science Foundation NETwork (NSFNET-USA) under dynamic traffic and compared with other heuristics such as Simulated Annealing, Genetic Algorithms and Tabu Search previously released, using the Blocking Probability indicator and Network Utilization. Comparing these heuristics, we can observe the improvement, of the blocking up to 130 Erlangs. Nevertheless, this results mean an increased and sustained use of the network. This behavior determines a partially good result, which determines the study of a modification of the Snake-one algorithm to improve both indicators.</description><identifier>ISSN: 0718-3291</identifier><identifier>EISSN: 0718-3305</identifier><language>spa</language><publisher>Arica: Universidad de Tarapacá</publisher><subject>Genetic algorithms ; Heuristic ; Routing</subject><ispartof>Ingeniare : Revista Chilena de Ingenieria, 2016-07, Vol.24 (3), p.412</ispartof><rights>Copyright Universidad de Tarapacá Jul 2016</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><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>García, Arturo Rodríguez</creatorcontrib><creatorcontrib>Ravanales, Washington Fernández</creatorcontrib><creatorcontrib>López, Leonardo Ramírez</creatorcontrib><title>Enrutamiento y asignación de longitud de onda: Nueva heurística snake-one para redes WDM bajo tráfico dinámico/Routing wavelength assignment: New snake-one heuristic for WDM networks with dynamic traffic</title><title>Ingeniare : Revista Chilena de Ingenieria</title><description>In this paper is shown the simulation results of a new heuristic, called snake-one. The simulation was performed in the National Science Foundation NETwork (NSFNET-USA) under dynamic traffic and compared with other heuristics such as Simulated Annealing, Genetic Algorithms and Tabu Search previously released, using the Blocking Probability indicator and Network Utilization. Comparing these heuristics, we can observe the improvement, of the blocking up to 130 Erlangs. Nevertheless, this results mean an increased and sustained use of the network. This behavior determines a partially good result, which determines the study of a modification of the Snake-one algorithm to improve both indicators.</description><subject>Genetic algorithms</subject><subject>Heuristic</subject><subject>Routing</subject><issn>0718-3291</issn><issn>0718-3305</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNqNjktOw0AMhkcIJMrjDpZYRyQNaVK2UMQGFgiJZWUyTjpp4inzaNTj9ACsOEIOwJWYIJBYsvIn2f6__0BM4jwpojSNs8Nfns6TY3FibRPH2XyWTSfic8HGO-wUsdOwA7SqZizV8MEgCVrNtXJejqxZ4jU8etoirMib4d06VSJYxjVFmgk2aBAMSbLwcvsAr9hocGbYV6rUIBUP-y7Q5ZP2TnENPW6pJa7dKmhHbxdKBAP1fzJHkxpFUGnzHcvkem3WFnoVPuWOQ_syeLAKnjNxVGFr6fxnnoqLu8XzzX20MfrNk3XLRnvDYbVMilmS52mRXKX_u_oC4Q1yKw</recordid><startdate>20160701</startdate><enddate>20160701</enddate><creator>García, Arturo Rodríguez</creator><creator>Ravanales, Washington Fernández</creator><creator>López, Leonardo Ramírez</creator><general>Universidad de Tarapacá</general><scope>3V.</scope><scope>4T-</scope><scope>4U-</scope><scope>7XB</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>CLZPN</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M2O</scope><scope>M7S</scope><scope>MBDVC</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope></search><sort><creationdate>20160701</creationdate><title>Enrutamiento y asignación de longitud de onda: Nueva heurística snake-one para redes WDM bajo tráfico dinámico/Routing wavelength assignment: New snake-one heuristic for WDM networks with dynamic traffic</title><author>García, Arturo Rodríguez ; Ravanales, Washington Fernández ; López, Leonardo Ramírez</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_18617738143</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>spa</language><creationdate>2016</creationdate><topic>Genetic algorithms</topic><topic>Heuristic</topic><topic>Routing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>García, Arturo Rodríguez</creatorcontrib><creatorcontrib>Ravanales, Washington Fernández</creatorcontrib><creatorcontrib>López, Leonardo Ramírez</creatorcontrib><collection>ProQuest Central (Corporate)</collection><collection>Docstoc</collection><collection>University Readers</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Research Library (Alumni Edition)</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection (ProQuest)</collection><collection>ProQuest One Community College</collection><collection>Latin America &amp; Iberia Database</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Research Library</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><jtitle>Ingeniare : Revista Chilena de Ingenieria</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>García, Arturo Rodríguez</au><au>Ravanales, Washington Fernández</au><au>López, Leonardo Ramírez</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Enrutamiento y asignación de longitud de onda: Nueva heurística snake-one para redes WDM bajo tráfico dinámico/Routing wavelength assignment: New snake-one heuristic for WDM networks with dynamic traffic</atitle><jtitle>Ingeniare : Revista Chilena de Ingenieria</jtitle><date>2016-07-01</date><risdate>2016</risdate><volume>24</volume><issue>3</issue><spage>412</spage><pages>412-</pages><issn>0718-3291</issn><eissn>0718-3305</eissn><abstract>In this paper is shown the simulation results of a new heuristic, called snake-one. The simulation was performed in the National Science Foundation NETwork (NSFNET-USA) under dynamic traffic and compared with other heuristics such as Simulated Annealing, Genetic Algorithms and Tabu Search previously released, using the Blocking Probability indicator and Network Utilization. Comparing these heuristics, we can observe the improvement, of the blocking up to 130 Erlangs. Nevertheless, this results mean an increased and sustained use of the network. This behavior determines a partially good result, which determines the study of a modification of the Snake-one algorithm to improve both indicators.</abstract><cop>Arica</cop><pub>Universidad de Tarapacá</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0718-3291
ispartof Ingeniare : Revista Chilena de Ingenieria, 2016-07, Vol.24 (3), p.412
issn 0718-3291
0718-3305
language spa
recordid cdi_proquest_journals_1861773814
source EZB-FREE-00999 freely available EZB journals
subjects Genetic algorithms
Heuristic
Routing
title Enrutamiento y asignación de longitud de onda: Nueva heurística snake-one para redes WDM bajo tráfico dinámico/Routing wavelength assignment: New snake-one heuristic for WDM networks with dynamic traffic
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T16%3A07%3A56IST&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=Enrutamiento%20y%20asignaci%C3%B3n%20de%20longitud%20de%20onda:%20Nueva%20heur%C3%ADstica%20snake-one%20para%20redes%20WDM%20bajo%20tr%C3%A1fico%20din%C3%A1mico/Routing%20wavelength%20assignment:%20New%20snake-one%20heuristic%20for%20WDM%20networks%20with%20dynamic%20traffic&rft.jtitle=Ingeniare%20:%20Revista%20Chilena%20de%20Ingenieria&rft.au=Garc%C3%ADa,%20Arturo%20Rodr%C3%ADguez&rft.date=2016-07-01&rft.volume=24&rft.issue=3&rft.spage=412&rft.pages=412-&rft.issn=0718-3291&rft.eissn=0718-3305&rft_id=info:doi/&rft_dat=%3Cproquest%3E4308105411%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1861773814&rft_id=info:pmid/&rfr_iscdi=true