Skip to main content
Log in

An Upward Max-Min Fairness Multipath Flow Control

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

Many rate allocation algorithms for multipath flows which satisfy max-min fairness are centralized and not scalable. Upward max-min fairness is a well-known relaxation of max-min fairness and can be achieved by an algorithm extended from water-filling algorithm. In this paper, we propose a price-based multipath congestion control protocol whose equilibrium point satisfies upward max-min fairness. Our protocol is derived from a network utility maximization model for multipath flows.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Kelly FP, Maulloo AK, Tan DKH (1998) Rate control for communication networks: Shadow prices, proportional fairness and stability. Journal of the Operational Research Society 49(3):237–252

    Article  Google Scholar 

  2. Low S, Lapsley D (1999) Optimization flow control, i: Basic algorithm and convergence. IEEE/ACM Trans Netw 7(6):861–874

    Article  Google Scholar 

  3. Wydrowski B, Zukerman M (2002) MaxNet: A congestion control architecture. IEEE Commun Lett 6 (11):512–514

    Article  Google Scholar 

  4. Wydrowski B, Andrew L, Zukerman M (2003) Maxnet: a congestion control architecture for scalable network. IEEE Communications Letters 7(10):511–513

    Article  Google Scholar 

  5. Wischik D, Handley M, Raiciu C (2009). In: Núñez-Queija R, Resing J (eds) Control of multipath TCP and optimization of multipath routing in the internet, ser. Lecture Notes in Computer Science. Springer , Berlin, p 5894

  6. Vo PL, Le AT, Hong CS (2012) The successive approximation approach for multi-path utility maximization problem. In: IEEE ICC’12

  7. Han H, Shakkottai S, Hollot CV, Srikant R, Towsley D (2006) Multi-path TCP: A joint congestion control and routing scheme to exploit path diversity in the internet, vol 14

  8. Nace D, Pioro M (2008) Max-min fairness and its applications to routing and load-balancing in communication networks: a tutorial. IEEE Communications Surveys Tutorials 10(4):5–17

    Article  Google Scholar 

  9. Bertsekas D, Gallager R (1992) Data networks, 2nd edn. Prentice-Hall Inc., Upper Saddle River

    MATH  Google Scholar 

  10. Mo J, Walrand J (2000) Fair end-to-end window-based congestion control. IEEE/ACM Trans Netw 8 (5):556–567

    Article  Google Scholar 

  11. Danna E, Hassidim A, Kaplan H, Kumar A, Mansour Y, Raz D, Segalov M (2017) Upward Max-Min Fairness. J ACM (JACM) 64(1):2

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This research is funded by Vietnam National Foundation for Science and Technology Development (NAFOSTED) under grant number 102.02-2015.36. Dr. Tuan-Anh Le is the corresponding author.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Phuong L. Vo.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Vo, P.L., Le, TA. & Tran, N.H. An Upward Max-Min Fairness Multipath Flow Control. Mobile Netw Appl 25, 1174–1177 (2020). https://doi.org/10.1007/s11036-019-01436-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-019-01436-y

Keywords

Navigation