Evolutionary Approach to Maxmin-Fair Network-Resource Allocation

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Mario K?ppen Articles by Masato Tsuru Articles by Yuji Oie

2008 International Symposium on Applications and the Internet

July 28-August 01

ISBN: 978-0-7695-3297-4

	ASCII Text	x
	Mario K?ppen, Masato Tsuru, Yuji Oie, "Evolutionary Approach to Maxmin-Fair Network-Resource Allocation," Applications and the Internet, IEEE/IPSJ International Symposium on, pp. 253-256, 2008 International Symposium on Applications and the Internet, 2008.

	BibTex	x
	@article{ 10.1109/SAINT.2008.91, author = {Mario K?ppen and Masato Tsuru and Yuji Oie}, title = {Evolutionary Approach to Maxmin-Fair Network-Resource Allocation}, journal ={Applications and the Internet, IEEE/IPSJ International Symposium on}, volume = {0}, year = {2008}, isbn = {978-0-7695-3297-4}, pages = {253-256}, doi = {http://doi.ieeecomputersociety.org/10.1109/SAINT.2008.91}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Applications and the Internet, IEEE/IPSJ International Symposium on TI - Evolutionary Approach to Maxmin-Fair Network-Resource Allocation SN - 978-0-7695-3297-4 SP253 EP256 A1 - Mario K?ppen, A1 - Masato Tsuru, A1 - Yuji Oie, PY - 2008 KW - maxmin-fairness KW - multi-objective optimization KW - evolutionary multi-objective optimization KW - SPEA2 KW - network resource allocation VL - 0 JA - Applications and the Internet, IEEE/IPSJ International Symposium on ER -

Mario K?ppen

Masato Tsuru

Yuji Oie

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SAINT.2008.91

This paper presents an evolutionary approach to the finding of maxmin-fair solutions of the general network resource allocation problem. From the definition of maxmin-fairness, a general relation among real points is derived that can be used to replace the role of the Pareto-dominance relation in Evolutionary Multi-Objective Search algorithms. The approach has been demonstrated by modifying the SPEA2 algorithm in this manner and testing it on some problems with known fairness points. In all the studied cases, the algorithm could achieve the correct fairness points, and the search effort scaled moderately with increasing problem dimension. Since maxmin-fair points also belong to the Pareto-front, the approach is also of interest for multi-objective optimization in general.

Index Terms:

maxmin-fairness, multi-objective optimization, evolutionary multi-objective optimization, SPEA2, network resource allocation

Citation:

Mario K?ppen, Masato Tsuru, Yuji Oie, "Evolutionary Approach to Maxmin-Fair Network-Resource Allocation," saint, pp.253-256, 2008 International Symposium on Applications and the Internet, 2008

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.