通信学报 ›› 2013, Vol. 34 ›› Issue (Z1): 216-222.doi: 10.3969/j.issn.1000-436x.2013.z1.028

• 技术报告 • 上一篇    下一篇

面向服务组合的密码服务调度智能优化研究

李建军1,2,郁滨1,陈武平2   

  1. 1 信息工程大学 密码工程学院,河南 郑州 450004
    2 信息保障技术重点实验室,北京 100072
  • 出版日期:2013-08-25 发布日期:2017-06-23
  • 基金资助:
    国家重点基础研究发展计划(“973计划)基金资助项目;信息保障技术重点实验室开放基金资助项目

Research on intelligent optimization of cryptogram service scheduling for service composition

Jian-jun LI1,2,Bin YU1,Wu-ping CHEN2   

  1. 1 Institute of Cryptographic Engineering, Information Engineering University, Zhengzhou 450004, China
    2 Science and Technology on Information Assurance Laboratory, Beijing 100072, China
  • Online:2013-08-25 Published:2017-06-23
  • Supported by:
    The National Basic Research Program of China (973 Program);Open Fund of Science and Technology on Information Assurance Laboratory

摘要:

为了提高密码服务的质量,提出了一种面向服务组合的密码服务体系结构,并针对其中的密码服务调度问题提出了一种改进的混合离散蛙跳算法。该算法利用传统混合蛙跳算法的基本框架,重新设计了编码和解码方式以及个体矢量更新方法。同时为了提高搜索的精度,利用6种邻域结构,结合变邻域搜索算法,对组内最优青蛙进行优化。最后分别进行了标准算例对比实验与模拟仿真实验,结果验证了算法高效的寻优能力以及合理地实现了服务组合的优化, 满足了用户的需求, 符合现实情况。

关键词: 密码服务调度, 混合离散蛙跳算法, 体系结构, 邻域结构, 局部搜索

Abstract:

To improve the quality of cryptogram service, the cryptogram service architecture for service composition was proposed. And a hybrid discrete shuffled frog-leaping algorithm was proposed to solve cryptogram service scheduling problem. It uses the basic framework of the traditional frog-leaping algorithm and designs the encoding and decoding ac-cording. The corresponding individual vector updating method was re-designed. To improve search accuracy, the pro-posed algorithm was improved with six neighborhoods to optimize the best frog of the group and combined with variable neighborhood search algorithm. The proposed algorithm was tested on a set of standard instances and simulation experi-ments. The results show the effectiveness of the algorithms, and an optimal path to fulfill the users' request have been formed. It is suitable for the real life environment.

Key words: cryptogram service scheduling problem, hybrid discrete shuffled frog-leaping algorithm, architecture, neighbor-hood, local search

No Suggested Reading articles found!