140IEEEJOURNALONSELECTEDAREASINCOMMUNICATIONS,VOL.32,NO.1,JANUARY2014
wouldnotnecessarilyaddressthisproblem:whileitisoptimalfortheaverageentrywidth,itmayyieldaworstcasethatendsupwastingasigni cantnumberofbits.Therefore,foragivenforwardingtablewithdcolumns,ourgoalistosuggestasetofdpre xencodingsthatminimizesthemaximalencodedentrywidth.Thismakesitparticularlyhard,becauseeachentrywidthinvolvesallcolumns,andthemaximalonealsoinvolvesallrowentries.Therefore,anystrongsolutionmayneedtojointlylookatalltheelements.
D.RelatedWork
Theforwardingtablescalingproblemhasbeenthoroughlyanalyzedanddiscussedinnetworkingindustryforumsandstandardsorganizations,bothintheL2andtheL3layers(e.g.[1],[3]–[5],[7],[8]).Theseanalysesraisetheconcernthatthesteepgrowthrateofforwardingtableshasoutrunthesteadytechnologygrowthrateofmemorydensity.
Variouscreativemethodshavebeenproposedtomitigatethisscalingproblem.First,FIBaggregation[9]isanapproachthatreducesthesizeofaforwardingtablebyaggregatingtableentrieswiththesamevaluesofthenexthop eld.Forinstance,twopre xrulesthatdifferonlyontheirlastbitcanbecombinedtoasinglepre xwithashorterpre x.Likewise,apre xmaybeeliminatedduetoredundancyachievedbyashorterpre xwiththesamenexthop.Asimilarapproachispresentedin[10]–[13].Forinstance,in[11]anoptimalrepresentationisfoundbasedondynamicprogrammingwhereineachrulethevalueofthenexthopcanbeselectedamongashortlistofpossiblevalues.However,thisapproachassumesthattheroutingtablehasatreestructure,i.e.theruleshavetheformofpre xesinanaddress eld(usuallyIPaddress)andcannotbeappliedinthecaseofmoregeneral elds,suchasanexactMACaddresswithacorrespondingattribute.Inaddition,therehavebeenstudiesinotherrelated elds.Clearly,ininformationtheory,therearemanyresultsoncom-pressionandonlowerboundsbasedonentropy[6].Likewise,databaseimplementationsalsoattempttoscalesystemsbyintroducingcompressiontechniques[14]–[16].Inparticular,in[14]adictionary-basedsolutionthatsupportsdeleteandupdateoperationsissuggested.A eldvalueisinsertedintothedictionaryandencodedbasedonitslengthanditsnumberofoccurrences.Likewise,ablockofdataiscompressedonlyifitscompressionratioisbeyondathreshold.However,thesestudiesdonotconsidertheforwardingtablerestrictionsthatwementionabove,andinparticulartheboundedentrylength.Recently,[17]studiedhowtomaximizetheprobabilityofencodingrandomentrieswithina xed-widthmemory.
Oursolutioncanbeconsideredasatypeoftopologi-caltransformation.MostoftherelatedapproachessuggestTCAM-basedsolutionsandmainlydiscussrangeencod-ing[18]–[20].OursolutioncanbeappliedtoamoregeneralclassoftablesandisnotnecessarilybasedonTCAM.
Finally,asmentioned,anorthogonalandcomplementaryconsiderationistheimplementationoftheforwardingtableusinghashing,inordertoeasily ndtherowthatcorrespondstoagivenkey[21].
E.Contributions
Thispaperinvestigatesanoveltechniquefortheef cientrepresentationofforwardingtablesindatacenterswitches,withasupportforfastrandomaccessand xed-widthmemorywords.
Westartbystudyinganof ineencodingschemeforagivenstaticFIBtable.Weprovethatitispossibletoformulatetheencodingproblemasanoptimizationproblem,andthattherelaxedoptimizationproblemisconvex.Asaresult,weproposeanovelalgorithmthatachieves,foranygivenforwardingtablewithdcolumns,theoptimalworst-caseentrywidthwithinaguaranteedconstantadditivefactorofd 1,independentlyoftheirvaluesandofthenumberofrows.Next,wealsoprovethatthegeneraloptimizationproblemisNP-hard,aslongasthereareatleastd=7columns.Wedosobypresentingareductionfromthe3 SATdecisionproblem.Therefore,thereislittlehopeforapracticaloptimalalgorithm.
Inaddition,wealsoconsiderthespecialcaseofforwardingtableswithd=2columns,whichmayonlyconsistofthekeyandtheaction.We rstsuggesttightupperandlowerboundsontheoptimalencodingwidthofatwo-columntableinthegeneralcase.Wealsoshowasuf cientconditionfora xed-lengthencodingtobeoptimal.Moreover,wepresentanoptimalconditionalencodingofasecondcolumnwhentheencodingofonecolumnisgiven.Later,wealsointroduceabipartitegraphthatcanmodeltheforwardingtable,andpresentadditionalgraph-theoreticboundsonitsoptimalencodingwidth.Theseimprovedboundsrelyonthecombinatorialpropertiesofthegraph,suchasthesizeofitsedgecover.
Finally,wealsodiscussthelimitsofourof inemodel,byanalyzinghowourcompressedforwardingtablesmaybeabletohandleupdates.Weshowthatanadditionalbitpercolumnandanadditionalsmallmemorymaybesuf cienttocopewithtemporaryloadsofentryadditions,modi cationsordeletions.Weconcludebyevaluatingthesuggestedencodingtech-niquesonreal-lifeforwardingtablesaswellasonsynthetictables.Wedemonstratehowourintroducedtechniquesfareagainstalternativealgorithmssuchas xed-lengthandHuff-mancoding.Inparticular,wegetclosertothecompressionlowerbound,albeitatthecostofanincreasedcomplexity.
II.MODELANDPROBLEMFORMULATION
A.Terminology
Westartwiththeformalde nitionofterminologyusedinthispaper.Forabinarycodeword(string)x,let (x)denotethelengthinbitsofx.
De nition1(FIBTable).AFIBtableA=((a11,...,a1d),...,(ah1,...,ah
andd))isatwo-dimensionalmatrixofhrows(entries)dcolumns( elds).
GivenaFIBtableA,wedenotebySj(forj∈setofelementvaluesinthejthcolumn,i.e.Sj= [1,d])the
h
alsodenotebynthenumberofdistinctelementsiin=1{aithej}.Wejjthcolumn,i.e.nj=|Sj|.Letsj,1,...,sj,njdenotetheelementsofSj.
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 ...
热门文档