mk:incos10

Summary

Fuzzification of Maxmin Fairness Relation based on Subvector Dominance Degree. Mario Köppen, Kaori Yoshida and Masato Tsuru. In Proc. 2nd International Conference on Intelligent Networking and Collaborative Systems (INCoS 2010), Thessaloniki, Greece, pages 344-349, November 2010.

Abstract

Maxmin fairness can be characterized as a state obtained from the application of the bottleneck flow control algorithm, allowing for a formally efficient definition of a fairness concept. But a number of problems with the related maxmin fairness vector relation, esp. non-uniqueness of the maximum, preference for improving least components, artefacts appearing in the discrete domain, and lack of numerical representation have already been noted. For this reason, we propose a fuzzy fairness, based on subvector dominance. The fuzzy fairness, here called subvector maxmin dominance degree, is based on the ratio of the number of all maxmin fair dominating subvectors to the number of all possible subvectors. It is shown how this definition extends the maxmin fairness relation, how it helps to solve the problems with maxmin fairness, and how it numerically emphasises fairness states against other states.

Bibtex entry

@INPROCEEDINGS { mk:incos10,
    ABSTRACT = { Maxmin fairness can be characterized as a state obtained from the application of the bottleneck flow control algorithm, allowing for a formally efficient definition of a fairness concept. But a number of problems with the related maxmin fairness vector relation, esp. non-uniqueness of the maximum, preference for improving least components, artefacts appearing in the discrete domain, and lack of numerical representation have already been noted. For this reason, we propose a fuzzy fairness, based on subvector dominance. The fuzzy fairness, here called subvector maxmin dominance degree, is based on the ratio of the number of all maxmin fair dominating subvectors to the number of all possible subvectors. It is shown how this definition extends the maxmin fairness relation, how it helps to solve the problems with maxmin fairness, and how it numerically emphasises fairness states against other states. },
    AUTHOR = { Mario Köppen and Kaori Yoshida and Masato Tsuru },
    BOOKTITLE = { Proc. 2nd International Conference on Intelligent Networking and Collaborative Systems (INCoS 2010), Thessaloniki, Greece },
    ADDED = { 2010-09-24 17:33:13 +0900 },
    MODIFIED = { 2011-03-31 15:31:33 +0900 },
    DOI = { http://doi.ieeecomputersociety.org/10.1109/INCOS.2010.45 },
    ISBN = { 978-0-7695-4278-2 },
    MONTH = { November },
    PAGES = { 344-349 },
    PUBLISHER = { IEEE Computer Society },
    TITLE = { Fuzzification of Maxmin Fairness Relation based on Subvector Dominance Degree },
    YEAR = { 2010 },
    1 = { http://doi.ieeecomputersociety.org/10.1109/INCOS.2010.45 },
}

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.