University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Priority Service Provisioning and Max-Min Fairness: A Utility-based Flow Control Approach

Jin, J, Palaniswami, M, Yuan, D, Dong, Y-N and Moessner, Klaus (2016) Priority Service Provisioning and Max-Min Fairness: A Utility-based Flow Control Approach Journal of Network and Systems Management, 25 (2). pp. 397-415.

[img] Text
J16_M-Priority Service Provisioning and Max-Min Fariness_A Utility-based....pdf - Accepted version Manuscript
Restricted to Repository staff only until 25 October 2017.
Available under License : See the attached licence file.

Download (171kB)
[img]
Preview
Text (licence)
SRI_deposit_agreement.pdf
Available under License : See the attached licence file.

Download (33kB) | Preview

Abstract

In this paper, a novel priority assignment scheme is proposed for priority service networks, in which each link sets its own priority threshold, namely, the lowest priority the link is willing to support for the incoming packets without causing any congestion. Aiming at a reliable transmission, the source then assigns each originated packet the maximum priority value required along its path, because links may otherwise discard the incoming packets which do not meet the corresponding priority requirements. It is shown that if each source sends the traffic at a rate that is reciprocal to the specified highest priority, a bandwidth max-min fairness is achieved in the network. Furthermore, if each source possesses a utility function of the available bandwidth and sends the traffic at a rate so that the associated utility is reciprocal to the highest link priority, a utility max-min fairness is achieved. For general networks without priority services, the resulting flow control strategy can be treated as a unified framework to achieve either bandwidth max-min fairness or utility max-min fairness through link pricing policy. More importantly, the utility function herein is only assumed to be strictly increasing and does not need to satisfy the strictly concave condition, the new algorithms are thus not only suitable for the traditional data applications with elastic traffic, but are also capable of handling real-time applications in the Future Internet.

Item Type: Article
Subjects : Electronic Engineering
Divisions : Faculty of Engineering and Physical Sciences > Electronic Engineering
Authors :
NameEmailORCID
Jin, JUNSPECIFIEDUNSPECIFIED
Palaniswami, MUNSPECIFIEDUNSPECIFIED
Yuan, DUNSPECIFIEDUNSPECIFIED
Dong, Y-NUNSPECIFIEDUNSPECIFIED
Moessner, KlausK.Moessner@surrey.ac.ukUNSPECIFIED
Date : 25 October 2016
Identification Number : 10.1007/s10922-016-9395-7
Copyright Disclaimer : The final publication is available at Springer via http://dx.doi.org/10.1007/s10922-016-9395-7
Uncontrolled Keywords : Priority assignment, congestion control, utility-fair resource allocation, Quality of Service, real-time application.
Related URLs :
Depositing User : Symplectic Elements
Date Deposited : 02 Nov 2016 10:05
Last Modified : 07 Jul 2017 13:24
URI: http://epubs.surrey.ac.uk/id/eprint/812701

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800