Study on resource service match and search in manufacturing grid system

被引:44
作者
Tao, Fei [1 ,2 ,3 ]
Hu, Yefa [2 ]
Zhao, Dongming [2 ]
Zhou, Zude [3 ]
机构
[1] Wuhan Univ Technol, Sch Mech & Elect Engn, Wuhan 430070, Peoples R China
[2] Wuhan Univ Technol, Hubei Digital Mfg Key Lab, Wuhan 430070, Peoples R China
[3] Univ Michigan, Dept ECE, Dearborn, MI 48128 USA
关键词
Manufacturing grid; Resource service match; Resource service search; Word match; Sentence match; Number match; Entity class match; SEMANTIC SIMILARITY; DISCOVERY; MATCHMAKING;
D O I
10.1007/s00170-008-1699-7
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Resource service match and search (RSMS) is the core to realize manufacturing grid (MGrid) resource scheduling. In order to realize effectively RSMS between resource demanders and providers, a RSMS framework is proposed and the key technologies to realize it are studied. The describing information of resource services are classified into four categories: (a) word concept information, (b) sentence information, (c) number information, including number interval and fuzzy number, and (d) entity class (or data structure) information. The similarity matching algorithms of each kind of describing information are investigated, respectively, including word matching algorithms, sentence matching algorithms, number matching algorithms, and entity class matching algorithms. Based on the proposed matching algorithms, the match and search processes of MGrid resource services are divided into four phases: first, matching the basic information of resource services, such as service name and service description, namely, basic matching; second, matching the inputs and outputs information of resource services, namely, I/O matching; third, matching the quality of service (QoS) information of resource services, namely QoS matching; last, combining the above three matching results and generating an integrated matching result, namely, integrated matching. The matching functions and algorithms of each phase are described in detail. A case study illustrates the application of proposed methods, and the accuracy and efficiency of the proposed method are measured.
引用
收藏
页码:379 / 399
页数:21
相关论文
共 40 条
[1]  
ALBERTO F, 2007, LNCS, V4504, P132
[2]  
[Anonymous], 2005, Advances in Intelligent and soft computing, DOI [10.1007/3-540-32366-X, DOI 10.1007/3-540-32366-X]
[3]  
[Anonymous], 1997, P 10 RES COMPUTATION
[4]   Context-sensitive service discovery experimental prototype and evaluation [J].
Balken, R. ;
Haukrogh, J. ;
Jensen, J. L. ;
Jensen, M. N. ;
Roost, L. J. ;
Toft, P. N. ;
Olsen, R. L. ;
Schwefel, H. -P. .
WIRELESS PERSONAL COMMUNICATIONS, 2007, 40 (03) :417-431
[5]   An ontology-based architecture for service discovery and advice system [J].
Bianchini, D ;
De Antonellis, V ;
Melchiori, M .
SIXTEENTH INTERNATIONAL WORKSHOP ON DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS, 2005, :551-556
[6]  
Chen L, 2004, LECT NOTES COMPUT SC, V3036, P507
[7]   Context-based caching and routing for P2P web service discovery [J].
Doulkeridis, Christos ;
Zafeiris, Vassilis ;
Norvag, Kjetil ;
Vazirgiannis, Michalis ;
Giakoumakis, Emmanouel A. .
DISTRIBUTED AND PARALLEL DATABASES, 2007, 21 (01) :59-84
[8]   A grid-based scheduling system of manufacturing resources for a virtual enterprise [J].
Hong, D ;
Li, C ;
Wang, CT ;
Deng, QN .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2006, 28 (1-2) :137-141
[9]  
Kokash N, 2007, LECT NOTES COMPUT SC, V4439, P95
[10]  
Lee CH, 2003, 2003 SYMPOSIUM ON APPLICATIONS AND THE INTERNET, PROCEEDINGS, P22, DOI 10.1109/SAINT.2003.1183029