Minimum delay load-balancing via nonparametric regression and no-regret algorithms

Computer Networks

Volumn 56, Issue 4, 2012, Pages 1152-1166

  Larroca, Federico ^a   Rougier, Jean Louis ^a  

^a TELECOM PARISTECH   (France)

Author keywords

Convex nonparametric least squares; No regret; Wardrop equilibrium; Weighted least squares

Indexed keywords

DISTRIBUTED OPTIMIZATION; FLOW-LEVEL SIMULATION; GRADIENT DESCENT; LEAST SQUARE; LOAD-BALANCING; MEAN DELAYS; MINIMUM DELAY; NETWORK SCENARIO; NO-REGRET; NON-PARAMETRIC REGRESSION; QUEUEING DELAYS; TRAFFIC DEMANDS; TRAFFIC DISTRIBUTIONS; TRAFFIC ENGINEERING; WARDROP EQUILIBRIUM; WEIGHTED LEAST SQUARES;

ALGORITHMS; DYNAMIC LOADS; HIGHWAY ENGINEERING; QUEUEING NETWORKS;

NETWORK MANAGEMENT;

EID: 84858157922     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2011.11.015     Document Type: Article

References (33)

1. W. Ben-Ameur, and H. Kerivin Routing of uncertain traffic demands Opt. Eng. 6 3 2005 283 313 (Pubitemid 41341537)
2. D. Applegate, E. Cohen, Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs, in: SIGCOMM '03, Karlsruhe, Germany, 2003, pp. 313-324.
3. H. Wang, H. Xie, L. Qiu, Y.R. Yang, Y. Zhang, and A. Greenberg Cope: traffic engineering in dynamic networks SIGCOMM Comput. Commun. Rev. 36 4 2006 99 110 (Pubitemid 44623719)
4. S. Balon, F. Skivée, G. Leduc, How well do traffic engineering objective functions meet TE requirements? in: 5th International IFIP-TC6 Networking Conference, Coimbra, Portugal, 2006, pp. 75-86. (Pubitemid 44045438)
5. F. Larroca, J.-L. Rougier, Routing games for traffic engineering, in: ICC 2009, Dresden, Germany.
6. A. Elwalid, C. Jin, S. Low, I. Widjaja, MATE: MPLS adaptive traffic engineering, in: INFOCOM 2001, vol. 3, Anchorage, USA, 2001, pp. 1300-1309. (Pubitemid 32485777)
7. S. Kandula, D. Katabi, B. Davie, A. Charny, Walking the tightrope: responsive yet stable traffic engineering, in: SIGCOMM '05, Philadelphia, USA, 2005, pp. 253-264. (Pubitemid 46323509)
8. S. Fischer, N. Kammenhuber, A. Feldmann, Replex: dynamic traffic engineering based on wardrop routing policies, in: CoNEXT '06, Lisboa, Portugal, 2006, pp. 1-12.
9. J. He, M. Bresler, M. Chiang, and J. Rexford Towards robust multi-layer traffic engineering: optimization of congestion control and routing IEEE JSAC 25 5 2007 868 880
10. A. Khanna, and J. Zinky The revised arpanet routing metric SIGCOMM Comput. Commun. Rev. 19 4 1989 45 56
11. A. Blum, E. Even-Dar, K. Ligett, Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing games, in: PODC 2006, Denver, USA, 2006, pp. 45-52. (Pubitemid 44393692)
12. P. Auer, N. Cesa-Bianchi, and C. Gentile Adaptive and self-confident on-line learning algorithms J. Comput. Syst. Sci. 64 1 2002 48 75 (Pubitemid 34473696)
13. N.C. Bianchi, and G. Lugosi Prediction, Learning, and Games 2006 Cambridge University Press
14. N. Littlestone, P.M. Long, and M. Warmuth The weighted majority algorithm Information and Computation 108 2 1994 212 261
15. T. Kuosmanen Representation theorem for convex nonparametric least squares Econometrics Journal 11 2 2008 308 325
16. A. Magnani, and S.P. Boyd Convex piecewise-linear fitting Optimization and Engineering 10 1 2009 1 17
17. E. Altman, T. Boulogne, R. El-Azouzi, T. Jiménez, and L. Wynter A survey on networking games in telecommunications Comput. Oper. Res. 33 2 2006 286 311 (Pubitemid 41068420)
18. J. Wardrop Some theoretical aspects of road traffic research Proc. Inst. Civil Engrs. Part II 1 36 1952 352 362
19. R. Banner, and A. Orda Bottleneck routing games in communication networks IEEE JSAC 25 6 2007 1173 1179 (Pubitemid 47171207)
20. R.C. Fair On the robust estimation of econometric models Annal. Econ. Social Measur. 3 4 1974 117 128
21. K. Cho, WIDE-TRANSIT 150 Megabit Ethernet Trace 2008-03-18. .
22. F. Larroca, Techniques d'Ingénierie de Trafic Dynamique pour l'Internet, Ph.D. Thesis, Telecom ParisTech, 2009. .
23. The Abilene Network. .
24. TOTEM: TOolbox for Traffic Engineering Methods. .
25. Yin Zhang, Abilene Dataset. .
26. P. Casas, L. Fillatre, S. Vaton, Robust and reactive traffic engineering for dynamic traffic demands, in: NGI 2008, Krakow, Poland, 2008, pp. 69-76.
27. M. Herbster, and M.K. Warmuth Tracking the best expert Mach. Learn. 32 2 1998 151 178 (Pubitemid 40626079)
28. The Network Simulator - ns. .
29. D. Katz, K. Kompella, D. Yeung, Traffic Engineering (TE) Extensions to OSPF Version 2, IETF, RFC 3630, September 2003. .
30. D. Peleg Distributed Computing: A Locality-Sensitive Approach 2000 SIAM
31. C. Cassandras, M. Abidi, and D. Towsley Distributed routing with on-line marginal delay estimation IEEE Trans. Commun. 38 3 1990 348 359 (Pubitemid 20678460)
32. T. Guven, R. La, M. Shayman, and B. Bhattacharjee A unified framework for multipath routing for unicast and multicast traffic IEEE/ACM Trans. Networking 16 5 2008 1038 1051
33. M. Heusse, F. Rousseau, G. Berger-Sabbatel, and A. Duda Performance anomaly of 802.11b IEEE INFOCOM 2003 2 2003 836 843