<?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=Madeira_et_al_2016a</id>
		<title>Madeira et al 2016a - 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=Madeira_et_al_2016a"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Madeira_et_al_2016a&amp;action=history"/>
		<updated>2026-04-21T22:01:48Z</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=Madeira_et_al_2016a&amp;diff=192996&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 526940320 to Madeira et al 2016a</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Madeira_et_al_2016a&amp;diff=192996&amp;oldid=prev"/>
				<updated>2021-01-28T18:30:21Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_526940320&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 526940320&quot;&gt;Draft Content 526940320&lt;/a&gt; to &lt;a href=&quot;/public/Madeira_et_al_2016a&quot; title=&quot;Madeira et al 2016a&quot;&gt;Madeira et al 2016a&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 18:30, 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=Madeira_et_al_2016a&amp;diff=192995&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  For cloud enterprise customers that require services on demand, data centers must allocate and partition data center resources in a dynamic fashion. We consid...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Madeira_et_al_2016a&amp;diff=192995&amp;oldid=prev"/>
				<updated>2021-01-28T18:30:18Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  For cloud enterprise customers that require services on demand, data centers must allocate and partition data center resources in a dynamic fashion. We consid...&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;
For cloud enterprise customers that require services on demand, data centers must allocate and partition data center resources in a dynamic fashion. We consider the problem in which a request from an enterprise customer is mapped to a virtual network (VN) that is allocated requiring both bandwidth and compute resources by connecting it from an entry point of a data center to one or more servers, should this data center be selected from multiple geographically distributed data centers. We present a dynamic traffic engineering framework, for which we develop an optimization model based on a mixed-integer linear programming (MILP) formulation that a data center operator can use at each review point to optimally assign VN customers. Through a series of studies, we then present results on how different VN customers are treated in terms of request acceptance when each VN class has a different resource requirement. We found that a VN class with a low resource requirement has a low blocking even in heavy traffic, while the VN class with a high resource requirement faces a high service denial. On the other hand, cost for the VN with the highest resource requirement is not always the highest in the heavy traffic because of the significantly high service denial faced by this VN class.&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://biblio.ugent.be/publication/8159344/file/8159346.pdf https://biblio.ugent.be/publication/8159344/file/8159346.pdf]&lt;br /&gt;
&lt;br /&gt;
* [http://xplorestaging.ieee.org/ielx7/7807759/7809617/07809628.pdf?arnumber=7809628 http://xplorestaging.ieee.org/ielx7/7807759/7809617/07809628.pdf?arnumber=7809628],&lt;br /&gt;
: [http://dx.doi.org/10.1109/itc-28.2016.111 http://dx.doi.org/10.1109/itc-28.2016.111]&lt;br /&gt;
&lt;br /&gt;
* [https://biblio.ugent.be/publication/8159344 https://biblio.ugent.be/publication/8159344],&lt;br /&gt;
: [http://hdl.handle.net/1854/LU-8159344 http://hdl.handle.net/1854/LU-8159344],&lt;br /&gt;
: [http://dx.doi.org/10.1109/ITC-28.2016.111 http://dx.doi.org/10.1109/ITC-28.2016.111],&lt;br /&gt;
: [https://biblio.ugent.be/publication/8159344/file/8159347 https://biblio.ugent.be/publication/8159344/file/8159347]&lt;br /&gt;
&lt;br /&gt;
* [https://biblio.ugent.be/publication/8159344/file/8159346.pdf https://biblio.ugent.be/publication/8159344/file/8159346.pdf],&lt;br /&gt;
: [https://dblp.uni-trier.de/db/conf/teletraffic/itc2016.html#MaswoodDMM16 https://dblp.uni-trier.de/db/conf/teletraffic/itc2016.html#MaswoodDMM16],&lt;br /&gt;
: [https://biblio.ugent.be/publication/8159344 https://biblio.ugent.be/publication/8159344],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/2570714606 https://academic.microsoft.com/#/detail/2570714606]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>