Publication: On the Regularity of the Bias of Throughput Estimates on Traffic Averaging
| dc.contributor.author | Rusakov, V. A. | |
| dc.contributor.author | Русаков, Виктор Анатольевич | |
| dc.date.accessioned | 2024-11-29T10:46:54Z | |
| dc.date.available | 2024-11-29T10:46:54Z | |
| dc.date.issued | 2021 | |
| dc.description.abstract | © 2021, The Author(s), under exclusive license to Springer Nature Switzerland AG.The interaction of intelligent agents implies the existence of an environment to support it. The usual representations of this environment are graphs with certain properties. Like reliability, throughput is one of the most important characteristics of such graphs. When evaluating throughput in the analysis and synthesis of graphs, a reasonable combination of heuristic and strict approaches is used. In practice, this leads to the use of graph metrics. Usual shortest paths are widely used as part of the various multi-colour flow distribution procedures. The analytical capabilities of the Euclidian metric can achieve much more than just obtaining such a distribution. Such a metric allows us to introduce an abstract measure of the (quadratic) proximity of an arbitrary graph to a complete graph. This measure can be used as a single indicator of the reliability and throughput of the graph. Other conditions for tasks on graphs can be attributed to restrictions. A traffic matrix is one of these conditions. Non-stationarity of traffic when averaging over time can significantly reduce the accuracy of the estimates of throughput. The described dependencies of the throughput on the traffic’s non-stationarity can be used in the analysis and synthesis of the communication environment when organizing the structure of the interaction of intelligent agents in the conditions of limited resources. These dependencies are verified by the results of numerical experiments. | |
| dc.format.extent | С. 425-434 | |
| dc.identifier.citation | Rusakov, V. A. On the Regularity of the Bias of Throughput Estimates on Traffic Averaging / Rusakov, V.A. // Advances in Intelligent Systems and Computing. - 2021. - 1310. - P. 425-434. - 10.1007/978-3-030-65596-9_51 | |
| dc.identifier.doi | 10.1007/978-3-030-65596-9_51 | |
| dc.identifier.uri | https://www.doi.org/10.1007/978-3-030-65596-9_51 | |
| dc.identifier.uri | https://www.scopus.com/record/display.uri?eid=2-s2.0-85098125261&origin=resultslist | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/23520 | |
| dc.relation.ispartof | Advances in Intelligent Systems and Computing | |
| dc.title | On the Regularity of the Bias of Throughput Estimates on Traffic Averaging | |
| dc.type | Conference Paper | |
| dspace.entity.type | Publication | |
| oaire.citation.volume | 1310 | |
| relation.isAuthorOfPublication | f02291ac-4bc1-4e7b-8875-24b5b2df74e0 | |
| relation.isAuthorOfPublication.latestForDiscovery | f02291ac-4bc1-4e7b-8875-24b5b2df74e0 | |
| relation.isOrgUnitOfPublication | 010157d0-1f75-46b2-ab5b-712e3424b4f5 | |
| relation.isOrgUnitOfPublication.latestForDiscovery | 010157d0-1f75-46b2-ab5b-712e3424b4f5 |