Skip to main content
SpringerLink
Log in

Maximum Throughput Network Routing Subject to Fair Flow Allocation

  • Conference paper
  • First Online:
Combinatorial Optimization (ISCO 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8596))

Included in the following conference series:

Abstract

We investigate a bilevel network routing problem where, given a directed graph with a capacity for each arc and a set of elastic traffic demands specified by the corresponding origin-destination pairs, the network operator has to select a single path for each pair so as to maximize the total throughput while assuming that the flows are allocated over the chosen paths according to a fairness principle. We consider max-min fair flow allocation as well as maximum bottleneck flow allocation. After presenting a complexity result, we discuss MILP formulations for the two problem versions, describe a Branch-and-Price algorithm and report some computational results.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Allalouf, M., Shavitt, Y.: Maximum flow routing with weighted max-min fairness. In: Solé-Pareta, J., Smirnov, M., Van Mieghem, P., Domingo-Pascual, J., Monteiro, E., Reichl, P., Stiller, B., Gibbens, R.J. (eds.) QofIS 2004. LNCS, vol. 3266, pp. 278–287. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Amaldi, E., Capone, A., Coniglio, S., Gianoli, L.G.: Network optimization problems subject to max-min fair flow allocation. IEEE Commun. Lett. 17(7), 1463–1466 (2013)

    Article  Google Scholar 

  3. Amaldi, E., Coniglio, S., Gianoli, L.G., Ileri, C.U.: On single-path network routing subject to max-min fair flow allocation. Electron. Notes Discrete Math. 41, 543–550 (2013)

    Article  Google Scholar 

  4. Andrews, M., Chuzhoy, J., Guruswami, V., Khanna, S., Talwar, K., Zhang, L.: Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs. Combinatorica 30(5), 485–520 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bertsekas, D., Gallager, R.: Data Networks. Prentice-Hall, Upper Saddle River (1992)

    MATH  Google Scholar 

  6. Danna, E., Hassidim, A., Kaplan, H., Kumar, A., Mansour, Y., Raz, D., Segalov, M.: Upward max min fairness. In: Proceedings IEEE INFOCOM 2012, pp. 837–845, March 2012

    Google Scholar 

  7. Danna, E., Mandal, S., Singh, A.: A practical algorithm for balancing the max-min fairness and throughput objectives in traffic engineering. In: Proceedings IEEE INFOCOM 2012, pp. 846–854, March 2012

    Google Scholar 

  8. Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theor. Comput. Sci. 10(2), 111–121 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  9. Harks, T., Hoefer, M., Schewior, K., Skopalik, A.: Routing games with progressive filling. CoRR abs/1308.3161, abs/1308.3161 (2013)

    Google Scholar 

  10. Kleinberg, J., Rabani, Y., Tardos, É.: Fairness in routing and load balancing. In: 40th Annual Symposium on Foundations of Computer Science (FOCS), pp. 568–578. IEEE (1999)

    Google Scholar 

  11. Massoulié, L., Roberts, J.: Bandwidth sharing: objectives and algorithms. IEEE/ACM Trans. Netw. 10(3), 320–328 (2002)

    Article  Google Scholar 

  12. Megiddo, N.: Optimal flows in networks with multiple sources and sinks. Math. Program. 7(1), 97–107 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  13. Nace, D., Pióro, M.: Max-min fairness and its applications to routing and load-balancing in communication networks: a tutorial. Commun. Surv. Tutorials 10(4), 5–17 (2008)

    Google Scholar 

  14. Nace, D., Doan, N.L., Klopfenstein, O., Bashllari, A.: Max-min fairness in multi-commodity flows. Comput. Oper. Res. 35(2), 557–573 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  15. Nilsson, P.: Fairness in communication and computer network design. Ph.D. thesis, Lund University, Sweden (2006)

    Google Scholar 

  16. Orlowski, S., Wessäly, R., Pióro, M., Tomaszewski, A.: SNDlib 1.0 - survivable network design library. Networks 55(3), 276–286 (2010)

    Google Scholar 

  17. Pioro, M.: Fair routing and related optimization problems. In: International Conference on Advanced Computing and Communications (ADCOM), pp. 229–235. IEEE (2007)

    Google Scholar 

  18. Radunovic, B., Boudec, J.Y.L.: A unified framework for max-min and min-max fairness with applications. IEEE/ACM Trans. Netw. 15(5), 1073–1083 (2007)

    Article  Google Scholar 

  19. Salles, R.M., Barria, J.A.: Lexicographic maximin optimisation for fair bandwidth allocation in computer networks. Eur. J. Oper. Res. 185(2), 778–794 (2008)

    Article  MATH  Google Scholar 

  20. Tomaszewski, A.: A polynomial algorithm for solving a general max-min fairness problem. Eur. Trans. Telecommun. 16(3), 233–240 (2005)

    Article  Google Scholar 

  21. Wong, R.: Integer programming formulations of the travelling salesman problem. In: Proceedings IEEE Conference on Circuits and Computers, pp. 149–152 (1980)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Elettronica, Informazione e Bioingegneria, Politecnico di Milano, Milan, Italy

    Edoardo Amaldi & Leonardo Taccari

  2. Lehrstuhl II Für Mathematik, RWTH Aachen University, Aachen, Germany

    Stefano Coniglio

Authors
  1. Edoardo Amaldi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefano Coniglio
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Leonardo Taccari
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Leonardo Taccari .

Editor information

Editors and Affiliations

  1. Univ Pierre et Marie Curie LIP6, Paris, France

    Pierre Fouilhoux

  2. Universidade de Lisboa, Lisbon, Portugal

    Luis Eduardo Neves Gouveia

  3. LAMSADE, Université Paris-Dauphine, Paris Cedex 16, France

    A. Ridha Mahjoub

  4. LAMSADE, Université Paris-Dauphine, Paris Cedex 16, France

    Vangelis T. Paschos

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Amaldi, E., Coniglio, S., Taccari, L. (2014). Maximum Throughput Network Routing Subject to Fair Flow Allocation. In: Fouilhoux, P., Gouveia, L., Mahjoub, A., Paschos, V. (eds) Combinatorial Optimization. ISCO 2014. Lecture Notes in Computer Science(), vol 8596. Springer, Cham. https://doi.org/10.1007/978-3-319-09174-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09174-7_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09173-0

  • Online ISBN: 978-3-319-09174-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation