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.

零途云:香港站群云服务器16IP220元/月,云服务器低至39元/月

零途云(Lingtuyun.com)新上了香港站群云服务器 – CN2精品线路,香港多ip站群云服务器16IP/5M带宽,4H4G仅220元/月,还有美国200g高防云服务器低至39元/月起。零途云是一家香港公司,主要产品香港cn2 gia线路、美国Cera线路云主机,美国CERA高防服务器,日本CN2直连服务器;同时提供香港多ip站群云服务器。即日起,购买香港/美国/日本云服务器享受9折优惠,新...

数脉科技香港自营,10Mbps CN2物理机420元/月

数脉科技怎么样?数脉科技品牌创办于2019,由一家从2012年开始从事idc行业的商家创办,目前主营产品是香港服务器,线路有阿里云线路和自营CN2线路,均为中国大陆直连带宽,适合建站及运行各种负载较高的项目,同时支持人民币、台币、美元等结算,提供支付宝、微信、PayPal付款方式。本次数脉科技给发来了新的7月促销活动,CN2+BGP线路的香港服务器,带宽10m起,配置E3-16G-30M-3IP,...

80VPS:香港服务器月付420元;美国CN2 GIA独服月付650元;香港/日本/韩国/美国多IP站群服务器750元/月

80vps怎么样?80vps最近新上了香港服务器、美国cn2服务器,以及香港/日本/韩国/美国多ip站群服务器。80vps之前推荐的都是VPS主机内容,其实80VPS也有独立服务器业务,分布在中国香港、欧美、韩国、日本、美国等地区,可选CN2或直连优化线路。如80VPS香港独立服务器最低月付420元,美国CN2 GIA独服月付650元起,中国香港、日本、韩国、美国洛杉矶多IP站群服务器750元/月...

p2pover官网为你推荐
甘肃省武威市人民检察院技术检验鉴定如时间选项无法打开请更改generatingcssFDCphp支持ipad特斯拉苹果5windows键是哪个Win键是什么?迅雷快鸟迅雷快鸟支持移动宽带提速吗chromeframe我的Chrome Frame为什么不能使用?chromeframechrome需要frame吗
山东vps 新通用顶级域名 域名抢注工具 naning9韩国官网 wavecom 128m内存 kddi 2014年感恩节 特价空间 174.127.195.202 godaddy 免费个人网站申请 免费dns解析 空间租赁 英雄联盟台服官网 lamp兄弟连 阿里云邮箱登陆 阿里云个人邮箱 葫芦机 hdsky 更多