Deriving traffic demands for operational IP networks: methodology and experience
IEEE/ACM Transactions on Networking (TON)
Pop-level and access-link-level traffic dynamics in a tier-1 POP
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
On the correctness of IBGP configuration
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Traffic matrix estimation: existing techniques and new directions
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
BGP routing stability of popular destinations
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Fast accurate computation of large-scale IP traffic matrices from link loads
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
ACM SIGCOMM Computer Communication Review
A distributed approach to measure IP traffic matrices
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Providing public intradomain traffic matrices to the research community
ACM SIGCOMM Computer Communication Review
Robust traffic matrix estimation with imperfect information: making use of multiple data sources
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Rapid service creation using the JUNOS SDK
Proceedings of the 2nd ACM SIGCOMM workshop on Programmable routers for extensible services of tomorrow
Proceedings of the ACM SIGCOMM 2010 conference
OpenTM: traffic matrix estimator for OpenFlow networks
PAM'10 Proceedings of the 11th international conference on Passive and active measurement
Traffic engineering with MPLS in the Internet
IEEE Network: The Magazine of Global Internetworking
OFLOPS: an open framework for openflow switch evaluation
PAM'12 Proceedings of the 13th international conference on Passive and Active Measurement
| Hi-index | 0.00 |
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.