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
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A multi-path routing algorithm for IP networks based on flow optimisation
QofIS'02/ICQT'02 Proceedings of the 3rd international conference on quality of future internet services and internet charging and QoS technologies 2nd international conference on From QoS provisioning to QoS charging
Optimizing OSPF/IS-IS weights in a changing world
IEEE Journal on Selected Areas in Communications
Stability of end-to-end algorithms for joint routing and rate control
ACM SIGCOMM Computer Communication Review
Improved balancing heuristics for optimizing shortest path routing
Computer Communications
Interface split routing for finer-grained traffic engineering
Performance Evaluation
Routing control in IP-networks with the variable performance criterion
Automation and Remote Control
Multi-path dynamic admission control in mpls networks with end-to-end delay guarantees
Proceedings of the 2nd ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
How can multi-topology routing be used for intradomain traffic engineering?
Proceedings of the 2007 SIGCOMM workshop on Internet network management
Optimal scheduling and routing for maximum network throughput
IEEE/ACM Transactions on Networking (TON)
Dynamic appointment of ABR for the OSPF routing protocol
Computer Communications
On basic properties of fault-tolerant multi-topology routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Multiple routing configurations for fast IP network recovery
IEEE/ACM Transactions on Networking (TON)
Edge-based traffic engineering for OSPF networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Traffic distribution over equal-cost-multi-paths
Computer Networks: The International Journal of Computer and Telecommunications Networking
A unified approach to congestion control and node-based multipath routing
IEEE/ACM Transactions on Networking (TON)
Adaptive multi-topology IGP based traffic engineering with near-optimal network performance
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Max-min utility fair flow management for networks with route diversity
International Journal of Network Management
Load-aware multicast routing metrics in multi-radio multi-channel wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A MILP-based heuristic for energy-aware traffic engineering with shortest path routing
INOC'11 Proceedings of the 5th international conference on Network optimization
Towards decentralized and adaptive network resource management
Proceedings of the 7th International Conference on Network and Services Management
Routing on demand: toward the energy-aware traffic engineering with OSPF
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I
Link-state routing with hop-by-hop forwarding can achieve optimal traffic engineering
IEEE/ACM Transactions on Networking (TON)
Cluster-based back-pressure routing algorithm
IEEE/ACM Transactions on Networking (TON)
Energy-aware IP traffic engineering with shortest path routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Traffic engineering aims to distribute traffic so as to "optimize" some performance criterion. This optimal distribution of traffic depends on both the routing protocol and the forwarding mechanisms in use in the network. In IP networks running the OSPF or IS-IS protocols, routing is over shortest paths, and forwarding mechanisms distribute traffic "uniformly" over equal cost shortest paths. These constraints often make achieving an optimal distribution of traffic impossible. In this paper, we propose and evaluate an approach that can realize near optimal traffic distribution without changes to routing protocols and forwarding mechanisms. In addition, we explore the tradeoff that exists between performance and the configuration overhead that our solution requires. The paper's contributions are in formulating and evaluating an approach to traffic engineering in IP networks that achieves near-optimal performance while preserving the existing infrastructure.