An Enhanced Estimator to Multi-objective OSPF Weight Setting Problem

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...

وصف كامل

محفوظ في:
التفاصيل البيبلوغرافية
المؤلف الرئيسي: Sqalli, M.H. (author)
مؤلفون آخرون: Sail, S.M. (author), Mohiuddin, M.A. (author), unknown (author)
التنسيق: article
منشور في: 2020
الموضوعات:
الوصول للمادة أونلاين:https://eprints.kfupm.edu.sa/id/eprint/14220/1/14220_1.pdf
https://eprints.kfupm.edu.sa/id/eprint/14220/2/14220_2.doc
الوسوم: إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
_version_ 1864513384059240448
author Sqalli, M.H.
author2 Sail, S.M.
Mohiuddin, M.A.
unknown
author2_role author
author
author
author_facet Sqalli, M.H.
Sail, S.M.
Mohiuddin, M.A.
unknown
author_role author
dc.creator.none.fl_str_mv Sqalli, M.H.
Sail, S.M.
Mohiuddin, M.A.
unknown
dc.date.*.fl_str_mv 2020
dc.format.none.fl_str_mv application/pdf
application/msword
dc.identifier.none.fl_str_mv https://eprints.kfupm.edu.sa/id/eprint/14220/1/14220_1.pdf
https://eprints.kfupm.edu.sa/id/eprint/14220/2/14220_2.doc
An Enhanced Estimator to Multi-objective OSPF Weight Setting Problem. Network Operations and Management Symposium, 2006. NOMS 2006. 10th IEEE/IFIP, 1.
dc.language.none.fl_str_mv en
en
dc.publisher.none.fl_str_mv IEEE
dc.relation.none.fl_str_mv https://eprints.kfupm.edu.sa/id/eprint/14220/
dc.rights.*.fl_str_mv info:eu-repo/semantics/openAccess
dc.subject.none.fl_str_mv Computer
dc.title.none.fl_str_mv An Enhanced Estimator to Multi-objective OSPF Weight Setting Problem
dc.type.none.fl_str_mv Article
PeerReviewed
info:eu-repo/semantics/publishedVersion
info:eu-repo/semantics/article
description 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
eu_rights_str_mv openAccess
format article
id KFUPM_129ee9f4d4f2cfb3d168c1eac624286a
identifier_str_mv An Enhanced Estimator to Multi-objective OSPF Weight Setting Problem. Network Operations and Management Symposium, 2006. NOMS 2006. 10th IEEE/IFIP, 1.
language_invalid_str_mv en
network_acronym_str KFUPM
network_name_str King Fahd University of Petroleum and Minerals
oai_identifier_str oai::14220
publishDate 2020
publisher.none.fl_str_mv IEEE
repository.mail.fl_str_mv
repository.name.fl_str_mv
repository_id_str
spelling An Enhanced Estimator to Multi-objective OSPF Weight Setting ProblemSqalli, M.H.Sail, S.M.Mohiuddin, M.A.unknownComputerOpen 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 functionIEEEArticlePeerReviewedinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfapplication/mswordhttps://eprints.kfupm.edu.sa/id/eprint/14220/1/14220_1.pdfhttps://eprints.kfupm.edu.sa/id/eprint/14220/2/14220_2.doc An Enhanced Estimator to Multi-objective OSPF Weight Setting Problem. Network Operations and Management Symposium, 2006. NOMS 2006. 10th IEEE/IFIP, 1. enenhttps://eprints.kfupm.edu.sa/id/eprint/14220/2020info:eu-repo/semantics/openAccessoai::142202019-11-01T14:04:47Z
spellingShingle An Enhanced Estimator to Multi-objective OSPF Weight Setting Problem
Sqalli, M.H.
Computer
status_str publishedVersion
title An Enhanced Estimator to Multi-objective OSPF Weight Setting Problem
title_full An Enhanced Estimator to Multi-objective OSPF Weight Setting Problem
title_fullStr An Enhanced Estimator to Multi-objective OSPF Weight Setting Problem
title_full_unstemmed An Enhanced Estimator to Multi-objective OSPF Weight Setting Problem
title_short An Enhanced Estimator to Multi-objective OSPF Weight Setting Problem
title_sort An Enhanced Estimator to Multi-objective OSPF Weight Setting Problem
topic Computer
url https://eprints.kfupm.edu.sa/id/eprint/14220/1/14220_1.pdf
https://eprints.kfupm.edu.sa/id/eprint/14220/2/14220_2.doc