<?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=Crichigno_et_al_2006a</id>
		<title>Crichigno et al 2006a - 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=Crichigno_et_al_2006a"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Crichigno_et_al_2006a&amp;action=history"/>
		<updated>2026-04-21T10:27:44Z</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=Crichigno_et_al_2006a&amp;diff=182364&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 870539200 to Crichigno et al 2006a</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Crichigno_et_al_2006a&amp;diff=182364&amp;oldid=prev"/>
				<updated>2021-01-21T13:41:39Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_870539200&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 870539200&quot;&gt;Draft Content 870539200&lt;/a&gt; to &lt;a href=&quot;/public/Crichigno_et_al_2006a&quot; title=&quot;Crichigno et al 2006a&quot;&gt;Crichigno et al 2006a&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:41, 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=Crichigno_et_al_2006a&amp;diff=182363&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  This paper presents a new traffic engineering multitree-multiobjective multicast routing algorithm (M-MMA) that solves for the first time the GMM model for Dy...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Crichigno_et_al_2006a&amp;diff=182363&amp;oldid=prev"/>
				<updated>2021-01-21T13:41:35Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  This paper presents a new traffic engineering multitree-multiobjective multicast routing algorithm (M-MMA) that solves for the first time the GMM model for Dy...&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;
This paper presents a new traffic engineering multitree-multiobjective multicast routing algorithm (M-MMA) that solves for the first time the GMM model for Dynamic Multicast Groups. Multitree traffic engineering uses several trees to transmit a multicast demand from a source to a set of destinations in order to balance traffic load, improving network resource utilization. Experimental results obtained by simulations using eight real net-work topologies show that this new approach gets trade off solutions while simultaneously considering five objective functions. As expected, when M-MMA is compared to an equivalent singletree alternative, it accommodates more traffic demand in a high traffic saturated network.&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;
* [http://sedici.unlp.edu.ar/bitstream/handle/10915/23915/Documento_completo.pdf?sequence=1 http://sedici.unlp.edu.ar/bitstream/handle/10915/23915/Documento_completo.pdf?sequence=1] under the license cc-by-nc-sa&lt;br /&gt;
&lt;br /&gt;
* [http://link.springer.com/content/pdf/10.1007/978-0-387-34747-9_26 http://link.springer.com/content/pdf/10.1007/978-0-387-34747-9_26],&lt;br /&gt;
: [http://dx.doi.org/10.1007/978-0-387-34747-9_26 http://dx.doi.org/10.1007/978-0-387-34747-9_26] under the license http://www.springer.com/tdm&lt;br /&gt;
&lt;br /&gt;
* [https://dblp.uni-trier.de/db/conf/ifip12/ai2006.html#PrietoBC06 https://dblp.uni-trier.de/db/conf/ifip12/ai2006.html#PrietoBC06],&lt;br /&gt;
: [https://link.springer.com/chapter/10.1007%2F978-0-387-34747-9_26 https://link.springer.com/chapter/10.1007%2F978-0-387-34747-9_26],&lt;br /&gt;
: [http://sedici.unlp.edu.ar/handle/10915/23915 http://sedici.unlp.edu.ar/handle/10915/23915],&lt;br /&gt;
: [https://www.cnc.una.py/publicaciones/4_145.pdf https://www.cnc.una.py/publicaciones/4_145.pdf],&lt;br /&gt;
: [https://www.researchgate.net/profile/Benjamin_Baran/publication/220827586_Multitree-Multiobjective_Multicast_Routing_for_Traffic_Engineering/links/0deec532c2b54a343c000000.pdf https://www.researchgate.net/profile/Benjamin_Baran/publication/220827586_Multitree-Multiobjective_Multicast_Routing_for_Traffic_Engineering/links/0deec532c2b54a343c000000.pdf],&lt;br /&gt;
: [http://sedici.unlp.edu.ar/bitstream/handle/10915/23915/Documento_completo.pdf?sequence=1 http://sedici.unlp.edu.ar/bitstream/handle/10915/23915/Documento_completo.pdf?sequence=1],&lt;br /&gt;
: [http://www.cnc.una.py/publicaciones/4_145.pdf http://www.cnc.una.py/publicaciones/4_145.pdf],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/1487429811 https://academic.microsoft.com/#/detail/1487429811]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>