Latest revision as of 23:54, 28 January 2021

Abstract

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.

Original document

The different versions of the original document can be found in:

• 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,

https://iris.uniroma3.it/handle/11590/177381,

https://core.ac.uk/display/53934274,

https://doi.acm.org/10.1145/1921151.1921166,

http://conferences2.sigcomm.org/co-next/2010/Workshops/PRESTO/PRESTO_papers/09-Balestra.pdf,

https://dl.acm.org/citation.cfm?id=1921166,

https://academic.microsoft.com/#/detail/2132323493

• http://dl.acm.org/ft_gateway.cfm?id=1921166&ftid=883266&dwn=1,

http://dx.doi.org/10.1145/1921151.1921166