<?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=Thabti_et_al_2012a</id>
		<title>Thabti et al 2012a - 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=Thabti_et_al_2012a"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Thabti_et_al_2012a&amp;action=history"/>
		<updated>2026-04-21T10:27:03Z</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=Thabti_et_al_2012a&amp;diff=195643&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 850294855 to Thabti et al 2012a</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Thabti_et_al_2012a&amp;diff=195643&amp;oldid=prev"/>
				<updated>2021-01-28T23:17:52Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_850294855&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 850294855&quot;&gt;Draft Content 850294855&lt;/a&gt; to &lt;a href=&quot;/public/Thabti_et_al_2012a&quot; title=&quot;Thabti et al 2012a&quot;&gt;Thabti et al 2012a&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 23:17, 28 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=Thabti_et_al_2012a&amp;diff=195642&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  International audience; Virtual Private Networks (VPNs) are overlay networks established on top of a public network backbone with the goal of providing a low...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Thabti_et_al_2012a&amp;diff=195642&amp;oldid=prev"/>
				<updated>2021-01-28T23:17:45Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  International audience; Virtual Private Networks (VPNs) are overlay networks established on top of a public network backbone with the goal of providing a low...&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;
International audience; Virtual Private Networks (VPNs) are overlay networks established on top of a public network backbone with the goal of providing a low cost but secure network solution. The allocation of bandwidth for VPN tunnels to meet the requirements specified by customers is an important traffic engineering research issue. This paper addresses the general problem of computing a constrained VPN with a tree topology, and having optimum bandwidth allocation. This is a hard combinatorial optimization problem [1]. This issue was studied first by different resource allocation methods [2] and next was studied by general optimization methods [3]. In this paper, we present integer programming formulations (IPFs) assuming a hose as well as a pipe workload models. Earlier work [2] showed that the hose model results in VPN trees over provisioned by a factor of 2-to-3. Extensive simulations using test networks and their corresponding hose workloads, generated with Brite [4] show that our exact methods produce VPN tree solutions with a bandwidth over-provisioning factor as low as 1.6, and never exceeds a factor of 2, compared to solutions obtained using a pipe workload.&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.archives-ouvertes.fr/hal-01497101 https://hal.archives-ouvertes.fr/hal-01497101]&lt;br /&gt;
&lt;br /&gt;
* [http://ieeexplore.ieee.org/document/6381675 http://ieeexplore.ieee.org/document/6381675],&lt;br /&gt;
: [https://ieeexplore.ieee.org/document/6381675 https://ieeexplore.ieee.org/document/6381675],&lt;br /&gt;
: [https://basepub.dauphine.fr/handle/123456789/11816?show=full https://basepub.dauphine.fr/handle/123456789/11816?show=full],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/2028189016 https://academic.microsoft.com/#/detail/2028189016]&lt;br /&gt;
&lt;br /&gt;
* [http://xplorestaging.ieee.org/ielx5/6365888/6381653/06381675.pdf?arnumber=6381675 http://xplorestaging.ieee.org/ielx5/6365888/6381653/06381675.pdf?arnumber=6381675],&lt;br /&gt;
: [http://dx.doi.org/10.1109/netwks.2012.6381675 http://dx.doi.org/10.1109/netwks.2012.6381675]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>