Skip to main content
SpringerLink
Log in

On Evaluating a Network Throughput

  • Conference paper
  • First Online:
Proceedings of the 13th International Conference on Ubiquitous Information Management and Communication (IMCOM) 2019 (IMCOM 2019)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 935))

  • 1218 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aldous, D.J., McDiarmid, C., Scott, A.: Uniform multicommodity flow through the complete graph with random edge-capacities. Oper. Res. Lett. 5(37), 299–302 (2009)

    Article  MathSciNet  Google Scholar 

  2. Colin, M., Alex, S., Paul, W.: Uniform multicommodity flows in the hypercube with random edge-capacities. Random Struct. Algorithms 50(3), 437–463 (2016). https://doi.org/10.1002/rsa.20672. https://onlinelibrary.wiley.com/doi/abs/10.1002/rsa.20672

    Article  MathSciNet  MATH  Google Scholar 

  3. Evans, J.: Maximum flow in probabilistic graphs - the discrete case. Networks 2(6), 161–183 (1976). https://doi.org/10.1002/net.3230060208

    Article  MathSciNet  MATH  Google Scholar 

  4. Ford, L.R., Fulkerson, D.R.: Maximal flow through a network, pp. 243–248. Birkhäuser Boston, Boston (1987). https://doi.org/10.1007/978-0-8176-4842-8_15

    Chapter  Google Scholar 

  5. Fujii, Y., Wadayama, T.: An analysis on minimum \(s-t\) cut capacity of random graphs with specified degree distribution. In: 2013 IEEE International Symposium on Information Theory, pp. 2895–2899 (2013). https://doi.org/10.1109/ISIT.2013.6620755

  6. Rodionov, A.: Cumulative estimated values of structural network’s reliability indices and their usage. In: 2016 Dynamics of Systems, Mechanisms and Machines (Dynamics), pp. 1–4 (2016). https://doi.org/10.1109/Dynamics.2016.7819071

  7. Wang, H., Fan, P., Cao, Z.: Analysis of maximum flow in random graphs for network coding. In: 2005 IEEE International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications, vol. 2, pp. 1062–1065 (2005). https://doi.org/10.1109/MAPE.2005.1618103

  8. Won, J.M., Karray, F.: Cumulative update of all-terminal reliability for faster feasibility decision. IEEE Trans. Reliab. 59(3), 551–562 (2010). https://doi.org/10.1109/TR.2010.2055924

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ICM and MG SB RAS, Prospekt Lavrentieva, 6, Novosibirsk, 630090, Russia

    Alexey S. Rodionov

  2. Siberian State University of Telecommunications and Information Sciences, Kirova str., 86, Novosibirsk, 630102, Russia

    Alexey S. Rodionov

Authors
  1. Alexey S. Rodionov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alexey S. Rodionov .

Editor information

Editors and Affiliations

  1. Intelligent Systems Research Institute, Sungkyunkwan University, Suwon, Korea (Republic of)

    Sukhan Lee

  2. Software Engineering, Universiti Kuala Lumpur, Kuala Lumpur, Malaysia

    Roslan Ismail

  3. College of Software, Sungkyunkwan University, Suwon, Korea (Republic of)

    Hyunseung Choo

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Rodionov, A.S. (2019). On Evaluating a Network Throughput. In: Lee, S., Ismail, R., Choo, H. (eds) Proceedings of the 13th International Conference on Ubiquitous Information Management and Communication (IMCOM) 2019. IMCOM 2019. Advances in Intelligent Systems and Computing, vol 935. Springer, Cham. https://doi.org/10.1007/978-3-030-19063-7_3

Download citation

Publish with us

Policies and ethics

Search

Navigation