Capacity Optimization in Dynamically Routing Computer Network Systems

dc.authoriduncu, nusin/0000-0003-3030-3363
dc.contributor.authorUncu, Nusin
dc.contributor.authorErol, Rizvan
dc.date.accessioned2025-01-06T17:37:06Z
dc.date.available2025-01-06T17:37:06Z
dc.date.issued2022
dc.description.abstractA computer network system is a complex system with a great number of dynamic components. There are many devices in the system, such as computers, routers, lines, hubs, and switches. In addition to these hardware systems, many protocols are integrated to set the rules and provide the way of communication. Due to the nature of the system, it is hard to formulate and solve problems analytically without making any assumptions. One of the prominent problems that occur in computer systems is the line capacity assignment problem. In the previous mathematical models, message routes were predetermined and the dynamic nature of the system was neglected. This study deals with the line capacity assignment problem under a dynamically routing policy. Four different computer network topologies are used and solved by two heuristic algorithms via simulation. A dynamic search approach based on the occupancy rate of lines is used to define the consecutive routes of messages. The performances of harmony search and genetic algorithms via simulation are compared with the results of OptQuest, one of the optimization packet programs embedded in simulation software Arena (R).
dc.description.sponsorshipCukurova University Scientific Research Project Commission
dc.description.sponsorshipThis research was supported by Cukurova University Scientific Research Project Commission.
dc.identifier.doi10.31803//tg-20201215233216
dc.identifier.endpage32
dc.identifier.issn1846-6168
dc.identifier.issn1848-5588
dc.identifier.issue1
dc.identifier.scopus2-s2.0-85147657591
dc.identifier.scopusqualityQ3
dc.identifier.startpage23
dc.identifier.urihttps://doi.org/10.31803//tg-20201215233216
dc.identifier.urihttps://hdl.handle.net/20.500.14669/2112
dc.identifier.volume16
dc.identifier.wosWOS:000752370700001
dc.identifier.wosqualityN/A
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherUniv North
dc.relation.ispartofTehnicki Glasnik-Technical Journal
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/openAccess
dc.snmzKA_20241211
dc.subjectcomputer networks
dc.subjectharmony search
dc.subjectgenetic algorithms
dc.subjectoptimization via simulation
dc.titleCapacity Optimization in Dynamically Routing Computer Network Systems
dc.typeArticle

Dosyalar