服务部署与发布绑定的基于P2P网络的Web服务发现机制

28420054CHINESEJOURNALOFCOMPUTERSVol.28No.4Apr.2005P2PWeb(100084):2004212205;:2005202223.(60443002).,,1977,,P2PWeb.E2mail:[e-mail].,,1973,,,P2PWebWeb.,,1947,,Web.,,1964,,,WebWeb.WebWeb,(SOA).SOA,.P2P,,,,.P2P,,.,.Web;Web;;;P2PTP311AP2PBasedWebServiceDiscoveryMechanismwithBoundingDeploymentandPublicationCHENDe2WeiXUBinCAIYue2RuLIJuan2Zi(DepartmentofComputerScienceandTechnology,TsinghuaUniversity,Beijing100084)AbstractWebServicesconstituteanewcomputingmodelforWebapplication.TheapplicationbasedonSOAisapromisingtrendofdistributedcomputing.ThekeyandmostdifficultprobleminSOAishowtoautomaticallydiscovertheservicesaccordingtotheendusersqueryaccuratelyandquickly.AnewP2PandSemanticWebbasedservicediscoverymechanismisdiscussedinthispaperinwhichthedeploymentandpublicationofaWebServiceareboundtogether.Whenwebservicemanagerdeployshisservices,theembeddedtoolkitwillcreatewebservicedescriptionfilesautomaticallyandputthemintotheservicemetadatarepositoryofthePeer.ProfitingfromusingP2Pnetworktoexchangethemetadata,theserviceprovidersarepermittedtoaddandmod2ifyanddeleteservicesfreelywithoutconferringothers.Whenaqueryissubmittedbyaserviceconsumer,atwostepsqueryingandtwolayerssearchingmethodsareusedtoimprovetheper2formance.KeywordsbasedmatchingandindexingintheGrouplayerareusedduringthefirststep,andsemanticbasedGoal2CapabilitymatchinginthePeerlayerisusedduringthesecondstepofquerying.Twometrics,servicegrowthtimeandservicedeathtimearealsointroducedinthispapertoevaluatethediscoveryperformance.KeywordsWebservicediscovery;semanticWebservice;servicedeployment;servicepublica2tion;P2Pnetwork1WebWeb.,HTTP,XML,SOAP,WSDL,UDDI.Web(ServiceOrientedArchitecture,SOA),SOA:.,,WSDL,,Web.,,,,,Web.,(WebServiceModeling)(WebServiceDiscovery)(WebServiceComposition)(WebServiceMan2agement),.Web,(capability),;,,.Web,(SemanticWeb)[1,2],,,.,P2P,UDDI.,,P2PWeb,.Web,.,P2P,Peer(QueryingAgent)(QueryAnsweringAgent).2,3,4,5,6,.2Web,P2P(,JXTA),WebWeb,Web,WebP2P,P2PPeer.,WebWeb,P2P.P2P,,Web.1.,(,AXIS),,Web,.,(,WSMO)(,WSML).P2P,.,(deploying),(publishing).,.,UDDI,IBM,MicrosoftUDDI,.,P2P,,,.Web6162005HaoHe.WhatisService2OrientedArchitecture.(un2publishing),.P2PPeers,.:(1);(2)P2P;(3)P2PPeer,.:(1)P2PPeer,,;(2)P2P.,Peer,WebPeer.3Web,:(1)Web,Web,Web.(2)Web,.,,Web,.,,,,,.Web,,,.,Web,,.7164:P2PWeb3.1,,SWWSWSMO[3],WSML,6WSMOWSML.,WSMOnonFunctionalProperties,,.,,WSML.[4,5],World2NetHowNet.Web:WS={KWS,C,I,OWS,MWS},KWS={kWS1,kWS2,kWSn},C={pre,ass,post,eff,OC,MC}.,KWS,kWSi,C,I,pre,ass,post,effWSMOPre2conditions,Assumptions,Post2conditions,Effects,MWSMC(Medi2ators),.WS2MOWSCOWSOC,.6WSMO.WebSubCan2didates={WS1,WS2,,WSl}.P2PCandidates=iSubCandidatesi.,:,WSMOGoals.QueryAgent.:R={KR,G},KR={kR1,kR2,,kRm},G={post,eff,OG,MG}[8].CandidatesRWS,WS.,Candidates,,T=jtj|Candidates|t,tWeb.3.2,,t|Candidates|,,WS,|Candi2dates|,t.,,,KWSKR,,WS,,WS.:SubCandidates=Á//ForWSiCandidatesIfsimilarity(KWSi,KR)threshold//ThenSubCandidates.Add(WSi)//WSEndifEndforReturnSubCandidates,,.,,[6]TFIDF[7].,,,;,,.,,Web,,,Web.3.3,,,Web.WSMOWSML,SWWSWeb(WSMX).CG,8162005CG,(Goal_Capability_Matching)[8].:G(Facts),;C(Rules);FactsRules,,.:G={post,eff,OG,MG},C={pre,ass,post,eff,OC,MC}.:PO3gcm(G,C){OC,OG,MC,MG}|=CLv(vin1,,inn:(pre(postpost)(effeff))):Matched=Á//WebForWSiSubCandidates//IfGoal_Capability_Matching(Ci,G)==True//ThenMatched.Add(WSi)EndifEndforReturnMatched43,,,,.,.,Web,.P2P.GartnerGroup[9]P2P:,,,.P2PWeb,Web.,P2P,P2P,.,P2P,,.,.4.1P2P[1013]P2PJXTA,,(Group)P2P.3,Peer,VPPeer:VP={k1,wP1,k2,wP2,,kp,wPp},KP={k1,k2,,kp}=KWS,wPi=count(ki).ki,wPiki,,.Peer1Peer2:Sim(Peer1,Peer2)=Similarity(VP1,VP2)Similarity.Peers(Group),Peer(GroupServer),PeerVP,.VG:VG={k1,w1,k2,w2,,kg,wg},KG={k1,k2,,kg}=KP,wi=wPi.,Group1Group2Sim(Group1,Group2)=Similarity(VG1,VG2);(Group1)Peer(Peer1)Sim(Group1,Peer1)=Similarity(VG1,VP1);(R)(Group)Sim(R,Group)=Similarity(KR,VG),KR={kR1,1,kR2,1,,kRm,1}.VG,,:RouteTable={GroupName1,GroupID1,VG1,,GroupNamei,GroupIDi,VGi},2.9164:P2PWebJXTATechnologyDocuments.()N()M.P2P,Peer,[12,14].4.2,Peer(Peer2Req),2R,Peer2ReqID,R.PeerR,(Matched),Peer2An2sID,URL,MatchedPeer2Req.,P2P:R,SIM={Sim1,Sim2,,Simi}.SIMSimjSimthreshold,GroupID,hops,Peer2ReqID,Rj.SIM,Q.R,j,.,GroupIDGroupID,hops=hops+1,hopsMaxHops,.,Peer,..,Simthreshold,Q,MaxHops.4.3,PeerP2P,,Peer2ReqID,R,.Peer(),,R,Matched,Peer2AnsID,URL,MatchedPeer2Req.55.1Web,,.PrecisionWS=ABB;0262005RecallWS=ABA.A,B,BPeer,B=Matched.[10]P2P,PeerPeer()7,,Peer,5.,Web,,Peer,PeerWeb3.Web3.PeerWeb,.,,,,,.,:1.Peer.GrowingTimei=Maxj{MinTime(WSiCandidatesj)}-TimeDeploymenti,MinTime(WSiCandidatesj)WSiPeerj,TimeDeploymentiWSi.GrowingTime=Average(GrowingTimei).2.PeerWebWeb.dyingTimei=Maxj{MinTime(WSi|Candidatesj)}-TimeUnDeploymenti,MinTime(WSi|Candidatesj)WSiPeerj,TimeUnDeploymentiWSi.DyingTime=Average(DyingTimei).,,()(Un2publish2ing).,Peer.Peer.:GrowingTime=DyingTime=Average(Length)k,Average(Length)P2P,k.P2PAverage(Length),CANO(N1/d)[15],ChordO(logN)[16].