首页> 中文期刊> 《电力系统及其自动化学报》 >能源互联网中区分服务的队列调度算法

能源互联网中区分服务的队列调度算法

         

摘要

为保证能源互联网各级自治单元信息的高效流动,促进通信过程中业务间的相对公平,设计了一种基于最大等待时间的队列调度算法.将业务进行重要度分类,在发生节点拥塞的时候,对重要业务的数据包优先传送,同时根据各数据包的最大等待时间,对其在节点内等待的时间进行有效控制,以保证业务数据的高效传输.通过仿真的方式对比了该队列调度算法与经典调度算法的调度效果.结果表明所提算法缓解低重要度业务的"Starva?tion"现象性能更优,证明了该队列调度算法可有效提升能源互联网中通信过程的可靠性.%In order to ensure the overall efficiency of inter service transmission in the energy internet communication network,and to promote the relative fairness among the business in the process of communication,a queue scheduling algorithm for energy internet was designed. Packets were given different degrees of importance depending on the type of business when packets were congested,the packets containing the important services were transmitted first. At the same time according to the maximum waiting time of each packet,the waiting time in the node was effectively con-trolled to ensure high-quality business data transmission. The performance of this scheduling algorithm was compared with other algorithm by simulation. The results showed that the algorithm proposed in this paper had better performance which made the"starvation phenomenon"of less importance degree packets reduce,proving that the queue scheduling algorithm can effectively improve the scheduling efficiency and the reliability of communication services in the energy internet.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号