Edge-based traffic engineering for OSPF networks

Computer Networks

Volumn 48, Issue 4, 2005, Pages 605-625

  Wang, Jun ^a   Yang, Yaling ^a   Xiao, Li ^a   Nahrstedt, Klara ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

Edge based; Mathematical programming optimization; OSPF; Traffic engineering; Traffic set

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; HEURISTIC METHODS; INTERNET; MATHEMATICAL PROGRAMMING; OPTIMIZATION; QUALITY OF SERVICE; SCHEDULING; TELECOMMUNICATION TRAFFIC; THEOREM PROVING;

EDGE-BASED APPROACH; MATHEMATICAL PROGRAMMING/OPTIMIZATION; OPEN SHORTEST PATH FIRST (OSPF) PROTOCOLS; TRAFFIC ENGINEERING (TE); TRAFFIC SET;

ROUTERS;

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

References (24)

1. J. Moy, OSPF Version 2, RFC 2328, April 1998
2. G. Apostolopoulos, D. Williams, S. Kamat, R. Guerin, A. Orda, T. Przygienda, QoS Routing Mechanisms and OSPF Extensions, RFC 2676, August 1999
3. B. Fortz, M. Thorup, Internet traffic engineering by optimizing OSPF weights, in: Proceedings of IEEE INFOCOM 2000, Tel-Aviv, Israel, 2000
4. A. Sridharan, R. Guerin, C. Diot, Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks, in: IEEE INFOCOM 2003, San Francisco, CA, 2003
5. A. Riedl, Optimized routing adaptation in IP networks utilizing OSPF and MPLS, in: Proceedings of IEEE ICC 2003, Anchorage, Alaska, 2003
6. S. Blake et al., An Architecture for Differentiated Services, RFC 2475
7. K. Nichols, V. Jacobson, L. Zhang, A Two-bit Differentiated Services Architecture for the Internet, RFC 2638
8. Internet Protocol, RFC 791
9. F. Baker, D. Black, S. Blake, K. Nichols, Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers, RFC 2474
10. Y. Wang, Z. Wang, L. Zhang, Internet Traffic engineering without full mesh overlaying, in: Proceedings of INFOCOM 2001, 2001
11. Y. Wang, Z. Wang, Explicit routing algorithms for internet traffic engineering, in: Proceedings of ICCCN'99, 1999
12. D. Awduche et al., Requirements for Traffic Engineering Over MPLS, RFC 2702, September 1999
13. J. Wang, S. Patek, H. Wang, J. Liebeherr, Traffic engineering with AIMD in MPLS networks, in: Proceedings of the Protocols for High-Speed Networks Workshop, 2002, pp. 192-210, citeseer.nj.nec.com/512747.html
14. S. Yilmaz, I. Matta, On the scalability-performance tradeoffs in MPLS and IP routing, in: Proceedings of SPIE: Scalability and Traffic Control in IP Networks, 2002
15. J. Wang, and K. Nahrstedt Hop-by-Hop Routing Algorithms For Premium Traffic ACM Computer Communication Review 32 5 2002 73 88
16. J. Wang, K. Nahrstedt, Hop-by-hop routing algorithms for premium-class traffic in DiffServ networks, in: Proceedings of IEEE Infocom 2002, 2002
17. J. Wang, L. Xiao, K.-S. Lui, K. Nahrstedt, Bandwidth sensitive routing in DiffServ networks with heterogeneous bandwidth requirements, in: Proceedings of IEEE ICC 2003, Anchorage, Alaska, 2003
18. A. Feldmann, A. Greenberg, C. Lund, N. Reingold, and J. Rexford Deriving traffic demands for operational IP networks: Methodology and experience IEEE/ACM Transactions on Networking 9 2001 265 278
19. Y. Zhang, M. Roughan, C. Lund, D. Donoho, An information-theoretic approach to traffic matrix estimation, in: Proceedings of ACM SIGCOMM'03, Karlsruhe, Germany, 2003
20. Y. Zhang, M. Roughan, N. Duffield, A. Greenberg, Fast accurate computation of large-scale IP traffic matrices from link loads, in: Proceedings of ACM SIGMETRICS'03, San Diego, CA USA, 2003
21. A. Medina, A. Lakhina, I. Matta, J. Byers, Brite: an approach to universal topology generation, in: Proceedings of the International Workshop on MASCOTS '01, Cincinnati, Ohio, 2001
22. ILOG CPLEX, in: http://www.ilog.com/products/cplex/
23. P. Gupta, S. Lin, N. McKeown, Routing lookups in hardware at memory access speeds, in: IEEE Infocom 1998, San Francisco, vol. 3, 1998, pp. 1240-1247
24. P. Gupta, and N. McKeown Packet Classification on Multiple Fields ACM Computer Communication Review 29 1999 147 160