<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>http://www.colloquiam.com/wd/index.php?action=history&amp;feed=atom&amp;title=Vissicchio_et_al_2010a</id>
		<title>Vissicchio et al 2010a - Revision history</title>
		<link rel="self" type="application/atom+xml" href="http://www.colloquiam.com/wd/index.php?action=history&amp;feed=atom&amp;title=Vissicchio_et_al_2010a"/>
		<link rel="alternate" type="text/html" href="http://www.colloquiam.com/wd/index.php?title=Vissicchio_et_al_2010a&amp;action=history"/>
		<updated>2026-05-11T11:15:15Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.27.0-wmf.10</generator>

	<entry>
		<id>http://www.colloquiam.com/wd/index.php?title=Vissicchio_et_al_2010a&amp;diff=195450&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 545757878 to Vissicchio et al 2010a</title>
		<link rel="alternate" type="text/html" href="http://www.colloquiam.com/wd/index.php?title=Vissicchio_et_al_2010a&amp;diff=195450&amp;oldid=prev"/>
				<updated>2021-01-28T22:54:39Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_545757878&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 545757878&quot;&gt;Draft Content 545757878&lt;/a&gt; to &lt;a href=&quot;/public/Vissicchio_et_al_2010a&quot; title=&quot;Vissicchio et al 2010a&quot;&gt;Vissicchio et al 2010a&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 22:54, 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>http://www.colloquiam.com/wd/index.php?title=Vissicchio_et_al_2010a&amp;diff=195449&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  Traffic matrices are used by Internet Service Providers as an input for many business-critical activities like capacity planning and traffic engineering. Desp...&quot;</title>
		<link rel="alternate" type="text/html" href="http://www.colloquiam.com/wd/index.php?title=Vissicchio_et_al_2010a&amp;diff=195449&amp;oldid=prev"/>
				<updated>2021-01-28T22:54:35Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  Traffic matrices are used by Internet Service Providers as an input for many business-critical activities like capacity planning and traffic engineering. Desp...&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 matrices are used by Internet Service Providers as an input for many business-critical activities like capacity planning and traffic engineering. Despite their importance, current approaches for computing traffic matrices are either unpractical or not arbitrarily accurate.   In this paper, we propose a novel distributed architecture in which programmable routers autonomously compute parts of the whole traffic matrix. Our proposal conjugates router programmability with some ideas firstly proposed by Varghese and Estan [17] and avoids the need for packet sampling exploiting highly optimized counting mechanisms, already available on commercial routers.   We describe our architecture and analyze main implementative issues. Also, we show the viability of our solution by describing a prototypical implementation and some experimental results.&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://conferences.sigcomm.org/co-next/2010/Workshops/PRESTO/PRESTO_papers/09-Balestra.pdf http://conferences.sigcomm.org/co-next/2010/Workshops/PRESTO/PRESTO_papers/09-Balestra.pdf]&lt;br /&gt;
&lt;br /&gt;
* [http://conferences.sigcomm.org/co-next/2010/Workshops/PRESTO/PRESTO_papers/09-Balestra.pdf http://conferences.sigcomm.org/co-next/2010/Workshops/PRESTO/PRESTO_papers/09-Balestra.pdf],&lt;br /&gt;
: [https://iris.uniroma3.it/handle/11590/177381 https://iris.uniroma3.it/handle/11590/177381],&lt;br /&gt;
: [https://core.ac.uk/display/53934274 https://core.ac.uk/display/53934274],&lt;br /&gt;
: [https://doi.acm.org/10.1145/1921151.1921166 https://doi.acm.org/10.1145/1921151.1921166],&lt;br /&gt;
: [http://conferences2.sigcomm.org/co-next/2010/Workshops/PRESTO/PRESTO_papers/09-Balestra.pdf http://conferences2.sigcomm.org/co-next/2010/Workshops/PRESTO/PRESTO_papers/09-Balestra.pdf],&lt;br /&gt;
: [https://dl.acm.org/citation.cfm?id=1921166 https://dl.acm.org/citation.cfm?id=1921166],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/2132323493 https://academic.microsoft.com/#/detail/2132323493]&lt;br /&gt;
&lt;br /&gt;
* [http://dl.acm.org/ft_gateway.cfm?id=1921166&amp;amp;amp;ftid=883266&amp;amp;amp;dwn=1 http://dl.acm.org/ft_gateway.cfm?id=1921166&amp;amp;amp;ftid=883266&amp;amp;amp;dwn=1],&lt;br /&gt;
: [http://dx.doi.org/10.1145/1921151.1921166 http://dx.doi.org/10.1145/1921151.1921166]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>