Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Deriving traffic demands for operational IP networks: methodology and experience
IEEE/ACM Transactions on Networking (TON)
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
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
Experience in measuring backbone traffic variability: models, metrics, measurements and meaning
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Minimizing Congestion in General Networks
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
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
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
IEEE Communications Magazine
Optimizing OSPF/IS-IS weights in a changing world
IEEE Journal on Selected Areas in Communications
NetScope: traffic engineering for IP networks
IEEE Network: The Magazine of Global Internetworking
Decoupling policy from mechanism in Internet routing
ACM SIGCOMM Computer Communication Review
A comparison of overlay routing and multihoming route control
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Traffic matrix estimation on a large IP backbone: a comparison on real data
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
A methodology for estimating interdomain web traffic demand
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
The problem of synthetically generating IP traffic matrices: initial recommendations
ACM SIGCOMM Computer Communication Review
Simplifying the synthesis of internet traffic matrices
ACM SIGCOMM Computer Communication Review
IEEE/ACM Transactions on Networking (TON)
COPE: traffic engineering in dynamic networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Estimating the source-destination traffic matrix of a VPN from access-link loads
Computer Communications
REPLEX: dynamic traffic engineering based on wardrop routing policies
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
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
Traffic matrix estimation based on a square root Kalman filtering algorithm
International Journal of Network Management
GATEway: symbiotic inter-domain traffic engineering
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Management of Variable Data Streams in Networks
Algorithmics of Large and Complex Networks
Spatio-temporal compressive sensing and internet traffic matrices
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Robust load-balancing under statistical uncertainty: models and polynomial-time algorithms
NGI'09 Proceedings of the 5th Euro-NGI conference on Next Generation Internet networks
Multi-commodity flow traffic engineering with hybrid MPLS/OSPF 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)
Demand-oblivious routing: distributed vs. centralized approaches
INFOCOM'10 Proceedings of the 29th conference on Information communications
R3: resilient routing reconfiguration
Proceedings of the ACM SIGCOMM 2010 conference
Optimizing cost and performance in online service provider networks
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
Blind maximum likelihood estimation of traffic matrices under long-range dependent traffic
Computer Networks: The International Journal of Computer and Telecommunications Networking
Reactive Robust Routing: Anomaly Localization and Routing Reconfiguration for Dynamic Networks
Journal of Network and Systems Management
Evaluation of Routing with Robustness to the Variation in Traffic Demand
Journal of Network and Systems Management
Taming traffic dynamics: Analysis and improvements
Computer Communications
Performance of traffic engineering in operational IP networks – an experimental study
IPOM'05 Proceedings of the 5th IEEE international conference on Operations and Management in IP-Based Networks
Spatio-temporal compressive sensing and internet traffic matrices
IEEE/ACM Transactions on Networking (TON)
B4: experience with a globally-deployed software defined wan
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
Hi-index | 0.00 |
Traffic engineering and traffic matrix estimation are often treated as separate fields, even though one of the major applications for a traffic matrix is traffic engineering. In cases where a traffic matrix cannot be measured directly, it may still be estimated from indirect data (such as link measurements), but these estimates contain errors. Yet little thought has been given to the effects of inexact traffic estimates on traffic engineering. In this paper we consider how well traffic engineering works with estimated traffic matrices in the context of a specific task; namely that of optimizing network routing to minimize congestion, measured by maximum link-utilization. Our basic question is: how well is the real traffic routed if the routing is only optimized for an estimated traffic matrix? We compare against optimal routing of the real traffic using data derived from an operational tier-1 ISP. We find that the magnitude of errors in the traffic matrix estimate is not, in itself, a good indicator of the performance of that estimate in route optimization. Likewise, the optimal algorithm for traffic engineering given knowledge of the real traffic matrix is no longer the best with only the estimated traffic matrix as input. Our main practical finding is that the combination of a known traffic matrix estimation technique and a known traffic engineering technique can get close to the optimum in avoiding congestion for the real traffic. We even demonstrate stability in the sense that routing optimized on data from one day continued to perform well on subsequent days. This stability is crucial for the practical relevance to off-line traffic engineering, as it can be performed by ISPs today.