IEEE/ACM Transactions on Networking (TON)
Worst-case traffic for oblivious routing functions
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
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
Profile-Based Routing: A New Framework for MPLS Traffic Engineering
COST 263 Proceedings of the Second International Workshop on Quality of Future Internet Services
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Throughput-centric routing algorithm design
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer 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
Adaptive control algorithms for decentralized optimal traffic engineering in the internet
IEEE/ACM Transactions on Networking (TON)
Optimal oblivious routing in polynomial time
Journal of Computer and System Sciences - Special issue: STOC 2003
Oblivious routing in directed graphs with random demands
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Stability of end-to-end algorithms for joint routing and rate control
ACM SIGCOMM Computer Communication Review
Walking the tightrope: responsive yet stable traffic engineering
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
COPE: traffic engineering in dynamic networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Optimal Routing in a Packet-Switched Computer Network
IEEE Transactions on Computers
Minimizing average latency in oblivious routing
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
REPLEX: dynamic traffic engineering based on wardrop routing policies
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
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
The explicit linear quadratic regulator for constrained systems
Automatica (Journal of IFAC)
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
Towards Robust Multi-Layer Traffic Engineering: Optimization of Congestion Control and Routing
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Until recent years, it was more or less undisputed common-sense that an accurate view on traffic demands is indispensable for optimizing the flow of traffic through a network. Lately, this premise has been questioned sharply: it was shown that setting just a single routing, the so called demandoblivious routing, is sufficient to accommodate any admissible traffic matrix in the network with moderate link overload, so no prior information on demands is absolutely necessary for efficient traffic engineering. Demand-oblivious routing lends itself to distributed implementations, so it scales well. In this paper, we generalize demand-oblivious routing in a new way: we show that, in contrast to the distributed case, centralized demand-oblivious routing can eliminate link overload completely. What is more, our centralized scheme allows for optimizing the routes with respect to arbitrary linear or quadratic objective function. We realize, however, that a centralized scheme can become prohibitively complex, therefore, we propose a hybrid distributed-centralized algorithm, which, according to our simulations, strikes a good balance between efficiency, scalability and complexity.