基于公平的用户中心网络全局优化

M. Köppen, Kaori Yoshida, M. Tsuru, Y. Oie
{"title":"基于公平的用户中心网络全局优化","authors":"M. Köppen, Kaori Yoshida, M. Tsuru, Y. Oie","doi":"10.1109/NCM.2009.219","DOIUrl":null,"url":null,"abstract":"In this paper, we discuss the opportunities for global optimization of networks, which takes the user perspective into account. We state three fundamental problems in this approach, which are the variable (and usually also large) number of objectives, the Arrow impossibility theorem, and the unavoidance of the fact that the feasible space may contain solutions, where some objectives are extreme. To overcome these problems, we propose to achieve at least fairness among the fulfillment of user objectives, if optimality (e.g. in the sense of Pareto-optimality) is not possible. We also outline a generalized approach to fairness, based on fairness relation. Heuristic methods are available to handle the corresponding search problems.","PeriodicalId":119669,"journal":{"name":"2009 Fifth International Joint Conference on INC, IMS and IDC","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Fairness-Based Global Optimization of User-Centric Networks\",\"authors\":\"M. Köppen, Kaori Yoshida, M. Tsuru, Y. Oie\",\"doi\":\"10.1109/NCM.2009.219\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we discuss the opportunities for global optimization of networks, which takes the user perspective into account. We state three fundamental problems in this approach, which are the variable (and usually also large) number of objectives, the Arrow impossibility theorem, and the unavoidance of the fact that the feasible space may contain solutions, where some objectives are extreme. To overcome these problems, we propose to achieve at least fairness among the fulfillment of user objectives, if optimality (e.g. in the sense of Pareto-optimality) is not possible. We also outline a generalized approach to fairness, based on fairness relation. Heuristic methods are available to handle the corresponding search problems.\",\"PeriodicalId\":119669,\"journal\":{\"name\":\"2009 Fifth International Joint Conference on INC, IMS and IDC\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-08-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Fifth International Joint Conference on INC, IMS and IDC\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NCM.2009.219\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Fifth International Joint Conference on INC, IMS and IDC","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCM.2009.219","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

在本文中,我们讨论了考虑到用户视角的网络全局优化的机会。我们在此方法中陈述了三个基本问题,即可变(通常也是大量)目标数量,阿罗不可能定理,以及不可避免的事实,即可行空间可能包含解决方案,其中一些目标是极端的。为了克服这些问题,我们建议在不可能实现最优性(例如在帕累托最优性意义上)的情况下,至少在用户目标的实现中实现公平。我们还提出了一种基于公平关系的广义公平方法。启发式方法可用于处理相应的搜索问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Fairness-Based Global Optimization of User-Centric Networks
In this paper, we discuss the opportunities for global optimization of networks, which takes the user perspective into account. We state three fundamental problems in this approach, which are the variable (and usually also large) number of objectives, the Arrow impossibility theorem, and the unavoidance of the fact that the feasible space may contain solutions, where some objectives are extreme. To overcome these problems, we propose to achieve at least fairness among the fulfillment of user objectives, if optimality (e.g. in the sense of Pareto-optimality) is not possible. We also outline a generalized approach to fairness, based on fairness relation. Heuristic methods are available to handle the corresponding search problems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Based on Improved BP Neural Network to Forecast Demand for Spare Parts Integrated Network Management Certification Training with Computer Game: A Knowledge Placement Framework Improving Scalability for RFID Privacy Protection Using Parallelism A Brand-New Mobile Value-Added Service: M-Check A Uniform Construction of New Exact Travelling Wave Solutions and its Applications
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1