A Comparison of Network Coding and Tree Packing网络编码的比较

A Comparison of Network Coding and Tree Packing网络编码的比较

ID:40843178

大小:259.12 KB

页数:7页

时间:2019-08-08

A Comparison of Network Coding and Tree Packing网络编码的比较_第1页
A Comparison of Network Coding and Tree Packing网络编码的比较_第2页
A Comparison of Network Coding and Tree Packing网络编码的比较_第3页
A Comparison of Network Coding and Tree Packing网络编码的比较_第4页
A Comparison of Network Coding and Tree Packing网络编码的比较_第5页
资源描述:

《A Comparison of Network Coding and Tree Packing网络编码的比较》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、AComparisonofNetworkCodingandTreePackingYunnanWu∗,PhilipA.Chou†,andKamalJain†∗Dept.ofElectricalEngineering,PrincetonUniversity,Princeton,NJ08544USA†MicrosoftResearch,OneMicrosoftWay,Redmond,WA98052-6399USAyunnanwu@princeton.edu,pachou@microsoft.com,kamalj@microsoft.com1IntroductionInthispape

2、r,weconsidertheproblemofinformationmulticast,namelytransmittingcommoninformationfromasenderstoasetofreceiversT,inacommunicationnet-work.Conventionally,inacommunicationnetworksuchastheInternet,thisisdonebydistributinginformationoveramulticastdistributiontree.Thenodesofsuchatreearerequiredonly

3、toreplicateandforward,i.e.,route,informationreceived.Recently,Ahlswedeetal.[1]demonstratedthatitisingeneralsuboptimaltorestrictthenetworknodestoperformonlyrouting.Theyshowthatthemulticastcapacity,whichisdefinedasthemaximumratethatasendercancommunicatecommoninformationtoasetofre-ceivers,isgive

4、nbytheminimumC=mint∈TCtofmax-flowsCt=maxflow(s,t)betweenthesenderandeachreceiver.Moreover,theyshowedthatwhilethemulticastcapacitycannotbeachievedingeneralbyrouting,itcanbeachievedbynetworkcoding.Networkcodingreferstoaschemewherecodingisdoneattheinteriornodesinthenetwork,notonlyatthesenderandre

5、ceivers.Li,Yeung,andCai[2]showedthatitissufficientfortheencodingfunctionsattheinteriornodestobelinear.KoetterandM´edard[3]gaveanalgebraiccharacterizationoflinearencodingschemesandprovedexistenceoflineartime-invariantcodesachievingthemulticastcapacity.Jaggi,Sanders,etal.[4][5][6]showedforacycli

6、cnetworkshowtofindtheencodinganddecodingcoefficientsinpolynomialtime.Chou,Wu,andJain[7][8]proposedadistributedschemeforpracticalnetworkcodinginrealpacketnetworksachievingthroughputclosetocapacitywithlowdelaythatisrobusttorandompacketlossanddelayaswellasrobusttoanychangestonetworktopologyorcapac

7、ity.Inthispaper,wecomparenetworkcodingsolutionsandroutingsolutionsfortheproblemofinformationmulticast,andweinvestigatethepotentialadvantagesofnetworkcodingoverrouting.Tomaximizetheperformanceoftheroutingsolutions,weinvestigatetheuseofmultiplemultic

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

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

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