Skip to main content
SpringerLink
Log in

Approximation algorithms for utility-maximizing network design problem

  • Conference paper
Progress in Systems Engineering

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

  • 3096 Accesses

Abstract

In this paper we consider the problem of selecting a collection of source-destination paths in a capacitated network in order to maximize the sum of concave utility functions. We show that the problem is NP-complete even for the iso-elastic utility functions. We provide deterministic and randomized algorithms that enable us to compute approximate solutions. We conclude the paper with results of computational experiments on example datasets.

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 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 329.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

Institutional subscriptions

References

  1. B. Awerbuch and Y. Azar. Buy-at-bulk network design. In: 38th Annual Symposium on Foundations of Computer Science, 1997, pages 542–547. IEEE, 1997.

    Google Scholar 

  2. M. Chiang, et al. Layering as optimization decomposition: A mathematical theory of network architectures. Proc. of the IEEE, 95(1):255–312, 2007.

    Article  Google Scholar 

  3. M. Drwal and D. Gasior. Utility-based rate control and capacity allocation in virtual networks. In Proc. of the 1st European Teletraffic Seminar, 2011.

    Google Scholar 

  4. M. Drwal and J. Jozefczyk. Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding. Annals of Operations Research, DOI: 10.1007/s10479-013-1330-7, 2013.

    Google Scholar 

  5. M. Garey and D. Johnson. Computers and intractability, Freeman New York, 1979.

    Google Scholar 

  6. D. Gasior and M. Drwal. Pareto-optimal Nash equilibrium in capacity allocation game for self-managed networks. Computer Networks, 57(14):2675–2868, 2013.

    Article  Google Scholar 

  7. D. Johnson, J.K. Lenstra, and A. Kan. The complexity of the network design problem. Networks, 8(4):279–285, 1978.

    Article  MathSciNet  MATH  Google Scholar 

  8. F. Kelly. Fairness and stability of end-to-end congestion control. European Journal of Control, 9(2-3):159–176, 2003.

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  10. T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM, 46(6), 1999.

    Google Scholar 

  11. P. Raghavan and C. Tompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica, 7(4):365–374, 1987.

    Article  MathSciNet  MATH  Google Scholar 

  12. J. Wang, L. Li, S. Low, and J. Doyle. Cross-layer optimization in TCP/IP networks. IEEE/ACM Transactions on Networking, 13(3):582–595, 2005.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Wrocław University of Technology, Wrocław, Poland

    Maciej Drwal

Authors
  1. Maciej Drwal
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Maciej Drwal .

Editor information

Editors and Affiliations

  1. University of Nevada at Las Vegas, Las Vegas, Nevada, USA

    Henry Selvaraj

  2. Department of Electrical Engineering, Idaho State University, Pocatello, Idaho, USA

    Dawid Zydek

  3. University of Nevada at Las Vegas, Las Vegas, Nevada, USA

    Grzegorz Chmaj

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Drwal, M. (2015). Approximation algorithms for utility-maximizing network design problem. In: Selvaraj, H., Zydek, D., Chmaj, G. (eds) Progress in Systems Engineering. Advances in Intelligent Systems and Computing, vol 366. Springer, Cham. https://doi.org/10.1007/978-3-319-08422-0_60

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08422-0_60

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08421-3

  • Online ISBN: 978-3-319-08422-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation