文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > 人文社科 > 文学研究 > compressing forwarding tables for datacenter scalability
侵权投诉

compressing forwarding tables for datacenter scalability

ROTTENSTREICHetal.:COMPRESSINGFORWARDINGTABLESFORDATACENTERSCALABILITY

compressing forwarding tables for datacenter scalability

147

compressing forwarding tables for datacenter scalability

(a)(b)

Fig.3.Twoexamplesofbipartitegraphswithn=2Wverticesineachgraphsiderepresentingtwotwo-columnFIB=8tables(forWA=3).Inthe rstgraph(a),thereisaperfectmatchandthesizeofthe(minimal)1andAedge2coveris8=n=α·nwithα=1andOPT(Athesecond(b),thesizeoftheedgecoveris14=α·nwith1)=α2W=1=.756.andInOPT(A2)≥5.

bits.ThustheencodingwidthofCAsatis es

(CA)=(x,ymax)∈E

(σ1(x))+ (σ2(y))

≥(max (σ (σX1(x))+2(y))≥D(CA)

x,y)∈S α·n≥

2n·W+2(α 1)·n

α·n

=

2·(W+α 1)2Wα≥α

.(24)Finally,SinceCAisanarbitraryencodingscheme,wecan

deducetheresult.

Example4.Figure3illustratesthetwocorrespondingbi-partitegraphsfortwo-columnFIBtablesA2W=8(forW=3)distinctelementsin1andAeachcolumn.2,withn=ForA1,thebipartitegraphincludesaperfectmatchandthesizeoftheedgecoveris8=n =α·nwith8impliesthatOPT(A α=1.

Theorem1)≥2·(W+α 1)

=2W.ForAα

2,thesizeoftheminimaledgecover1)=α·nwithα=1.75.ThusOPT(A is14=2·(n 2)≥2·(3+1.75 1)

=5.Further,byencodingthe rstelementinacolumn1.75

inasinglebitandothersinfourbits,wehavethatindeedOPT(A2)=5.

VI.SUPPORTINGUPDATES

Forwardingtablesneedtosupportupdates.Theseupdatescanincludeaninsertionofanewentry,adeletionofanexistingentry,oramodi cationofsomeofthe eldsofanentry.Forinstance,theymayfollowtheadditionordeletionofVMsinthedatacenter,aswellVMmigrations.Inthissection,wediscusshowsuchupdatescanbesupported.

Whileupdatingtheforwardingtableinitsencodedrep-resentation,wemightencounterseveralobstacles.First,anentrymighthavetobeencodedinawidthlargerthanthecurrentlyallocatedmemorywidth.Inaddition,insomecasestheremaybeaproblemtoallocateadditionalcodewordsfornewinsertedelementswhilestillkeepingthepropertiesofthepre xencodings.

Ingeneral,theupdateprocessincludestwosteps:anim-mediatesteprequiredforcoherency,andanotherprocedurethatcanoccurof inetoimproveperformance.Thissecondstepcanberun,forinstance,eitherperiodicallyintimeoraftera xednumberofupdates.Meanwhile,inadditionto

theencodedtable,wemakeuseofasmalldedicatedmemoryforkeepingasmallnumberofentries.LetPbethe xedallocatednumberofbitsfortheencodingofeachentry.Tosupportsuchupdates,weassumethateachentryincludesanadditionalbitthatindicatesitsvalidity.

tionInsertionofanewandentryModi cationorachange:inDealinganentrywithcanwithbeandoneinser-inasimilarway.Wedescribeseveralpossiblescenarios.First,ifalltheelementsintheupdatedentryappearinthecurrentdictionaries,wesimplyencodeanewentrybasedonthesedictionaries.IfitstotalwidthisnotgreaterthanP,nofurtherchangesarerequired.IfitisgreaterthanP,wesettheoriginalentry(incaseofachange)asinvalidandtemporarilyaddthenewentry(withoutencodingit)tothesmallmemory.

Iftheupdatedentryincludesanewelement,wetrytoassociateitwithacodeword.Inaspeci ccolumn,wecandosoonlyifthesumthatappearsinKraft’sinequalityissmallerthanone.Further,theminimalpossiblecodewordlengthdependsonthevalueofthissum.Forthesakeofsimplicity,wesuggesttoallocateforeachnewelementacodewordwiththeminimalpossiblelength.Ifwecannotallocateanynewcodewordinoneofthesecolumns(duetoanequalityinthecorrespondingKraft’sinequality),oriftheallocatedcodewordsyieldanentrythatistoolong,theupdatedentryisagainaddedtothesmallmemory.

requiresDeletionsetting:Dealingtheentrywithasinvalid.anentrySuchdeletionachangeiseasydoesandnotrequireanychangesintheencodingsofotherentries,sincethemaximalwidthoftherestoftheencodedentriesisclearlyboundedbythemaximalwidthbeforechange.Reductioninthemaximalwidthofthetableafteranentryremovalmaybeachievedbyrunningthecompressionalgorithmaspartoftheof ineprocedure.

culationOf ineofanProcessef cient:Theencodingof ineprocessfortheincludesexistingencodedthecal-entriesandfortheunencodedentriesstoredinthesmallmemory.Later,thismemoryiscleared.ThevalueofPmaybechanged,aswellastheencodedversionofexistingentries.ItispossibletoendowthetableencodingalgorithmwithbetterupdatecapabilitiesbychoosinganencodingwithaslightlylargervalueofPthatguaranteesshortcodewordlengthsforpossiblefutureinsertedelements.Anotherimprovementcanbeasfollows.Toavoidtherelativelylongrunningtimeoftheprocess,wecantrytorelyonthepreviouslyfoundencodingscheme.Weconsidertheelementsintheproblematicentriesstoredintheadditionalmemory.Wetrytoallocatefortheseelementsrelativelyshortcodewords,toenablethemtobewithintheallocatedmemorywidth.Todoso,wemighthavetoreplacebylongercodewordstherepresentationofotherelementsthatappearinshorterentries.Ifwedonotsucceedtodoso,wecanrepeattheprocessafterincreasingthecurrentmemorywidth.Meanwhile,forcoherencyreasons,betweentwoof ineprocesses,anylookupshouldconsidertheencodedentriesintheFIBandtheunencodedentriesinthesmalldedicatedmemory.Inaddition,theremightbeasynchronizationproblemtodealwithaccessrequestsduringtheshorttimerequiredforchangingthememory(e.g.inthecompletionoftheof ineprocess).Wesuggesttopostponetheseaccessrequestsforashorttime.Ifthisisimpossible,we

上一页第10页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email