Data networks
OSPF complete implementation
High Speed Networks and Internets: Performance and Quality of Service
High Speed Networks and Internets: Performance and Quality of Service
OSPF Network Design Solutions
Self-Similar Network Traffic and Performance Evaluation
Self-Similar Network Traffic and Performance Evaluation
IEEE Computational Science & Engineering
Inferring link weights using end-to-end measurements
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
On improving the accuracy of OSPF traffic engineering
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Traffic engineering with traditional IP routing protocols
IEEE Communications Magazine
Optimizing OSPF/IS-IS weights in a changing world
IEEE Journal on Selected Areas in Communications
Dynamic appointment of ABR for the OSPF routing protocol
Computer Communications
| Hi-index | 0.24 |
This work presents an alternative analysis for the shortest path optimal routing problem and proposes novel heuristics methods to solve it. In practical terms, a solution for the shortest path optimal routing problem determines the link weights that optimize a computer network operating under standard routing protocols (e.g. OSPF). We base our solution on traffic engineering techniques that respect the shortest path routing model. We consider the main objectives of traffic engineering, such as: load balancing, efficient use of available resources and capacity to support growing traffic demands. Our proposals present better results than traditional approaches and follow closely theoretical optimal points.