An Optimal Solution for Byzantine

An Optimal Solution for Byzantine

ID:39076023

大小:1.05 MB

页数:20页

时间:2019-06-24

An Optimal Solution for Byzantine_第1页
An Optimal Solution for Byzantine_第2页
An Optimal Solution for Byzantine_第3页
An Optimal Solution for Byzantine_第4页
An Optimal Solution for Byzantine_第5页
资源描述:

《An Optimal Solution for Byzantine》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、AnOptimalSolutionforByzantineAgreementunderaHierarchicalCluster-orientedMobileAd-hocNetworkShun-ShengWang,Kuo-QinYan*,andShu-ChingWang*ChaoyangUniversityofTechnology168,JifongE.Rd.,WufongTownship,TaichungCounty41349,Taiwan,R.O.C.Email:{sswang;kqyan*;scwang

2、*}@cyut.edu.tw*Correspondingauthortoprovidephone:+886-4-2330-000;fax:+886-2330-4902AbstractMobileAdhocNETworks(MANETs)arebecomingmorepopularduetotheadvantagethattheydonotrequireanyfixedinfrastructure,andthatcommunicationamongprocessorscanbeestablishedquick

3、ly.Forthisreason,potentialMANETapplicationsincludemilitaryuses,searchandrescueandmeetingsorconferences.Therefore,thefault-toleranceandreliabilityoftheMANETisanimportantissue,whichneedstobeconsidered.Theproblemofreachingagreementinthedistributedsystemisoneo

4、fthemostimportantareasofresearchtodesignafault-tolerantsystem.Withanagreement,eachcorrectprocessorcancopewiththeinfluencefromotherfaultycomponentsinthenetworktoprovideareliablesolution.Inthisresearch,apotentialMANETwithadualfailuremodeisconsidered.Thepropo

5、sedprotocolcanusetheminimumnumberofroundsofmessageexchangetoreachacommonagreementandcantolerateamaximumnumberofallowablefaultycomponentstoinduceallcorrectprocessorstoreachacommonagreementwithintheMANET.Keywords:ByzantineAgreementProblem,MobileAd-hocNetwork

6、,DistributedSystem,Fault-Tolerance,DualFailureModes.1.IntroductionAdistributedcomputingsystemiscomposedofasetofprocessors,whichcommunicatewitheachotherthroughthenetwork.Areliablecomputersystemneedstocopewiththefaultsorinterferencefromotherfaultycomponents.

7、Inmanycases,reachinganagreementinthepresenceofmalfunctioningcomponentsisthecentralissueoffault-toleratedistributedcomputing[2,7].SuchageneralproblemiscalledtheByzantineAgreement(BA)problemandwasfirststudiedbyLamport[7].Traditionally,theBAproblemdefinedbyLa

8、mportassumesthefollowing[7]:(1)Therearenprocessors,ofwhichatmosttp(tp≤(n-1)/3)processorscouldfailwithoutbreakingdownaworkablenetwork.(2)Theprocessorscommunicatewitheachotherthroughmessageexchangesinafullyco

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。