150IEEEJOURNALONSELECTEDAREASINCOMMUNICATIONS,VOL.32,NO.1,JANUARY2014
TABLEII
DEALINGWITHRULEUPDATES.ENCODINGISBASEDONTHEFIRSTHALFOFTHEENTRIESINEACHFILE.ADDITIONALENTRIESARECONSIDERED
ASNEWINSERTEDENTRIES.
numbernumberraw xed-improvedlonguncodedofofdatalengthwidthentriesentries eldsentrieswidthwidthUnitedStates32790311513530China1290329118132China2
2
428
29
5
5
3
TheresultsaresummarizedinTableII.Ingeneral,onlyasmallportionofthenewentriescouldnotbeencodedwithinthepredeterminedwidth.Forinstance,inthetablefromUnitedStatesanencodingwidthof13bitswasobtainedintheencodingofthe rst1395entries,improvingthewidthof15bitsrequiredfortheencodingofthe lewiththe xed-lengthencoding.Whiletryingtoinsertthelast1395entriesofthesecondhalfofthe leasnewentries,1342ofthem(96.2%)couldbeencodedsuccessfullywithin13bitsbasedonthepreviouslyselectedencodingscheme.Only53entriesobtainedwidthslargerthan13.Inaddition,noneofthesenewentriescontainednewelementssuchthattheirencodingwasnotde nedintheschemeforthe rstentries.Likewise,inChina1,weencountered13entrieswithover owamong452insertedentries(only2.88%).Onlytwoofthenewentriescontainedelementsthatdidnotappearinthe rsthalfofentries.
C.ExtrapolatedTables
Wewanttoextrapolatethebehaviorsoftheseschemesfromreal-lifelimiteddatasetstothelargerexpecteddatasetstobeencounteredinfuturedatacenternetworkarchitectures.Theapproachwetakehereinistoamplifytheavailabledatasetsbyscalingoutthenumberofcolumnsinthetable,soastomodelatablewithascaled-outnumberofattributes.
WeextendtheChina1tablebyduplicatingandappendingtheportcolumnseveraltimes.Ineachnewcolumn,wepermutetheappearancesoftheelementsuniformlyatrandom.Themotivationistomodeladditionalforwardingattributesthatwouldfollowadistributionthatissimilartoanexistingone.Rearrangingtherowlocationsoftheduplicateelementsaddsrandomnesstotheextended le.AsseeninFig.8,foreachadditionalcolumnthe xedencodingincreasesbyaconstant,asexpectedsincethenumberofuniqueelementsineachcolumndoesnotvary.TheHuffmanandconvexencodingsincreaseataslowerpace,therebyincreasingtheencodingeffectivenessasthenumberofcolumnsgrows.Ofcourse,sincethistableisextendedsynthetically,weurgecautioninover-interpretingtheresults.
VIII.CONCLUSION
Inthispaper,wesawhowdatacentervirtualizationiscausingadramaticriseinthenumberofentriesinforwardingtables,suchthatitbecomesimpossibletoimplementfor-wardingtablesincurrentmemorysizeswithoutanycompres-sionalgorithm.Wetheninvestigatedthecompressibilityofforwardingtables,byintroducinganovelforwardingtablearchitecturewithseparateencodingineachcolumn.

Our
Fig.8.Effectivenessoftheencodingalgorithmontheextendedtable(basedontheChina1table),asafunctionofthenumberofcolumns.
architecturesupportsfastrandomaccessesand xed-widthmemorywords.Wealsolaterexplainedhowourarchitecturecanhandletableupdates.
Later,wesuggestedanencodingwhoseper-entrymem-oryrequirementisguaranteedtobewithinasmalladditiveconstantoftheoptimum.Finally,weevaluatedthisnewschemeagainstthe xed-widthandHuffmanschemes,usingbothsyntheticandreal-lifeforwardingtablesfromdifferentswitches,switchvendors,andnetworkcountrylocations.Asfuturework,weplantocheckhowusingadditionalhardwaresuchasCAMandTCAMcanhelpinfurthercompressingtheforwardingtables.
IX.ACKNOWLEDGMENT
WewouldliketothankYishayMansourandHaimKaplanfortheirhelpfulparticipationandsuggestions.
ThisworkwaspartlysupportedbytheAndrewViterbigrad-uatefellowship,bytheGoogleEuropeanDoctoralfellowship,byaEuropeanCommissionMarieCurieCIGgrant,bytheIntelICRI-CICenter,bytheIsraelScienceFoundationgrantNo.1241/12,bytheGerman-IsraeliFoundationforScienti cResearchandDevelopment,bytheJapanTechnionSocietyandGreenberg(Ottawa)ResearchFunds,andbytheIsraelMinistryofScienceandTechnology.
REFERENCES
[1]I.Gashinsky,“Datacenterscalabilitypanel,”inNorthAmericanNetwork
OperatorsGroup,NANOG52,2011.
[2]R.N.Mysoreetal.,“Portland:ascalablefault-tolerantlayer2data
centernetworkfabric,”inSIGCOMM,2009.
[3]T.Nartenetal.,“ProblemstatementforARMD,”IETF,draft-ietf-armd-problem-statement,workinprogress,2012.
[4]G.Hankins,“Pushingthelimits,aperspectiveonrouterarchitecture
challenges,”inNorthAmericanNetworkOperatorsGroup,NANOG53,2011.
[5]D.Meyer,L.Zhang,andK.Fall,“ReportfromtheIABworkshopon
routingandaddressing,”IETF,RFC4984,2007.
[6]T.M.CoverandJ.A.Thomas,Elementsofinformationtheory(2.ed.).
Wiley,2006.
[7]T.Narten,“Onthescalabilityofinternetrouting,”IETF,draft-narten-radir-problem-statement,workinprogress,2010.
[8]P.Francis,X.Xu,H.Ballani,D.Jen,R.Raszuk,andL.Zhang,“FIB
suppressionwithvirtualaggregation,”IETF,draft-ietf-grow-va,workinprogress,2011.
[9]X.Zhao,Y.Liu,L.Wang,andB.Zhang,“Ontheaggregatabilityof
routerforwardingtables,”inINFOCOM,2010.
[10]R.Draves,C.King,V.Srinivasan,andB.Zill,“Constructingoptimal
IProutingtables,”inINFOCOM,1999.
[11]Q.Li,D.Wang,M.Xu,andJ.Yang,“Onthescalabilityofrouter
forwardingtables:Nexthop-selectableFIBaggregation,”inInfocomMini-Conference,2011.
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 ...
热门文档