Deriving traffic demands for operational IP networks: methodology and experience
IEEE/ACM Transactions on Networking (TON)
Measuring ISP topologies with rocketfuel
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
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
An information-theoretic approach to traffic matrix estimation
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Traffic engineering with estimated traffic matrices
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Structural analysis of network traffic flows
Proceedings of the joint international conference on Measurement and modeling of computer systems
How to identify and estimate the largest traffic matrix elements in a dynamic environment
Proceedings of the joint international conference on Measurement and modeling of computer systems
Traffic matrix estimation on a large IP backbone: a comparison on real data
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
A distributed approach to measure IP traffic matrices
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Traffic matrices: balancing measurements, inference and modeling
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Optimizing OSPF/IS-IS weights in a changing world
IEEE Journal on Selected Areas in Communications
Controlled use of excess backbone bandwidth for providing new services in IP-over-WDM networks
IEEE Journal on Selected Areas in Communications
Simplifying the synthesis of internet traffic matrices
ACM SIGCOMM Computer Communication Review
An independent-connection model for traffic matrices
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
On the predictive power of shortest-path weight inference
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
Towards a meaningful MRA of traffic matrices
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
On basic properties of fault-tolerant multi-topology routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Application of attractor selection to adaptive virtual network topology control
Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems
Balancing performance, robustness and flexibility in routing systems
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Threshold configuration and routing optimization for PCN-based resilient admission control
Computer Networks: The International Journal of Computer and Telecommunications Networking
Robust virtual network topology control based on attractor selection
ONDM'09 Proceedings of the 13th international conference on Optical Network Design and Modeling
Stable and robust multipath oblivious routing for traffic engineering
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
On the safety and security of path splicing: a case study for path splicing on the GÉANT network
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Robust traffic engineering using multi-topology routing
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Gradually reconfiguring virtual network topologies based on estimated traffic matrices
IEEE/ACM Transactions on Networking (TON)
Performance evaluation of path splicing on the GÉANT and the Sprint networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Graceful network state migrations
IEEE/ACM Transactions on Networking (TON)
Distributed detection/localization of change-points in high-dimensional network traffic data
Statistics and Computing
Effectiveness of link cost optimization for IP rerouting and IP fast reroute
MMB&DFT'10 Proceedings of the 15th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
A history of an internet exchange point
ACM SIGCOMM Computer Communication Review
Network pruning for energy saving in the Internet
Computer Networks: The International Journal of Computer and Telecommunications Networking
Towards a statistical characterization of the interdomain traffic matrix
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part II
Proceedings of the 24th International Teletraffic Congress
A toolchain for simplifying network simulation setup
Proceedings of the 6th International ICST Conference on Simulation Tools and Techniques
| Hi-index | 0.00 |
There exist a wide variety of network design problems that require a traffic matrix as input in order to carry out performance evaluation. The research community has not had at its disposal any information about how to construct realistic traffic matrices. We introduce here the two basic problems that need to be addressed to construct such matrices. The first is that of synthetically generating traffic volume levels that obey spatial and temporal patterns as observed in realistic traffic matrices. The second is that of assigning a set of numbers (representing traffic levels) to particular node pairs in a given topology. This paper provides an in-depth discussion of the many issues that arise when addressing these problems. Our approach to the first problem is to extract statistical characteristics for such traffic from real data collected inside two large IP backbones. We dispel the myth that uniform distributions can be used to randomly generate numbers for populating a traffic matrix. Instead, we show that the lognormal distribution is better for this purpose as it describes well the mean rates of origin-destination flows. We provide estimates for the mean and variance properties of the traffic matrix flows from our datasets. We explain the second problem and discuss the notion of a traffic matrix being well-matched to a topology. We provide two initial solutions to this problem, one using an ILP formulation that incorporates simple and well formed constraints. Our second solution is a heuristic one that incorporates more challenging constraints coming from carrier practices used to design and evolve topologies.