Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Maximum Flow Routing with Weighted Max-Min Fairness

  • Conference paper
Quality of Service in the Emerging Networking Panorama (WQoSR 2004, QofIS 2004, ICQT 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3266))

Abstract

Max-min is an established fairness criterion for allocating bandwidth for flows. In this work we look at the combined problem of multi-path routing and bandwidth allocation such that the flow allocation for each connection will be maximized and fairness will be maintained. We use the weighted extension of the max-min criterion to allocate bandwidth in proportion to the flows’ demand. Our contribution is an algorithm which, for the first time, solves the combined routing and bandwidth allocation problem for the case where flows are allowed to be splitted along several paths. We use multi commodity flow (MCF) formulation which is solved using linear programming (LP) techniques. These building blocks are used by our algorithm to derive the required optimal routing and allocation.

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

Access this chapter

Log in via an institution

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
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Marbach, P.: Priority service and max-min fairness. IEEE/ACMTransactions on Networking 11, 733–746 (2003)

    Article  Google Scholar 

  2. Bertsekas, D., Gallager, R.: Data Networks, 2nd edn. Prentice Hall, Englewood Cliffs (1992)

    MATH  Google Scholar 

  3. Chen, S., Nahrstedt, K.: Maxmin fair routing in connection-oriented networks. In: Proceedings of Euro-Parallel and Distributed Systems Conference (Euro-PDS 1998), pp. 163–168 (1998)

    Google Scholar 

  4. Afek, Y., Mansour, Y., Ostfeld, Z.: Phantom: a simple and effective flow control scheme. Computer Networks 32, 277–305 (2000)

    Article  Google Scholar 

  5. Awerbuch, B., Shavitt, Y.: Converging to approximated max-min flowfairness in logarithmic time. In: INFOCOM, vol. (2), pp. 1350–1357 (1998)

    Google Scholar 

  6. Bartal, Y., Farach-Colton, M., Yooseph, S., Zhang, L.: Fast, fair, and frugal bandwidth allocation in atm networks. Algorithmica (special issue on Internet Algorithms) 33, 272–286 (2002)

    MATH  MathSciNet  Google Scholar 

  7. Bartal, Y., Byers, J., Raz, D.: Global optimization using local information with applications to flowcontrol. In: The 38th Ann. IEEE Symp. on Foundations of Computer Science, FOCS (1997)

    Google Scholar 

  8. Kelly, F.P., Maulloo, A.K., Tan, D.K.H.: Rate control for communication networks: Shadow prices, proportional fairness and stability. Operational Research Society 49, 237–252 (1998)

    MATH  Google Scholar 

  9. Mo, J., Warland, J.: Fair end-to-end window-based congestion control. IEEE/ACM Transactions on Networking 8, 556–567 (2000)

    Article  Google Scholar 

  10. Hochbaum, D.S.: Approximation Algorithms for NP-Hard Problems. PWS Publishing Company (1997)

    Google Scholar 

  11. Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)

    Google Scholar 

  12. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (2001)

    MATH  Google Scholar 

  13. Shahroki, F., Matula, D.W.: The maximum concurrent flow problem. Journal of the ACM 37, 318–334 (1990)

    Article  Google Scholar 

  14. Plotkin, S.A., Shmoys, D.B., Tardos, E.: Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research 20, 257–301 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  15. Cheriyan, J., Karloff, H., Rabani, Y.: Approximating directed multicuts. In: FOCS, pp. 291–301 (2001)

    Google Scholar 

  16. Ott, T., Bogovic, T., Carpenter, T., Krishnan, K.R., Shallcross, D.: Algorithm for flow allocation for multi protocol label switching. Research report, Telcordia, Telcordia Technical Memorandum TM-26027 (2001)

    Google Scholar 

  17. Mitra, D., Ramakrishnan, K.: A case study of multiservice, multipriority traffic engineering design for data networks. In: IEEE GLOBECOM, pp. 1077–1083 (1999)

    Google Scholar 

  18. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Networks Flows. Prentice-Hall, NewJersey (1993)

    MATH  Google Scholar 

  19. Allalouf, M., Shavitt, Y.: Fast approximation algorithm for weighted max-min fairness with maximum flow routing. Technical Report EES2004-1, Tel Aviv University (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electrical Engineering, Tel Aviv University,  

    Miriam Allalouf & Yuval Shavitt

Authors
  1. Miriam Allalouf
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuval Shavitt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Architecture Dept., Jordi Girona, Technical University of Catalonia (UPC), 1-3 (Campus Nord D6), 08034, Barcelona, Spain

    Josep Solé-Pareta

  2. Fraunhofer Institut FOKUS, Kaiserin-Augusta Allee 31, 10589, Berlin, Germany

    Michael Smirnov

  3. Delft University of Technology,  

    Piet Van Mieghem

  4. Advanced Broadband Communications Centre, Technical University of Catalunya (UPC), Spain

    Jordi Domingo-Pascual

  5. University of Coimbra, CISUC/DEI, Coimbra, Portugal

    Edmundo Monteiro

  6. Telecommunications Research Center Vienna (ftw.), Donau-City-Str. 1, 1220, Vienna, Austria

    Peter Reichl

  7. Department of Informatics IFI, University of Zurich, Binzmühlestrasse 14, CH—8050, Zürich, Switzerland

    Burkhard Stiller

  8. Computer Laboratory, University of Cambridge, 15 JJ Thomson Avenue, CB 3 0FD, Cambridge, UK

    Richard J. Gibbens

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Allalouf, M., Shavitt, Y. (2004). Maximum Flow Routing with Weighted Max-Min Fairness. In: Solé-Pareta, J., et al. Quality of Service in the Emerging Networking Panorama. WQoSR QofIS ICQT 2004 2004 2004. Lecture Notes in Computer Science, vol 3266. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30193-6_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30193-6_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23238-4

  • Online ISBN: 978-3-540-30193-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation