Skip to main content

Effects of Utility Functions on Network Response Time and Optimization

  • Chapter
Software and Network Engineering

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

  • 758 Accesses

Abstract

Network optimization is a classic and effective approach for allocating network resources in such a way that certain measure of the network utilization is optimized. Network models and algorithms have been proposed and developed for solving the optimization problems. However, we haven’t seen studies on the effect of the utility functions on the network response time when the overall utilization of the network is maximized. In this paper, we investigate this problem with simulation experiments on a simple 4-node network using two different utility functions, a logarithmic function and a linear function. We fine tune the network transmission rates near their optimal values on several routes and observe the network response time. Our preliminary study showed that different utility functions do have impact on the response time on individual routes.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.S.: A general approach to online network optimization problems. ACM Transactions on Algorithms 2(4), 640–660 (2006)

    Article  MathSciNet  Google Scholar 

  2. Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Mathematical Programming 98(1), 49–71 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chiu, D.M., Jain, R.: Analysis of the increase and decrease algorithms for congestion avoidance in computer networks. Computer Networks ISDN Systems 17(1), 1–14 (1989)

    Article  MATH  Google Scholar 

  4. Jacobson, V., Karels, M.J.: Congestion avoidance and control. ACM Computer Communication Review 18(4), 314–329 (1988)

    Article  Google Scholar 

  5. Kelly, F.: Charging and rate control for elastic traffic. European Transactions on Telecommunications 8, 33–37 (1997)

    Article  Google Scholar 

  6. Kelly, F., Maulloo, A.K., Tan, D.: Rate control in communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society 49(3), 237–252 (1998)

    MATH  Google Scholar 

  7. Kuhn, H.W., Tucker, A.W.: Nonlinear programming. In: Second Berkeley Symposium on Mathematical Statistics and Probability, pp. 481–492. University of California Press (1951)

    Google Scholar 

  8. Shakkottai, S., Srikant, R.: Network optimization and control. Foundations and Trends in Networking 2(3), 271–379 (2008)

    Article  Google Scholar 

  9. Stolyar, A.L.: Maximizing queueing network utility subject to stability: Greedy primal-dual algorithm. Queueing Systems 50, 401–457 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  10. Walton, N.S.: Utility optimization in congested queuing networks. Journal of Applied Probability 48(1), 68–89 (2011)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chris Johns .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag GmbH Berlin Heidelberg

About this chapter

Cite this chapter

Johns, C., Mak, K., Hu, G., Feng, W. (2012). Effects of Utility Functions on Network Response Time and Optimization. In: Lee, R. (eds) Software and Network Engineering. Studies in Computational Intelligence, vol 413. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28670-4_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28670-4_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28669-8

  • Online ISBN: 978-3-642-28670-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics