PERFORMANCE REQUIRED FOR COMMON-USE COMPONENTS OF COMPUTER NETWORKS

Sometimes, in practice, simple solutions of quick preliminary estimation of basic characteristics of a computer network are needed.In this aim, the backbone subnet and server set of wide area computer networks are examined. Based on Jackson’s partitioning theorem and considering the linear...

Full description

Saved in:
Bibliographic Details
Main Author: BOLUN, Ion
Format: Article
Language:English
Published: Technical University of Moldova 2024-09-01
Series:Journal of Engineering Science (Chişinău)
Subjects:
Online Access:https://press.utm.md/index.php/jes/article/view/2024-31-3-06/06-pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832576310903308288
author BOLUN, Ion
author_facet BOLUN, Ion
author_sort BOLUN, Ion
collection DOAJ
description Sometimes, in practice, simple solutions of quick preliminary estimation of basic characteristics of a computer network are needed.In this aim, the backbone subnet and server set of wide area computer networks are examined. Based on Jackson’s partitioning theorem and considering the linear dependence of the costs of channels, routers, and servers on their performance, a simplified analytical model for these components of the network is defined. Using this model, two optimization problems are formulated: minimizing the average response time to user requests of data processing and minimizing the summary cost of servers, channels and routers of the computer network. For both problems, analytical solutions regarding the necessary performances of channels, routers and servers are obtained. As expected, in the obtained analytical solutions, the equations for the optimization criteria of the two problems coincide, only their form being different. Calculations of performances according to these solutions are simple and can be done, for example, in MS Excel. Because the obtained in this way performances are positive real numbers, and the allowed performances of concerned entities are discrete ones, further adjustment of the solution in question, depending of the case, may be necessary. For such an adjustment, two algorithms are proposed. One of them solves the problem by reducing it to that of backpack. Another solves the problem based on the use of resource concentration rule.
format Article
id doaj-art-f6d3b78c441b4949bbcdadce4dc6f3ec
institution Kabale University
issn 2587-3474
2587-3482
language English
publishDate 2024-09-01
publisher Technical University of Moldova
record_format Article
series Journal of Engineering Science (Chişinău)
spelling doaj-art-f6d3b78c441b4949bbcdadce4dc6f3ec2025-01-31T07:29:16ZengTechnical University of MoldovaJournal of Engineering Science (Chişinău)2587-34742587-34822024-09-01XXXI36374https://doi.org/10.52326/jes.utm.2024.31(3).06PERFORMANCE REQUIRED FOR COMMON-USE COMPONENTS OF COMPUTER NETWORKSBOLUN, Ion0https://orcid.org/0000-0003-1961-7310Technical University of Moldova, 168 Stefan cel Mare Blvd., Chisinau, Republic of MoldovaSometimes, in practice, simple solutions of quick preliminary estimation of basic characteristics of a computer network are needed.In this aim, the backbone subnet and server set of wide area computer networks are examined. Based on Jackson’s partitioning theorem and considering the linear dependence of the costs of channels, routers, and servers on their performance, a simplified analytical model for these components of the network is defined. Using this model, two optimization problems are formulated: minimizing the average response time to user requests of data processing and minimizing the summary cost of servers, channels and routers of the computer network. For both problems, analytical solutions regarding the necessary performances of channels, routers and servers are obtained. As expected, in the obtained analytical solutions, the equations for the optimization criteria of the two problems coincide, only their form being different. Calculations of performances according to these solutions are simple and can be done, for example, in MS Excel. Because the obtained in this way performances are positive real numbers, and the allowed performances of concerned entities are discrete ones, further adjustment of the solution in question, depending of the case, may be necessary. For such an adjustment, two algorithms are proposed. One of them solves the problem by reducing it to that of backpack. Another solves the problem based on the use of resource concentration rule.https://press.utm.md/index.php/jes/article/view/2024-31-3-06/06-pdfalgorithmchannelcostoptimizationresponse timerouterserver
spellingShingle BOLUN, Ion
PERFORMANCE REQUIRED FOR COMMON-USE COMPONENTS OF COMPUTER NETWORKS
Journal of Engineering Science (Chişinău)
algorithm
channel
cost
optimization
response time
router
server
title PERFORMANCE REQUIRED FOR COMMON-USE COMPONENTS OF COMPUTER NETWORKS
title_full PERFORMANCE REQUIRED FOR COMMON-USE COMPONENTS OF COMPUTER NETWORKS
title_fullStr PERFORMANCE REQUIRED FOR COMMON-USE COMPONENTS OF COMPUTER NETWORKS
title_full_unstemmed PERFORMANCE REQUIRED FOR COMMON-USE COMPONENTS OF COMPUTER NETWORKS
title_short PERFORMANCE REQUIRED FOR COMMON-USE COMPONENTS OF COMPUTER NETWORKS
title_sort performance required for common use components of computer networks
topic algorithm
channel
cost
optimization
response time
router
server
url https://press.utm.md/index.php/jes/article/view/2024-31-3-06/06-pdf
work_keys_str_mv AT bolunion performancerequiredforcommonusecomponentsofcomputernetworks