chargingp2pover官网
p2pover官网 时间:2021-05-24 阅读:(
)
Market-basedNetworkFormationforanAdHoc,P2PWirelessNetworkYasUlloriYamamoto·SchoolofInformationStudies,SyracuseUniversityMinistryofPublicManagement,HomeAffairs,PostsandTelecommunications5495-1-502Ooyaguchi,Saitama996-0934JAPANyayamamo@syr.
eduJunseokHwangtSchoolofInformationStudies,SyracuseUniversity4-291,CenterforScienceandTechnologySyracuse,NY13244-4100USAjshwang@syr.
eduAbstractInanadhoc,arbitrarilyformedpeertopeer(P2P)networksystem,eachusercanselectoneoftheservicesofferedbymultipleneighborstationstohaveanaccesstothenetwork.
Everyuserhasapreferencefunctiontodetermineaservicetouse,whichisdescribedasatotalwillingnesstopaybasedonthebandwidthandthedurationofusingaservice.
Inourstudy,wedevelopedamarket-basedmodelforausertodetermineaserviceinordertomaximizetheuser'ssurplus.
Ourmodelallowsastationtoconnectanotherstationwithoutreconnectionaslongasitwantsorpossible.
Byemployingourmodel,stationsofprovidingaservicecanofferacompetitivepricingbasedondurationsofconnectionssuchasadiscountfortheiruserstouseitlonger.
Thepricingofthiskindisalsopreferableforbothusersandproviders.
Inaddition,basedonourmodel,wedevelopedanalgorithmforastationtodetermineawayofmakingaconnectiontothenetwork.
WesimulatedsomescenariosofadhocP2Pwirelessnetworksbyusingthealgorithm.
WefoundthattheformednetworkismoreefficientthanformerceaselesslyreconnectingnetworksintermsoftheconnectivitytogetacertainQoS.
Keywords:Market-basednetworks,P2Pnetworking,WirelessCommunications·Phone:+81(48)874-7233,Fax:+l(702)921-3399tPhone:+l(315)443-4473,Fax:+l(315)443-5806Theoriginalversionofthischapterwasrevised:Thecopyrightlinewasincorrect.
Thishasbeencorrected.
TheErratumtothischapterisavailableatDOI:10.
1007/978-0-387-35618-1_37C.
G.
Omidyar(ed.
),MobileandWirelessCommunicationsIFIPInternationalFederationforInformationProcessing200322YasunoriYamamoto1.
IntroductionDuetorapiddevelopmentofthewirelesstechnology,demandsonhigh-speedpersonalwirelessdatacommunicationshasincreased(In-ternationalTelecommunicationUnion,2000).
Onceintherangeofpropagation,individualuserscanaccesstheInternetwithoutanyca-blewherevertheyare,whethertheymoveornot.
Inthissituation,decentralizedadhocP2Pnetworksaremoresuitablethancentralizedstaticnetworksystems.
Thosenetworksalloweverystationtobecomeanetworkproviderforotherstationsandactasarepeater,sothatauseroutoftherangeofabasestationcouldaccessthenetworkviaanotherstation.
Weassumedthefollowingscenario.
Inanadhoc,arbitrarilyformedP2Pnetworksystem,eachuserselectsoneoftheservicesofferedbymultipleneighborstationstohaveanaccesstothenetwork.
Everyuserhasapreferencefunctiontodetermineaservicetouse,whichisdescribedasatotalwillingnesstopaybasedonthebandwidthandthedurationofusingaservice.
Inourstudy,wedevelopedamarket-basedmodelforausertodetermineaserviceinordertomaximizetheuser'ssurplus.
Inourmodel,astationcanconnectwithanotherwithoutareconnectionaslongasitwantsorpossible.
Thisfeatureallowsstationstoprovideacompetitivepricingsuchasadiscountplanfortheiruserstoconnectwiththemlonger.
Inordertorealizeit,usersarepreviouslyinformedofcostsaccordingtothedurationofaconnectionbyprovid-ingstations.
Thepricingschemeofthiskindbringsbenefitstobothofusersandproviders,sincemanyuserspreferafixedrateservicetothatofusage-basedcharging(Ohu,1999),whileproviderscangetanoptimalpricingtomaketheirprofitshigher.
Inspiteofmanystudiesofoptimalpricing,fewofthemtakeconsiderationofthisusers'preference.
Inaddition,basedonthemarket-basedmodel,wedevelopedanalgo-rithmofdeterminingawayofconnectingwiththenetwork.
Wesimu-latedsomescenariosofadhocP2Pwirelessnetworkformationsbyusingthealgorithm.
Asaresult,wefoundthatanadhocP2Pwirelessnet-workcanbeformedautonomouslybyusingthealgorithm.
Theformednetworkshowedbetterperformancethanceaselesslyreconnectingnet-worksintermsoftheconnectivity.
2.
RelatedStudiesSomestudiesproposedabiddingmethodtoallocateresource(i.
e.
,asellerallocatesresourcetothosewhovalueitmost)andusedagametheorytoshowanoptimalconditionunderwhichusersandasellermaximizetheirutilities.
Usersbideverycertainperiodoftimetobeallocated.
Arecentstudy(LazarandSemret,1998)introducedthePro-Market-basedNetworkFormation/oranAdHoc,.
.
.
23gressiveSecondPrice(PSP)mechanism,whichisderivedfromVickreyAuction(secondpricesealedbid)andgeneralizesit.
Resourceisallo-catedtobiddersaccordingtotheorderofthebiddingpricesuntilnomoreresourceisleft.
Thismechanismisunprecedentedinthatitap-pliestoagenericarbitrarilydivisibleandadditiveresourcemodelsuchasspectrumallocation.
Theirapproachdoesnotassumeanyspecificmappingofresourceallocationtoqualityofservice.
However,biddersaredefinedashavinganexplicitmonetaryvaluationofquantitiesofresourcewhichauctioneerdoesnotorcannotknowapriori.
Anotherapproach(AltmannetaI.
,2002)usedaMarkovmodel.
Inthemodel,anadministratoroffersseveraltypesofservicesatdifferentprioritylevels,andauserdecidesoneofthemtousebasedonhisorherjob'spriorityandofferedprices.
ApriceatapriorityleveldoesnotchangebutanactualQoSatthelevelvariesdependingoncircumstances.
Accordingly,userscanseeaQoSanditspriceofaservicewhendeciding.
Sincethisapproachisjoboriented,however,userscannotestimatetotalcostsfortheirconnections.
3.
AssumptionWeconsidertwomaintypesofnetworktopologywhenwedevelopapricingmodel:StarandP2P.
Startopologyisthatthereisanaccesspointusedbymultipleuserssimultaneously.
Currentcellularsystemisinthistopology.
P2Ptopologyisthattherearemultiplestationsandastationcanbeanaccesspointtotheothers.
Needlesstosay,thistopologyincludesStartopology.
Anadvantageofthiscanbeshownwhenthereisastationoutoftherangeofanaccesspoint,butanotherstationwithintherangecanbecomeaproxytothatstation.
Sinceweassumethatanyusercanalsobeanetworkprovidertoanother,wedonotcareaboutanetworktopologybutfocusonbehaviorsofusersandproviders.
Userspreferfixedrateserviceswhileprovidersseekmaximumprofits.
Weseekawayofprovidingaconditionunderwhichbothplayerscangetsatisfied.
Aprovideroffersseveraltypesofservicesintermsofdurationofserviceandbandwidth(QoS).
Auserchoosesaserviceofferedbyneighborprovidersaccordingtohisorherpreference.
WeassumeaCDMAsystemtowhichourmodelapplies,whereusersareassignedorthogonalspreadingcodes.
Inthissystem,atransmittedpowerandalengthofcodesdetermineaQoS.
Asinastudy(Liuetal.
,2000),weassumeallcodeshavesamelength,andthereforeaQoSisdeterminedbyatransmittedpower.
Let#Li(O1(t),4>2(t),.
.
.
,4>N(t)and[kl(d),k2(d),kN(d),respectively.
Assum-ingthattheexponentiallydistributedservicedurationisnotaffectedby4>j(t),usersstartingaservicejattimetareexpectedtopayanaveragepriceof:1+00[1(T-t)1pj(t)=tTje-rj(T-t).
t4>j(v)dv·(1-kj(r-t))dr.
(4)LetPb(t)beaspotpricedeterminedbyhowscarcethespectrumresourceisattimet.
Pb(t)wouldbecomehigherif,forexample,thepropaga-tionconditionisworseornumberofuserswantingtouseitincreases.
Since4>j(t)canbeuniquelydeterminedbyPb(t)ifthediscountratesaregiven,weassumethatprovidersmanipulate[Pl(t),P2(t),···,PN(t)tomaximizetheirutility.
5.
CaseStudy5.
1.
Station'sBehavior(Withvs.
WithoutaDiscount)Asanexampleofcomparison,wetookthreeserviceplans4>i(i=1,2,and3)withandwithoutadiscountplankll.
Inaddition,wetookauser'spreferencetWIforthoseservicesasanexample,whichcanbedescribedasaGaussianfunction.
Inthissituation,theuser'ssurplusU(t)canbedescribedasfollows:U(t)=tWI(t)-kl(t)lot4>i(V)dv(i=1,2,3).
(5)Therefore,inthisexample,thedurationoftimetomaketheuser'ssurplusoptimalcanbefoundbysolvingthefollowingequation:dtwl(t)dr·dt=dtkl(t)104>i(V)dv1,2,3).
(6)s.
t.
(7)Figure1showshowthesethreepricingplansrequireausertopayac-cordingtothedurationofconnectiontime,andauser'spreference.
1kl(t)=1incaseofnodiscount.
26YasunoriYamamoto45.
0price40.
5WithoUldlJcouO36.
031.
527.
022.
518.
013.
59.
04.
5duration0.
00481216202428323640Figure1.
Comparisonofservices,andauser'spreference5.
2.
NetworkFormationAlgorithm.
Inordertomakeanetworkformationautonomic,wedevelopedanalgorithmforastationtodetermineawayofestablishingaconnectiontoanotherstationorgivingup.
Table1showsthealgorithm,whichemploysourmodeldiscussedinthisstudy.
Table1.
AlgorithmtomakeaconnectionP={},Q=U;Fori=1TotheendofexistingstationsnearbyCalculatethedistancedi;Forj=1TotheendofserviceswhichstationioffersQ=QU{QoSofServiceSij};P=Pu{PricingScheduleofServiceSij};End;End;FindaserviceSi*j*:surplussp(Si*j*)>sp(Sij)(i*I=-i,j*I=-j);IfSi*j*,;z<,.
I".
I.
':r-1I0,001tOOllOll!
tOOl0.
009D.
I1Itill0.
012tll.
ltOl4D.
I1ISRecIprocalTetaTimeFigure9.
ContinuativeConnectionsAverageNumberofActiveandInactiveStationsaveragenumbersofactiveandinactivestationstothereciprocaltotaltimestocompleteasimulation.
Asforthediscreteconnections,theaveragenumbersofactivestationsarefrom10.
6to22.
1whilethoseofinactiveonesarefrom2.
06to4.
40.
Ontheotherhand,concerningthecontinuativeconnections,thoseofactiveonesarefrom18.
6to32.
5andinactiveonesfrom0.
50to1.
12.
Thisresultindicatesthatmorestationscanhaveconnectionswhentheyarecontinuativethandiscrete.
Inotherwords,theconnectivityofanadhocP2Pnetworkimproveswhencon-2fromthetimeofthefirststationcomesuptothetimeofthelastonedisappears3stationhavingaconnection4stationnothavingaconnection5numberofconnectionsfromtheroottoastation(e.
g.
,astartopologynetworkhas1.
00ofitsaveragedepth.
)28YasunoriYamamototinuativeconnectionsareallowed.
Itshouldbenotedthattheaveragedepthsofbothsituationsarealmostidentical(1.
73and1.
84).
6.
ConclusionInourstudy,weintroduceadiscountfactor,andthereforefixedrateserviceswhichmanyindividualusers'preferencecanbedescribedinourpricingmodel.
Eachuserispreviouslyshownwithserviceplanswhichcompriseapricingandadiscountschedulebymultipleserviceproviders.
Afterthat,theusercandetermineaserviceplanandaserviceprovidertouse.
Besides,wedonotassumethateachserviceproviderpreviouslyknowstheusers'preferences,butinsteadassumethattheirdurationsoftimetousenetworksareexponentiallydistributed.
Inthisassumption,wegetanoptimalpricingmodel.
Inaddition,wedevelopedanalgorithmforeachstationtodeterminehowtomakeaconnectiontoanotherstationbasedonthesurplusforit.
Usingthealgorithm,wemadesimulationsandconfirmedthatanadhocP2Pwirelessnetworkcanbeformedautonomously.
Inaddition,oursimulationsshowedthatconnectivityofformednet-worksimprovesbyintroducingcontinuativeconnections.
ReferencesAltmann,J.
,Daanen,H.
,Oliver,H.
,andSuarez,A.
S.
-B.
(2002).
HowtoMarket-ManageaQoSnetwork.
InIEEEInfoCom2002,ConferenceonComputerCom-munications,NewYork,USA.
Chu,K.
(1999).
Userreactionstoflatrateoptionsundertimechargeswithdifferen-tiatedqualityofaccess:Preliminaryresultsfromindex.
InternationalTelecommunicationUnion(2000).
MainresultsofWRC-2oo0.
RetrievedSeptember26,2001,from:http://www.
itu.
int/brconf/wrc-20oo/docs/index.
html.
Lazar,A.
A.
andSemret,N.
(1998).
Designandanalysisoftheprogressivesecondpriceauctionfornetworkbandwidthsharing.
The8thInternationalSymposiumonDynamicGamesandApplications.
Liu,P.
,Honig,M.
L.
,andJordan,S.
(2000).
Forward-linkCDMAresourceallocationbasedonpricing.
InIEEEWirelessCommunicationsandNetworkingConference,Chicago,IL.
Wang,Q.
,Sirbu,M.
A.
,andPeha,J.
M.
(1996).
TelecommunicationsandInter-netPolicy,chapterPricingofATMNetworkServices.
LawrenceErlbaumAssoc,Washington,DC.
Vultr 商家有新增韩国首尔机房,这个是继日本、新加坡之后的第三个亚洲机房。不过可以大概率知道肯定不是直连中国机房的,因为早期的日本机房有过直连后来取消的。今天准备体验看看VULTR VPS主机商的韩国首尔机房的云服务器的速度和性能。1、全球节点PING速度测试这里先通过PING测试工具看看全球几十个节点的PING速度。看到好像移动速度还不错。2、路由去程测试测试看看VULTR韩国首尔机房的节点...
如何低价香港服务器购买?想要做一个个人博客,想用香港服务器,避免繁琐备案,性能不需要多高,只是记录一些日常而已,也没啥视频之类的东西,想问问各位大佬有没有低价的香港服务器推荐?香港距大陆近,相比美国服务器最大的优势在于延迟低,ping值低,但是带宽紧张,普遍都是1M,一般戏称其为“毛细血管”。同时价格普遍高,优质稳定的一般价格不菲。大厂云梯队阿里云、腾讯云两家都有香港服务器,要注意的是尽量不要选择...
六一云互联六一云互联为西安六一网络科技有限公司的旗下产品。是一个正规持有IDC/ISP/CDN的国内公司,成立于2018年,主要销售海外高防高速大带宽云服务器/CDN,并以高质量.稳定性.售后相应快.支持退款等特点受很多用户的支持!近期公司也推出了很多给力的抽奖和折扣活动如:新用户免费抽奖,最大可获得500元,湖北新购六折续费八折折上折,全场八折等等最新活动:1.湖北100G高防:新购六折续费八折...
p2pover官网为你推荐
"2014年全国民营企业招聘会现场A区域企业信息",,,,支持ipad支持ipad支持ipad步骤ios重庆宽带测速重庆联通宽带测速的网址是好多呢?ipad上网为什么ipad网速特别慢iphonewifi苹果手机突然用不了Wi-Fi了chromeframe有用过 Google Chrome Frame 的吗bitchina怎么下载电影?
虚拟主机试用 四川虚拟主机 网址域名注册 企业域名备案 域名抢注工具 com域名抢注 本网站服务器在美国维护 a2hosting 表单样式 服务器日志分析 typecho me空间社区 阿里校园 phpmyadmin配置 亚马逊香港官网 福建铁通 google台湾 摩尔庄园注册 空间服务器 购买空间 更多