ABSTRACT Traffic engineering helps to use network resources more efficiently. Network operators use TE to obtain different objectives such as load balancing, congestion avoidance and average delay reduction. Plane IP routing protocols such as OSPF, a popular intradomain routing protocol, are believed to be insufficient for TE. OSPF is based on the shortest path algorithm in which link weights are usually static value without considering network load. They can be set using the inverse proportional bandwidth capacity or certain value. However, Optimization theory helps network researchers and operators to analyze the network behavior more precisely. It is not a practical approach can be implemented in traditional protocol .This paper proposes that to address the feasibility requirements, a weight set can be extracted from optimization problem use as a link metric in OSPF. We show the routes that selected in OSPF with these metric distribute the traffic more close to optimal situation than routes from OSPF with default metric.
Cite this paper
T. Shabanian, M. Hashemi and A. Askarian, "Maximum Load Balancing with Optimized Link Metrics," Journal of Software Engineering and Applications, Vol. 5 No. 12, 2012, pp. 14-19. doi: 10.4236/jsea.2012.512B003.
 Y. Lee et al., “Traffic Engineering in Next-Generation Optical Networks,” IEEE Commun. Surveys & Tutorials, vol. 6, no. 3, 2004, pp. 16–33.
 D. Awduche et al, “Requirements on Traffic Engineering over. 2. MPLS,” RFC 2702, June 1999.
 D. Awduche et al., “MPLS and Traffic Engineering in IP Networks, IEEE Commun. Mag., vol. 37, no. 12, Dec. 1999, pp. 42–47.
 B. Fortz et al., “Internet Traffic Engineering by Optimising OSPF Weights,” Proc. IEEE INFOCOM, 2000, pp. 519–28.
 N. Hu et al., “Locating Internet Bottle-necks: Algorithms, Measure-ments and Implications,” Proc. ACM SIGCOMM, 2004, pp. 41–54.
 A.Marija et al “Two Phase Load balance Routing using OSPF,” IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 28, NO. 1, JANUARY 2010
 E. Oki et al” Load-Balanced IP Routing Scheme Based on Shortest Paths in Hose Model” IEEE Transaction on comminications, Volume : 58, Page(s): 2088 - 2096, 2010
 Z. Wang, Y. Wang, and L. Zhang, ”Internet Traffic Engineering without Full Mesh Overlaying,” INFOCOM’2001
 S. Boyd and L. Vanderberghe. Convex Optimization. Cambridge Univ. Press, 2004
 D. P. Bertsekas. Network Optimization: Continuous and Discrete Models Athena Scientific, 1998