• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Sun Liyang, Li Yang, Lin Jianning, Mao Shaojie, Liu Zhong. Community Service Selection Algorithm for Network Simulation Task[J]. Journal of Computer Research and Development, 2014, 51(3): 650-660.
Citation: Sun Liyang, Li Yang, Lin Jianning, Mao Shaojie, Liu Zhong. Community Service Selection Algorithm for Network Simulation Task[J]. Journal of Computer Research and Development, 2014, 51(3): 650-660.

Community Service Selection Algorithm for Network Simulation Task

More Information
  • Published Date: March 14, 2014
  • Net-centric simulation (NCS) is a new simulation mode, which provides a brand new method to support distributed simulation in WAN. To meet different users' requirements, building a new simulation task community (STC) dynamically by integrating distributed various services on network is the key problem of NCS. A simulation task community service selection algorithm (STCSSA) is proposed. It aims at the building of STC and adopts an improved particle swarm optimization (PSO) which overcomes the shortcomings of traditional PSO. The essence of the algorithm is that the problem of STC construction is transformed into a multi-objective service selection optimization with QoS constraints. Firstly, QoS model of STC service and the evaluation of STC composition process is described. Then, STCSSA is introduced in terms of the function steps, including a dynamic inertia weight strategy and an alternative method of mutation. Finally, several experiments are conducted to test STCSSA. On the one hand, STCSSA is tested with typical functions to prove the proposed algorithm can not only improve the convergence speed of service options, but also avoid the algorithm going into a local optimum. On the other hand, practical application is presented in detail. STCSSA is utilized to help a military STC search simulation services. Compared with some other PSO algorithms, STCSSA can effectively support large-scaled STC construction in NCS environment.
  • Related Articles

    [1]Jiang Tao, Li Zhanhuai. A Survey on Local Pattern Mining in Gene Expression Data[J]. Journal of Computer Research and Development, 2018, 55(11): 2343-2360. DOI: 10.7544/issn1000-1239.2018.20170629
    [2]Ding Zhaoyun, Jia Yan, Zhou Bin. Survey of Data Mining for Microblogs[J]. Journal of Computer Research and Development, 2014, 51(4): 691-706.
    [3]Liu Dayou, Chen Huiling, Qi Hong, and Yang Bo. Advances in Spatiotemporal Data Mining[J]. Journal of Computer Research and Development, 2013, 50(2): 225-239.
    [4]Lei Xiangxin, Yang Zhiying, Huang Shaoyin, Hu Yunfa. Mining Frequent Subtree on Paging XML Data Stream[J]. Journal of Computer Research and Development, 2012, 49(9): 1926-1936.
    [5]Liao Guoqiong, Wu Lingqin, Wan Changxuan. Frequent Patterns Mining over Uncertain Data Streams Based on Probability Decay Window Model[J]. Journal of Computer Research and Development, 2012, 49(5): 1105-1115.
    [6]Zhu Ranwei, Wang Peng, and Liu Majin. Algorithm Based on Counting for Mining Frequent Items over Data Stream[J]. Journal of Computer Research and Development, 2011, 48(10): 1803-1811.
    [7]Hu Wenyu, Sun Zhihui, Wu Yingjie. Study of Sampling Methods on Data Mining and Stream Mining[J]. Journal of Computer Research and Development, 2011, 48(1): 45-54.
    [8]Yang Bingru, Gao Jing, and Song Wei. Application Research of Cognitive Physics in Data Mining[J]. Journal of Computer Research and Development, 2006, 43(8): 1432-1438.
    [9]Liu Xuejun, Xu Hongbing, Dong Yisheng, Wang Yongli, Qian Jiangbo. Mining Frequent Patterns in Data Streams[J]. Journal of Computer Research and Development, 2005, 42(12): 2192-2198.
    [10]Yan Yuejin, Li Zhoujun, and Chen Huowang. A Depth-First Search Algorithm for Mining Maximal Frequent Itemsets[J]. Journal of Computer Research and Development, 2005, 42(3).

Catalog

    Article views (700) PDF downloads (573) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return