personpagerank
pagerank 时间:2021-04-19 阅读:()
Topic-SensitivePageRankPresentedby:BratislavV.
Stojanoviunimatrix0@live.
comUniversityofBelgradeSchoolofElectricalEngineeringPage1/29IntroductionTheWorldWideWebisgrowingrapidlyTherearemorethan100millionwebsitesandmorethan10billionpagesoverthere!
Wedidn'tmentionthecontentthatcannotbeindexedbystandardsearchengines(Deepweb)!
Forexample,ifwetypetheword"golf"insideGoogle,wewillendupwitharound456millionresults!
Othersearchengineswillyieldmoreorlessdifferentresults.
Why"Whatmakesthefoundationofthesearchengine""Whydowepreferonesearchengineoveranother"BratislavStojanovi(unimatrix0@live.
com)|Page2/29ProblemDefinition"HowcanwefindexactlywhatwewantontheWWWinafastandefficientmatter"Everysearchengineneedstorankpages,buthowBiggerthevaluemeansthepagehasmorecontentBiggerthevaluemeansquerywordsaremorefrequentBiggerthevaluemeansthepageismoreimportantEverypagehasitsownrankofimportance,butwhatisimportanceTrafficanalysisFinancialstatementanalysisLinkstructureanalysis$$$BratislavStojanovi(unimatrix0@live.
com)|Page3/29ProblemImportanceNearly90%oftraffictomostwebsitesisfoundbyusingasearchengineordirectoryBratislavStojanovi(unimatrix0@live.
com)|Page4/29WheredousersclickmoreoftenWhatwillbetheresultofthequery"golf"ProblemTrendOureverydaylifeisclutteredwithatonsofdifferentinformationsFindingarealinformationhasbecomeevenmoredifficultTherehasbeenacoupleofmillionnewwebsitesadded,onlyinthelastyear!
Googleisthemostpopularwebsite,andthesecondmostvisitedwebsiteontheplanet!
BratislavStojanovi(unimatrix0@live.
com)|Page5/29ExistingSolutionsHITS(Hyperlink-InducedTopicSearch)HyperSearchPageRankHilltopSALSA(StochasticApproachforLinkStructureAnalysis)TrustRankAndmanyothervariants…BratislavStojanovi(unimatrix0@live.
com)|Page6/29Solution#1:HITSHubsandAuthoritiesJohnM.
Kleinberg,CornellUniversity,NY,'98ReflectsthetimewhentheinternetwasoriginallyformingTwotypesofpages:HubsAuthoritiesHubpageprovideslinkstogoodauthoritiesonthesubjectAuthoritypageprovidesagoodinformationaboutthesubjectBratislavStojanovi(unimatrix0@live.
com)|Page7/29Solution#1:HITSCriticism:ExpensiveatruntimeScoresarecalculatedusingsubgraphoftheentireWebgraphSimpleanditerativeQuery-specificrankscoreBratislavStojanovi(unimatrix0@live.
com)|Page8/29Solution#2:PageRankLawrence"Larry"Page,SergeyBrin,Stanford,1998UsedbytheGooglesearchengineUsesarandomsurfermodelRepresentsthelikelihoodthatapersonrandomlyclickingonlinkswillarriveatanyparticularpageProbabilitydistributionisevenlydividedamongallpagesintheWebgraphPageRankvalueiscomputedforeachpageofflineInterpretsahyperlinkfrompageitopagejasavote,bypagei,forpagejAnalyzesthepagethatcaststhevoteaswellBratislavStojanovi(unimatrix0@live.
com)|Page9/29Solution#2:PageRank"Pageisimportantifmanyimportantpagespointtoit"SimplifiedPageRankformula:r=PR(G)Input:WebgraphG=(V,E)Output:RankvectorrLetGhavennodes(pages)In-linksofpagei:HyperlinksthatpointtopageifromotherpagesOut-linksofpagei:HyperlinksthatpointouttootherpagesfrompageiBratislavStojanovi(unimatrix0@live.
com)|Page10/29Solution#2:PageRankOriginalPageRankformula:Dampingfactord=0.
85Moregeneralformula:Recursivedefinition!
Equationoftheeigensystem,wherethesolutiontoPisaneigenvectorwiththecorrespondingeigenvalueof1ComputationcanbedoneusingpoweriterationmethodBratislavStojanovi(unimatrix0@live.
com)|Page11/29Solution#2:PageRankBratislavStojanovi(unimatrix0@live.
com)|Page12/29P1P2P3P4I11111I2I3I4I5111110.
330.
330.
330.
50.
51P1P2P3P4I11111I211.
830.
330.
83I3I4I511.
830.
330.
830.
330.
330.
330.
1650.
1650.
831.
83P1P2P3P4I11111I211.
830.
330.
83I31.
831.
3250.
330.
495I4I51.
3251.
830.
330.
4950.
610.
610.
610.
1650.
1651.
3250.
495P1P2P3P4I11111I211.
830.
330.
83I31.
831.
3250.
330.
495I41.
3251.
270.
610.
775I51.
271.
3250.
610.
7750.
4420.
4420.
4421.
270.
3050.
3050.
775P1P2P3P4I11111I211.
830.
330.
83I31.
831.
3250.
330.
495I41.
3251.
270.
610.
775I51.
271.
5220.
4420.
7471.
5221.
270.
4420.
747ConvergesDEPENDS!
Solution#2:PageRankCriticism:QueryindependentrankscoreRandomsurfermodelnotappropriateinsomesituationsPronetomanipulations(Googlebombs,linkfarms…)InexpensiveatruntimeScoresarecalculatedusingtheentireWebgraphAlgorithmhashooksfor"personalization"BratislavStojanovi(unimatrix0@live.
com)|Page13/29Solution#3:TrustRankGyngyi,Garcia-Molina,Pedersen,Stanford&Yahoo!
,2004LinkanalysisalgorithmFindsmotivationinPageRankmanipulationUsedtosemi-automaticallyseparateusefulwebpagesfromspamWebspampagesarecreatedonlywiththeintentionofmisleadingsearchenginesHumanexpertscaneasilyidentifyspampages,butit'stooexpensivetomanuallyevaluateeverythingBratislavStojanovi(unimatrix0@live.
com)|Page14/29Solution#3:TrustRankSelectasmallsetofseedpagestobeevaluatedbyanexpertNow,extendoutwardfromtheseedsetandseeksimilarpagesbyusinglinksAlternatively,wecanpickasmallsetofspampagesTRcanbeusedtocalculatespammassSpammassisthemeasureoftheimpactoflinkspammingonapagerankingInsteadofPR,wecalculateInversePR"Pagesarebadiftheylinktobadpages"BratislavStojanovi(unimatrix0@live.
com)|Page15/29Solution#3:TrustRankCriticism:Semi-automatedseparationofreputable,goodpagesfromspampagesIncontrasttoPR,TRdifferentiatesgoodandbadpagesBasedonagoodseedsetoflessthan200pages,resultshaveshownthatTRcaneffectivelyfilteroutspamBratislavStojanovi(unimatrix0@live.
com)|Page16/29ProposedSolutionTSPR(Topic-SensitivePageRank)TaherH.
Haveliwala,StanfordUniversity,2003"Personalized"versionofPageRankInsteadofcomputingasinglerankvector,whydon'twecomputeasetofrankvectors,oneforeach(basis)topicUsestheOpenDirectoryProjectasasourceofrepresentativebasistopics(http://www.
dmoz.
org)orYahoo!
Calculateintwosteps,fullyautomatically:Pre-processingQuery-processingPreprocessingstepiscalculatedoffline,justaswithordinaryPageRankBratislavStojanovi(unimatrix0@live.
com)|Page17/29IsitbetterQuery-specificrankscoreFullyautomatedMakeuseofcontextStillinexpensiveatruntimeBratislavStojanovi(unimatrix0@live.
com)|Page18/29IsitoriginalThefirsttopic-sensitivepersonalizationofPageRankSourceofideasformanyotherpossiblepersonalizationsTahergotajobatGoogleInc.
in2003asamemberofSearchQualityGroupCited994timesonGoogleScholarBratislavStojanovi(unimatrix0@live.
com)|Page19/29TrendSearchincontextandsemanticwebareverypopulartopicsnowadaysTheywillcertainlyplayasignificantroleinthenextstepoftheWorldWideWebevolutionTheSemanticWebasaglobalvisionhasremainedlargelyunrealizedThereisabeliefthatWeb3.
0willdramaticallyimprovethefunctionalityandusabilityofsearchenginesBratislavStojanovi(unimatrix0@live.
com)|Page20/29Topic-SensitivePageRank1/7PageRankformula:r=PR(G)Topic-SensitivePageRankformula:r=IPR(G,v)IPRstandsfor"Influenced"PageRankInput:WebgraphG=(V,E)InfluencevectorisavectorofbasistopicstOutput:ListofrankvectorsrItmapspageito:pageiimportance,WRTtopictiBratislavStojanovi(unimatrix0@live.
com)|Page21/29Topic-SensitivePageRank2/7Forthesakeofsimplicity,let'sconsidersomepageiandonly16topics(categories):WecanpickthemfromthefirstlevelofODPStep1isperformedonce,offline,duringWebcrawlItusesthefollowingiterativeapproach:BratislavStojanovi(unimatrix0@live.
com)|Page22/29Foreachtopiccjεv{//Part1:Calcvjvj[i]=0;if(iεpages(cj)){vj[i]=1/num(pages(cj))}//Part2:Calcrjrj[i]=IPR(W,vj[i]);}Topic-SensitivePageRank3/7BratislavStojanovi(unimatrix0@live.
com)|Page23/29Step2assumesthatwecalculatesomedistributionofweightsoverthe16topicsinourbasisOnlythelinkstructureofpagesrelevanttothequerytopicwillbeusedtorankpageiExample:Queryis"golf"Withnoadditionalcontext,thedistributionoftopicweightswewoulduseis:Topic-SensitivePageRank4/7BratislavStojanovi(unimatrix0@live.
com)|Page24/29Ifuserissuesqueriesaboutinvestmentopportunities,afollow-upqueryon"golf"shouldberankeddifferently,withthebusiness-specificrankvectorExample:Queryis"golf",butthepreviousquerywas"financialservicesinvestments"Distributionoftopicweightswewoulduseis:Topic-SensitivePageRank5/7BratislavStojanovi(unimatrix0@live.
com)|Page25/29Attheend,calculatethecompositePageRankscoreusingthefollowingformula:Interpretationofthecompositescore:WeightedsumofrankvectorsitselfformsavalidrankvectorThefinalscorecanbeusedinconjuctionwithotherscoringschemesTopic-SensitivePageRank6/7BratislavStojanovi(unimatrix0@live.
com)|Page26/29Topic:SportsTopic:SportsAfterawhile:P1(sports)=0.
895P1(business)=1.
2731111111P1P2P3P4P5P6P7I11111111I2Topic:BusinessTopic:Business11andsoon…Finally:P1(sports,business)==0.
55*0.
895+0.
85*1.
273=0.
533110.
330.
330.
330.
330.
330.
3310.
330.
330.
33P1P2P3P4P5P6P7I11111111I2110.
330.
660.
331.
331.
33P1P2P3P4P5P6I1I2P1P2P3P4P5P6I1111111I2110.
330.
660.
331.
331.
331111P1P2P3P4P5P6I1111111I2………………Topic-SensitivePageRank7/7BratislavStojanovi(unimatrix0@live.
com)|Page27/29ConclusionImplicitlymakesuseofIR(InformationRetrieval)indeterminingthetopicofthequeryHowever,thisuseofIRisNOTvulnerabletomanipulation,becauseODPiscompiledbythousandsofvolunteereditorsUsingasmallbasissetisimportantforkeepingthequery-timecostslowFuturework:UsefinergrainedbasissetWeightingschemebasedonpagesimilaritytoODPcategory,ratherthanpagemembershiptoODPcategoryBratislavStojanovi(unimatrix0@live.
com)|Page28/29QuestionsandDiscussionBratislavStojanovi(unimatrix0@live.
com)|Page29/29Yes
Stojanoviunimatrix0@live.
comUniversityofBelgradeSchoolofElectricalEngineeringPage1/29IntroductionTheWorldWideWebisgrowingrapidlyTherearemorethan100millionwebsitesandmorethan10billionpagesoverthere!
Wedidn'tmentionthecontentthatcannotbeindexedbystandardsearchengines(Deepweb)!
Forexample,ifwetypetheword"golf"insideGoogle,wewillendupwitharound456millionresults!
Othersearchengineswillyieldmoreorlessdifferentresults.
Why"Whatmakesthefoundationofthesearchengine""Whydowepreferonesearchengineoveranother"BratislavStojanovi(unimatrix0@live.
com)|Page2/29ProblemDefinition"HowcanwefindexactlywhatwewantontheWWWinafastandefficientmatter"Everysearchengineneedstorankpages,buthowBiggerthevaluemeansthepagehasmorecontentBiggerthevaluemeansquerywordsaremorefrequentBiggerthevaluemeansthepageismoreimportantEverypagehasitsownrankofimportance,butwhatisimportanceTrafficanalysisFinancialstatementanalysisLinkstructureanalysis$$$BratislavStojanovi(unimatrix0@live.
com)|Page3/29ProblemImportanceNearly90%oftraffictomostwebsitesisfoundbyusingasearchengineordirectoryBratislavStojanovi(unimatrix0@live.
com)|Page4/29WheredousersclickmoreoftenWhatwillbetheresultofthequery"golf"ProblemTrendOureverydaylifeisclutteredwithatonsofdifferentinformationsFindingarealinformationhasbecomeevenmoredifficultTherehasbeenacoupleofmillionnewwebsitesadded,onlyinthelastyear!
Googleisthemostpopularwebsite,andthesecondmostvisitedwebsiteontheplanet!
BratislavStojanovi(unimatrix0@live.
com)|Page5/29ExistingSolutionsHITS(Hyperlink-InducedTopicSearch)HyperSearchPageRankHilltopSALSA(StochasticApproachforLinkStructureAnalysis)TrustRankAndmanyothervariants…BratislavStojanovi(unimatrix0@live.
com)|Page6/29Solution#1:HITSHubsandAuthoritiesJohnM.
Kleinberg,CornellUniversity,NY,'98ReflectsthetimewhentheinternetwasoriginallyformingTwotypesofpages:HubsAuthoritiesHubpageprovideslinkstogoodauthoritiesonthesubjectAuthoritypageprovidesagoodinformationaboutthesubjectBratislavStojanovi(unimatrix0@live.
com)|Page7/29Solution#1:HITSCriticism:ExpensiveatruntimeScoresarecalculatedusingsubgraphoftheentireWebgraphSimpleanditerativeQuery-specificrankscoreBratislavStojanovi(unimatrix0@live.
com)|Page8/29Solution#2:PageRankLawrence"Larry"Page,SergeyBrin,Stanford,1998UsedbytheGooglesearchengineUsesarandomsurfermodelRepresentsthelikelihoodthatapersonrandomlyclickingonlinkswillarriveatanyparticularpageProbabilitydistributionisevenlydividedamongallpagesintheWebgraphPageRankvalueiscomputedforeachpageofflineInterpretsahyperlinkfrompageitopagejasavote,bypagei,forpagejAnalyzesthepagethatcaststhevoteaswellBratislavStojanovi(unimatrix0@live.
com)|Page9/29Solution#2:PageRank"Pageisimportantifmanyimportantpagespointtoit"SimplifiedPageRankformula:r=PR(G)Input:WebgraphG=(V,E)Output:RankvectorrLetGhavennodes(pages)In-linksofpagei:HyperlinksthatpointtopageifromotherpagesOut-linksofpagei:HyperlinksthatpointouttootherpagesfrompageiBratislavStojanovi(unimatrix0@live.
com)|Page10/29Solution#2:PageRankOriginalPageRankformula:Dampingfactord=0.
85Moregeneralformula:Recursivedefinition!
Equationoftheeigensystem,wherethesolutiontoPisaneigenvectorwiththecorrespondingeigenvalueof1ComputationcanbedoneusingpoweriterationmethodBratislavStojanovi(unimatrix0@live.
com)|Page11/29Solution#2:PageRankBratislavStojanovi(unimatrix0@live.
com)|Page12/29P1P2P3P4I11111I2I3I4I5111110.
330.
330.
330.
50.
51P1P2P3P4I11111I211.
830.
330.
83I3I4I511.
830.
330.
830.
330.
330.
330.
1650.
1650.
831.
83P1P2P3P4I11111I211.
830.
330.
83I31.
831.
3250.
330.
495I4I51.
3251.
830.
330.
4950.
610.
610.
610.
1650.
1651.
3250.
495P1P2P3P4I11111I211.
830.
330.
83I31.
831.
3250.
330.
495I41.
3251.
270.
610.
775I51.
271.
3250.
610.
7750.
4420.
4420.
4421.
270.
3050.
3050.
775P1P2P3P4I11111I211.
830.
330.
83I31.
831.
3250.
330.
495I41.
3251.
270.
610.
775I51.
271.
5220.
4420.
7471.
5221.
270.
4420.
747ConvergesDEPENDS!
Solution#2:PageRankCriticism:QueryindependentrankscoreRandomsurfermodelnotappropriateinsomesituationsPronetomanipulations(Googlebombs,linkfarms…)InexpensiveatruntimeScoresarecalculatedusingtheentireWebgraphAlgorithmhashooksfor"personalization"BratislavStojanovi(unimatrix0@live.
com)|Page13/29Solution#3:TrustRankGyngyi,Garcia-Molina,Pedersen,Stanford&Yahoo!
,2004LinkanalysisalgorithmFindsmotivationinPageRankmanipulationUsedtosemi-automaticallyseparateusefulwebpagesfromspamWebspampagesarecreatedonlywiththeintentionofmisleadingsearchenginesHumanexpertscaneasilyidentifyspampages,butit'stooexpensivetomanuallyevaluateeverythingBratislavStojanovi(unimatrix0@live.
com)|Page14/29Solution#3:TrustRankSelectasmallsetofseedpagestobeevaluatedbyanexpertNow,extendoutwardfromtheseedsetandseeksimilarpagesbyusinglinksAlternatively,wecanpickasmallsetofspampagesTRcanbeusedtocalculatespammassSpammassisthemeasureoftheimpactoflinkspammingonapagerankingInsteadofPR,wecalculateInversePR"Pagesarebadiftheylinktobadpages"BratislavStojanovi(unimatrix0@live.
com)|Page15/29Solution#3:TrustRankCriticism:Semi-automatedseparationofreputable,goodpagesfromspampagesIncontrasttoPR,TRdifferentiatesgoodandbadpagesBasedonagoodseedsetoflessthan200pages,resultshaveshownthatTRcaneffectivelyfilteroutspamBratislavStojanovi(unimatrix0@live.
com)|Page16/29ProposedSolutionTSPR(Topic-SensitivePageRank)TaherH.
Haveliwala,StanfordUniversity,2003"Personalized"versionofPageRankInsteadofcomputingasinglerankvector,whydon'twecomputeasetofrankvectors,oneforeach(basis)topicUsestheOpenDirectoryProjectasasourceofrepresentativebasistopics(http://www.
dmoz.
org)orYahoo!
Calculateintwosteps,fullyautomatically:Pre-processingQuery-processingPreprocessingstepiscalculatedoffline,justaswithordinaryPageRankBratislavStojanovi(unimatrix0@live.
com)|Page17/29IsitbetterQuery-specificrankscoreFullyautomatedMakeuseofcontextStillinexpensiveatruntimeBratislavStojanovi(unimatrix0@live.
com)|Page18/29IsitoriginalThefirsttopic-sensitivepersonalizationofPageRankSourceofideasformanyotherpossiblepersonalizationsTahergotajobatGoogleInc.
in2003asamemberofSearchQualityGroupCited994timesonGoogleScholarBratislavStojanovi(unimatrix0@live.
com)|Page19/29TrendSearchincontextandsemanticwebareverypopulartopicsnowadaysTheywillcertainlyplayasignificantroleinthenextstepoftheWorldWideWebevolutionTheSemanticWebasaglobalvisionhasremainedlargelyunrealizedThereisabeliefthatWeb3.
0willdramaticallyimprovethefunctionalityandusabilityofsearchenginesBratislavStojanovi(unimatrix0@live.
com)|Page20/29Topic-SensitivePageRank1/7PageRankformula:r=PR(G)Topic-SensitivePageRankformula:r=IPR(G,v)IPRstandsfor"Influenced"PageRankInput:WebgraphG=(V,E)InfluencevectorisavectorofbasistopicstOutput:ListofrankvectorsrItmapspageito:pageiimportance,WRTtopictiBratislavStojanovi(unimatrix0@live.
com)|Page21/29Topic-SensitivePageRank2/7Forthesakeofsimplicity,let'sconsidersomepageiandonly16topics(categories):WecanpickthemfromthefirstlevelofODPStep1isperformedonce,offline,duringWebcrawlItusesthefollowingiterativeapproach:BratislavStojanovi(unimatrix0@live.
com)|Page22/29Foreachtopiccjεv{//Part1:Calcvjvj[i]=0;if(iεpages(cj)){vj[i]=1/num(pages(cj))}//Part2:Calcrjrj[i]=IPR(W,vj[i]);}Topic-SensitivePageRank3/7BratislavStojanovi(unimatrix0@live.
com)|Page23/29Step2assumesthatwecalculatesomedistributionofweightsoverthe16topicsinourbasisOnlythelinkstructureofpagesrelevanttothequerytopicwillbeusedtorankpageiExample:Queryis"golf"Withnoadditionalcontext,thedistributionoftopicweightswewoulduseis:Topic-SensitivePageRank4/7BratislavStojanovi(unimatrix0@live.
com)|Page24/29Ifuserissuesqueriesaboutinvestmentopportunities,afollow-upqueryon"golf"shouldberankeddifferently,withthebusiness-specificrankvectorExample:Queryis"golf",butthepreviousquerywas"financialservicesinvestments"Distributionoftopicweightswewoulduseis:Topic-SensitivePageRank5/7BratislavStojanovi(unimatrix0@live.
com)|Page25/29Attheend,calculatethecompositePageRankscoreusingthefollowingformula:Interpretationofthecompositescore:WeightedsumofrankvectorsitselfformsavalidrankvectorThefinalscorecanbeusedinconjuctionwithotherscoringschemesTopic-SensitivePageRank6/7BratislavStojanovi(unimatrix0@live.
com)|Page26/29Topic:SportsTopic:SportsAfterawhile:P1(sports)=0.
895P1(business)=1.
2731111111P1P2P3P4P5P6P7I11111111I2Topic:BusinessTopic:Business11andsoon…Finally:P1(sports,business)==0.
55*0.
895+0.
85*1.
273=0.
533110.
330.
330.
330.
330.
330.
3310.
330.
330.
33P1P2P3P4P5P6P7I11111111I2110.
330.
660.
331.
331.
33P1P2P3P4P5P6I1I2P1P2P3P4P5P6I1111111I2110.
330.
660.
331.
331.
331111P1P2P3P4P5P6I1111111I2………………Topic-SensitivePageRank7/7BratislavStojanovi(unimatrix0@live.
com)|Page27/29ConclusionImplicitlymakesuseofIR(InformationRetrieval)indeterminingthetopicofthequeryHowever,thisuseofIRisNOTvulnerabletomanipulation,becauseODPiscompiledbythousandsofvolunteereditorsUsingasmallbasissetisimportantforkeepingthequery-timecostslowFuturework:UsefinergrainedbasissetWeightingschemebasedonpagesimilaritytoODPcategory,ratherthanpagemembershiptoODPcategoryBratislavStojanovi(unimatrix0@live.
com)|Page28/29QuestionsandDiscussionBratislavStojanovi(unimatrix0@live.
com)|Page29/29Yes
- personpagerank相关文档
- belongingpagerank
- originatingpagerank
- matrixpagerank
- errorpagerank
- estimatepagerank
- pagepagerank
TTcloud：日本独立服务器促销活动,价格$70/月起,季付送10Mbps带宽
ttcloud怎么样?ttcloud是一家海外服务器厂商，运营服务器已经有10年时间，公司注册地址在香港地区，业务范围包括服务器托管，机柜托管，独立服务器等在内的多种服务。我们后台工单支持英文和中文服务。TTcloud最近推出了新上架的日本独立服务器促销活动，价格 $70/月起，季付送10Mbps带宽。也可以跟进客户的需求进行各种DIY定制。点击进入：ttcloud官方网站地址TTcloud拥有自...
易速互联月付299元，美国独立服务器促销,加州地区,BGP直连线路,10G防御
易速互联怎么样?易速互联是国人老牌主机商家，至今已经成立9年，商家销售虚拟主机、VPS及独立服务器，目前商家针对美国加州萨克拉门托RH数据中心进行促销，线路采用BGP直连线路，自带10G防御，美国加州地区，100M带宽不限流量，月付299元起，有需要美国不限流量独立服务器的朋友可以看看。点击进入：易速互联官方网站美国独立服务器优惠套餐：RH数据中心位于美国加州、配置丰富性价比高、10G DDOS免...
Raksmart：香港高防服务器/20Mbps带宽(cn2+bgp)/40G-100Gbps防御
RAKsmart怎么样?RAKsmart香港机房新增了付费的DDoS高防保护服务，香港服务器默认接入20Mbps的大陆优化带宽(电信走CN2、联通和移动走BGP)。高防服务器需要在下单页面的IP Addresses Option里面选择购买，分：40Gbps大陆优化高防IP-$461/月、100Gbps国际BGP高防IP-$692/月，有兴趣的可以根据自己的需求来选择!点击进入：RAKsmart官...
pagerank为你推荐
-
phpwindPHPWIND和DISCUZ有什么区别三友网有了解唐山三友集团的吗？大学生待遇如何，工资收入，福利保障，工作环境等等玖融网泰和网理财可信吗，泰和网理财是不是骗人的啊？？？？？？？？即时通请问有没有人知道即时通是什么？怎样先可以开？？3g手机有哪些电信3g手机有哪些?网络u盘你们谁知道网络硬盘怎么用什么是通配符什么是模糊查询？申请400电话申请400电话需要哪些流程？办理哪些证明？discuz论坛discuz论坛要怎么弄oscommercewedopay的通道怎么样？