A new polynomial-time algorithm for linear programming
Combinatorica
Deriving traffic demands for operational IP networks: methodology and experience
IEEE/ACM Transactions on Networking (TON)
Trajectory sampling for direct traffic observation
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
Experience in measuring backbone traffic variability: models, metrics, measurements and meaning
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Inferring link weights using end-to-end measurements
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
Optimal oblivious routing in polynomial time
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Coping with network failures: routing strategies for optimal demand oblivious restoration
Proceedings of the joint 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
How can multi-topology routing be used for intradomain traffic engineering?
Proceedings of the 2007 SIGCOMM workshop on Internet network management
Robust traffic engineering using multi-topology routing
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Load-balanced IP routing scheme based on shortest paths in hose model
IEEE Transactions on Communications
EA'09 Proceedings of the 9th international conference on Artificial evolution
Fine two-phase routing over shortest paths with traffic matrix
Computer Networks: The International Journal of Computer and Telecommunications Networking
Robust network planning in nonuniform traffic scenarios
Computer Communications
Evaluation of Routing with Robustness to the Variation in Traffic Demand
Journal of Network and Systems Management
Identifying and using energy-critical paths
Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
Simultaneous approximations for adversarial and stochastic online budgeted allocation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Distributing content simplifies ISP traffic engineering
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Achieving high robustness and performance in QoS-aware route planning for IPTV networks
Information Sciences: an International Journal
| Hi-index | 0.00 |
Intra-domain traffic engineering can significantly enhance the performance of large IP backbone networks. Two important components of traffic engineering are understanding the traffic demands and configuring the routing protocols. These two components are inter-linked, as it is widely believed that an accurate view of traffic is important for optimizing the configuration of routing protocols, and through that, the utilization of the network.This basic premise, however, seems never to have been quantified. How important is accurate knowledge of traffic demands for obtaining good utilization of the network? Since traffic demand values are dynamic and illusive, is it possible to obtain a routing that is "robust" to variations in demands?We develop novel algorithms for constructing optimal robust routings and for evaluating the performance of any given routing on loosely constrained rich sets of traffic demands. Armed with these algorithms we explore these questions on a diverse collection of ISP networks. We arrive at a surprising conclusion: it is possible to obtain a robust routing that guarantees a nearly optimal utilization with a fairly limited knowledge of the applicable traffic demands.