REPLEX - Dynamic traffic engineering based on wardrop routing policies

Proceedings of CoNEXT'06 - 2nd Conference on Future Networking Technologies

Volumn , Issue , 2006, Pages

  Fischer, Simon ^a   Kammenhuber, Nils ^b   Feldmann, Anja ^c  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b Inst F Med Stat und Epidemiol   (Germany)

^c DEUTSCHE TELEKOM LABORATORIES   (Germany)

Author keywords

Convergence time; Dynamic routing; Load balancing; Real time adaptive multipath routing; Traffic engineering; Wardrop equilibria

Indexed keywords

ARPANET; COMMUNICATION NETWORKS; CONVERGENCE TIME; COST ROUTES; DISTRIBUTED DYNAMICS; DISTRIBUTING-LOAD; DYNAMIC TRAFFIC ENGINEERING; FLASH CROWD; LOAD-SENSITIVE; MULTI PATH ROUTING; ON TIME; POSSIBLE SOLUTIONS; RE-ROUTING; ROUTING DECISIONS; SELF-SIMILARITIES; SHORT TIME SCALE; TCP TRAFFIC; THEORETICAL RESULT; TRAFFIC CONDITIONS; TRAFFIC DEMANDS; TRAFFIC ENGINEERING; TRAFFIC LOADS; WARDROP EQUILIBRIUM; WARDROP ROUTING; WEB TRAFFIC;

CONVERGENCE OF NUMERICAL METHODS; INTERNET PROTOCOLS; PARALLEL ARCHITECTURES; TELECOMMUNICATION NETWORKS; TRANSMISSION CONTROL PROTOCOL;

ENGINEERING;

EID: 77953813824     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1368436.1368438     Document Type: Conference Paper

References (50)

1. D. Applegate and E. Cohen. Making intra-domain routing robust to changing and uncertain traffic demands: Understanding fundamental tradeoffs. In Proc. ACM SIGCOMM Conference, 2003.
2. B. Awerbuch and R. D. Kleinberg. Adaptive routing with end-to-end feedback: Distributed learning and geometric approaches. In Proc. 36th Ann. ACM. Symp. on Theory of Comput. (STOC), 2004.
3. P. Barford and M. Crovella. Generating representative Web workloads for network and server performance evaluation. In Proc. ACM SIGMETRICS Conference, 1998.
4. M. Beckmann, C. B. McGuire, and C. B. Winsten. Studies in the Economics and Transportation. Yale University Press, 1956.
5. P. Berenbrink, T. Friedetzky, L. A. Goldberg, P. Goldberg, Z. Hu, and R. Martin. Distributed selfish load balancing. In Proc. 17th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), 2006.
6. A. Blum, E. Even-Dar, and K. Ligett. Routing without regret, 2005. Manuscript.
7. Z. Cao, Z. Wang, and E. W. Zegura. Performance of hashing-based schemes for Internet load balancing. In Proc. IEEE INFOCOM Conference, 2000.
8. H. Dreger, A. Feldmann, M. Mai, V. Paxson, and R. Sommer. Dynamic application-layer protocol analysis for network intrusion detection. In Proc.15thUsenix Security Symposium, 2006 (to appear).
9. A. Elwalid, C. Jin, S. Low, and I. Widjaja. MATE: MPLS adaptive traffic engineering. In Proc. IEEE INFOCOM Conference, 2001.
10. E. Even-Dar and Y. Mansour. Fast convergence of selfish rerouting. In Proc. 16th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), 2005.
11. A. Feldmann, A. Gilbert, P. Huang, and W. Willinger. Dynamics of IP traffic: A study of the role of variability and the impact of control. In ACM SIGCOMM Conference, Sept. 1999.
12. A. Feldmann, A. Greenberg, C. Lund, N. Reingold, and J. Rexford. NetScope: Traffic engineering for IP networks. IEEE Network Magazine, 2000.
13. S. Fischer, H. Räcke, and B. Vöcking. Fast convergence to Wardrop equilibria by adaptive sampling methods. In Proc. 38th Ann. ACM. Symp. on Theory of Comput. (STOC), Seattle, WA, USA, May 2006. ACM.
14. S. Fischer and B. Vöcking. On the evolution of selfish routing. In S. Albers and T. Radzik, editors, Proc. 12th Ann. European Symp. on Algorithms (ESA), number 3221 in Lecture Notes in Comput. Sci., Bergen, Norway, September 2004. Springer-Verlag.
15. S. Fischer and B. Vöcking. Adaptive routing with stale information. In M. K. Aguilera and J. Aspnes, editors, Proc. 24th Ann. ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing (PODC), Las Vegas, NV, USA, 2005.
16. B. Fortz, J. Rexford, and M. Thorup. Traffic engineering with traditional IP routing protocols. In IEEE Communication Magazine, 2002.
17. B. Fortz and M. Thorup. Internet traffic engineering by optimizing OSPF weights. In Proc. IEEE INFOCOM Conference, 2000.
18. B. Fortz and M. Thorup. Optimizing OSPF/IS-IS weights in a changing world. In IEEE Journal on Selected Areas in Communications, Vol. 20, No. 4, 2002.
19. W. Hao and R. Ito. Dynamics of load-sensitive adaptive routing. In Proc. IEEE International Conference on Communications (ICC), 2005.
20. J.-Y. Jo, Y. Kim, H. J. Chao, and F. Merat. Internet traffic load balancing using dynamic hashing with flow volume. In Proc.SPIE ITCom, 2002.
21. S. Kandula, D. Katabi, B. Davie, and A. Charny. Walking the tightrope: responsive yet stable traffic engineering. In Proc. ACM SIGCOMM, 2005.
22. D. Katz, K. Kompella, and D. Yeung. Traffic engineering extensions to OSPF version 2. Internet Draft, 2003.
23. A. Khanna and J. Zinky. The revised ARPANET routing metric. In Proc. ACM SIGCOMM Conference, 1989.
24. T. Krämer. IP traffic engineering-OSPF vs. MPLS. Master's thesis, Universität des Saarlandes, 2003.
25. B. Krishnamurthy and J. Rexford. Web Protocols and Practice. Addison-Wesley, 2001.
26. M. Laor and L. Gendel. The effect of packet reordering in a backbone link on application throughput. IEEE Network, September/October 2002.
27. Y. Liu and A. L. N. Reddy. Multihoming route control among a group of multihomed stub networks. Technical Report TAMU-ECE-2006-01, 2006.
28. K. Park and W. Willinger, editors. Self-Similar Network Traffic and Performance Evaluation. Wiley-Interscience, 2000.
29. C. Pelsser, S. Uhlig, and O. Bonaventure. On the difficulty of establishing interdomain LSPs. In IEEE IPOM, 2004.
30. J. Postel et al. RFC 793, September 1981. http://www.ietf.org/rfc/rfc793. txt.
31. V. Raghunathan and P. R. Kumar. A Wardrop routing protocol for ad hoc wireless networks. In IEEE CDC, 2004.
32. V. Raghunathan and P. R. Kumar. Issues in Wardrop routing in wireless networks. In IEEE WICON, 2005.
33. Renesys. The SSFNet network simulatorhttp://www.ssfnet.org/.
34. M. Roughan, M. Thorup, and Y. Zhang. Traffic engineering with estimated traffic matrices. In Proc. ACM SIGCOMM Conference, 2003.
35. T. Roughgarden and É. Tardos. How bad is selfish routing? J. ACM, 49(2), 2002.
36. N. Skrypnyuk. Load-sensitive routing. Master's thesis, TU München, 2006.
37. N. Spring, R. Mahajan, and D. Wetherall. Measuring ISP topologies with Rocketfuel. In Proc. ACM SIGCOMM Conference, Pittsburgh, PA, USA, August 2002. ACM.
38. A. Sridharan, R. Guérin, and C. Diot. Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks. In Proc. IEEE INFOCOM Conference, 2003.
39. R. Teixeira. Network Sensitivity to Intradomain Routing Changes. PhD thesis, University of California San Diego, August 2005.
40. R. Teixeira, N. Duffield, J. Rexford, and M. Roughan. Traffic matrix reloaded: Impact of routing changes. In Proc. Passive and Active Measurement, 2005.
41. TOTEM-Toolbox for Traffic Engineering Methods. http://totem.run. montefiore.ulg.ac.be/.
42. C. Vollmert. A Web workload generator for the SSFNet network simulator. Bachelor's thesis, Technische Universität München, 2004.
43. J. Wallerich. Design and implementation of a WWW workload generator for the ns-2 network simulator. Master's thesis, Universität des Saarlandes, 2001.
44. J. Wallerich, H. Dreger, A. Feldmann, B. Krishnamurthy, and W. Willinger. A methodology for studying persistency aspects of Internet flows. ACM SIGCOMM Computer Communication Review, 35, 2005.
45. H. Wang, H. Xie, L. Qiu, Y. R. Yang, Y. Zhang, and A. Greenberg. COPE: Traffic engineering in dynamic networks. In Proc. ACM SIGCOMM Conference, 2006.
46. J. G. Wardrop. Some theoretical aspects of road traffic research. In Proc. of the Institute of Civil Engineers, Pt. II, 1952.
47. X. Xiao, A. Hannan, B. Bailey, and L. Ni. Traffic engineering with MPLS in the Internet. In IEEE Network Magazine, March 2000.
48. W. Xu and J. Rexford. Miro: Multi-path interdomain routing. In Proc. ACM SIGCOMM Conference, 2006.
49. C. Zhang, Z. Ge, J. Kurose, Y. Liu, and D. Towsley. Optimal routing with multiple traffic matrices: Tradeoff between average case and worst case performance. In Proc. 13th International Conference on Network Protocols (ICNP), 2005.
50. Y. Zhang, M. Roughan, C. Lund, and D. Donoho. An information-theoretic approach to traffic matrix estimation. In Proc. ACM SIGCOMM, 2003.