Computer Science ›› 2014, Vol. 41 ›› Issue (1): 172-177.

Previous Articles     Next Articles

CBSD:A Fuzzy Service Discovery Algorithm Based on Chord

ZHAO Wen-dong,TIAN Chang and PENG Lai-xian   

  • Online:2018-11-14 Published:2018-11-14

Abstract: The main drawback of the structured service discovery method based on DHT doesn’t support fuzzy search in the distributed computing environment.A Bloom filter based structured service discovery method was raised that combines the service clustering and structured service discovery technology.This method uses Bloom filter to represent the service semantics.The clustering feature vectors are got by service training queue.Before the services are published into the chord ring,they are clustered by the relevance among the feature vectors.Without redundancy advertisement,this method can guarantee that the services with similar semantics can be published to the same node and can support fuzzy service discovery.Based on this method,a distributed service composed algorithm was raised.At last,the feasibility of the proposed method was demonstrated by simulation.

Key words: Service discovery,Distributed,Cluster,Service composition,Fuzzy

[1] Joung Y,Yang L,Fang C.Keyword search in DHT-based peer-to-peer networks[J].IEEE JSAC,2007,25(1):46-61
[2] Wang T,Di R H.A Semantic Web Service Discovery ModelBased on Pastry System[C]∥ChinaGrid.2010:205-208
[3] Liu L,Ryu K D,Lee K.Supporting efficient keyword-based file search in peer-to-peer file sharing systems[C]∥GLOBECOM.2004:1259-1265
[4] Schmidt C,Parashar M.Enabling flexible queries with guaran-tees in P2P systems[C]∥IEEE Internet Compu.2004:19-26
[5] Tang C,Xu Z,Mahalingam M.PSearch:Information retrieval in structured overlays[C]∥ACM SIGCOMM.2003:89-94
[6] Rajmohan R,Padmapriya N.A Domain Ontology Based Service Matching for Chord Based Super Peer network[C]∥ICDSE.2012:214-219
[7] 陈蕾,杨庚,张迎周,等.基于核Batch SOM聚类优化的语义Web服务发现机制研究[J].电子与信息学报,2011,33(6):1307-1312
[8] Rosch P,Sattler K,Weth C,et al.Best effort query processing in DHT-based p2p systems[C]∥ICDE.2005:1186-1189
[9] Szekeres A,Baranga S H,Dobre C,et al.A Keyword Search Algorithm for Structured Peer-to-Peer Networks[C]∥SYNASC.2010:253-260
[10] Zhu Y W,Hu Y M.Ferry:A P2P-Based Architecture for Content-Based Publish/Subscribe Services[J].IEEE T ransactions on Parallel and Distributed Systems,2007,18(5):672-685
[11] Harren M,Hellerstein J M,Huebsch R,et al.Complex queries in DHT-based peer-to-peer networks[C]∥IPTPS.2002:242-259
[12] Ganesan P,Sun Q,Garcia-Molina H.Adlib:A self-tuning index for dynamic peer-to-peer systems[C]∥ICDE.2005:256-257
[13] Jin X,Yiu W P K,Chan S H G.Supporting multiple keywordsearch in a hybrid structured peer-to-peer network[C]∥ICC.2006:42-47
[14] Tang C,Dwarkadas S.Hybrid global-local indexing for efficient Peer-to-Peer information retrieval[C]∥NSDI.2004:25-39
[15] 赵文栋,张进,彭来献,等.一种基于Bloom过滤器的服务模糊匹配算法[J].计算机科学,2013,40(3):175-179
[16] Bloom B.Space/time trade-offs in hash coding with allowable errors[J].Communications of the ACM,1970,13:422-426

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!