https://www.scipedia.com/wd/index.php?action=history&feed=atom&title=Masood_et_al_2017a 2026-05-03T02:27:53Z Revision history for this page on the wiki MediaWiki 1.27.0-wmf.10 https://www.scipedia.com/wd/index.php?title=Masood_et_al_2017a&diff=206278&oldid=prev 2021-02-03T17:22:11Z

<p>Scipediacontent moved page <a href="/public/Draft_Content_371660105" class="mw-redirect" title="Draft Content 371660105">Draft Content 371660105</a> to <a href="/public/Masood_et_al_2017a" title="Masood et al 2017a">Masood et al 2017a</a></p> <table class="diff diff-contentalign-left" data-mw="interface"> <tr style='vertical-align: top;' lang='en'> <td colspan='1' style="background-color: white; color:black; text-align: center;">← Older revision</td> <td colspan='1' style="background-color: white; color:black; text-align: center;">Revision as of 17:22, 3 February 2021</td> </tr><tr><td colspan='2' style='text-align: center;' lang='en'><div class="mw-diff-empty">(No difference)</div> </td></tr></table>

Scipediacontent https://www.scipedia.com/wd/index.php?title=Masood_et_al_2017a&diff=206277&oldid=prev 2021-02-03T17:22:08Z

<p>Created page with &quot; == Abstract == Introduction of modern and diverse applications in telecommunication field has raised challenges in networking area regarding efficient use of network resourc...&quot;</p> <p><b>New page</b></p><div><br /> == Abstract ==<br /> <br /> Introduction of modern and diverse applications in telecommunication field has raised challenges in networking area regarding efficient use of network resources and with optimizing performance. Therefore MPLS/GMPLS (Generalized multiprotocol label switching) networks were introduced to provide a better quality of service to meet users' requirements as well as to optimize network resources. GMPLS networks use traffic engineering techniques for more efficient communication within the network and help to optimize network resources. This paper proposes BAT inspired metaheuristic algorithm for selecting an efficient route in MPLS/ GMPLS networks. In our investigation we considered routing costs as an objective function with goal to minimize it. The paper uses BAT algorithm with various levels of loudness parameter. The simulation results show performance improvements in MPLS/GMPLS networks of different size.<br /> <br /> Document type: Conference object<br /> <br /> == Full document ==<br /> &lt;pdf&gt;Media:Draft_Content_371660105-beopen5892-7081-document.pdf&lt;/pdf&gt;<br /> <br /> <br /> == Original document ==<br /> <br /> The different versions of the original document can be found in:<br /> <br /> * [https://strathprints.strath.ac.uk/62175/1/Masood_etal_TELFOR_2017_Proposing_bat_inspired_heuristic_algorithm_for_the_optimization_of_GMPLS_networks.pdf https://strathprints.strath.ac.uk/62175/1/Masood_etal_TELFOR_2017_Proposing_bat_inspired_heuristic_algorithm_for_the_optimization_of_GMPLS_networks.pdf]<br /> <br /> * [https://zenodo.org/record/1039118 https://zenodo.org/record/1039118] under the license http://creativecommons.org/licenses/by-nc-nd/4.0/legalcode<br /> <br /> * [https://zenodo.org/record/1039118/files/Masood-etal-TELFOR-2017-Proposing-bat-inspired-heuristic-algorithm-for-the-optimization-of-GMPLS-networks.pdf https://zenodo.org/record/1039118/files/Masood-etal-TELFOR-2017-Proposing-bat-inspired-heuristic-algorithm-for-the-optimization-of-GMPLS-networks.pdf] under the license cc-by-nc-nd<br /> <br /> * [http://xplorestaging.ieee.org/ielx7/8234842/8249266/08249295.pdf?arnumber=8249295 http://xplorestaging.ieee.org/ielx7/8234842/8249266/08249295.pdf?arnumber=8249295],<br /> : [http://dx.doi.org/10.1109/telfor.2017.8249295 http://dx.doi.org/10.1109/telfor.2017.8249295]<br /> <br /> * [https://strathprints.strath.ac.uk/62175 https://strathprints.strath.ac.uk/62175],<br /> : [https://pureportal.strath.ac.uk/en/publications/proposing-bat-inspired-heuristic-algorithm-for-the-optimization-o https://pureportal.strath.ac.uk/en/publications/proposing-bat-inspired-heuristic-algorithm-for-the-optimization-o],<br /> : [https://core.ac.uk/display/144865883 https://core.ac.uk/display/144865883],<br /> : [https://academic.microsoft.com/#/detail/2765358650 https://academic.microsoft.com/#/detail/2765358650]<br /> <br /> * [https://zenodo.org/record/1039118 https://zenodo.org/record/1039118],<br /> : [http://dx.doi.org/10.5281/zenodo.1039117 http://dx.doi.org/10.5281/zenodo.1039117] under the license https://creativecommons.org/licenses/by-nc-nd/4.0<br /> <br /> * [https://zenodo.org/record/1039118 https://zenodo.org/record/1039118],<br /> : [http://dx.doi.org/10.5281/zenodo.1039118 http://dx.doi.org/10.5281/zenodo.1039118] under the license https://creativecommons.org/licenses/by-nc-nd/4.0<br /> <br /> <br /> <br /> DOIS: 10.5281/zenodo.1039117 10.5281/zenodo.1039118 10.1109/telfor.2017.8249295</div>

Scipediacontent