IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v11y2019i2p39-d204596.html
   My bibliography  Save this article

A Mathematical Model for Efficient and Fair Resource Assignment in Multipath Transport

Author

Listed:
  • Andreas Könsgen

    (Sustainable Communication Networks, University of Bremen, 28359 Bremen, Germany)

  • Md. Shahabuddin

    (Sustainable Communication Networks, University of Bremen, 28359 Bremen, Germany)

  • Amanpreet Singh

    (Sustainable Communication Networks, University of Bremen, 28359 Bremen, Germany)

  • Anna Förster

    (Sustainable Communication Networks, University of Bremen, 28359 Bremen, Germany)

Abstract

Multipath transport protocols are aimed at increasing the throughput of data flows as well as maintaining fairness between users, which are both crucial factors to maximize user satisfaction. In this paper, a mixed (non)linear programming (MINLP) solution is developed which provides an optimum solution to allocate link capacities in a network to a number of given traffic demands considering both the maximization of link utilization as well as fairness between transport layer data flows or subflows. The solutions of the MINLP formulation are evaluated w. r. t. their throughput and fairness using well-known metrics from the literature. It is shown that network flow fairness based capacity allocation achieves better fairness results than the bottleneck-based methods in most cases while yielding the same capacity allocation performance.

Suggested Citation

  • Andreas Könsgen & Md. Shahabuddin & Amanpreet Singh & Anna Förster, 2019. "A Mathematical Model for Efficient and Fair Resource Assignment in Multipath Transport," Future Internet, MDPI, vol. 11(2), pages 1-40, February.
    • Handle: RePEc:gam:jftint:v:11:y:2019:i:2:p:39-:d:204596
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/11/2/39/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1999-5903/11/2/39/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jftint:v:11:y:2019:i:2:p:39-:d:204596. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.