Taming traffic dynamics: Analysis and improvements

Computer Communications

Volumn 35, Issue 5, 2012, Pages 565-578

  Casas, Pedro ^a,b   Larroca, Federico ^b,c   Rougier, Jean Louis ^c   Vaton, Sandrine ^a  

^a TECHNOPÔLE BREST IROISE   (France)

^b UNIVERSIDAD DE LA REPÚBLICA   (Uruguay)

^c TELECOM PARISTECH   (France)

Author keywords

Dynamic Load Balancing; Robust optimization; Robust Routing; Traffic management; Traffic uncertainty

Indexed keywords

ALTERNATIVE METHODS; COMPARATIVE STUDIES; CONGESTION FUNCTIONS; INTERNET TRAFFIC; MULTIPLE-PATH; NETWORK SCENARIO; NEW MECHANISMS; PERFORMANCE LOSS; RESOURCES OPTIMIZATION; ROBUST OPTIMIZATION; ROBUST ROUTING; TRAFFIC DYNAMICS; TRAFFIC ENGINEERING; TRAFFIC MANAGEMENT;

COMPUTER AIDED NETWORK ANALYSIS; DYNAMIC LOADS; NETWORK MANAGEMENT; OPTIMIZATION;

TRAFFIC CONGESTION;

EID: 84857048327     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2010.07.009     Document Type: Article

References (34)

1. Cisco Systems, Global IP Traffic Forecast and Methodology 2006-2011, White Paper (2007 - updated 2008).
2. Cisco Systems, The Exabyte Era, White Paper (2007 - updated 2008).
3. Global Action Plan, An Inefficient Truth. URL .
4. M. Gupta, S. Singh, Greening of the Internet, in: Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM '03), Karlsruhe, Germany, 2003, pp. 19-26.
5. A. Feldmann, A. Greenberg, C. Lund, N. Reingold, J. Rexford, F. True, Deriving traffic demands for operational IP networks, in: IEEE/ACM Trans. Networking, vol. 9 (3), 2001, pp. 265-279.
6. W. Ben-Ameur, and H. Kerivin Routing of uncertain traffic demands Opt. Eng. 6 3 2005 283 313 (Pubitemid 41341537)
7. D. Applegate, E. Cohen, Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs, in: Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM '03), Karlsruhe, Germany, 2003, pp. 313-324.
8. 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)
9. A. Elwalid, C. Jin, S. Low, I. Widjaja, MATE: MPLS adaptive traffic engineering, in: IEEE 20th Annual Joint Conference of the IEEE Computer and Communications Societies. (INFOCOM 2001), vol. 3, Anchorage, USA, 2001, pp. 1300-1309. (Pubitemid 32485777)
10. S. Kandula, D. Katabi, B. Davie, A. Charny, Walking the tightrope: responsive yet stable traffic engineering, in: Proceedings of the 2005 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM '05), Philadelphia, USA, 2005, pp. 253-264. (Pubitemid 46323509)
11. S. Fischer, N. Kammenhuber, A. Feldmann, REPLEX: dynamic traffic engineering based on wardrop routing policies, in: Proceedings of the 2006 ACM CoNEXT Conference (CoNEXT '06), Lisboa, Portugal, 2006, pp. 1-12.
12. A. Khanna, and J. Zinky The revised ARPANET routing metric SIGCOMM Comput. Commun. Rev. 19 4 1989 45 56
13. P. Casas, L. Fillatre, S. Vaton, Robust and reactive traffic engineering for dynamic traffic demands, in: Next Generation Internet Networks (NGI 2008), Krakow, Poland, 2008, pp. 69-76.
14. A. Blum, E. Even-Dar, K. Ligett, Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing games, in: 25th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2006), Denver, USA, 2006, pp. 45-52. (Pubitemid 44393692)
15. R. Banner, and A. Orda Bottleneck routing games in communication networks IEEE J. Select. Areas Commun. 25 6 2007 1173 1179 (Pubitemid 47171207)
16. M. Roughan, M. Thorup, Y. Zhang, Traffic engineering with estimated traffic matrices, in: Proceedings of the Third ACM SIGCOMM Conference on Internet Measurement (IMC '03), Miami Beach, USA, 2003, pp. 248-258. (Pubitemid 40730657)
17. C. Zhang, Y. Liu, W. Gong, J. Kurose, R. Moll, D. Towsley, On optimal routing with multiple traffic matrices, in: 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2005), vol. 1, Miami Beach, USA, 2005, pp. 607-618. (Pubitemid 41390855)
18. P. Casas, S. Vaton, An adaptive multi temporal approach for Robust Routing, in: Euro-FGI Workshop on IP QoS and Traffic Control, Lisbon, Portugal, 2007.
19. F. Larroca, J.-L. Rougier, Minimum-delay Load Balancing through non-parametric regression, in: Proceedings of the Eigth International IFIP-TC 6 Networking Conference (NETWORKING '09), Aachen, Germany, 2009, pp. 782-794.
20. M. Johansson, A. Gunnar, Data-driven traffic engineering: techniques, experiences and challenges, in: Third International Conference on Broadband Communications, Networks and Systems (BROADNETS 2006), San José, USA, 2006, pp. 1-10.
21. I. Juva, Robust Load Balancing, in: IEEE Global Telecommunications Conference (GLOBECOM '07), Washington D.C., USA, 2007, pp. 2708-2713. (Pubitemid 351259498)
22. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin Network Flows: Theory, Algorithms, and Applications 1993 Prentice Hall
23. D. Mitra, K. Ramakrishnan, A case study of multiservice, multipriority traffic engineering design for data networks, in: 1999 Global Telecommunications Conference (GLOBECOM '99), vol. 1B, 1999, pp. 1077-1083.
24. 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)
25. F. Larroca, J.-L. Rougier, Routing Games for Traffic Engineering, in: IEEE International Conference on Communications (ICC '09), Dresden, Germany, 2009.
26. J. Wardrop Some theoretical aspects of road traffic research Proceedings of the Institution of Civil Engineers, Part II 1 36 1952 352 362
27. R. Yaroshinsky, R. El-Yaniv, and S.S. Seiden How to better use expert advice Mach. Learn. 55 3 2004 271 309
28. N. Littlestone, and M.K. Warmuth The weighted majority algorithm Inf. Comput. 108 2 1994 212 261
29. Yin Zhang, Abilene Dataset. URL .
30. The Abilene Observatory. URL .
31. K. Cho, WIDE-TRANSIT 150 Megabit Ethernet Trace 2008-03-18. URL .
32. J. Evans, and R. Steuer A revised simplex method for linear multiple objective programs Math. Program. 5 1 1973 54 72
33. J. Ecker, and I. Kouada Finding all efficient extreme points for multiple objective linear programming programs Math. Program. 14 1978 249 261
34. P. Auer, N. Cesa-Bianchi, and C. Gentile Adaptive and self-confident on-line learning algorithms J. Comput. Syst. Sci. 64 2002 48 75 (Pubitemid 34473696)