IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v65y2014i10p1562-1570.html
   My bibliography  Save this article

On the rate allocation problem under co-existence of uncertain utility function parameters and uncertain link capacities

Author

Listed:
  • Dariusz Gąsior

    (Wroclaw University of Technology, Wroclaw, Poland)

  • Donat Orski

    (Wroclaw University of Technology, Wroclaw, Poland)

Abstract

The allocation problem is considered for a computer communication network with network links being shared among multiple transmissions running at the same time. Typically, each transmission brings benefit to a network owner proportional to the transmission rate allowed. Since the link capacities are limited and the minimal rates defined by Quality of Service (QoS) requirements have to be preserved, the rate allocation problem is defined here as a problem of maximizing the overall benefit (utility) under capacity and QoS constraints. In this paper, we consider the uncertain version of the problem, in which unknown utility function parameters and unknown link capacities are treated as uncertain variables characterized by certainty distributions. We present a method for solving the problem in a unified way, with both uncertainties combined in a single certainty index.

Suggested Citation

  • Dariusz Gąsior & Donat Orski, 2014. "On the rate allocation problem under co-existence of uncertain utility function parameters and uncertain link capacities," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 65(10), pages 1562-1570, October.
    • Handle: RePEc:pal:jorsoc:v:65:y:2014:i:10:p:1562-1570
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v65/n10/pdf/jors2013113a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v65/n10/full/jors2013113a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    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:pal:jorsoc:v:65:y:2014:i:10:p:1562-1570. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.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.