<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Glesk_et_al_2018a</id>
		<title>Glesk et al 2018a - Revision history</title>
		<link rel="self" type="application/atom+xml" href="https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Glesk_et_al_2018a"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Glesk_et_al_2018a&amp;action=history"/>
		<updated>2026-04-30T20:00:07Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.27.0-wmf.10</generator>

	<entry>
		<id>https://www.scipedia.com/wd/index.php?title=Glesk_et_al_2018a&amp;diff=182379&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 311162311 to Glesk et al 2018a</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Glesk_et_al_2018a&amp;diff=182379&amp;oldid=prev"/>
				<updated>2021-01-21T13:42:50Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_311162311&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 311162311&quot;&gt;Draft Content 311162311&lt;/a&gt; to &lt;a href=&quot;/public/Glesk_et_al_2018a&quot; title=&quot;Glesk et al 2018a&quot;&gt;Glesk et al 2018a&lt;/a&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left&quot; data-mw=&quot;interface&quot;&gt;
				&lt;tr style='vertical-align: top;' lang='en'&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;Revision as of 13:42, 21 January 2021&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan='2' style='text-align: center;' lang='en'&gt;&lt;div class=&quot;mw-diff-empty&quot;&gt;(No difference)&lt;/div&gt;
&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	<entry>
		<id>https://www.scipedia.com/wd/index.php?title=Glesk_et_al_2018a&amp;diff=182378&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  Modern communication networks offer advance and diverse applications, which require huge usage of network resources while providing quality of services to the...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Glesk_et_al_2018a&amp;diff=182378&amp;oldid=prev"/>
				<updated>2021-01-21T13:42:47Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  Modern communication networks offer advance and diverse applications, which require huge usage of network resources while providing quality of services to the...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&lt;br /&gt;
== Abstract ==&lt;br /&gt;
&lt;br /&gt;
Modern communication networks offer advance and diverse applications, which require huge usage of network resources while providing quality of services to the users. Advance communication is based on multiple switched networks that cannot be handle by traditional IP (internet protocol) networks. GMPLS (Generalized multiprotocol label switched) networks, an advance version of MPLS (multiprotocol label switched networks), are introduced for multiple switched networks. Traffic engineering in GMPLS networks ensures traffic movement on multiple paths. Optimal path(s) computation can be dependent on multiple objectives with multiple constraints. From optimization prospective, it is an NP (non-deterministic polynomial-time) hard optimization problem, to compute optimal paths based on multiple objectives having multiple constraints. The paper proposed a metaheuristic Pareto based Bat algorithm, which uses two objective functions; routing costs and load balancing costs to compute the optimal path(s) as an optimal solution for traffic engineering in MPLS/GMPLS networks. The proposed algorithm has implemented on different number of nodes in MPLS/GMPLS networks, to analysis the algorithm performance.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Original document ==&lt;br /&gt;
&lt;br /&gt;
The different versions of the original document can be found in:&lt;br /&gt;
&lt;br /&gt;
* [https://strathprints.strath.ac.uk/63371/1/Masood_etal_AMLTA_2018_Pareto_based_bat_algorithm_for_multi_objectives_multiple_constraints_optimization.pdf https://strathprints.strath.ac.uk/63371/1/Masood_etal_AMLTA_2018_Pareto_based_bat_algorithm_for_multi_objectives_multiple_constraints_optimization.pdf]&lt;br /&gt;
&lt;br /&gt;
* [http://link.springer.com/content/pdf/10.1007/978-3-319-74690-6_4 http://link.springer.com/content/pdf/10.1007/978-3-319-74690-6_4],&lt;br /&gt;
: [http://dx.doi.org/10.1007/978-3-319-74690-6_4 http://dx.doi.org/10.1007/978-3-319-74690-6_4] under the license http://www.springer.com/tdm&lt;br /&gt;
&lt;br /&gt;
* [https://dblp.uni-trier.de/db/conf/amlta/amlta2018.html#MasoodFG18 https://dblp.uni-trier.de/db/conf/amlta/amlta2018.html#MasoodFG18],&lt;br /&gt;
: [https://link.springer.com/chapter/10.1007/978-3-319-74690-6_4 https://link.springer.com/chapter/10.1007/978-3-319-74690-6_4],&lt;br /&gt;
: [https://www.scipedia.com/public/Masood_et_al_2018a https://www.scipedia.com/public/Masood_et_al_2018a],&lt;br /&gt;
: [https://strathprints.strath.ac.uk/63371 https://strathprints.strath.ac.uk/63371],&lt;br /&gt;
: [https://pureportal.strath.ac.uk/en/publications/pareto-based-bat-algorithm-for-multi-objectives-multiple-constrai https://pureportal.strath.ac.uk/en/publications/pareto-based-bat-algorithm-for-multi-objectives-multiple-constrai],&lt;br /&gt;
: [https://rd.springer.com/chapter/10.1007/978-3-319-74690-6_4 https://rd.springer.com/chapter/10.1007/978-3-319-74690-6_4],&lt;br /&gt;
: [https://core.ac.uk/display/151397412 https://core.ac.uk/display/151397412],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/2787185559 https://academic.microsoft.com/#/detail/2787185559]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>