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
Optimizing OSPF/IS-IS weights in a changing world
IEEE Journal on Selected Areas in Communications
Traffic engineering with estimated traffic matrices
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Coping with network failures: routing strategies for optimal demand oblivious restoration
Proceedings of the joint international conference on Measurement and modeling of computer systems
The all-or-nothing multicommodity flow problem
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Traffic matrix estimation on a large IP backbone: a comparison on real data
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Optimal oblivious routing in polynomial time
Journal of Computer and System Sciences - Special issue: STOC 2003
The problem of synthetically generating IP traffic matrices: initial recommendations
ACM SIGCOMM Computer Communication Review
Traffic engineering of management flows by link augmentations on confluent trees
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Walking the tightrope: responsive yet stable traffic engineering
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Robust Control of Information Networks
Automation and Remote Control
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On achieving maximum multicast throughput in undirected networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
COPE: traffic engineering in dynamic networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Touring the internet in a TCP sidecar
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Making routing robust to changing traffic demands: algorithms and evaluation
IEEE/ACM Transactions on Networking (TON)
Two-phase routing, scheduling and power control for wireless mesh networks with variable traffic
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Oblivious routing for fat-tree based system area networks with uncertain traffic demands
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Reliability as an interdomain service
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Routing control in IP-networks with the variable performance criterion
Automation and Remote Control
IGP link weight assignment for operational Tier-1 backbones
IEEE/ACM Transactions on Networking (TON)
Minimizing average latency in oblivious routing
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Enhanced-robustness Dijkstra algorithm for control of routing in the IP-networks
Automation and Remote Control
REPLEX: dynamic traffic engineering based on wardrop routing policies
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
Optimal hierarchical decompositions for congestion minimization in networks
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Slack allocation techniques for intra-path load balancing
Journal of High Speed Networks
New architecture and algorithms for fast construction of hose-model VPNs
IEEE/ACM Transactions on Networking (TON)
P4p: provider portal for applications
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Routing optimization in wireless mesh networks under uncertain traffic demands
Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
Locally restorable routing of highly variable traffic
IEEE/ACM Transactions on Networking (TON)
Optimal link weights for IP-based networks supporting hose-model VPNs
IEEE/ACM Transactions on Networking (TON)
Routing with load balancing: increasing the guaranteed node traffics
IEEE Communications Letters
Guaranteed performance routing of unpredictable traffic with fast path restoration
IEEE/ACM Transactions on Networking (TON)
Oblivious routing in fat-tree based system area networks with uncertain traffic demands
IEEE/ACM Transactions on Networking (TON)
A hybrid approach for robust traffic engineering
ISWPC'09 Proceedings of the 4th international conference on Wireless pervasive computing
The measurement paradox in valiant network design
Research Letters in Communications
Augmenting predictive with oblivious routing for wireless mesh networks under traffic uncertainty
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal capacity allocation for load balanced shortest path routing
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
Harnessing Traffic Uncertainties in Wireless Mesh Networks--A Stochastic Optimization Approach
Mobile Networks and Applications
Stable and robust multipath oblivious routing for traffic engineering
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Improving the interaction between overlay routing and traffic engineering
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Cost reduction of reliable networks using load balanced routing
IEEE Communications Letters
Autonomic traffic engineering for network robustness
IEEE Journal on Selected Areas in Communications
Two phase load balanced routing using OSPF
IEEE Journal on Selected Areas in Communications
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
Fine two-phase routing over shortest paths with traffic matrix
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
An efficient algorithm to enable path diversity in link state routing networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computers and Operations Research
Evaluation of Routing with Robustness to the Variation in Traffic Demand
Journal of Network and Systems Management
Multiple-layer network planning with scenario-based traffic forecast
EUNICE'11 Proceedings of the 17th international conference on Energy-aware communications
End-to-end restorable oblivious routing of hose model traffic
IEEE/ACM Transactions on Networking (TON)
Latency inflation with MPLS-based traffic engineering
Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conference
Designing a predictable internet backbone with valiant load-balancing
IWQoS'05 Proceedings of the 13th international conference on Quality of Service
Taming traffic dynamics: Analysis and improvements
Computer Communications
Minimum delay load-balancing via nonparametric regression and no-regret algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
Towards a statistical characterization of the competitiveness of oblivious routing
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Ant colony based self-adaptive energy saving routing for energy efficient Internet
Computer Networks: The International Journal of Computer and Telecommunications Networking
Static and dynamic routing under disjoint dominant extreme demands
Operations Research Letters
On total traffic domination in non-complete graphs
Operations Research Letters
On improving optimal oblivious routing
Operations Research Letters
DECOR: a distributed coordinated resource monitoring system
Proceedings of the 2012 IEEE 20th International Workshop on Quality of Service
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
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Joint coverage and link utilization for fast IP local protection
Computer Networks: The International Journal of Computer and Telecommunications Networking
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
Optimizing IGP link costs for improving IP-level resilience with Loop-Free Alternates
Computer Communications
Fast pattern-specific routing for fat tree networks
ACM Transactions on Architecture and Code Optimization (TACO)
Journal of Network and Computer Applications
| 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 demandsand 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, never seems 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? Armed with enhanced recent algorithmic tools 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.