Skip to main content

Network Design via Flow Optimization

  • Chapter
  • 378 Accesses

Part of the book series: Studies in Computational Intelligence ((SCI,volume 56))

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Albert and A.-L. Barabási. Statistical mechanizm of complex network. Review of Modern Physics, 74, 2002.

    Google Scholar 

  2. A.-L. Barabási and R. Albert. Emergence of scaling in random networks. Science, 286, 1999.

    Google Scholar 

  3. S. N. Dorogovtsev and J. F. F. Mendes. Evolution of networks. Advances in Physics, 51(4), 2002.

    Google Scholar 

  4. P. Erdós and A. Rényi. On random graphs. Publicationes Mathematicae, 6, 1959.

    Google Scholar 

  5. R. E. Gomory and T. C. Hu. Synthesis of a communication network. J. SIAM,12(2),1961.

    Google Scholar 

  6. T. C. Hu. Multi-commodity network flows. J. ORSA, 15(2), 1967.

    Google Scholar 

  7. T. Kenyon. High-performance data network disign: design techniques and tools. Butterworth-Heinemann, 2002.

    Google Scholar 

  8. L. Kleinrock. Queueing systems, volume 1. Wiley-Interscience, 1975.

    Google Scholar 

  9. J. Little. A proof of the queueing formula l = λw. Operetions Resesearch, 9, 1961.

    Google Scholar 

  10. Y. Matsumura, H. Kawamura, and A. Ohuchi. Desirable design methodology for queueing networks. In Proc. of the First International Workshop on Artificial Computational Economics & Social Simulation 2005, 2005.

    Google Scholar 

  11. Y. Matsumura, H. Kawamura, and A. Ohuchi. Desirable design of queueing networks excluding linking costs. In Proc. of the Workshop on Emergent Intelligence on Networked Agents (WEIN ’ 06), 2006.

    Google Scholar 

  12. S. H. Strogatz. Exploring complex networks. Nature, 410, 2001.

    Google Scholar 

  13. D. J. Watts. Nature, 393(440), 1998.

    Google Scholar 

  14. W. Whitt. A review of l = λw and extensions. Queueing Systems, 9(3), 1991.

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Matsumura, Y., Kawamura, H., Kurumatani, K., Ohuchi, A. (2007). Network Design via Flow Optimization. In: Namatame, A., Kurihara, S., Nakashima, H. (eds) Emergent Intelligence of Networked Agents. Studies in Computational Intelligence, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71075-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71075-2_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71073-8

  • Online ISBN: 978-3-540-71075-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics