ROTTENSTREICHetal.:COMPRESSINGFORWARDINGTABLESFORDATACENTERSCALABILITY143
Property2.LetAbeaFIBtableofdcolumnssuchthatthesetofdistinctelementsinthejthcolumnisS≤2WThen,
jwith|Sj|=njj.OPT(A)≤
dWj.
(9)
j=1
D.NP-HARDNESS
Weconcludethesectionbyconsideringthecomplexityof ndinganoptimalencodingschemeofagivenFIBtable.First,foratablewithasinglecolumn(d=1)anoptimalsolutionisgivenbythe xed-lengthencoding.Ifthereareninthe xed-lengthencodingallcodewords1=|S1|distinctelements,havelengthof log2n1 bits.Clearly,thisencodingisoptimalsinceKraft’sinequalitycannotbesatis edifallelementsareencodedinatmost( lognowshowthatthe2nabove1 -1)bits.
WeencodingproblemisNP-hardfortableswithatleastsevencolumns.
Theorem2.GivenaFIBtableAwithd≥7columns, ndinganoptimalencodingschemeofAisNP-hard.
ProofOutline.Forspacereasons,weprovideaproofoutline,andpresentthefullproofin[23].Weshowareductionfromthe3 SATdecisionproblemto ndinganoptimalencodingofatablewith7columns.
LetY=Y1∧Y2∧...∧YmbeaCNFformula.LetnbethenumberofvariablesinY.Fornisoftheformofn=2k
1
simplicity,weassumethat
forapositiveintegerk.Weshowthattheformula3
Yissatis ableiffacarefullyconstructedtableT(Y)withsevencolumnshasencodingwidthofatmost3k+6bits.T(Y)hastwokindsofentries.Entriesthatarenotin uencedbyY,andmadditionalentriesthatrepresentthemclausesofY.Aclauseissatis edifthewidthofthecorrespondingencodedentryisatmost3k+6bits.Usingthistable,wepresentthereductionfromanyinstanceof3 SAT,beforeconcluding.
Determiningthehardnessoftheprobleminthecaseofd∈[2,6]isleftasanopenquestion.WeconjecturethattheproblemisNP-hardford≥2.
Conjecture1.Foralld≥2, ndinganoptimalencodingschemeoftableswithdcolumnsisNP-hard.E.RetrievingtheForwardingInformation
AsmentionedinSectionI,intheproposedsolutiontherepresentationofanyencodedentryofdcolumns,issimplytheconcatenationofthedcorrespondingcodewordswithoutanyadditionalseparating ags.Wewouldliketoshow rstthattherepresentationsoftwodistinctoriginalentriesyieldtwodifferentconcatenations.Wewouldalsoliketosuggestanef cientwaytodetecttheboundariesofthedifferentcodewordscomposingsuchaconcatenation.
Property3.Letσ1,...,σdbedpre xencodingsofdsetsS1,...,Sd.Letx=(x j∈[11,...,x,d])xd),y=(y1,...,yd)betwoentriessatisfying(j,yj∈Sj.Letσ(x)=σ1(x1)·σ2(x2)...σd(xd)andσ(y)=σ1(y1)·σ2(y2)...σtwostringobtainedbyconcatenatingthedcodewordsd(yd)betheinthe
encodingsofx,y.Ifσ(x)=σ(y)thennecessarilyx=y,i.e.
( j∈[1,d])xi=yi.Inparticularthereisasingleelementz1∈S1whoseencodingσ1(z1)isapre xofσ(x)=σ(y).Proof.Theproofisbyinductionond.First,ford=1ifσ(x)=σ(y)wehaveσ1(x1)=σ(x)=σ(y)=σ1(y1).SinceσFor1isanencoding,wehavethatnecessarilyx1=y1.d≥2,assumethatσ(x)=σ(y),i.e.σ1(x1)·σ2(xbetween2)...σthed(xd)=σtwofollowing1(y1)·σcases.
2(y2)...σd(yd)anddistinguish(i)Ifx1=y1thennecessarilyσ1(x1)=σ1(y1).WecanthendeducethatσBytheinductionhypothesis2(x2)...σwehaved(xd)=σinthis2(ycase2)...σalsod(ythatd).(x2,...,xd)=(y2,...,yd)andsincexconcludethat(x1=y1wecan1,...,xd)=(y1,...,y(xd).
(ii)Ifx1=y1thennecessarilyσ11)=σ1(y1).Fromtheequalityσmust1(xhave1)·σthat2(x2)...σ (σd(x))d)=σ= (σ1(y1)·σ2(y2)...σd(yd)weσ1(x11(y1))andthateither1(x1)isapre xofσ1(y1)(if (σ1(x1))< (σ)isapre xofσσ1(y1)))orσ1(y1acontradiction1(x1)(if (since1(xσ1))> (σpre x1(yencoding.1))).Bothcasesleadto1isaFinally,sincecase(ii)leadstoacontradiction,theonlyelementz1∈S1whoseencodingσ1(z1)isapre xofσ(x)=σ(y)mustbez1=x1=y1.
Followingthelastpartoftheproperty,wecannowsuggesthowtodetecttheboundariesofthedifferentcodewordscomposinganencodedentry.Todoso,wekeepforeachofthedencodings,adictionarywithasortedlistofthepossiblecodewords(andtheirmatchingelements).Then,weperforminapipelinedmannerdaccessestothedictionaries.Ineachaccess,weperformabinarysearchto ndthesinglecodewordinthecurrentencodingwhichisapre xoftheconcatenatedstringrepresentingtheencodedentry.Bythelastproperty,thereisexactlyonesuchcodeword.Next,wecontinuetothenextdictionaryafteromittingthepre xoftheconcatenatedstring.Anyadditionalmemorybesidesthebasicrepresentationofthedictionariesisnotrequired.
IV.TWO-COLUMNFIBTABLES
Indatacenters,apopularclassofFIBtablesaresimpleL2MACtablesthatcontaintwocolumns.The rstdescribestheTargetPort,whilethesecondcanbeviewedasanaggrega-tionofcolumnsrepresentingacollectionofotherattributes.Indeed,weseeinreal-lifetabletracesthattheseadditionalattributesarehardlyeverused.Thustheiraggregationhasarelativelysmallsetofpossiblevalues.
Therefore,fromnowon,weconsiderthespecialcaseoftwo-columnFIBtables,i.e.FIBtablesthatsatisfyd=2.Wewouldliketofundamentallystudythiscasetoobtainsomeintuitionontheproblem.Weshowthatinthiscase,inorderto nditsoptimalencodingscheme,aFIBtableAcanbesimplyrepresentedasabipartitegraph.Wealsosuggestananalysisoftheoptimalencodingwidthofsuchtwo-columnFIBtables.
Forthesakeofsimplicity,weassume,unlessmentionedotherwise,thatthenumberofdistinctelementsineachofthed=2columnsofAisthesame,andthatitisapoweroftwo,i.e.|S1|=|S2|=n=2W.
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 ...
热门文档