A New Approach for Open Shortest Path Weight Setting Problem (OSPFWSP)

Routing protocol is the nervous system to any network. It directs data to it's destinations, OSPF is the famous intera-domain routing protocol at all over the world, OSPF calculates routes as follow. Each link is assigned weights by operator. Each node in the autonomous system computes shortest paths and creates destination tables used to route data to next node on the path to its destination it direct data according to variable parameter named weights (cost), quality of routing depends on the setting of these parameters, OSPF routing is NP hard problem [1], OSPF weights setting problem is to find a set of OSPF weights that optimizes network performance. Although a lot of trials have been made for open shortest path setting problem (OSPFWSP), no optimal setting is found. At this paper a new algorithm is developed to solve OSPFWSP, also comparison between the new algorithm and the legacy methods is done.

[1]  James R. Eagan,et al.  Extending and enhancing GT-ITM , 2003, MoMeTools '03.

[2]  Zhi-Li Zhang,et al.  Local Rerouting for Handling Transient Link Failures , 2003 .

[3]  Chen-Nee Chuah,et al.  Fast local rerouting for handling transient link failures , 2007, TNET.

[4]  Yong Zuo,et al.  Impact of Link Weight Ranges on OSPF Weight Solutions , 2007, 2007 Second International Conference on Communications and Networking in China.

[5]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[6]  A.A. Ghazala,et al.  A Survey for Open Shortest Path First Weight Setting (OSPFWS) Problem , 2008, 2008 International Conference on Information Security and Assurance (isa 2008).

[7]  Sadiq M. Sait,et al.  Engineering Evolutionary Algorithm to Solve Multi-objective OSPF Weight Setting Problem , 2006, Australian Conference on Artificial Intelligence.

[8]  M. Dzida,et al.  Traffic Flow Optimization in Networks with Combined OSPF/MPLS Routing , 2007, 15th International Conference on Advanced Computing and Communications (ADCOM 2007).

[9]  Mikkel Thorup,et al.  Increasing Internet Capacity Using Local Search , 2004, Comput. Optim. Appl..

[10]  Sadiq M. Sait,et al.  An Enhanced Estimator to Multi-objective OSPF Weight Setting Problem , 2006, 2006 IEEE/IFIP Network Operations and Management Symposium NOMS 2006.

[11]  Brunilde Sansò,et al.  Corouting: An IP Hybrid Routing Approach , 2008, Fourth International Conference on Networking and Services (icns 2008).

[12]  Michal Pioro,et al.  Traffic flow optimization in networks with combined OSPF/MPLS routing , 2007 .