期刊文献+

基于负载基尼系数的服务网络公平均衡调度 被引量:5

A fair and balanced load scheduling based on Gini coefficient for service networks
下载PDF
导出
摘要 针对组织结构较为稳定的区域内服务网络,提出了一种有监督的公平均衡负载调度算法。该算法受到经济学领域的收入分配基尼系数的启发,通过对网络负载分配基尼系数的监控,最终完成区域内服务任务的公平调度。给出了实现公平任务调度所需的系统结构和算法步骤,并通过仿真结果验证了该方法能有效完成服务网络任务均衡调度,具有较好的全局公平性。 We propose a supervised fair and load balance scheduling algorithm for task distribution in an intra-area service network with stable structure.The algorithm is inspired by the Gini coefficient of income distribution in the economics field.Through the monitoring of the Gini coefficient of network load distribution,the fair scheduling of service tasks in the area is finally completed.In this paper,the system structure and algorithm steps needed to achieve fair task scheduling are given.Simulation results show that the proposed method can effectively complete the task-balanced scheduling of service networks and has good global fairness.
作者 陈华鹏 林杰 CHEN Hua peng;LIN Jie(School of Economics and Management,Tongji University,Shanghai 201804;Department of Information,Zhejiang Technical Institute of Economics,Hangzhou 310018,China)
出处 《计算机工程与科学》 CSCD 北大核心 2018年第7期1155-1164,共10页 Computer Engineering & Science
基金 国家自然科学基金(71672128) 浙江省教育厅访工访学科研项目基金(Y201404) 浙江省人才资源和社会保障科学研究项目(R2013B019)
关键词 服务网络 公平调度 负载均衡 基尼系数 洛仑兹曲线 service network fair scheduling load balance Gini coefficient Lorenz curve
  • 相关文献

参考文献8

二级参考文献54

  • 1Jiang Y, Lin C, Wu J. Integrated performance evaluating criteria for network Ixaffic conlxol. In: Proceedings of IEEE Symposium on Computers and Communications 2001. Tunisia: IEEE Communications Society Press, 2001.
  • 2Cruz R L. A calculus for network delay, Part I: Network elements in isolation. IEEE Trans on Information Theory, 1991, 37(1):ll4-131.
  • 3Cruz R L. A calculus for network delay, Part II: Network analysis. IEEE Trans on Information Theory, 1991, 37(1): 132-141.
  • 4Kurose J. On computing per-session performance bounds in high-speed multi-hop computer networks. In: Proc of ACM Sigmetrics and Performance '92. New York: ACM Press, 1992. 128-134.
  • 5Yaron O, Sidi M. Performance and stability of communication networks via robust exponential bounds. IEEE/ACM Trans on Networking, 1993,1(3): 372-385.
  • 6Chang C S. Stability, queue length, and delay of deterministic and stochastic queueing networks. IEEE Trans on Automatic Control. 1994, 39(5): 913,-,931.
  • 7Hurley P, Boudec J L. A Proposal for an asymmetric best-effort service. In: Proceedings of IWQOS'99. London, 1999.129-132.
  • 8Pitsillides A, Stylianou G, Pattichis C, et al. Bandwidth allocation for virtual paths (BAVP): Investigation of performance of classical constrained and genetic algorithm based optimisation techniques. In: Proceedings of INFOCOM'2000, Tel Aviv,2000. 1379-1387.
  • 9Lin C, Shah Z, Yang Y. Integrated schemes of request dispatching and selecting in web server clusters. In: Proceedings of WCC2000. Beijing: Publishing House of Electronics Industry, 2000, 922-930.
  • 10Lin C, Sheng L, Wu J, et al. An integrative scheme of differentiated services. In: Proceedings of MASCOTS 2000. San Francisco, 2000. 441-448.

共引文献112

同被引文献36

引证文献5

二级引证文献17

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部