ROTTENSTREICHetal.:COMPRESSINGFORWARDINGTABLESFORDATACENTERSCALABILITY

139
TABLEI
ANEXAMPLEOFAFORWARDINGTABLEWITHd=3COLUMNSANDITSENCODEDREPRESENTATION.I(A)SHOWSTHEORIGINALTABLEWITHOUTENCODING.THEENTRYSELECTIONMECHANISMISNOTPRESENTED.I(B)ILLUSTRATESTHECORRESPONDINGENCODEDFORWARDINGTABLEWITH
AMAXIMALENCODEDENTRYWIDTHOFP=5BITS.(SPACESAREPRESENTEDJUSTFORSIMPLICITYANDDONOTEXISTINPRACTICE.)I(C)
DESCRIBESTHEd=3DICTIONARIESREPRESENTINGTHEPREFIX
ENCODINGSOFTHEdCOLUMNS.
(A)TheoriginalforwardingtableMACAddressVLANTargetPort00:1b:2b:c3:4d:90Vlan10Te12/100:00:aa:6c:b1:10Vlan10Gi11/800:00:aa:65:ce:e4Vlan10Te12/100:00:aa:65:ce:e4Vlan200Gi11/2400:13:72:a2:a2:0eVlan200Gi11/2400:21:9b:37:7e:14Vlan10Te12/100:13:72:a2:a2:0eVlan200Gi11/8
Fig.1.Anillustrationofanaccesstotheencodedforwardingtable.First,
thepacketlookupkeyishashedtoobtainanentryindexi∈[1,h].Then,asingleencodedentryof(atmost)Pbitsisretrieved.Finally,dpipelinedaccessestoddictionariesareperformedbasedonthedbinarycodewords(ofdifferentlengths)composingthisencodedentry.
(B)Encoding1100000010010001111101111110010110
(C)Theencodingdictionaries
D1(MACAddress)
00-00:00:aa:6c:b1:1001-00:00:aa:65:ce:e410-00:13:72:a2:a2:0e110-00:1b:2b:c3:4d:90111-00:21:9b:37:7e:14
D2(VLAN)0-Vlan101-Vlan200
D3(TargetPort)0-Te12/110-Gi11/811-Gi11/24
wouldliketokeeptwokeypropertiesthatarespeci ctoforwardingtables:
(i)Theabilitytoaccesseachrowentrydirectlyregardlessofitsrowindex,and
(ii)Theabilitytostoreeachrowentryina xed-widthmemoryword.
Suchcriteriapreventormakelessattractivetraditionalen-codingtechniques.Forinstance,iftheentriesarecompressedusingaLempel-ZivWelch(LZW)techniqueandsequentiallystoredinthememory,itisthendif culttocalculatethememoryaddressofaspeci centry,andtoaccessitdirectlybasedonitsentryindex.
C.OverviewoftheSuggestedSolution
AsillustratedinFigure1,wesuggestanovelcompressiontechniqueforforwardingtablesthatsupportsrandomaccesses.Weproposetoencodeeachoftheforwarding-tablecolumnsseparately,usingadedicatedvariable-lengthbinarypre xencoding,i.e.anencodinginwhichanycodewordisnotapre xofanyothercodeword.Weremindthatapre xofastringb1b2...bn,isastringoftheformb1b2...bmwherem≤n.Therefore,eachrowentryinad-columntableisrepresentedbytheconcatenationofdcodewordsrepresentingthecontentofeachofitsd elds.Accordingly,itswidthequalsthesumofthedcorrespondingcodewordlengths.Foreachrowentryweallocatea xedmemorysizeP.Inaddition,eachcolumnjisassociatedtoadictionaryDj,whichisstoredseparatelyinthememory.ThisdictionaryDjmapseachbinarycodewordintoitsrepresented eldvalueincolumnj.Figure1illustratesanaccesstotheencodedforwardingtable.Ateachpacketarrival,we rsthashthepacketlookupkeytoobtainanentryindexi∈[1,h].Then,weaccesstheencodedtabletoretrievethePbitsrepresentingtheencodingofitsithentry.Last,welookupeachoftheddictionariesinapipelinedmanner.Thisway,wesequentiallyobtainthecorrespondingvaluesofthed eldsintheithentryafterdpipelinedlookups.
Notethatthecombinationofthebounded-widthentrypropertyandthepre xpropertyofindividual eldsyieldsourtwodesiredpropertiesspeci edabove.
Example1.TableIpresentsanexampleofaforwardingtableandapossibleencodingofthattable.Thereareh=7entriesinthetable,eachwithd=3 elds:MACAddress,VLANandTargetPort.
First,TableI(A)presentstheoriginaltablewithoutencod-ing.
Next,TableI(B)illustratesapossibleencodingoftheforwardingtable(thepresentedspacesintheencodedtablearejustshowntodistinguishbetweenthedifferent elds,anddonotexistinpractice).Forinstance,thetwopossiblevaluesintheVLAN eldareencodedbyasimple xed-lengthsingle-bitencoding.Inaddition,variable-lengthencodingsareusedtoencodethethreedistinctvaluesintheTargetPort eld,aswellasthe vedistinctvaluesoftheMACAddress eld.Withthesed=3encodings,theobtainedmaximalwidthofanencodedentryisP=5bits.Thus,inordertosupporttherandom-accessrequirement,wekeepP=5bitsinthememoryforeachencodedentry,evenifitmayactuallybeshorter.Forinstance,thethirdentryonlyneeds4bits,andthereforewastes1bit.
Finally,TableI(C)illustratestheencodingsusedbythed=3dictionariesrepresentingthed=3columns.ThenumberofentriesineachdictionaryequalsthenumberofdistinctvaluesinthecorrespondingcolumninI(A).
Thisexampleillustrateshowpre xencodingenablesustosimplyconcatenatethecodewordswithoutaneedforanyadditionalseparating ags.
Inaddition,italsoshowshowthememorysizeisdirectlydeterminedbytheworst-caseentrywidth,i.e.themaximumnumberofconcatenatedbitsperentry.ThisisonereasonforexamplewhyencodingeachcolumnusingHuffmancoding[6]
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 ...
热门文档