mk:admnet14

Summary

Maxmin Fairness under Priority for Network Resource Allocation Tasks. Mario Köppen, Kei Ohnishi and Masato Tsuru. In Computer Software and Applications Conference Workshops (COMPSAC 2014), 2014 IEEE 38th International, pages 49-54. IEEE, July 2014.

Abstract

Many network control policies can benefit from introducing priorities among users, traffic flows, or service provisions e.g. for QoS? improvement or network congestion avoidance. In order to ensure fairness of concomitant resource sharing tasks, generic extensions of maxmin fairness under priority are considered. A critical analysis of existing approaches leads to the definition of two fairness relations based on formal modifications of the maxmin fairness standard of comparison. One is based on using priority functions for internal weighting, the other on priority classes. Experimental evaluation shows that maximizing under these relations indeed gives relations close to maxmin fairness that take priorities into account such that higher priority users receive higher allocations in average. Further studying the wireless channel allocation model problem shows that prioritizing can give solutions of higher efficiency than maxmin fairness.

Bibtex entry

@INPROCEEDINGS { mk:admnet14,
    ABSTRACT = { Many network control policies can benefit from introducing priorities among users, traffic flows, or service provisions e.g. for QoS? improvement or network congestion avoidance. In order to ensure fairness of concomitant resource sharing tasks, generic extensions of maxmin fairness under priority are considered. A critical analysis of existing approaches leads to the definition of two fairness relations based on formal modifications of the maxmin fairness standard of comparison. One is based on using priority functions for internal weighting, the other on priority classes. Experimental evaluation shows that maximizing under these relations indeed gives relations close to maxmin fairness that take priorities into account such that higher priority users receive higher allocations in average. Further studying the wireless channel allocation model problem shows that prioritizing can give solutions of higher efficiency than maxmin fairness. },
    AUTHOR = { Mario Köppen and Kei Ohnishi and Masato Tsuru },
    BOOKTITLE = { Computer Software and Applications Conference Workshops (COMPSAC 2014), 2014 IEEE 38th International },
    ADDED = { 2014-10-16 06:23:52 +0000 },
    MODIFIED = { 2014-10-16 06:57:12 +0000 },
    MONTH = { July },
    ORGANIZATION = { IEEE },
    PAGES = { 49-54 },
    PDF = { admnet14.pdf },
    TITLE = { Maxmin Fairness under Priority for Network Resource Allocation Tasks },
    YEAR = { 2014 },
}

On small computer displays, you can hide this right bar by using the 'Hide' button above.

News

Next conferences COMPSAC 2014 (Vasteras, Sweden, July 2014), INCoS-2014 (Salerno, Italy, September 2014).

New edited book "Soft Computing in Industrial Applications", V. Snasel, P. Kroemer, M. Koeppen, G. Schaefer, Springer AISC 223, July 2013.