The revised ARPANET routing metric
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
The weighted majority algorithm
Information and Computation
Machine Learning - Special issue on context sensitivity and concept drift
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Walking the tightrope: responsive yet stable traffic engineering
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Prediction, Learning, and Games
Prediction, Learning, and Games
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
COPE: traffic engineering in dynamic networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
REPLEX: dynamic traffic engineering based on wardrop routing policies
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
A unified framework for multipath routing for unicast and multicast traffic
IEEE/ACM Transactions on Networking (TON)
A survey on networking games in telecommunications
Computers and Operations Research
Routing games for traffic engineering
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
How well do traffic engineering objective functions meet TE requirements?
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
Towards Robust Multi-Layer Traffic Engineering: Optimization of Congestion Control and Routing
IEEE Journal on Selected Areas in Communications
Bottleneck Routing Games in Communication Networks
IEEE Journal on Selected Areas in Communications
Optimal multipath forwarding in planned Wireless Mesh Networks
Computer Communications
| Hi-index | 0.00 |
In the current network scenario, where traffic is increasingly dynamic and resource demanding, Dynamic Load-Balancing (DLB) has been shown to be an excellent Traffic Engineering tool. In particular, we are interested in the problem of minimum delay load-balancing. That is to say, we assume that the queueing delay of a link is given by a function of its load. The objective is then to adjust the traffic distribution over paths so that, for the current traffic demand, the addition of these functions times the load is minimized. The contribution of our article is twofold. Firstly, we analyze the possibility of using so-called no-regret algorithms to perform the load balancing. As opposed to other distributed optimization algorithms (such as the classical gradient descent) the algorithm we discuss requires no fine-tuning of any speed-controlling parameter. Secondly, we present a framework that does not assume any particular model for the queueing delay function, and instead learns it from measurements. This way, the resulting mean delay of optimizing with this learnt function is an excellent approximation of the real minimum delay traffic distribution. The whole framework is illustrated by several packet and flow level simulations.