<?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=Casas_et_al_2008a</id>
		<title>Casas et al 2008a - 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=Casas_et_al_2008a"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Casas_et_al_2008a&amp;action=history"/>
		<updated>2026-04-23T20:12:30Z</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=Casas_et_al_2008a&amp;diff=191145&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 387691150 to Casas et al 2008a</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Casas_et_al_2008a&amp;diff=191145&amp;oldid=prev"/>
				<updated>2021-01-28T16:03:47Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_387691150&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 387691150&quot;&gt;Draft Content 387691150&lt;/a&gt; to &lt;a href=&quot;/public/Casas_et_al_2008a&quot; title=&quot;Casas et al 2008a&quot;&gt;Casas et al 2008a&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 16:03, 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=Casas_et_al_2008a&amp;diff=191144&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  Traffic Engineering (TE) has become a challenging mechanism for network management and resources optimization due to the uncertainty and the difficulty to pre...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Casas_et_al_2008a&amp;diff=191144&amp;oldid=prev"/>
				<updated>2021-01-28T16:03:42Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  Traffic Engineering (TE) has become a challenging mechanism for network management and resources optimization due to the uncertainty and the difficulty to pre...&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;
Traffic Engineering (TE) has become a challenging mechanism for network management and resources optimization due to the uncertainty and the difficulty to predict current traffic patterns. Recent works have proposed robust optimization techniques to cope with uncertain traffic, computing a stable routing configuration that is immune to demand variations within certain uncertainty set. However, using a single routing configuration for long-time periods can be highly inefficient. Even more, the presence of abnormal and malicious traffic has magnified the network operation problem, claiming for solutions which not only deal with traffic uncertainty but also allow to identify faulty traffic. In this paper, we propose two complementary methods to tackle both problems. Based on expected traffic patterns, we adapt the uncertainty set and build a multi-hour yet robust routing scheme that outperforms the stable approach. For the case of anomalous and unexpected traffic, we propose a fast anomaly detection/isolation algorithm which relies on a novel linear spline-based model of traffic demands to identify traffic problems and decide routing changes. This algorithm is optimal in the sense that it minimizes the decision delay for a given mean false alarm rate and false isolation probabilities. Both proposals are validated using real traffic data from two Internet backbone networks.&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-00540896/file/ICC08camRe.pdf https://hal.archives-ouvertes.fr/hal-00540896/file/ICC08camRe.pdf]&lt;br /&gt;
&lt;br /&gt;
* [http://xplorestaging.ieee.org/ielx5/4533035/4533036/04534117.pdf?arnumber=4534117 http://xplorestaging.ieee.org/ielx5/4533035/4533036/04534117.pdf?arnumber=4534117],&lt;br /&gt;
: [http://dx.doi.org/10.1109/icc.2008.1081 http://dx.doi.org/10.1109/icc.2008.1081]&lt;br /&gt;
&lt;br /&gt;
* [https://dblp.uni-trier.de/db/conf/icc/icc2008.html#CasasFV08 https://dblp.uni-trier.de/db/conf/icc/icc2008.html#CasasFV08],&lt;br /&gt;
: [https://ieeexplore.ieee.org/document/4534117 https://ieeexplore.ieee.org/document/4534117],&lt;br /&gt;
: [https://doi.org/10.1109/ICC.2008.1081 https://doi.org/10.1109/ICC.2008.1081],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/2159019949 https://academic.microsoft.com/#/detail/2159019949]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>