OSPF: Anatomy of an Internet Routing Protocol
OSPF: Anatomy of an Internet Routing Protocol
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
Measuring ISP topologies with rocketfuel
IEEE/ACM Transactions on Networking (TON)
Increasing Internet Capacity Using Local Search
Computational Optimization and Applications
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
A column generation approach for IGP weight setting problem
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
Traffic matrix tracking using Kalman filters
ACM SIGMETRICS Performance Evaluation Review - Special issue on the First ACM SIGMETRICS Workshop on Large Scale Network Inference (LSNI 2005)
Fanout Inference from Link Count
ECUMN '07 Proceedings of the Fourth European Conference on Universal Multiservice Networks
Optimal link weights for IP-based networks supporting hose-model VPNs
IEEE/ACM Transactions on Networking (TON)
Dynamic IGP Weight Optimization in IP Networks
NCCA '11 Proceedings of the 2011 First International Symposium on Network Cloud Computing and Applications
| Hi-index | 0.00 |
The high volatility of traffic patterns in IP networks calls for dynamic routing schemes allowing to adapt resource utilization to prevailing traffic. In this paper, we focus on the problem of link weight optimization in OSPF networks where the traffic is routed along shortest paths according to the link metrics. We propose an online approach to optimize OSPF weights, and thus the routing paths, adaptively as some changes are observed in the traffic. The approach relies on the estimation of traffic demands using SNMP link counts. Experimental results on both simulated and real traffic data show that the network congestion rate can be significantly reduced with respect to a static weight configuration.