ROTTENSTREICHetal.:COMPRESSINGFORWARDINGTABLESFORDATACENTERSCALABILITY

147

(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
Compressing Video for TaskStream Currently, TaskStream allows users to upload videos up to 100 megabytes in size. Therefore, in order to upload a video...
PPMexe: PPM for Compressing Software Milenko Drini?? and Darko Kirovski? c ? Computer Science Department, UCLA, Los Angeles, USA ? Microsoft Research, ...
Face Fixer Compressing Polygon MeshesFace Fixer Compressing Polygon Meshes隐藏>> UNC Technical Report TR-00-04 Face Fixer: Compressing Polygon Meshes with ...
Compressing Hexahedral Volume Meshes Martin Isenburg? University of North Carolina at Chapel Hill Pierre Alliez? INRIA Sophia-Antipolis Abstract Unstructured ...
Compressing Mixed-State Sources by Sending Classical Information_专业资料。We consider visible compression for discrete memoryless sources of mixed quantum ...
Managing Gigabytes Compressing and Indexing Documents and Images_专业资料。As today’s information explosion generates greater and greater volumes of raw data...
Compressing File Collections with a TSP-Based Approach Dimitre Trendafilov Nasir Memon Torsten Suel Department of Computer and Information Science Technical ...
Compressing cube-connected cycles and butterfly networks We consider the simulation of large cube-connected cycles (CCC) and large butterfly networks (BFN)...
The objectives for compressing DEMs are obtain...更多>>Abstract. Wavelet decomposition is a well-known technique to compress image data. Here, we have ...
Re-Store: A System for Compressing, Browsing, and Searching Large Documents (Extended Abstract of Invited Presentation) Alistair Moffat Raymond Wan ...
热门文档