<?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=Merghem-Boulahia_et_al_2007a</id>
		<title>Merghem-Boulahia et al 2007a - 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=Merghem-Boulahia_et_al_2007a"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Merghem-Boulahia_et_al_2007a&amp;action=history"/>
		<updated>2026-04-21T10:30:06Z</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=Merghem-Boulahia_et_al_2007a&amp;diff=184879&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 206979505 to Merghem-Boulahia et al 2007a</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Merghem-Boulahia_et_al_2007a&amp;diff=184879&amp;oldid=prev"/>
				<updated>2021-01-25T11:30:06Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_206979505&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 206979505&quot;&gt;Draft Content 206979505&lt;/a&gt; to &lt;a href=&quot;/public/Merghem-Boulahia_et_al_2007a&quot; title=&quot;Merghem-Boulahia et al 2007a&quot;&gt;Merghem-Boulahia et al 2007a&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 11:30, 25 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=Merghem-Boulahia_et_al_2007a&amp;diff=184878&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  MPLS DiffServ-TE combines the advantages of DiffServ and MPLSTE by allowing a differentiation of services and a traffic engineering based on a fast packet swi...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Merghem-Boulahia_et_al_2007a&amp;diff=184878&amp;oldid=prev"/>
				<updated>2021-01-25T11:30:03Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  MPLS DiffServ-TE combines the advantages of DiffServ and MPLSTE by allowing a differentiation of services and a traffic engineering based on a fast packet swi...&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;
MPLS DiffServ-TE combines the advantages of DiffServ and MPLSTE by allowing a differentiation of services and a traffic engineering based on a fast packet switching technology. However, such MPLS DiffServ-TE network needs an efficient method for Quality of Service (QoS) guaranteeing. In addition, the management of such a network is not a simple function and could not be done manually. In fact, it would be much more economic and effective to let equipments handle a part of the tasks attributed currently to the human administrator. In this paper, a novel architecture based on a Multi-Agent System is proposed to automatically manage MPLS DiffServ-TE domains. To meet the QoS requirements, an LSP creation strategy, based on a traffic-driven approach and depending on the traffic load, is proposed. It determines when to set up a new LSP and when to forward a new traffic in an already existing one. This strategy reduces the number of LSPs and the number of signalling operations in the network. Simulation results are provided to illustrate the efficiency of our proposition.&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://hal-utt.archives-ouvertes.fr/hal-02272129 https://hal-utt.archives-ouvertes.fr/hal-02272129]&lt;br /&gt;
&lt;br /&gt;
* [http://link.springer.com/content/pdf/10.1007/978-3-7643-8569-9_8 http://link.springer.com/content/pdf/10.1007/978-3-7643-8569-9_8],&lt;br /&gt;
: [http://dx.doi.org/10.1007/978-3-7643-8569-9_8 http://dx.doi.org/10.1007/978-3-7643-8569-9_8] under the license http://www.springer.com/tdm&lt;br /&gt;
&lt;br /&gt;
* [https://link.springer.com/chapter/10.1007/978-3-7643-8569-9_8 https://link.springer.com/chapter/10.1007/978-3-7643-8569-9_8],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/337481691 https://academic.microsoft.com/#/detail/337481691]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>