Standard
On evaluating a network throughput. / Rodionov, Alexey S.
Proceedings of the 13th International Conference on Ubiquitous Information Management and Communication, IMCOM 2019. ed. / Hyunseung Choo; Sukhan Lee; Roslan Ismail. Springer-Verlag GmbH and Co. KG, 2019. p. 34-41 (Advances in Intelligent Systems and Computing; Vol. 935).
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
Harvard
Rodionov, AS 2019,
On evaluating a network throughput. in H Choo, S Lee & R Ismail (eds),
Proceedings of the 13th International Conference on Ubiquitous Information Management and Communication, IMCOM 2019. Advances in Intelligent Systems and Computing, vol. 935, Springer-Verlag GmbH and Co. KG, pp. 34-41, 13th International Conference on Ubiquitous Information Management and Communication, IMCOM 2019, Phuket, Thailand,
04.01.2019.
https://doi.org/10.1007/978-3-030-19063-7_3
APA
Vancouver
Rodionov AS.
On evaluating a network throughput. In Choo H, Lee S, Ismail R, editors, Proceedings of the 13th International Conference on Ubiquitous Information Management and Communication, IMCOM 2019. Springer-Verlag GmbH and Co. KG. 2019. p. 34-41. (Advances in Intelligent Systems and Computing). doi: 10.1007/978-3-030-19063-7_3
Author
Rodionov, Alexey S. /
On evaluating a network throughput. Proceedings of the 13th International Conference on Ubiquitous Information Management and Communication, IMCOM 2019. editor / Hyunseung Choo ; Sukhan Lee ; Roslan Ismail. Springer-Verlag GmbH and Co. KG, 2019. pp. 34-41 (Advances in Intelligent Systems and Computing).
BibTeX
@inproceedings{be36761ab7f64c8585ad58f467908483,
title = "On evaluating a network throughput",
abstract = "The task of obtaining and estimating maximum flows between all pairs of nodes in a given subset of a network{\textquoteright}s nodes is discussed. It is shown how significantly reduce number of operations by re-usage of some intermediate results while calculating maximum flows between several pairs of nodes. Obtaining all maximum flows allows calculate an arithmetical average of maximum flows between all pairs of nodes characterizes “throughput” of a network in a whole that may serve as the index of a citys road network quality, for example. Cumulative bounds are used for faster and strict estimation of maximum flows and their average.",
keywords = "Graph, Maximum flow, Network throughput",
author = "Rodionov, {Alexey S.}",
year = "2019",
doi = "10.1007/978-3-030-19063-7_3",
language = "English",
isbn = "9783030190620",
series = "Advances in Intelligent Systems and Computing",
publisher = "Springer-Verlag GmbH and Co. KG",
pages = "34--41",
editor = "Hyunseung Choo and Sukhan Lee and Roslan Ismail",
booktitle = "Proceedings of the 13th International Conference on Ubiquitous Information Management and Communication, IMCOM 2019",
address = "Germany",
note = "13th International Conference on Ubiquitous Information Management and Communication, IMCOM 2019 ; Conference date: 04-01-2019 Through 06-01-2019",
}
RIS
TY - GEN
T1 - On evaluating a network throughput
AU - Rodionov, Alexey S.
PY - 2019
Y1 - 2019
N2 - The task of obtaining and estimating maximum flows between all pairs of nodes in a given subset of a network’s nodes is discussed. It is shown how significantly reduce number of operations by re-usage of some intermediate results while calculating maximum flows between several pairs of nodes. Obtaining all maximum flows allows calculate an arithmetical average of maximum flows between all pairs of nodes characterizes “throughput” of a network in a whole that may serve as the index of a citys road network quality, for example. Cumulative bounds are used for faster and strict estimation of maximum flows and their average.
AB - The task of obtaining and estimating maximum flows between all pairs of nodes in a given subset of a network’s nodes is discussed. It is shown how significantly reduce number of operations by re-usage of some intermediate results while calculating maximum flows between several pairs of nodes. Obtaining all maximum flows allows calculate an arithmetical average of maximum flows between all pairs of nodes characterizes “throughput” of a network in a whole that may serve as the index of a citys road network quality, for example. Cumulative bounds are used for faster and strict estimation of maximum flows and their average.
KW - Graph
KW - Maximum flow
KW - Network throughput
UR - http://www.scopus.com/inward/record.url?scp=85066859316&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-19063-7_3
DO - 10.1007/978-3-030-19063-7_3
M3 - Conference contribution
AN - SCOPUS:85066859316
SN - 9783030190620
T3 - Advances in Intelligent Systems and Computing
SP - 34
EP - 41
BT - Proceedings of the 13th International Conference on Ubiquitous Information Management and Communication, IMCOM 2019
A2 - Choo, Hyunseung
A2 - Lee, Sukhan
A2 - Ismail, Roslan
PB - Springer-Verlag GmbH and Co. KG
T2 - 13th International Conference on Ubiquitous Information Management and Communication, IMCOM 2019
Y2 - 4 January 2019 through 6 January 2019
ER -
