ROTTENSTREICHetal.:COMPRESSINGFORWARDINGTABLESFORDATACENTERSCALABILITY

149
(a)United

States
(b)China

1
(c)China2
Fig.7.Totalmemorysizeofencodedreal-lifetablesincludingthedictionarysize.Allforwardingtableswerecollectedinenterprisenetworks,intheUnitedStatesaswellasinChina.
Weperformanadditionalsimulationtoexaminehowthenumberofentriesin uencetheencodingwidth.Wecompareagainoursuggestedschemewiththe xed-lengthencodingintablesofhentriesforh∈{100,500,1000,2000,5000,10000}andd=4columns.Allentriesareselectedrandomlyamong2W=256(forW=8)possibleelementsineachcolumn,accordingtoZipfdistribu-tionparameterss=2,3.Here,sinceweconsideralsotableswithrelativelysmallnumberofentries,wedonotforceallelementstoappearatleastonceineachcolumn.Accordingly,the xed-lengthencodingyieldsanencodingwidthsmallerthand·W=32.Theresultsarebasedontheaverageof10simulations.
Fig.6depictstheresults.Asexpected,theencodingwidthofourschemeincreaseswhenthenumberofentriesgrows
sincetheadditionalentriesresultinmoreconstraintsonthewidth.Forallexaminednumberofentriestheimprovementofourschemeisnotnegligible.Forinstance,ifh=500ands=3theobtainedwidthis12.8incomparisonwith14.5forthe xed-lengthencoding(animprovementof11.7%).Likewise,ifh=2000thewidthis14.5insteadof17.0(14.9%improvement).Theimprovementisevenlargerforthecaseofh=10000entriesandequals20.0%.Further,weexpecttoobserveanimprovementfortableswithrelativelylargenumberofentriesaslongasthedistributionoftheirelementsislessclosetotheuniformdistribution.Ofcourse,within nitenumberofentries,allpossibleentriesappearandwecannotimprovethe xed-lengthencoding.B.Real-LifeFIBtables
Wealsoconductexperimentsonthreetypicalreal-lifeenterprise-networktables.Thetablesarecollectedfromthreedifferentswitchesofthreedifferentswitchvendors,eachswitchusingadifferentnumberofcolumns.Alltableswerecollectedinenterprisenetworks,the rstintheUnitedStateswith2790entriesandtheotherinChinawith903and428entries.
Wewould rstliketoevaluatethevariousencodingschemes.Foreachtable,wepresentthesizeoftheoriginalrawtablewithoutcompression.Wecompareittothetotalsizeofthecompressedtable,includingthedictionaryforthreecompressionalgorithms:the xed-lengthencoding,theHuffmanencodingandoursuggestedencoding.TheresultsarepresentedinFig.7.
Forinstance,inthesecondreal-lifetable(China1),pre-sentedinFig.7(b),weconsiderthe903entriesoftwocolumnsrepresentingtheVLANandtheTarget-Port elds.Withoutencoding,eachentryisallocated29bitsperentryandthustherawdatawithoutencodingrequires903·29=26187bits.Usingthethreeencodings,thesizeofthedictionariesisalmost xedandequalsapproximately2900bits.Anentrywidthof11and14bitsisachievedinthe xed-lengthencodingandintheHuffmanencoding,respectively,whileintheproposedencodingweachieveanentrywidthofonly8bits.Thisleadstoanimprovementof20.7%,34.9%,and61.3%inthetotalmemorysize(includingthedictionary)comparedtothe xed-length,HuffmanandRawsolutions,respectively.
Wewouldalsoliketoexaminetheef ciencyoftheen-codingschemewhiledealingwithforwardingtableupdates.Toillustrateupdatesweperformthefollowingexperiment.Foreachofthethreereal-lifetables,weconsiderthe rsthalfofentries(e.g.1395outof2790inthetablefromUnitedStates).Wethen ndforeachofthem,oursuggestedencodingscheme.Next,weconsidertheentriesinthesecondhalfoftheoriginaltableasnewinsertedentries.Weexaminetheabilitytoencodethenewentrieswithinthedeterminedencodingwidth.Anotherobstacleisthatthesenewentriesmightincludenewelementsthatarenotencodedintheencodingschemefoundforthe rsthalfofentries.Ourhighinterestininsertionsofnewelementsisexplainedbythefactthat,asmentionedinSectionVI,changesinexistingentriescanbealsosupportedbyinsertionsofnewentries.
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 ...
热门文档