(2006) An Enhanced Estimator to Multi-objective OSPF WeightSetting Problem. In: Proceedings of 2006 IEEE/IFIP Network Operations & Management Symposium (NOMS 2006),, Vancouver, Canada.

Preview

PDF Sqalli_NOMS_April2006.pdf Download (813kB) | Preview

Abstract

Abstract—Open Shortest Path First (OSPF) is a routing protocol which is widely used in the Industry. Its functionality mainly depends on the weights assigned to the links. Given the traffic demands on a network, setting weights such that congestion can be avoided is an NP-hard problem. Optimizing these link weights leads to efficient network utilization which is the main goal of traffic engineering. In this paper, Simulated Annealing iterative heuristic is applied to this problem. This will provide close-to-optimal solutions that can be used for network provisioning. For this problem, the cost function that has been used in the literature depends solely on the links utilization and therefore optimizes only the network utilization. In this paper, our goal is to optimize the number of congested links in the network in addition to the utilization. Therefore, we propose a new cost function that depends on the utilization and the extra load caused by congested links in the network. This provides the network designer with more flexibility to optimize desired parameters. Our results show less number of congested links and comparable extra load in the network when compared to results of using the existing cost function.

Item Type:	Conference or Workshop Item (Other)
Subjects:	Computer
Department:	College of Computing and Mathematics > Computer Engineering
Depositing User:	AbdulRahman
Date Deposited:	24 Feb 2008 13:03
Last Modified:	01 Nov 2019 13:22
URI:	http://eprints.kfupm.edu.sa/id/eprint/79