causeddroppingofthetos-basedroutingrequirementfromtheospfspecication.
|
|
- Peregrine Johnson
- 8 years ago
- Views:
Transcription
1 ComputerScienceDepartment ImplementationandPerformanceMeasurements CollegePark,MD20742 UniversityofMaryland GeorgeApostolopoulos ofqosroutingextensionstoospf RochGuerin,SanjayKamat protocol,andonvariousperformancemeasurementsmadeonthebasisofthisimplementation Inthispaper,wereportonanimplementationofQoSroutingextensionstotheOSPF AbstractYorktownHeights,NY10598 IBMT.J.Watson toassessthecostandfeasibilityofqosroutinginipnetworks.theresultsprovideinsight ResearchCenter ofqosroutingiswellwithinthelimitsofmodernprocessors.furthermore,wealsondthat theimplementationtoresultsgeneratedbymeansofsimulations.thisprovidesacomprehensive andprotocoloverhead.moreimportant,theyestablishstrongempiricalevidencethatthecost minutefractionofthebandwidthofmostlinks.thepaperalsoexploresthesensitivityofour althoughsupportforqosroutingdoesincreasetheamountofprotocoltrac,itstillremainsa ndingstovariationsinnetworksizeandtopology,bycombiningtheinformationobtainedfrom investigationoftheoperationalcostsofqosrouting. intotherespectiveweightsofthetwomajorcomponentsofqosroutingcosts,processingcost ofqosroutingforimprovingnetworkutilizationandtheservicelevelsprovidedtorequestswith QoSrequirements.Theimprovementtotheservicereceivedbyusersisintheformofanincreased e.g.,bandwidthordelay.severalrecentresearchresults[1,2,3,4,5]havepointedoutthepotential processofselectingthepathtobeusedbythepacketsofaowbasedonitsqosrequirements, attentioninthecontextofitspossibleuseinanintegratedservicesipnetwork.qosroutingisthe 1Introduction likelihoodofndingapaththatmeetstheirqosrequirements.conversely,theimprovementto networkeciencyisusuallyintermsofincreaseinrevenue,whererevenueistypicallyafunction Becauseofitspotentialbenets,QualityofService(QoS)routinghasrecentlyreceivedsubstantial stateofnetworkresourcesthatareofrelevancetopathselection,e.g.,availablelinkbandwidth. coststhatsupportforqosroutingentails.theseaddedcostshavetwomajorcomponents:computationalcostandprotocoloverhead.theformerisduetothemoresophisticatedandmorefrequent implementingqosroutingprotocolsinipnetworks.thisisprimarilybecauseoftheadditional Suchupdatestranslateintoadditionalnetworktracandprocessing,inparticularinthecaseof ofthenumberofowsortheamountofbandwidthcarriedbythenetwork. pathselectioncomputations,whilethelatteriscausedbytheneedtodistributeupdatesonthe linkstateprotocols,onwhichmostoftheqosroutingproposalscurrentlybeingputforwardare Despitethesebenets,thereremainsmuchuncertaintyregardingthevalueandfeasibilityof based,e.g.,see[6]foranoverview.insuchacontext,itisimportanttoproperlyassessthemagnitudeofthesecosts,sothattheweightoftheassociatedbenetscanbebetterevaluated.such intoactualimplementationsandthetrade-ostheyinvolve. anassessmentshouldstrivetobothunderstandfundamentalcostcomponents,andprovideinsight 1
2 havebeeninvestigatedtoexplorethepossibilityofreducingtheprocessingcostofqospathcomputation.similarly,avarietyoflinkcostmetricsandupdatetriggeringtechniques[13,14]orpath issuesassociatedwithqosrouting.eventheverydetailedcostmodelsusedin[12,14,15],arenot selectiontechniques[14]havebeenproposedtolowertheprotocoloverheadofqosroutingwithout signicantlyaectingitsabilitytocomputeecientpaths.however,theseworksrelyprimarilyon SeveralrecentworkshaveaimedatsheddingsomelightintothecostsinherenttoQoSrouting. Inparticular,dierentvariationsofpathpre-computation[7,8,9,10]andpathcaching[11,12] simulations,andasaresultarenotabletofullycapturesomeofthemoreimplementationspecic sucienttopreciselycharacterizetheprocessingloadthatarealqoscapablerouterwillhaveto support.therefore,despitethegreaterinsightintothecostandbenetstrade-oofqosrouting, severalscenarios.thisprovidesvaluableinsightintotheoverallimplementationcomplexityofqos thedesignoftheseextensionsandtheirimplementation,wealsoevaluatetheirperformanceunder itsfeasibilityinipnetworksremainsaquestionmark,andresolvingitrequiresadditionalevidence routing,andthebehaviorofseveralofitscomponents.inparticular,usingthisimplementationwe PathFirst(OSPF)[16]routingprotocolunderthegated[17]environment.Inadditiontodescribing aqosroutingalgorithmbasedonextensionstoapopularimplementationoftheopenshortest ofacompleteimplementationofaqosroutingprotocolforipnetworks.specically,weimplement thatonlyarealimplementationcanprovide. obtainrealisticestimatesforthecostofvariousqosroutingoperationssuchaspathcomputation, Asaresult,thegoalofthispaperistollthisgapbyprovidingadetailedreportandassessment linkstateadvertisementsgenerationandreception,andcomparethecostofourqosenhanced versionofospftothatofthestandardospfprotocol.finally,thepaperalsoattemptsto combinesimulationdataandthendingsbasedonourimplementation,inordertoemulatethe operationofarouterthatispartofalargeqosenablednetworkandgetsomeinsightintothe amountofloadthatan\o-the-shelf",gatedbasedqosroutercanhandle. whichwearecurrentlypursuing. 5summarizesthendingsofthepaperandidentiesanumberofextensionsandenhancements, theqosextensionsweadded,andthegatedprogram,whichisthebaseofourimplementation. gatedbase,whilesection4reportsonperformancemeasurementsforourimplementation.section Section3givesanoverviewofourimplementationandhowwehaveaddedourQoSextensionstothe Thispaperisorganizedasfollows:InSection2,wepresentbackgroundinformationonOSPF, 2Background eachrouterandpropagatedtoallotherroutersusingreliableooding.thisoodingiscontrolledby statedatabase,whichcanberelativelyeasilyaugmentedtoincludeqosrelatedlinkmetrics.the databaseisconstructedandupdatedbymeansoflinkstateadvertisements,thataregeneratedby routingprotocolthathasbeenaninternetstandardforsometime.animportantcharacteristicof linkstateroutingprotocolsisthateachroutermaintainsthefulltopologyofthenetworkinalink TheOpenShortestPathFirst(OSPF)[16]isawellestablishedandwidelydeployedlinkstate 2.1LinkStateRoutingandOSPF havingneighboringroutersformalogicallinkbetweenthemcalledanadjacency,sothatinformation isoodedonlybetweenadjacentrouters.again,linkstateadvertisementscanthemselvesbe extendedtocarryqosinformation(see[18]). TheOSPFstandardspeciesthatroutersimplementingtheprotocolrunshortestpathDijkstra 2
3 identifywherepacketsaretobesentnextbasedontheirdestination.ospfallowsmultipleequal eachdestinationisalsoderivedandusedtoconstructthecorrespondingroutingtableentry,i.e., networks.theshortestpathcomputationperformedbyeachroutercreateswhatisknownasthe SPF(shortestpathrst)tree.AspartoftheSPFtreecomputation,thenexthopinformationfor costpathstoadestinationtosupportloadbalancing. inthenetwork.verticesintheospftopologycancorrespondtorouters,transitnetworks,orstub computationontheirlocallinkstatedatabase,anddeterminetheshortestpathtoallothervertices1 databaseofonlytheareatowhichitbelongsandthesummarizedlistofreachabledestinations statedatabasemaintainedateachrouter,sinceeachrouterneedstomaintainadetailedtopology specialbackbonearea.theuseofareasreducestheroutingprotocoltracandthesizeofthelink withinotherareas. domain.theroutingdomain(alsocalledanautonomoussystemoras)canbesplitintomultipleareaswhichareallinterconnected(eitherphysicallyorlogicallyviavirtuallinks)througha completenetworklinkstatedatabase,ospfallowsforatwolevelhierarchywithintherouting Inordertohandlethescalabilityproblemsassociatedwithbothoodingandmaintaininga thetosbyteinipdatagramsisbeingrevisedbytheietfandlackofdeploymentexperience TOS-basedroutingbyallowingrouterstoadvertiseindependentcostmetricsfordierentservice typesandspecifyingthatrouterscomputeadierentspftreeforeachtypeofservice.inspiteof maximumthroughput,andminimumdelay)thatwerespeciedforipdatagrams.ospfenabled NeitherweretherehostapplicationsrequestingspecicTOSinIPdatagrams.Thesemanticsof thisprovision,thereweren'tmultipleinteroperableospfimplementationssupportingthisfeature. supportthevedierenttypesofservice(viz.,normal,minimumcost,maximumreliability, Originally,OSPFspecicationallowedforTypeofService(TOS)basedroutinginorderto causeddroppingofthetos-basedroutingrequirementfromtheospfspecication. andattempttohighlightaspectsofrelevancetoqosextensions. beendroppedfromospf.routerscanindicatetheirtoscapabilityduringadjacencyformation ThereareseveralotheraspectsoftheOSPFprotocol,thatareofimportancetotheQoSextensions weimplementedandreportoninthispaper.intherestofthissection,wereviewthemajorones aretobeusedforroutecomputationisleftunspecied.thishasprovidedanopportunityto experimentwithqosroutingasanextensionofthetosfeaturesprovidedbystandardospf. andadvertisetosspecicmetricsintheirlinkstateadvertisementsalthoughhowsuchmetrics However,inordertoavoidpotentialbackwardcompatibilityproblems,notallTOSfeatureshave distributed.thestandardospfprotocoltracconsistsofseveraltypesofpackets,andthe theamountofroutingprotocoltrac,especiallywhenadditionalqosinformationneedstobe informationaboutchangesinthetopology,andareusedtocarrymultiplelinkstateadvertisements interestedreaderisreferredto[16]fordetails.here,webrieyreviewthoseofmostsignicancein thecontextofourimplementationofqosextensionstoospf.linkstateupdatepacketscontain (LSA).Astheirnameindicates,LinkStateAcknowledgmentpacketsareusedtoacknowledgereceipt oflinkstateadvertisements.finallydatabasedescriptionandlinkstaterequestpacketsareused Oneaspectofparticularsignicanceistheoodingmechanismasithasadirectbearingon setofroutersattachedtoagivennetwork.asmentionedbefore,multiplelsascanbeincluded containinformationaboutarouterandallitsincidentinterfaces,whilenetworklsasdescribethe inagivenlinkstateupdatepacket.linkstateadvertisementareeithergeneratedperiodically andnetworklinkadvertisementsbeingthemostrelevantonestoourqosextensions.routerlsas tosynchronizethelinkstatedatabasesofneighboringrouterswhentheyformanadjacency. 1Throughoutthispaperweuseinterchangeablythetermsvertexandnode. Therearealsoseveraltypesoflinkstateadvertisements(again,see[16]fordetails),withrouter 3
4 receiptofanlsa,thereceivingrouteracknowledgesthelsawithalinkstateacknowledgment packet.multiplelsascanbeacknowledgedinasingelinkstateacknowledgmentpacket. bandwidth,ofanyofthelinks.notethatbecausearouterlsaadvertisesthecurrentstateofall linksontherouter,achangeinthestateofasinglelinkresultsinthestateofalllinksbeingupdated. WepreservedthischaracteristicinourimplementationofupdateextensionsforQoSmetrics.On QoSextensions,theywillalsobetriggeredby\signicant"changesinthemetrics,e.g.,available oraretriggeredbytopologychangessuchaslinkfailuresorrecoveries.inthecontextofour twoconsecutiveoriginationsofagivenlsabyarouter.thedefaultvalueofminlsintervalis5 seconds.thisparameterisimportantinthecontextofqosextensions,asitlimitsthefrequency relatedtotheoodingoflsas.severalofthemareofparticularrelevancetotheqosextensions weconsider.inparticular,theconstantminlsintervalspeciestheminimumtimebetweenany atwhichchangesinlinkstatecanbeadvertised.qosmetricsbeingmorevariablethanlink status,lsasaimedatupdatingqosmetricsarelikelytobemorefrequent,andtheirprocessing couldthenbeaected(see[14]foranextensivediscussiononhowtolimitthefrequencyofqos TheOSPFstandardmandatesavarietyofconstantsthatcontrolthefrequencyoftheoperations causedbytoofrequentretransmissionsinsomecongurations.itsdefaultvaluehasbeensetto1 second. andsimplydiscarded.thisconstantwasaddedinthelastversionofospfbecauseofproblems isminlsarrival,whichlimitsthefrequencyatwhichnewinstancesofagivenlsacanbeaccepted. IftwoconsecutiveinstancesofanLSAarelessthanMinLSArrivalapart,thesecondisnotprocessed updates,andtheassociatedimpactontheperformanceofqosrouting).anothersimilarconstant triptimebetweenneighboringrouters.rxmtintervalcanbesetonaperinterfacebasis,whileall quencylsrefreshtime,whichhasadefaultvalueof30minutes.finally,recallthatospfprotocol messagesaresentasrawipdatagramsandreliabilityisimplementedwithinospfthroughacknowledgementsandretransmissions.thetimebetweenlsaretransmissionsisdeterminedby BesidesLSAstriggeredbystatechanges,arouteralsoperiodicallygeneratesLSAswithfre- otherconstantsarecommontoallinterfaces. RxmtInterval,whichhasadefaultvalueof5seconds,butneedstobesettowellovertheround- sub-section,wedescribemorepreciselythenatureoftheseextensions.inparticular,weoutlinethe modiedpathselectionusedtocomputeqosroutes,andidentifythemodicationsmadetolsas tosupportadvertisementofqosmetrics. suchproblemswithoutweakeningtheprotectionprovidedbythesetwoconstants,isoneofthe issuesthatneedstobeaddressedwhenimplementingsupportforqosextensions.inthenext mostlikelytointerferewiththemorefrequentupdatesassociatedwithqosmetrics.avoiding Asmentionedearlier,oftheaboveconstants,MinLSArrivalandMinLSIntervalaretheones 2.2OSPFExtensionsforQoSSupport Wechosetoimplementpathpre-computationbecauseofitspotentiallysignicantgainsintermsof [18]identiesseveralpossiblevariationsforQoSroutingextensions,thatincludeon-demandcomputationandpre-computationofQoSroutesaswellasbothexplicitandhop-by-hoproutingmodes. Ourimplementationperformspathpre-computationandisbasedonahop-by-hoproutingmode. quirements,andasaresultlinkbandwidthistheonlymetricsextensionthathasbeenimplemented. proposals[7,10]forsupportingqosrouting.itislimitedtohandlingrequestswithbandwidthre- Ourimplementationisbasedontheapproachdescribedin[18],whichissimilartoseveralother processingload,e.g.,see[15].similarly,weoptedforahop-by-hoproutingmode,simplybecauseit canbeaccommodatedwithoutmajorchangestorsvp[19],thesignalingprotocolthatweassume isusedtorequestqosguarantees,e.g.,see[20].4
5 OurimplementationcomputesQoSpathsusingthewidest-shortestpathselectioncriterion describedin[18].atarouter,thealgorithmpre-computespathsfromtherouter(thesourcevertex s)toalldestinationsinthenetwork.foreachdestination,thealgorithmcomputespathsofall possiblebandwidthvalues,andusesthemtobuildaqosroutingtablewhichiskeptseparatefrom thestandardospfroutingtable(moreonthislater).specically,foradestinationvertexd,the algorithmgeneratesthesetsd=<s1d;s2d;:::;snd>.thissetfurtherconsistsofanorderedlistof sets,wherethesetshdcontainsallpathsfromstodwithhopcounthandthemaximumbandwidth achievableforthathopcount.incaseswhenanincreaseinhopcountfromhtoh+1doesnot improvetheavailablebandwidth,thesetsh+1 discurrently2omitted.inotherwords,thesetsd maintainscandidatepathsinincreasingorderofhopcountandavailablebandwidth. TheQoSroutingtablegeneratedbythealgorithmcanthenbeconceptuallyviewedasamatrix, witheachrowassociatedwithaparticulardestination(entryintheiproutingtable),andeach columngivingtheamountofbandwidthavailableforagivenhopcount.eachentry(row-column intersection)inthetablecontains,inadditiontotheavailablebandwidthandthehopcount, informationidentifyingthenexthoponthepath(s)tothedestination3.notethatanentryinthe QoSroutingtablecancontainmorethanonenexthopincaseswhenseveralpathsexistforagiven hopcountandavailablebandwidth. TheinformationintheQoSroutingtableisusedtoidentifypathscapableofsatisfyingthebandwidthrequirementsofnewrequests.Thisisaccomplishedbycomparingtheamountofbandwidth requestedbyanewowtotheavailablebandwidthinsuccessiveentriesintherowassociatedwith theow'sdestination.thesearchstopsattherstentrywithanavailablebandwidthlargerthan therequestedvalue,atwhichpointthecorrespondingnexthopisreturnedandusedtodetermine wheretoforwardtherequestnext(see[20]fordetails).ifthereismorethanonenexthop,one ofthemmustbechosen.apossibleselectioncriterionistochoosethepathatrandombasedon theavailablebandwidthontheassociatedlocalinterface.thatis,theprobabilitypiofforwarding therequesttonexthopnireachablethroughinterfaceiwithlocalavailablebandwidthbi,isset topi=bi=pnj=1bj,wherenisthenumberofpossiblenexthopsintheroutingtableentry.this istheapproachusedinourimplementationasitfavorslocalloadbalancing.however,itshould benotedthatthismethodignorespotentialsharingofsubsequentlinksbetweenpaths,andhence mayhavelimitedeectivenessincertaintopologies.whileothermoresophisticatedmethodsare possible,inthecurrentimplementation,wechosetofocusontheabovesimplemethod. Inadditiontothechangesrequiredtoboththeroutingtableandthepathcomputation,the OSPFprotocolandcodealsoneedstobemodiedtosupportthepropagationofappropriately extendedlinkstateadvertisements.inparticular,informationaboutavailablebandwidthneedsto beaddedtothelinkstatedatabaseandupdatedthroughlinkstateadvertisements.theformatof LSAsis,therefore,extendedtocarryavailablebandwidthinformation.Thisinformationisencoded usinganewtoseld.theospfspecicationallowsavariablenumberoftos-metricstobe containedinanlsa.however,only16bitsareavailabletoadvertisethevalueofthemetric.while 16bitsaresucientforadvertisinglinkcostsforbest-eortrouting,advertisingbandwidthvalues forlinksrangingfromfewkilobitspersecondtomanyterabitspersecondrequiresmorecareful encoding.onesuchencodingschemeisdescribedin[18]andwasusedinourimplementation. Theproposalof[18]doesnotspecifyanumberofdetailssuchasthemechanismsfortriggering updatesorguidelinesonhowoftentopre-computepaths.theseissueswereinvestigatedthrough 2Wehaveexperimentedwithanumberofvariationsonthepathselectionalgorithm,thatrelaxthehopcount criterion,e.g.,keepingpathswithhigherhopcountbutthesamebandwidth,buttheyarenotincorporatedinthe currentimplementation. 3Asdescribedin[18]thiscaneasilybeextendedtoalsoprovidetheinformationneededtoconstructacomplete explicitroute. 5
6 simulationinseveralotherworks[14,15],andanumberofdesignchoicesintheimplementationwe protocolsonhostsrunningtheunixoperatingsystem.thedistributionofthegatedsoftwarealso gated[17]isapopular,publicdomain4programthatprovidesaplatformforimplementingrouting thisdiscussion,webrieyreviewsomeofthebasicaspectsofgatedonwhichourimplementation isbased. 2.3GateDaemon(gated) reportoninthispaperarebasedonthendingsofthoseworks.however,beforeweproceedwith servicesalsofacilitatedimplementationofsomeoftheextensionsthatwererequiredtosupport QoSrouting.Thesegatedservicesinclude: gatedenvironmentoersavarietyofservicesusefulforimplementingaroutingprotocol.these includesimplementationsofmanypopularroutingprotocols,includingtheospfprotocol.the Memorymanagement Asimpleschedulingmechanism Supportforcreationandmanagementoftimers asoneorseveraltasks.agatedtaskisacollectionofcodeassociatedwithaunixsocket.the socketisusedfortheinputandoutputofthetask.gated'smainloopconsists,amongother Routemanagement(e.g.,routeprioritizationandrouteexchangebetweenprotocols) Interfacesformanipulatingthehost'sroutingtableandaccessingthenetwork creationtimeandareinvokedbygated'smainloop.inaddition,themainloopalsoschedulesthe occurredinanyofthem.appropriatehandlersforavarietyofconditionsareregisteredattask operations,ofaselect()calloveralltasksocketstodetermineifanyread/writeorerrorconditions theschedulingmechanismsofgatedarelowprecision,andtimershaveamaximumresolutionof1 executionofexpiredtimersandlowerprioritycomputationscalledjobs.itshouldbenotedthat AllgatedprocessingisdonewithinasingleUnixprocess,androutingprotocolsareimplemented theospftask.periodicprocessingsuchasgenerationoflinkstateupdatesishandledwith makesitparticularlyimportanttoensurethatalltaskscompletereasonablyquickly.thisneeds second.furthermore,schedulingisnon-preemptiveandoperationsruntocompletion.thelatter generationoflsastoupdateqosmetrics,andre-computationoftheqosroutingtable.thisis primarilybecausewearerelyingonperiodictriggersforboththesetasks(see[14]formotivations tobetakenintoconsiderationwhenchoosingapathselectionalgorithmforqosrouting. ArrivingOSPFpacketsareprocessedbydispatchingthepacketreceptionhandlerregisteredby andevidencesupportingthesechoices). timerswhilelongerprocessingsuchasspfcomputationsarescheduledasjobs.currently,mostof ourextensionstosupportqosroutinghavebeenimplementedusingtimers.theseincludeboth Asanexample,OSPFisimplementedasasingletask,associatedwithasinglerawUnixsocket. administrativepreferencesandonlyasinglerouteisactiveperdestination.theseroutesareperiodicallydownloadedinthehost'skernelforwardingtable.ourqosroutingtableismaintainedasa tokeepmultipleentriesforagivendestinationasafunctionofhopcountandbandwidth. separatetable,primarilytoavoidconictscreatedbyprioritizationandbecauseofourrequirement 4AccesstosomeofthemorerecentversionsofthegatedisrestrictedtotheGateDconsortiummembers. gatedmaintainsasingleroutingtablethatcontainsroutesdiscoveredbyalltheactiverouting protocols.multipleroutestothesamedestinationareprioritizedaccordingtoasetofrulesand 6
7 ofthelinkstatedatabaseduringtheshortestpathcomputationeasyandecient,avoidingthe asadjacentrouters)arelinkedtogetheratthedatabaselevelwithpointers.thismakestraversal needforfulldatabaselookupsforlocatinglinkstaterecordsofneighboringnetworkelements.we takeadvantageofthesestructuresduringthecomputationoftheqosroutingtable. particularlinkstaterecord.inaddition,linkstaterecordsforneighboringnetworkelements(such Finally,theOSPFlinkstatedatabaseisimplementedusingaradixtree,forfastaccesstoa 3ImplementingtheQoSExtensionsofOSPF 3.1DesignObjectivesandLimitations QoSroutingimplementationwhilecontainingtheoverallimplementationcomplexity.Thus,our Oneofourmajordesignobjectiveswastogainsubstantialexperiencewithafunctionallycomplete importantassumptionsare: architecturewasmodularandaimedatreusingtheexistingospfcodewithonlyminimalchanges. QoSextensionswerelocalizedtospecicmodulesandtheirinteractionwithexistingOSPFcode waskepttoaminimum.besidesreducingthedevelopmentandtestingeortthisapproachalso facilitatedexperimentationwithdierentalternativesforimplementingtheqosspecicfeatures tionalitiesthatanearlyprototypeimplementationofqosroutingmustdemonstrate.someofthe suchastriggeringpoliciesforlinkstateupdatesandqosroutetablecomputation. Supportforonlyhop-by-hoprouting.ThisaectedthepathstructureintheQoSrouting Severalofthedesignchoiceswerealsoinuencedbyourassumptionsregardingthecorefunc- Supportforpathpre-computation.ThisrequiredthecreationofaseparateQoSroutingtable FullintegrationoftheQoSextensionsintothegatedframework,includingconguration beeasilyextendedtoallowconstructionofexplicitroutes,butthisiscurrentlynotsupported. tableasitonlyneedstostorenexthopinformation.asmentionedearlier,thestructurecan anditsassociatedpathstructure,andwasmotivatedbytheneedtominimizeprocessing overhead. Decouplingfromlocaltracandresourcemanagementcomponents,i.e.,packetclassiers Modularitytoallowexperimentationwithdierentapproaches,e.g.,useofdierentupdate thatcouldbeusedbyothers. thesepoliciesfromthegatedcongurationle. support,errorlogging,etc.thiswasrequiredtoensureafullyfunctionalimplementation, andschedulersandlocalcalladmission.thisissupportedbyprovidinganapibetweenqos andpre-computationtriggeringpolicieswithsupportforselectionandparameterizationof InterfacetoRSVP.TheimplementationassumesthatRSVP[19]isthemechanismusedto Futureimplementationswillbeabletospecifytheirownmechanismsforthismodule. requestrouteswithspecicqosrequirements.suchrequestsarecommunicatedthroughan routingandthelocaltracmanagementmodule,thathidesallinternaldetailsormechanisms. [18],namely Inaddition,ourimplementationalsoreliesonseveralofthesimplifyingassumptionsmadein interfacebasedon[21],andthersvpcodeusedwastheonecreatedbyisi,version4.2a2 [22]. 7
8 3.2Architecture ThescopeofQoSroutecomputationiscurrentlylimitedtoasinglearea. TheabovedesigndecisionsandassumptionsresultedinthearchitectureshowninFigure1.It AllinterfacesonarouterareassumedtobeQoScapable. AllrouterswithintheareaareassumedtorunaQoSenabledversionofOSPF,i.e.,interoperabilitywithnon-QoSawareversionsoftheOSPFprotocolisnotconsidered. consistsofthreemajorcomponents:thesignalingcomponent(rsvpinourcase);theqosrouting component;andthetracmanager.intherestofthispaperweconcentrateonthestructureand operationoftheqosroutingcomponent.ascanbeseeninfigure1,theqosroutingextensions arefurtherdividedintothefollowingmodules: Pathselectionandmanagementmoduleselectsapathforarequestwithparticular Updatetriggermoduledetermineswhentoadvertiselocallinkstateupdates. Pathpre-computationmodulecomputestheQoSroutingtablebasedontheQoSspecic Pre-computationtriggermoduledetermineswhentoperformQoSpathpre-computation. TspecmappingmodulemapsrequestrequirementsexpressedintheformofRSVPTspecs QoSroutingtablemoduleimplementstheQoSspecicroutingtable,whichismaintained linkstateinformation. QoSrequirements,andmanagesitonceselected,i.e.,reactstolinkorreservationfailures. independentlyoftheothergatedroutingtable. ever,insteadofthe\conceptual"matrixformatdescribedinthatsection,eachrowoftheqos QoSpathsarepre-computedandstoredintheQoSroutingtableasoutlinedinSection2.2.How- 3.3QoSRoutingTableandPathPre-ComputationModules Intherestofthissection,weoutlinethemainfunctionsofeachofthesemodules. andrspecsintothebandwidthrequirementsthatqosroutinguses. spondstoadierenthopcountandbandwidthvalue,arrangedinincreasingorder,i.e.,anentryfor routingtableconsistsofapathstructureintheformofalinkedlist.eachentryinthelistcorre- agivenhopcountiscreatedonlyifithasalargerbandwidththanpreviousentrieswithasmaller pathsavailablewiththesamehopcountandbandwidthvalue.asmentionedearlier,thisisused apathrequestspeciesadestinationaddressandabandwidthrequirement,andtherststepin donotcorrespondtoanincreaseinbandwidth.inadditiontothehopcountandbandwidthinformation,eachentryinthelistalsocontainsalinkedlistofnexthopsassociatedwiththedierent isthemeansforaccessingtherowassociatedwithapathrequesttoagivendestination.specically, forloadbalancingbetweenequalcostpaths. hopcount.thisavoidshavingtoallocatememoryforentriesassociatedwithhopcountvaluesthat whichthedestinationisreachable.suchavertexcanbeatransitnetwork,astubnetwork,or identifyingasuitablepathistoretrievethepathstructureassociatedwiththevertexthrough thedestinationhostitself.identifyingthisvertexisaccomplishedbyreusingthesameradixtree BesidesthelinkedliststructureofeachrowoftheQoSroutingtable,anotherimportantaspect 8
9 MAPPINGFigure1:Thesoftwarearchitecture QOS ROUTE PRECOMPUTATION QOS ROUTE CORE OSPF TABLE FUNCTIONS + (ENHANCED) PRECOMPUTATION TOPOLOGY TRIGGER DATABASE FLOW PATHS TABLE structureusedtoimplementthegatedroutingtableitself.thegatedradixtreestructurecarries RECEIVE & someoverheadbecauseitneedstoallowcoexistenceofmultipleroutingprotocols,andasaresult UPDATE INTERFACE STATUS QoS LSA PATH SELECTION asimplerandmoreecientdatastructurecouldhavebeendevisedifwehadfocusedonlyonthe & MANAGEMENT BUILD & LINK STATE theimplementation(nonewcomponent)andreducethedevelopmenttime.asaresult,theexisting requirementsoftheqosroutingtable.however,wechosetoreusetheexistingstructuretosimplify SEND TRAFFIC PARAMETERS UPDATE TRIGGER QoS LSA gatedfacilityisusedtoconstructaseparateradixtreebasedontheaddressandreachability Routing Enabled OSPF informationcontainedinthelinkstatedatabase.eachleafoftheradixtreecorrespondstoa RSVP RESOURCE Thispointerisimplementedusingthegatedttsimechanism,thatallowstheinstallationofuser destinationvertex,andapointerisprovidedtotheqospathstructureassociatedwiththisvertex. MANAGER deneddatainaleafoftheradixtree. implementingthemaingatedroutingtable,thiscouldcreatepotentialconsistencyproblemsas structures.sincetheradixtreestructureisthesameastheoneusedbythemaingatedrouting availablepathstodestinationvertices,whiletheradixtreeisusedtofacilitateaccesstothesepath decidedtokeeptheqosroutingtableindependentofthegatedroutingtabletoconformtoour table,apossibleoptionwouldhavebeentosharethisstructurebetweenthetworoutingtables.we designgoalsoflocalizingchangesandminimizingimpactontheexistingospfcode.inparticular, whileitwouldbepossibletoattachtheqospathstructuresdirectlytotheleavesoftheradixtree NotethatthebulkoftheQoSroutingtableisinthepathstructuresdescribingthedierent otherroutingprotocolscontinuouslymanipulateandmodifythegatedroutingtable.inaddition, theqosroutingtablegetsre-builtindependentlyofthegatedroutingtable;afurtherreasonfor keepingthetwoseparate.finally,thegatedroutingtablecontainsroutesdiscoveredbyallactive routingprotocols,whiletheqosroutingtableisonlyassociatedwithourqosextendedversionof OSPF. thebellman-fordcomputation.duringthisconstructionphase,itisnecessarytoassociatethelink AnotherimportantaspectoftheQoSroutingtableistheoverheadinvolvedinbuildingitduring 9
10 statedatabaseentities(vertices)thatarebeingexpandedbythebellman-fordalgorithmwith containedinthelsaassociatedwiththevertexbeingexpanded(routerid'sinthecaseofarouter LSA,andnetworkid'sinthecaseofanetworkLSA).Thisprovidesageneral,albeitinecient solution,asitrequiresafulllookupintheradixtreeeachtimeavertexisexpandedinthebellman- canbeaccomplishedbyusingtheradixtreeoftheqosroutingtabletosearchfortheaddress thecorrespondingpathstructuresthatcontainthepathsdiscoveredsofarforthisvertex.this Fordcomputation.Inordertoavoidsuchapenaltyinourimplementation,weaddedapointer asmalladditionalmodicationtotheexistingvertexstructure,whichhadtobemodiedanyhow tosupporttheqosextensions. directlytothepathstructureinsidethevertexstructureinthelinkstatedatabase.thisrequired structureforthisvertex.atthistime,thepointerinthevertexstructureisupdatedtopointto insertionofthevertexintheradixtreeoftheqosroutingtableandthecreationofaninitialpath thenewlycreatedpathstructureforthevertex.inaddition,thettsieldinthenew(leaf)node structurethatpointstothevertexpathstructureisexamined.anullvalueforthispointerisan indicationthatthisisthersttimethevertexisbeingvisited.asaresult,thistriggersboththe insertedintheradixtreewiththisvertexasdestination,isalsoupdatedtopointtothesamepath expandsverticesasthehopcountincreases.whenavertexisexpanded,thepointerinthevertex WhentheBellman-Fordcomputationisinstantiated,itproceedsfromthesourcevertexand QoSroutingtablestructureisshowninFigure2. otherospfimplementations.itsmainbenetisthatitdecouplesthepathstructuresandthepath computationfromtheexactformatusedinthelinkstatedatabase.anoverviewoftheresulting structure.bothpointersarethenavailablefortherestofthepathpre-computationphase,and pointerbacktothevertexisalsoaddedinthepathstructureitself,inordertoallowdecouplingthe pathstructurefromthevertexstructure,andfacilitateportingoftheqosspecicextensionsto provideimmediateaccesstotheexistingpathstructureofanyvertexbeingexpanded.another treein-order,andde-allocatingeachnodeinthetreealongwithanypathstructurethatmay de-allocationofmemory.currently,whenanewqosroutingtableistobecomputed,both theradixtreeandthepathstructuresarefreed.thisisaccomplishedbytraversingtheradix bepointedtobythettsieldoftheleafnode.thisfullde-allocationoftheqosroutingtableis potentiallywasteful,especiallysincememoryallocationandde-allocationisanexpensiveoperation. Furthermore,becausepathpre-computationsaretypicallynottriggeredbychangesintopology, thesetofdestinationswillusuallyremainthesameandcorrespondtoanunchangedradixtree.a ThelastissueofsignicanceintheconstructionoftheQoSroutingtable,isallocationand naturaloptimizationwouldthenbetode-allocateonlythepathstructuresandmaintaintheradix tree.afurtherenhancementwouldbetomaintainthepathstructuresaswell,andattemptto 3.4UpdateandPre-computationTriggerModules incrementallyupdatethemonlywhenrequiredbecauseofadierentnumberofpathswithdistinct TheupdatetriggermoduledetermineswhenarouteroodsanewLSAtoadvertisechangesinits correctlyremovefaileddestinationsfromtheradixtreeandupdatethetreeaccordingly. andnumerouscomplexitiestoensuretheintegrityoftheoveralldatastructureatalltimes,e.g., notbeenincludedinourinitialimplementation.themainreasonisthattheyinvolvesubtle hopcountsandbandwidthvalues.however,despitethepotentialgains,theseoptimizationshave linkmetrics.thepre-computationmoduleisresponsibleforinitiatingthecomputationofanew QoSroutingtable.Inordertoallowforexperimentation,thesetwomodulessupportanumberof optionsthatcanbeconguredintheimplementation. Theupdatetriggermoduleimplements:10
11 Figure2:Mappingbetweendierentdatastructures Mapping using Radix Tree the ttsi information Path... Paths to D with hop length H1... Paths to D with hop length H2... Paths to D with hop length H3... Paths to D with hop length H4 Destination D QoS Routing Table using pointer in the path Periodicupdategeneration. Avarietyoftriggeringpolicies.Examplesofsuchpoliciesare:a)Thresholdbasedpolicy:an updateistriggeredwhenthedierencebetweenthepreviouslyoodedandthecurrentvalue using a pointer Thepre-computationtriggermoduleimplements: crossed.classesmayhaveequalorexponentiallyincreasingsizesforlargervaluesofavailable bandwidth. foravailablelinkbandwidthislargerthanacongurablethreshold.b)classbasedpolicy: splitthecapacityofalinkinanumberofclassesandadvertisewhenaclassboundaryis in the vertex Vertex node D Beabletoreceivenoticationofeventsofinterest.Inparticular,thepre-computationmodule Periodicpre-computation. Triggeredpre-computationeachtimeNdistinctlinkstateadvertisementhavebeenreceived. Toimplementthisfunctionalitybothmodulesneedto: ThiscanbeaccomplishedbyinsertinghooksintotheOSPFcoderesponsibleforreceivingand processinglsas.similarly,theupdatetriggeringmoduleneedstobeinformedofchanges needstobenotiedofthearrivalofalinkstateadvertisementoratimerexpirationevent. Maintainandposttheirowntimers.Bothmodulesneedtwotypesoftimers:a)Clampdown sentifthetimerhasexpired.clamp-downtimerscanbeimplementedthroughacombination timers,thatareusedtolimitthefrequencyofmetricsupdates,i.e.,theupdatecanonlybe managertonotifytheupdatetriggeringmoduleofsuchchanges. intheavailablebandwidthonlocallinks.thisisneededtoensurethatthecorrectvalue ofastandardtimerandaag.theagissetwhenthetimerisstartedandresetwhenthe issentinthenextlsa,andinsomeinstancestodetermineifanupdateisneeded.this timerexpires.byinspectingtheagthemodulecanthendetermineiftheclampdowntimer isaccomplishedthroughtheuseofasimplemessaginginterface,thatallowstheresource hasexpiredornot.b)timersforperiodicoperation.thesearesimpletimerscoupledtothe appropriatetimerexpirationhandler.11
12 pathcomputation,itisharderforupdatetriggering.aswasalludedtointheprevioussection,this isbecausetheregularospfupdatetriggeringrulescaninterferewiththetriggeringpolicyimplementedbytheupdatetriggeringmodule.specically,theperiodic(rxmtinterval)andownclamp Ideally,theoperationoftheabovetwomodulesshouldbetransparenttotheexistingOSPF additiontothetheospfcodethathandlesinterfacestatuschanges. accomplishforthepathcomputationcomponentasitoperatesindependentlyoftheregularospf mechanismsformanagingbothpathcomputationandupdatetriggering.whilethisiseasyto Benotiedwhenalocallinkchangesstatus(up/down).Thisisaccomplishedthroughasmall onesecondisthesmallestpossiblevaluewecanspecify,anditistheonewecurrentlyuseinthe implementation.ifinsomesituations,asmallervalueisrequired,modicationstothegatedtimer morefrequentqosupdates.notethatsincethecurrentresolutionofgatedtimersisinseconds, downtimers(minlsintervalandminlsarrival)ofospfmayneedtobedisabledorbypassedin ordertoavoidinterferingwiththegenerationofqoslsas.oneoptionistodisabletheexisting codewillbeneededtoallowforanerresolution. toimplementasimilarmechanismtoensurestabilityoftheprotocolduringperiodsofoverload. Asaresult,weoptedforthesimpleapproachofdecreasingthevalueofMinLSIntervaltoallow OSPFclamp-downmechanismsinthecaseofQoSrelatedLSAs.However,itremainsnecessary infrequently(thelifetimeofadatabaseentryis1,800seconds),thecurrentimplementationallows allupdatesoriginatedbyospf.changesinthestatusofalocalinterfacecouldbeinferredfromthe originatedperiodicupdates.forsimplicityandgiventhatperiodicospfupdatesareoriginated thatalllsassentbytheospfprotocolaretrappedandroutedthroughit.asaresult,theupdate bandwidthvaluesadvertised.thisisachievedbyimplementingtheupdatetriggeringmoduleso triggeringnow\sees"alllsasandcan,therefore,controlwhichonestoblock,ifany,e.g.,theospf ofanystandardlsageneratedbyospfasthisaectsitsbook-keepingregardingthelastavailable Inadditiontotheaboveissue,itisalsoimportanttoinformtheQoSupdatetriggeringmodule onsuchanexplicitnoticationmechanism,asitlearnsaboutchangesinlinkstatusfromthe associatedlsageneratedbyospf,butagainforsimplicityweoptedforanexplicitnotication oftheupdatetriggeringmodule.notethatthepre-computationtriggermoduledoesnotrely componentresponsibleforprocessingincominglsas(anlsaisalsousedtoreectanychange ofstatusofalocallinkinthelinkstatedatabase).thisdecouplingfromlocalstateinformation alsoextendstolinkmetrics.inparticular,computationoftheqosroutingtableisdoneusing itisdiculttoaccuratelycharacterizethetransmissionpatternsoflsascorrespondingtoqos accuratemetricsinformationcouldbeobtained.thisisimportanttominimizeinconsistenciesin themetricsinformationavailableinthelinkstatedatabase,evenforlocallinksforwhichmore updates,sothatdetermininganappropriatevaluefordelayingacknowledgmentisalsodicult.in updatetrac,thiscouldcauseoverowsintheretransmissionqueuesofthesender.unfortunately, edgmentsformultiplelsas.becauseupdatesofqosmetricsarelikelytoincreasetheamount addition,thecurrentdefaultvalueisfairlylarge(about20seconds),whichwouldinterferewith forqosrouting,isthesupportfordelayedacknowledgmentsthatallowsaggregationofacknowl- theqosroutingtablescomputedatdierentrouters. QoSupdatesexceptmaybewhenusingaperiodictriggermechanismwithalargetrigger(greater AnotherexistingOSPFmechanismthathasthepotentialtointerferewiththeextensionsneeded inourcurrentimplementationtobypassthismechanismaltogetherandimmediatelyacknowledge LSAsreceivedfromneighboringrouters. than20seconds).asaresult,sinceachievingameaningfullevelofaggregationforacknowledgmentsappearstorequireadelayvaluethatwillmostcertainlyinterferewithqosupdates,wechose Anotherapproachwhichweconsideredbutdidnotimplementatthispoint,wastomakeQoS 12
13 MakingQoSLSAsunreliablewouldbeareasonabledesignchoicebecauseoftheirmorefrequent LSAsunreliable,i.e.,eliminatetheiracknowledgments,soastoavoidanypotentialinterference. theproperoperationofthebaseospfprotocolitself.onesuchinstanceistheimpactofqos implementingandexperimentingwithsuchanoptioninthefuture. Anequallyandevenmoreimportantaspect,istoensurethatQoSextensionsdonotinterferewith operationofospf,andonlyreducethequalityofpathsdiscoveredbyqosrouting.weplanon LSAsonthestandardSPFcomputation.BecausesuchLSAsdonotcorrespondtochangesinlink transmission,butmoreimportantbecausethelossofaqoslsawillnotinterferewiththebase status,anewspfcomputationistypicallynotrequiredandshould,thereforebeavoided.our thathavethepotentialtointerferewiththeoperationoftheextensionsneededforqosrouting. implementationaddressesthisissuethroughtheuseofaagthatidentiesqoslsasandisused tobypassthespfcomputation. Finally,itshouldbenotedthattheabovediscussionhasfocusedonexistingOSPFmechanisms request,tosearchthroughtheradixtreeoftheqosroutingtable.thissearchidentiesthepath 3.5PathSelectionandManagementModule Thismodulehastwoparts,ofwhichonlythepathselectionparthasbeenimplemented.Path selectionisresponsibleforhandlingincomingrequestsforqosroutes,e.g.,triggeredbythereceipt ofanrsvppathmessage.thisisdonebyrstusingthedestinationinformationprovidedinthe structureassociatedwiththedestination.recallthatthepathstructureforadestinationconsists ofalistofnexthopscorrespondingtolonger,buthigherbandwidthpathstothedestination. Oncetheappropriatepathstructurehasbeenidentied,itisscanneduntiltheminimumhoppath withanavailablebandwidthlargerthanorequaltotheamountrequestedisfound.thenexthop oneisselectedatrandomwithprobabilityproportionaltotheamountofavailablebandwidthon information,i.e.,theassociatedinterface,oroneofthenexthopsifmorethanoneispresent,is thenreturnedandusedtoforwardtherequestonward.whenmorethanonenexthopispresent, theinterfaceasdiscussedinsection2.2.ifthesearchofthepathstructureterminateswithout timeofpathselection. (i.e.,thecorrespondingnexthop)tothedestination,i.e.,wedonotperformcalladmissionatthe ndingapathwithsucientbandwidth,wecurrentlyreturn(oneof)thewidestavailablepaths 3.6TspecMappingModule ThismodulesimplyextractsinformationfromtheRSVPTspecthatdescribestheQoSrequirements lastfeatureisnotyetsupportedinthecurrentimplementation. withtherequest.themanagementofthisentryinthepresenceofpathorreservationfailures(see [20]fordetails)istheresponsibilityofthepathmanagementpartofthemodule.However,this Onceapathhasbeenidentied,acorrespondingentryiscreatedinaowtable,andisassociated RSVP,version4.2a2. therestofthesystem.theintegratedservicesdatastructuresarethesameonesusedbytheisi wesupportonlyasimplemappingwherethetokenrateoftherequestisusedasthebandwidth requirementoftherequest.othermoresophisticatedmappingscanbeaddedlaterwithoutaecting ofarequest,andmapsittotheqosmodelsupportedbythesystem,i.e.,bandwidth.currently, 13
14 4PerformanceEvaluation 4.1Methodology Inthissection,weattempttoevaluatethecostofQoSrouting,whenusingourimplementation. Asdiscussedintheintroduction,weassumethatcomparedtoregularBest-Eortrouting,QoS constructarealnetworkwithroutersrunningourimplementation,andobserveandmeasuretheir costofqosrouting.consequently,wedonotdiscussroutingperformanceissuesorcomparerouting a)processingcost,b)messagegenerationandreceptioncost,andc)memoryrequirements.for processingcost,wefurthersubdivideitintopathpre-computationandpathselectioncosts. performanceofqosandnon-qosrouting(see[14]forsuchadiscussion),andconcentrateinstead onimplementationcostcomparisons.weexplorethreedierentdimensionsinourcomparisons: routinghasbenetsforthenetworkandtheuser,andtheprimaryissueisthepotentiallygreater operationalperformance.unfortunately,thisapproachisnotpracticalforanynon-trivialsize networkduetothehighcostofbuildingareallargescalenetwork.asaresult,weinvestigate stand-aloneoperations.forexample,thetimeneededforasinglepathpre-computation,orthe stepinthatdirectionistonoticethatmostoftheabovecostscanbemeasuredindividuallyoras measurementmethodsthatareaccuratewithoutrequiringalargeequipmentinvestment.therst sizeoftheqosroutingtablecanbeestimatedbasedonasinglerouter,whoselinkstatetopology ThemostcomprehensiveandaccuratemethodformeasuringthecostofQoSroutingisto timeittakestoselectapath.eventhecostofreceivingororiginatinglsascanbemeasured databasehasbeenpopulatedusingsomeexternalmechanism.thesameholdsformeasuringthe ciesandinteractionsthattakeplaceinarealoperationalenvironment.theseaectperformance, estimatestheintrinsiccostofqosrelatedoperations,itdoesnotfullycapturethemanydependenmentoftheimpactofqosroutingonarouter'soperation.thisisbecause,whilethisaccurately measurementsas\stand-alone"evaluationmode. reasonablyaccuratelybyusingonlytworoutersaftertheyformanadjacencyandstartexchanging ifonlybecausetheydeterminethefrequencyandtimingofmanyofthoseoperations,andthese LSAs.Thus,itispossible,withaminimumamountofequipment,toobtaingoodatomicestimatesofthecostofallindividualoperationsofinterest.Werefertothistypeofperformance parametersarediculttoestimatewithoutafullscalenetworkenvironment.inordertoaddress simulationsthatweusetocreatetheappearanceofalargenetwork. thisshortcomingofthestand-alonemeasurementmode,weproposetocombineitsresultswith Stand-aloneperformanceresultsaloneare,however,notsucienttoprovideacompleteassess- correspondtorepresentativeandrealisticoperationalconditions.onceagivensetofparameters estimateoftheoperationalbehaviorofaqosroutingenabledrouterinthesimulatednetwork. hasbeenxed,weselectoneofthesimulatedroutersasa\test-node"anduseittoobtainan parametersis\tuned"basedonourpreviousexperiencewiththissimulationenvironment,soasto requests,arrivalratesanddistributionofrequestsourcesanddestinations,andc)choiceofpath pre-computationandlinkstateupdategenerationtriggerpoliciesintherouters.eachoftheabove workwiththefollowingparameters:a)networktopology,b)traccharacteristicssuchassizeof Specically,wedeneasimulationenvironmentthatallowsustospecifyanoperationalnet- Thisisaccomplishedasfollows: thefollowingoperationsoccurredatthetestnode:a)generationofanlsa,b)receptionofan LSA,c)initiationofpathpre-computationand,d)initiationofpathselection.Theinformation usingeitheroneofthefollowingtwomethods.therstmethodusestheindividualoperations gatheredinthesimulationlogsisthenusedtoderiveoperationalcostsofthetest-noderouter Whileperformingasimulationrun,wegeneratealogthatcontainsthetimeatwhicheachof 14
15 cumulativecostisobtainedbyaddingindividualcostsbasedonthesimulationlogthatidentiesall thedierentoperationsperformedbytherouter.thecumulativecostcanthenbedividedbythe totalsimulationtimetoyieldanestimateoftherouterload.thesecondmethodusesthetiming andoperationinformationcontainedinthesimulationlogtodrivearealrouterandobserveits costsderivedfromthestand-aloneexperimenttocomputeacumulativecostatthetest-node.this themandthegrowthofoperationalcosts.ontheotherhand,thesecondmethodfocuseson Inparticular,therstmethodallowsustoestimatethenumberofoperationsperformedasvarious providesadierentestimateofperformancecosts,andasaresultallowsustocross-validateresults. parameterssuchasnetworksize,tracload,etc.,vary,butitassumesanadditiverelationbetween thenmeasuredandusedtoprovideanotherestimateoftheimpactofqosrouting.eachmethod behavior.thisisactuallyaccomplishedusingtworouters.oneusedtogeneratelsasaccording capturingpossibleinteractionsthatcantakeplacewithinarouterastheprocessingloadtriggered usedtoperformalltheotheroperationsspeciedinthetestlog.theloadonthistestrouteris toinformationinthesimulationlogonreceptionoflsas.thesecondisourtestrouter,andis dierenceisthatospfimplementstwotypesoflsas,routerandnetworklsas,andthesimulator First,thesimulator(amodiedversionofMaRS[23]builtforpreviousworks)usedtoderivethe byexternaleventsvaries. operationsandtiminglogs,doesnotexactlymimicthebehavioroftheospfprotocol.themain dier,theimpactofignoringnetworklsasshouldbeminimalasupdatesoflinkbandwidth assumesthatonlyrouterlsasaresent.however,whilehandlingofrouterandnetworklsasdo simulationbasedmethodwejustdescribedremainsanapproximation,albeitareasonableone. informationareprovidedonlythroughrouterlsas.suchlsasrepresent,therefore,thebulkof Beforeweproceedwithourperformanceevaluation,itisimportanttopointoutthatthe combinationofmultiplelsasintoasingleospfnetworkpacket,whichlowerstheirtransmission overhead.theseeectsarenotcapturedinthesimulator,whichdoesnotimposeanyminimum senttoaneighboringrouter.thisaectsthearrivalpatternsoflsasandisalsolikelytocausethe thequeuingofupdatesgeneratedatafasterrate,sothattheyareproperlyspacedbeforebeing ingof1secondweimposebetweenthetransmissionoftwoconsecutivelsas.thisconstraintforces LSAswhenoperatingaQoSroutingenableddomain,withnetworkLSAsbeingoriginatedonlyin spacingbetweenconsecutivelsas,andfurtherassumesthateachlsaistransmittedinitsown caseoftopologychangeswhichweanyhowdonotconsiderinoursimulation. OSPFpacket.Thiscanleadtoslightlylargerestimatesforoperationalcostssincethereceptionof Anotherdiscrepancybetweenthesimulatorandtherealimplementation,istheminimumspac- However,wedon'texpectthistohaveamajorimpact.Finally,themachineusedastestrouterisan machine.asaresult,whenmeasuringtheutilizationofthetestrouter,allthetrac,whichinthe simulatednodecameandleftthroughmultipleinterfaces,isnowpassingthroughthesameinterface. ordinaryunixbasedhostrunninggatedwithoutanyofthesoftwareandhardwareoptimizations, secondevaluationmethod.specically,onlyasinglenetworkinterfacewasavailableforthetest containingmultiplelsas. multipleindividuallsasislikelytobemoreexpensivethanthereceptionofasingleospfpacket thatmostcommercialroutersareequippedwith.nevertheless,despitetheseshortcomings,we believethatthisstudyprovidesrealisticinsightintotheprocessingrequirementsof\typical"qos Hardwarelimitationsintroduceanothersourceofdiscrepancy,whichismorerelevanttothe gated3.6a.2software.theethernetadaptersusedinthetestsare10mbit/secondsmcpci. processor,64mbytesofrealmemory,3.4gbytesofdisk,runningfreebsd2.2.5-releaseand routingloads. Inallexperiments,thetestsystemsusedareIBMIntellistationswithaPentiumPro200MHz 15
16 computingtheqosroutingtabletothatoftheospfshortestpathcomputation,andthememory 4.2Stand-AloneCost requirementsoftheqosroutingtabletothoseofthestandardospfroutingtable.pathselection onesinanon-qosroutingenabledimplementation.inparticular,wecomparethecostofpre- WeappropriatelyinstrumenttheimplementationinordertomeasurethecostofeachoftheQoS specicoperationsweidentiedearlier.inparticular,wemeasurethetimeneededtocompute Therstofthesetwocomponentsiscommontobest-eortroutingwhilethesecondisuniqueto costinqosroutinghastwocomponents:theradixtreesearchbasedondestinationaddressand thelinearscanningofthepathstructurelistforafeasiblepathbasedonbandwidthrequirement. theqosroutingtable,theamountofmemorythistableneeds,andthetimeittakestoselecta QoSrouting. pathfromthistable.afterobtainingthesemeasurements,wecontrastthemwithcorresponding numberofpathsimpliesahigherpathcomputationtimeaswellasabiggerqosroutingtable.in links.thisisbecausepathpre-computationmaintainsalternatepathswithbottleneckbandwidth largerthanthatofminimumhoppaths.asaresult,thenumberofdistinctpathstoagiven ordertoreportrepresentativeguresfortheoverheadofqosrouting,wethereforeneedtoconsider asisthecaseforthestandardospfprotocol,butalsoonthedistributionofavailablebandwidthon destinationvariesaccordingtothedistributionofavailablebandwidthonnetworklinks.alarger theimpactoflinkbandwidthdistribution,andpossiblyreportresultsfordierentcases. ItisimportanttonotethatQoSroutingspeciccostsdependnotonlyonthenetworktopology, oflinkbandwidths,thatresultsinthemaximumdistinctnumberofpathsbeinggeneratedwhen computingtheqosroutingtable.unfortunately,suchadirectapproachappearstoocomplex topologybydefaultingthepathpre-computationalgorithmtoaminimumhopcountalgorithm. asidentifyingsuchaworstcasebandwidthdistributionseemstorequiretheenumerationofan knowtodependonlinkbandwidthdistribution.specically,weobtainthebestcaseforagiven intermediatesolution,weproposetocomputebothbestandaveragecasesforthosecoststhatwe exponentialnumberofpaths.thismakestheproblemdiculteveninsmalltopologies.asan Onepossibleapproachistoattempttoidentify,foraparticularnetworktopology,anassignment inisolation.however,therearealsodependenciesonexternalfactorssuchasnetworksizeand andreceptionoflsas.thecostoftheseoperationscanbemeasuredbyconsideringeachofthem topology.inparticular,generationandhandlingoflsastypicallyinvolvesaccessingthelinkstate Thisyieldstheminimumpossible(one)numberofpathstoeachdestination.Next,weobtainan randomlinkbandwidthdistribution,andaveragingtheresultingcosts. thatwealsomeasurethecostofoperationsthatarecommontoboth.inparticular,generation estimateoftheaveragecasebyexecutingthepathpre-computationalgorithmforasequenceof database,andthecostofsuchanoperationcandependonthesizeandorganizationofthedatabase. Thisinturnislikelytodependonnetworksize.Weinvestigatetheextentofanysuchdependency byconsideringmultiplenetworksizesandtopologies. ComparisonbetweenQoSroutingenabledandstandardversionsoftheOSPFprotocol,require tiveofthenetworktopologyofatypicalinternetserviceproviderintheus.thisistheisptopology showninfigure3(a),whereallnodescorrespondtorouternodesinterconnectedbypoint-to-point thecorrespondingsetofentries.weconsidertwotypesoftopologies. particular,thismeansarticiallypopulatingthelinkstatetopologydatabaseoftherouterswith stateofourtestrouters5totheonecorrespondingtothenetworktopologyweareassuming.in Therstoneisatopologythathasbeenusedinanumberofpreviousstudies,andisrepresenta- Finally,inordertoperformanyoftheabovemeasurements,weneedtorstinitializetheinternal 5Recallthatweusetwo. 16
17 Test node A Test node A Test node B links.intheisptopology,themaximumpathlengthforthebellman-fordcomputationwassetto 16hops.Thetopologyisdimensionedforuniformtrac,assumingminimumhoprouting,sothat Source linkcapacitiesrangebetween20and70mbits/second.thesecondtypeoftopologyweconsider,is (a)theisptopology (b)thevariablesizemeshtopology Source Transit Networks anarticial,meshliketopologythatisconstructedbyrepeatingabasicbuildingblock.thebasic Figure3:Topologiesusedincostmeasurements Routers smallblackdotscorrespondtorouternodes,whilethewhitecirclesindicatetransitnetworknodes buildingblockwhichconsistsof4routersand5transitnetworksisdepictedinfigure3(b).the intheospftopologydatabase.annnmeshtopologyisconstructedbyrepeatingthebuilding blockalongtwodimensions.figure3(b),alsoillustrates22meshtopology.inthistopology,all Test node B Building Block Varyingthesizeofthemeshtopologyallowsustoobservehowthecomputationcostvarieswith 4.2.1QoSRoutingTableComputation thistopologyrangingfrom11to1010.foratopologyofsizenn,themaximumhoplimit linksareassumedtohaveacapacityof45mbits/second.inourexperimentsweuseinstancesof thatthegureforthenumberofroutersinonearearangesfrom20to350with100beingthe medianand160beingthemean.weshowresultsfornetworksofupto400nodes.thetime networksize.arecentsurvey[24]ofvendorswhohavedeployedospfinrealnetworks,reports forthebellman-fordcomputationwassetton+2. neededforcomputingthestandardspftreeandtheqosroutingtableforthemeshtopologyare isanaspectwhichweinvestigateinsection4.3. QoSpathpre-computationmaybesignicantlylargerthanthatoftheSPFcomputation,andthis averagecase.inbothcases,theprocessingcostofqospathpre-computationisnotsignicantly thecostofde-allocatingthepreviousqosroutingtable,andresultsareshownforthebestand largerthanthatofthespfcomputation.however,oneshouldrememberthatthefrequencyof computationarebasedonarticiallyconguringthelinkstatedatabaseofourtestrouterforthe showninfigure4.theperformanceestimateforboththespfcomputationandtheqospathpre- itcanhelpidentifyitemsthatmaybeworthyoffurtheroptimization,eitherintheimplementation dierentnetworksizesweassume.inthecaseofqosrouting,thepre-computationtimesinclude Itisinterestingtobreakdownthecostofpathpre-computationintoindividualcomponents,as 17
18 SPF QoS Table Best Case QoS Table Average Case computationcost,37%ofthetotaltimeisspentinde-allocatingthepreviousqosroutingtable Another23%isusedforaccessingthelinkstatedatabasetoretrieveinformationaboutnodesand Figure4:Processingtimeforpathcomputation 6000 theirlinks,forsearchingthroughlinkstaterecords,andforfollowingpointersbetweenlinkstate orintheoperationoftheprotocolitself.forthatpurpose,weusetheprolingtoolgprofto conclusionthatcanbedrawnfromtheabovenumbers,isthatgiventhecostofde-allocatingthe spentinsideafunctionanditsdescendants.basedonthis,wendthatoftheoverallpathpre- databaseentries.theremaining40%includesthevariouscomputationsperformedbythealgorithm aswellasmanagementandupdatesofpathstructures,andallocationofnewpathentries.one estimateindividualoperationalcosts.thetoolprovidesuswithinformationaboutthetotaltime Network Size standardgatedroutingtablefordierentnetworksizes.asbefore,themeshtopologyisusedto generatenetworksofvaryingsize.itshouldalsobenotedthatalthoughthegatedroutingtable Figure5illustratesthedierencesinmemoryrequirementsbetweentheQoSroutingtableandthe 4.2.2MemoryRequirementsoftheQoSRoutingTable appeartohavethepotentialtoyieldsignicantperformanceimprovements. previousqosroutingtable,thememorymanagementoptimizationsthatwerepreviouslydiscussed, OSPFprotocolwasactive.Asaresult,thecomparisonbetweenroutingtablesizesismeaningful. Conclusionssimilartotheonesthatcouldbedrawnfromthepreviouscomparisonofprocessing costs,applytomemoryrequirements.specically,whilethememoryrequirementsforqosrouting areclearlyhigher,giventhecostandavailabilityofmemory,thedierenceisagainnotextremely signicant,e.g.,aboutafactorof2fortheaveragecase.thisdierencewastobeexpectedsince bothtablescontainaradixtreeofalldestinations,andtheqosroutingtablerequiresadditional storageforthepathstructures.itisthisadditionalstoragethatcorrespondstothedierences normallycontainsrouteslearnedfromalltheactiveroutingprotocols,inourexperimentsonlythe intheradixtreebasedonthedestination,andsecondasearchofthepathstructureassociatedwith valueandreturningasuitablepath(nexthop).accessingtheroutingtablerequiresrstalookup PathselectionconsistsofaccessingtheQoSroutingtableforagivendestinationandbandwidth showninfigure CostofPathSelection 18 Time (microsec)
19 SPF QoS Table Best Case QoS Table Average Case alongwhichaveragingcantakeplace.foragiventopologyanddistributionoflinkbandwidth, Figure5:Comparisonofmemoryrequirements averagingcanbedonebasedonthedestinationnodeandtheamountofrequestedbandwidth.the destinationaectsnotonlythecostofthelookupintheradixtree,butalsothepotentialdepthof thesearchinthepathstructureassociatedwiththedestination,asthenumberofentriesinthepath thedestinationuntilapathcapableofsatisfyingtherequestedbandwidthisfound.thecostof 0 structureislikelytodierfromdestinationtodestination.thesearchinthepathstructureisalso totheminimumhopcount.asfarastheaveragecaseisconcerned,therearetwodimensions bestcaseisobtainedbyforcingallpathstructurestoonlycontainoneentry,theonecorresponding theseoperationsisshowninfigure6forboththebestandaveragecases.asmentionedearlier,the Network Size aectedbytherequestedbandwidthaslargevalueswilltypicallyrequiresteppingthroughmore networklinks.thisresultsinthemaximumsearchtimethroughthepathstructure,sothatweare entriesinthepathstructure.inourmeasurements,weaveragebasedonlyondestinations,andthe ineectmeasuringanaverageworstcase. isavoidedbyforcingallrequeststobeforanamountofbandwidthlargerthanthecapacityofthe averageiscomputedacrossallpossibledestinationsinthenetwork.averagingbasedonbandwidth pathsandfewlinkdisjointpathsofhigherhopcount.thisagainminimizesanydierencebetween averageandbestcases.finally,thelimitedprecisionoftheprolingtoolmightalsohaveaected theresulttosomeextent.themainmessagefromfigure6isthatwhilethecostofpathselection causeisthearticialnatureofthemeshtopology,whichhasalargenumberofminimumhopcount boththeaverageandthebestcase,thedierencesbetweenthetwoshouldbeminimal.another rstisthatthelookupintheradixtreeisthedominantcomponent,andsinceitisidenticalfor fornetworksofsizeover300nodes.thereareanumberofreasonsfortheobservedbehavior.the Figure6showssimilarperformancefortheaverageandbestcasesfornetworksof50nodesand costsofqosroutingfromothercostsoftheroutingsystemsuchasrsvpandinterfacecosts,we mayslightlyincreasewithnetworksize,thissensitivityissmallandsoistheactualcostofselecting apath,atleastinthecontextofapre-computedqosroutingtable. simulatedthearrivalofarequestbydirectlyinvokingthepathselectionfunction. andpassedtogatedthroughthersvp-gatedinterface.sinceinthisstudywewanttoisolatethe Weshouldalsonotethatinarealoperationalenvironment,requestswillbeoriginatedbyRSVP 19 Size (bytes)
20 Time (microseconds) Figure6:Costofpathselection Best Case 9800 Average Case Network Size Average Case QoSroutingversionsofOSPF.TheyconsistofthecostofgeneratingandreceivingLSAs,that Thelastsetofparameters,whosecostswewanttoestimate,arecommontothestandardand Figure7:Costofaccessingthelinkstatedatabase isreceived,theinformationabouttheremoterouterneedstobeenteredinthelinkstatedatabase, 4.2.4LinkStateAdvertisementsGenerationandReception 3800 andthereforeadatabaseaccessneedstobeperformed. router,constructingthelinkstateadvertisementpacket,andoodingitoverallinterfaces.we areincurredinbothcases.generatinganlsainvolvesscanningalltheactiveinterfacesofthe assumedinourmeasurementthateachlsawassentinitsownpacket.conversely,whenanlsa ThetimerequiredforgeneratingandreceivingLSAswasmeasuredusingtwosimilarmachines Network Size machineswereconguredsoastoformanospfadjacency,andthenexchangelsasbetweenthem. connectedtoeachother,andrunninggatedwithourqosroutingenabledversionofospf.the TheOSPFclampdownmechanismbasedonMinLSIntervalandMinLSArrivalwasdisabled,in ordertogetaccuratemeasurementsofthelsagenerationandreceptioncosts. crosecondsinourtestsystem.thisishowevernotamarginalcostwhencomparedtosomeof Accordingtoourmeasurements,eithergeneratingorreceivinganLSAtakesabout200mi- Time (microsec)
Lecture 23: Interconnection Networks. Topics: communication latency, centralized and decentralized switches (Appendix E)
Lecture 23: Interconnection Networks Topics: communication latency, centralized and decentralized switches (Appendix E) 1 Topologies Internet topologies are not very regular they grew incrementally Supercomputers
More informationComputer Networks II Master degree in Computer Engineering Exam session: 11/02/2009 Teacher: Emiliano Trevisani. Student Identification number
Computer Networks II Master degree in Computer Engineering Exam session: 11/02/2009 Teacher: Emiliano Trevisani Last name First name Student Identification number You are only allowed to use a pen and
More informationTopological Properties
Advanced Computer Architecture Topological Properties Routing Distance: Number of links on route Node degree: Number of channels per node Network diameter: Longest minimum routing distance between any
More informationCisco s Massively Scalable Data Center
Cisco s Massively Scalable Data Center Network Fabric for Warehouse Scale Computer At-A-Glance Datacenter is the Computer MSDC is the Network Cisco s Massively Scalable Data Center (MSDC) is a framework
More informationCHAPTER 8 CONCLUSION AND FUTURE ENHANCEMENTS
137 CHAPTER 8 CONCLUSION AND FUTURE ENHANCEMENTS 8.1 CONCLUSION In this thesis, efficient schemes have been designed and analyzed to control congestion and distribute the load in the routing process of
More informationQuestion 1. [7 points] Consider the following scenario and assume host H s routing table is the one given below:
Computer Networks II Master degree in Computer Engineering Exam session: 11/02/2009 Teacher: Emiliano Trevisani Last name First name Student Identification number You are only allowed to use a pen and
More informationAutonomous Fast Rerouting for Software Defined Network
Autonomous ast Rerouting for Software Defined Network 2012.10.29 NTT Network Service System Laboratories, NTT Corporation Shohei Kamamura, Akeo Masuda, Koji Sasayama Page 1 Outline 1. Background and Motivation
More informationProject Report on Traffic Engineering and QoS with MPLS and its applications
Project Report on Traffic Engineering and QoS with MPLS and its applications Brief Overview Multiprotocol Label Switching (MPLS) is an Internet based technology that uses short, fixed-length labels to
More informationOSPF Version 2 (RFC 2328) Describes Autonomous Systems (AS) topology. Propagated by flooding: Link State Advertisements (LSAs).
OSPF Version 2 (RFC 2328) Interior gateway protocol (IGP). Routers maintain link-state database. Describes Autonomous Systems (AS) topology. Propagated by flooding: Link State Advertisements (LSAs). Router
More informationHow To Route A Network Over The Internet With Qos Based Routing
Issues on QoS based Routing in the Integrated Services Internet Gábor Rétvári Department of Telecommunications and Telematics, Budapest University of Technology and Economics (BUTE) High Speed Networks
More informationHow To Provide Qos Based Routing In The Internet
CHAPTER 2 QoS ROUTING AND ITS ROLE IN QOS PARADIGM 22 QoS ROUTING AND ITS ROLE IN QOS PARADIGM 2.1 INTRODUCTION As the main emphasis of the present research work is on achieving QoS in routing, hence this
More informationFast Reroute Techniques in MPLS Networks. George Swallow swallow@cisco.com
Fast Reroute Techniques in MPLS Networks George Swallow swallow@cisco.com Agenda What are your requirements? The solution space U-turns Traffic Engineering for LDP Traffic Engineering Some Observations
More informationQuality of Service Routing Network and Performance Evaluation*
Quality of Service Routing Network and Performance Evaluation* Shen Lin, Cui Yong, Xu Ming-wei, and Xu Ke Department of Computer Science, Tsinghua University, Beijing, P.R.China, 100084 {shenlin, cy, xmw,
More informationWAN Topologies MPLS. 2006, Cisco Systems, Inc. All rights reserved. Presentation_ID.scr. 2006 Cisco Systems, Inc. All rights reserved.
MPLS WAN Topologies 1 Multiprotocol Label Switching (MPLS) IETF standard, RFC3031 Basic idea was to combine IP routing protocols with a forwarding algoritm based on a header with fixed length label instead
More informationAnalysis of QoS Routing Approach and the starvation`s evaluation in LAN
www.ijcsi.org 360 Analysis of QoS Routing Approach and the starvation`s evaluation in LAN 1 st Ariana Bejleri Polytechnic University of Tirana, Faculty of Information Technology, Computer Engineering Department,
More informationRelationship between SMP, ASON, GMPLS and SDN
Relationship between SMP, ASON, GMPLS and SDN With the introduction of a control plane in optical networks, this white paper describes the relationships between different protocols and architectures. Introduction
More informationLink-State Routing Protocols
Link-State Routing Protocols Malin Bornhager Halmstad University Session Number 2002, Svenska-CNAP Halmstad University 1 Objectives Link-state routing protocol Single-area OSPF concepts Single-area OSPF
More informationIntroducing Basic MPLS Concepts
Module 1-1 Introducing Basic MPLS Concepts 2004 Cisco Systems, Inc. All rights reserved. 1-1 Drawbacks of Traditional IP Routing Routing protocols are used to distribute Layer 3 routing information. Forwarding
More informationSDN IN WAN NETWORK PROGRAMMABILITY THROUGH CENTRALIZED PATH COMPUTATION. 1 st September 2014
SDN IN WAN NETWORK PROGRAMMABILITY THROUGH CENTRALIZED PATH COMPUTATION st September 04 Aaron Tong Senior Manager High IQ Networking Centre of Excellence JUNIPER S AUTOMATION HORIZON SDN IS A JOURNEY NOT
More informationLoop-Free IP Fast Reroute Using Local and Remote LFAPs
Loop-Free IP Fast Reroute Using Local and Remote LFAPs I. Hokelek, M. A. Fecko, P. Gurung, S. Samtani Contact: Ibrahim Hokelek Applied Research Telcordia Technologies Inc. ihokelek@research.telcordia.com
More informationPath Selection Methods for Localized Quality of Service Routing
Path Selection Methods for Localized Quality of Service Routing Xin Yuan and Arif Saifee Department of Computer Science, Florida State University, Tallahassee, FL Abstract Localized Quality of Service
More informationData Center Convergence. Ahmad Zamer, Brocade
Ahmad Zamer, Brocade SNIA Legal Notice The material contained in this tutorial is copyrighted by the SNIA unless otherwise noted. Member companies and individual members may use this material in presentations
More informationAnalysis of traffic engineering parameters while using multi-protocol label switching (MPLS) and traditional IP networks
Analysis of traffic engineering parameters while using multi-protocol label switching (MPLS) and traditional IP networks Faiz Ahmed Electronic Engineering Institute of Communication Technologies, PTCL
More informationCHAPTER 6 SECURE PACKET TRANSMISSION IN WIRELESS SENSOR NETWORKS USING DYNAMIC ROUTING TECHNIQUES
CHAPTER 6 SECURE PACKET TRANSMISSION IN WIRELESS SENSOR NETWORKS USING DYNAMIC ROUTING TECHNIQUES 6.1 Introduction The process of dispersive routing provides the required distribution of packets rather
More informationProviding QoS in OSPF based best effort network using load sensitive routing q
Simulation Modelling Practice and Theory 15 (2007) 426 448 www.elsevier.com/locate/simpat Providing QoS in OSPF based best effort network using load sensitive routing q Anunay Tiwari, Anirudha Sahoo *
More informationChapter 10 Link-State Routing Protocols
Chapter 10 Link-State Routing Protocols CCNA2-1 Chapter 10 Note for Instructors These presentations are the result of a collaboration among the instructors at St. Clair College in Windsor, Ontario. Thanks
More informationFaculty of Engineering Computer Engineering Department Islamic University of Gaza 2012. Network Chapter# 19 INTERNETWORK OPERATION
Faculty of Engineering Computer Engineering Department Islamic University of Gaza 2012 Network Chapter# 19 INTERNETWORK OPERATION Review Questions ٢ Network Chapter# 19 INTERNETWORK OPERATION 19.1 List
More informationQuality of Service Routing
REPORT 1(54) ` Quality of Service Routing State of the Art Report Summary Quality of Service (QoS) routing is concerned with routing traffic such that the QoS requirements of the carried traffic are met.
More informationImplementation of Traffic Engineering and Addressing QoS in MPLS VPN Based IP Backbone
International Journal of Computer Science and Telecommunications [Volume 5, Issue 6, June 2014] 9 ISSN 2047-3338 Implementation of Traffic Engineering and Addressing QoS in MPLS VPN Based IP Backbone Mushtaq
More informationEvaluating the Overheads of Source-Directed Quality-of-Service Routing
Evaluating the Overheads of Source-Directed Quality-of-Service Routing Anees Shaikh Jennifer Rexford Kang G. Shin Department of Electrical Engineering Network Mathematics Research and Computer Science
More informationA QoS Network Management System for Robust and Reliable Multimedia Services
A QoS Network Management System for Robust and Reliable Multimedia Services S. Das, K. Yamada, H. Yu, S. S. Lee, and M. Gerla Computer Science Department University of California, Los Angeles Los Angeles,
More informationReal-Time Communication in IEEE 802.11 Wireless Mesh Networks: A Prospective Study
in IEEE 802.11 : A Prospective Study January 2011 Faculty of Engineering of the University of Porto Outline 1 Introduction 2 3 4 5 in IEEE 802.11 : A Prospective Study 2 / 28 Initial Considerations Introduction
More informationMPLS TE Technology Overview
C H A P T E R MPLS TE Technology Overview In this chapter, you review the following topics: MPLS TE Introduction Basic Operation of MPLS TE DiffServ-Aware Traffic Engineering Fast Reroute This chapter
More informationBuilding MPLS VPNs with QoS Routing Capability i
Building MPLS VPNs with QoS Routing Capability i Peng Zhang, Raimo Kantola Laboratory of Telecommunication Technology, Helsinki University of Technology Otakaari 5A, Espoo, FIN-02015, Finland Tel: +358
More informationLecture 2.1 : The Distributed Bellman-Ford Algorithm. Lecture 2.2 : The Destination Sequenced Distance Vector (DSDV) protocol
Lecture 2 : The DSDV Protocol Lecture 2.1 : The Distributed Bellman-Ford Algorithm Lecture 2.2 : The Destination Sequenced Distance Vector (DSDV) protocol The Routing Problem S S D D The routing problem
More informationAll Rights Reserved - Library of University of Jordan - Center of Thesis Deposit
iii DEDICATION To my parents, my wife, my brothers and sisters, and my son for their encouragement, and help during this thesis. iv ACKNOWLEDGEMENT I would like to thank my supervisor prof. Jameel Ayoub
More informationQoS Switching. Two Related Areas to Cover (1) Switched IP Forwarding (2) 802.1Q (Virtual LANs) and 802.1p (GARP/Priorities)
QoS Switching H. T. Kung Division of Engineering and Applied Sciences Harvard University November 4, 1998 1of40 Two Related Areas to Cover (1) Switched IP Forwarding (2) 802.1Q (Virtual LANs) and 802.1p
More informationVipersat Management System (VMS) & SLM-5650A Series Modem Course Description
Vipersat Management System (VMS) & SLM-5650A Series Modem Course Description Course Overview The Vipersat Management System (VMS) & SLM-5650A Series Modem training course is beneficial to people playing
More informationMPLS Network Design & Monitoring
Slide 1 MPLS Network Design & Monitoring Slide 2 What Is MPLS Traffic Engineering? Traffic Control -Unexpected Incidences -Fiber Cut -Delay Network Optimization Efficient Use of Network Resources Topology
More informationMPLS: Key Factors to Consider When Selecting Your MPLS Provider
White paper MPLS: Key Factors to Consider When Selecting Your MPLS Provider New Edge Networks June 2008 New Edge Networks 3000 Columbia House Blvd. Vancouver, WA 98661 360-693-9009 1-866-636-EDGE www.newedgenetworks.com
More informationComputer Network Architectures and Multimedia. Guy Leduc. Chapter 2 MPLS networks. Chapter 2: MPLS
Computer Network Architectures and Multimedia Guy Leduc Chapter 2 MPLS networks Chapter based on Section 5.5 of Computer Networking: A Top Down Approach, 6 th edition. Jim Kurose, Keith Ross Addison-Wesley,
More informationSmart WWW Traffic Balancing
Smart WWW Traffic Balancing Erol Gelenbe Ricardo Lent Juan Arturo Nunez School of Electrical Engineering & Computer Science University of Central Florida Introduction The Internet is one of the biggest
More informationDatagram-based network layer: forwarding; routing. Additional function of VCbased network layer: call setup.
CEN 007C Computer Networks Fundamentals Instructor: Prof. A. Helmy Homework : Network Layer Assigned: Nov. 28 th, 2011. Due Date: Dec 8 th, 2011 (to the TA) 1. ( points) What are the 2 most important network-layer
More informationMPLS Part II - Recovery
MPLS Part II - Recovery Outline Introduction MPLS Recovery Framework MPLS Mechanism for Protection/Restoration Shared Backup LSP Restoration Fast reroute RSVP-TE Recovery A Heuristic Restoration Approach
More informationImplementing MPLS VPN in Provider's IP Backbone Luyuan Fang luyuanfang@att.com AT&T
Implementing MPLS VPN in Provider's IP Backbone Luyuan Fang luyuanfang@att.com AT&T 1 Outline! BGP/MPLS VPN (RFC 2547bis)! Setting up LSP for VPN - Design Alternative Studies! Interworking of LDP / RSVP
More information2. What is the maximum value of each octet in an IP address? A. 28 B. 255 C. 256 D. None of the above
CCNA1 V3.0 Mod 10 (Ch 8) 1. How many bits are in an IP C. 64 2. What is the maximum value of each octet in an IP A. 28 55 C. 256 3. The network number plays what part in an IP A. It specifies the network
More informationInternational Journal of Scientific & Engineering Research, Volume 4, Issue 11, November-2013 349 ISSN 2229-5518
International Journal of Scientific & Engineering Research, Volume 4, Issue 11, November-2013 349 Load Balancing Heterogeneous Request in DHT-based P2P Systems Mrs. Yogita A. Dalvi Dr. R. Shankar Mr. Atesh
More informationRing Protection: Wrapping vs. Steering
Ring Protection: Wrapping vs. Steering Necdet Uzun and Pinar Yilmaz March 13, 2001 Contents Objectives What are wrapping and steering Single/dual fiber cut Comparison of wrapping and steering Simulation
More informationMonitoring within an Autonomic Network: A. Framework
Monitoring within an Autonomic Network: A GANA based Network Monitoring i Framework Anastasios Zafeiropoulos, Athanassios Liakopoulos, Alan Davy, Ranganai Chaparadza tzafeir@grnet.gr Greek Research and
More informationQoS Implementation For MPLS Based Wireless Networks
QoS Implementation For MPLS Based Wireless Networks Subramanian Vijayarangam and Subramanian Ganesan Oakland University, Rochester, Michigan Abstract : Voice has been the primary application in wireless
More informationCHAPTER 6. VOICE COMMUNICATION OVER HYBRID MANETs
CHAPTER 6 VOICE COMMUNICATION OVER HYBRID MANETs Multimedia real-time session services such as voice and videoconferencing with Quality of Service support is challenging task on Mobile Ad hoc Network (MANETs).
More informationInternet QoS: the Big Picture
Internet QoS: the Big Picture Xipeng Xiao and Lionel M. Ni Department of Computer Science 3115 Engineering Building Michigan State University East Lansing, MI 48824-1226 {xiaoxipe,ni}@cse.msu.edu Abstract
More informationA New Fault Tolerant Routing Algorithm For GMPLS/MPLS Networks
A New Fault Tolerant Routing Algorithm For GMPLS/MPLS Networks Mohammad HossienYaghmae Computer Department, Faculty of Engineering, Ferdowsi University of Mashhad, Mashhad, Iran hyaghmae@ferdowsi.um.ac.ir
More informationEvaluation And Implementation Of The Open Shortest Path First (OSPF) Routing Protocol
Evaluation And Implementation Of The Open Shortest Path First (OSPF) Routing Protocol G.C NWALOZIE 1, V.N OKOROGU 2, A.C OKAFOR 3, A.O UMEH 4 1, 2, 3,4 Electronic and Computer Engineering Department, Nnamdi
More informationQoSIP: A QoS Aware IP Routing Protocol for Multimedia Data
QoSIP: A QoS Aware IP Routing Protocol for Multimedia Data Md. Golam Shagadul Amin Talukder and Al-Mukaddim Khan Pathan* Department of Computer Science and Engineering, Metropolitan University, Sylhet,
More informationTE in action. Some problems that TE tries to solve. Concept of Traffic Engineering (TE)
1/28 2/28 TE in action S-38.3192 Verkkopalvelujen tuotanto S-38.3192 Network Service Provisioning Networking laboratory 3/28 4/28 Concept of Traffic Engineering (TE) Traffic Engineering (TE) (Traffic Management)
More informationInternet QoS: A Big Picture
12 Internet QoS: A Big Picture Xipeng Xiao and Lionel M. Ni, Michigan State University Abstract In this article we present a framework for the emerging Internet quality of service (QoS). All the important
More informationFactors to Consider When Designing a Network
Quality of Service Routing for Supporting Multimedia Applications Zheng Wang and Jon Crowcroft Department of Computer Science, University College London Gower Street, London WC1E 6BT, United Kingdom ABSTRACT
More informationAn Efficient Primary-Segmented Backup Scheme for Dependable Real-Time Communication in Multihop Networks
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 11, NO. 1, FEBRUARY 2003 81 An Efficient Primary-Segmented Backup Scheme for Dependable Real-Time Communication in Multihop Networks Krishna Phani Gummadi, Madhavarapu
More informationSBSCET, Firozpur (Punjab), India
Volume 3, Issue 9, September 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Layer Based
More informationNetwork Instruments white paper
Network Instruments white paper MONITORING SERVICE DELIVERY IN AN MPLS ENVIRONMENT A growing number of enterprises depend on (or are considering) MPLS-based routing to guarantee highbandwidth capacity
More informationCS/ECE 438: Communication Networks. Internet QoS. Syed Faisal Hasan, PhD (Research Scholar Information Trust Institute) Visiting Lecturer ECE
CS/ECE 438: Communication Networks Internet QoS Syed Faisal Hasan, PhD (Research Scholar Information Trust Institute) Visiting Lecturer ECE Introduction The Internet only provides a best effort service
More informationAsynchronous Bypass Channels
Asynchronous Bypass Channels Improving Performance for Multi-Synchronous NoCs T. Jain, P. Gratz, A. Sprintson, G. Choi, Department of Electrical and Computer Engineering, Texas A&M University, USA Table
More informationBGP Vector Routing. draft-patel-raszuk-bgp-vector-routing-01
BGP Vector Routing draft-patel-raszuk-bgp-vector-routing-01 Keyur Patel, Robert Raszuk, Burjiz Pithawala, Ali Sajassi, Eric Osborne, Jim Uttaro, Luay Jalil IETF 88, November 2013, Vancouver, Canada Presentation_ID
More informationNetwork Contention and Congestion Control: Lustre FineGrained Routing
Network Contention and Congestion Control: Lustre FineGrained Routing Matt Ezell HPC Systems Administrator Oak Ridge Leadership Computing Facility Oak Ridge National Laboratory International Workshop on
More informationHow To Understand The Benefits Of An Mpls Network
NETWORKS NetIron XMR 16000 NETWORKS NetIron XMR 16000 NETWORKS NetIron XMR 16000 Introduction MPLS in the Enterprise Multi-Protocol Label Switching (MPLS) as a technology has been around for over a decade
More informationRouting Protocols OSPF CHAPTER. The following topics describe supported routing protocols. Topics include OSPF, page 9-1 IS-IS Protocol, page 9-3
CHAPTER 9 The following topics describe supported routing protocols. Topics include OSPF, page 9-1 IS-IS Protocol, page 9-3 OSPF Open Shortest Path First (OSPF) is a link state Internet routing protocol.
More informationQuality of Service Routing in MPLS Networks Using Delay and Bandwidth Constraints
Quality of Service Routing in MPLS Networks Using Delay and Bandwidth Constraints Mohammad HossienYaghmae Computer Department, Faculty of Engineering, Ferdowsi University of Mashad, Mashhad, Iran hyaghmae@ferdowsi.um.ac.ir
More informationReal-Time OSPF Route Monitoring
Real-Time OSPF Route Monitoring Emmanuel Baccelli 1 and Raju Rajan 2 Abstract: In this paper, we present the design and the implementation of an OSPF route monitoring service hooked up to a managed IP
More informationTraffic Engineering & Network Planning Tool for MPLS Networks
Traffic Engineering & Network Planning Tool for MPLS Networks Dr. Associate Professor, Department of Electrical Engineering Indian Institute of Technology Bombay, Powai, Mumbai 76 Founder & Director, Vegayan
More informationManagement of Telecommunication Networks. Prof. Dr. Aleksandar Tsenov akz@tu-sofia.bg
Management of Telecommunication Networks Prof. Dr. Aleksandar Tsenov akz@tu-sofia.bg Part 1 Quality of Services I QoS Definition ISO 9000 defines quality as the degree to which a set of inherent characteristics
More informationVoice Over IP. MultiFlow 5048. IP Phone # 3071 Subnet # 10.100.24.0 Subnet Mask 255.255.255.0 IP address 10.100.24.171. Telephone.
Anritsu Network Solutions Voice Over IP Application Note MultiFlow 5048 CALL Manager Serv # 10.100.27 255.255.2 IP address 10.100.27.4 OC-48 Link 255 255 25 IP add Introduction Voice communications over
More informationThe necessity of multicast for IPTV streaming
The necessity of multicast for IPTV streaming ARIANIT MARAJ, ADRIAN SHEHU Telecommunication Department Faculty of Information Technology, Polytechnic University of Tirana Tirana, Republic of Albania arianit.maraj@ptkonline.com,
More informationBGP Convergence in much less than a second Clarence Filsfils - cf@cisco.com
BGP Convergence in much less than a second Clarence Filsfils - cf@cisco.com 1 Down Convergence T1 Down Convergence T2 Default metric = 1 Src R R 20 F Dst Link L Assume a flow from Src to Dest T1: when
More informationInvestigation and Comparison of MPLS QoS Solution and Differentiated Services QoS Solutions
Investigation and Comparison of MPLS QoS Solution and Differentiated Services QoS Solutions Steve Gennaoui, Jianhua Yin, Samuel Swinton, and * Vasil Hnatyshin Department of Computer Science Rowan University
More informationExplicit Multicast Routing
Explicit Multicast Routing Malik Mubashir HASSAN Stagiaire, ARMOR 2 IRISA Supervisors: Bernad Cousin Miklos Molnar 1 Plan Introduction of Group Communications Various types of Group Communications Multicast
More informationA Fast Path Recovery Mechanism for MPLS Networks
A Fast Path Recovery Mechanism for MPLS Networks Jenhui Chen, Chung-Ching Chiou, and Shih-Lin Wu Department of Computer Science and Information Engineering Chang Gung University, Taoyuan, Taiwan, R.O.C.
More informationA Localized Adaptive Proportioning Approach to QoS Routing
QOS ROUTING A Localized Adaptive Proportioning Approach to QoS Routing Srihari Nelakuditi and Zhi-Li Zhang, University of Minnesota Here we assume source routing with bandwidth guarantees. ABSTRACT In
More informationNetwork management and QoS provisioning - QoS in the Internet
QoS in the Internet Inernet approach is based on datagram service (best effort), so provide QoS was not a purpose for developers. Mainly problems are:. recognizing flows;. manage the issue that packets
More informationICTTEN6172A Design and configure an IP- MPLS network with virtual private network tunnelling
ICTTEN6172A Design and configure an IP- MPLS network with virtual private network tunnelling Release: 1 ICTTEN6172A Design and configure an IP-MPLS network with virtual private network tunnelling Modification
More informationDEMYSTIFYING ROUTING SERVICES IN SOFTWAREDEFINED NETWORKING
DEMYSTIFYING ROUTING SERVICES IN STWAREDEFINED NETWORKING GAUTAM KHETRAPAL Engineering Project Manager, Aricent SAURABH KUMAR SHARMA Principal Systems Engineer, Technology, Aricent DEMYSTIFYING ROUTING
More informationData Networking and Architecture. Delegates should have some basic knowledge of Internet Protocol and Data Networking principles.
Data Networking and Architecture The course focuses on theoretical principles and practical implementation of selected Data Networking protocols and standards. Physical network architecture is described
More informationInterconnection Networks
Advanced Computer Architecture (0630561) Lecture 15 Interconnection Networks Prof. Kasim M. Al-Aubidy Computer Eng. Dept. Interconnection Networks: Multiprocessors INs can be classified based on: 1. Mode
More informationCisco IOS MPLS configuration
Introduction Cisco IOS MPLS configuration MPLS can be configured over different platforms It can be implemented on a purely router-based Internet backbone over an ATM switchednetwork -MPLS enables an ATM
More informationO 10.16.1.0/27 [110/129] via 192.168.1.5, 00:00:05, Serial0/0/1
1 Which two statements are true regarding the advantages of the use of static routes? (Choose increased security reduced effort in configuring routes the administrator maintains control over routing easier
More informationLecture 18: Interconnection Networks. CMU 15-418: Parallel Computer Architecture and Programming (Spring 2012)
Lecture 18: Interconnection Networks CMU 15-418: Parallel Computer Architecture and Programming (Spring 2012) Announcements Project deadlines: - Mon, April 2: project proposal: 1-2 page writeup - Fri,
More informationIP, Ethernet and MPLS
IP, Ethernet and MPLS Networks Resource and Fault Management Andre Perez ISTE WILEY Table of Contents Preface xi Chapter 1. Network Operation 1 1.1. Basic concepts 1 1.1.1. Layered structure 1 1.1.2. LANs
More informationInternet Firewall CSIS 4222. Packet Filtering. Internet Firewall. Examples. Spring 2011 CSIS 4222. net15 1. Routers can implement packet filtering
Internet Firewall CSIS 4222 A combination of hardware and software that isolates an organization s internal network from the Internet at large Ch 27: Internet Routing Ch 30: Packet filtering & firewalls
More informationInfluence of Load Balancing on Quality of Real Time Data Transmission*
SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol. 6, No. 3, December 2009, 515-524 UDK: 004.738.2 Influence of Load Balancing on Quality of Real Time Data Transmission* Nataša Maksić 1,a, Petar Knežević 2,
More informationQoS Provisioning in Mobile Internet Environment
QoS Provisioning in Moile Internet Environment Salem Lepaja (salem.lepaja@tuwien.ac.at), Reinhard Fleck, Nguyen Nam Hoang Vienna University of Technology, Institute of Communication Networks, Favoritenstrasse
More informationComparative Analysis of Mpls and Non -Mpls Network
Comparative Analysis of Mpls and Non -Mpls Network Madhulika Bhandure 1, Gaurang Deshmukh 2, Prof. Varshapriya J N 3 1, 2, 3 (Department of Computer Science and IT, VJTI, Mumbai-19 ABSTRACT A new standard
More informationHyacinth An IEEE 802.11-based Multi-channel Wireless Mesh Network
Hyacinth An IEEE 802.11-based Multi-channel Wireless Mesh Network 1 Gliederung Einführung Vergleich und Problemstellung Algorithmen Evaluation 2 Aspects Backbone Last mile access stationary commodity equipment
More informationA REPORT ON ANALYSIS OF OSPF ROUTING PROTOCOL NORTH CAROLINA STATE UNIVERSITY
A REPORT ON ANALYSIS OF OSPF ROUTING PROTOCOL Using OPNET 14.5 Modeler NORTH CAROLINA STATE UNIVERSITY SUBMITTED BY: SHOBHANK SHARMA ssharma5@ncsu.edu Page 1 ANALYSIS OF OSPF ROUTING PROTOCOL A. Introduction
More informationQuality of Service Routing in Ad-Hoc Networks Using OLSR
Quality of Service Routing in Ad-Hoc Networks Using OLSR Ying Ge Communications Research Centre ying.ge@crc.ca Thomas Kunz Carleton University tkunz@sce.carleton.ca Louise Lamont Communications Research
More informationInternational Journal of Advanced Research in Computer Science and Software Engineering
Volume 2, Issue 9, September 2012 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com An Experimental
More informationRouter Scheduling Configuration Based on the Maximization of Benefit and Carried Best Effort Traffic
Telecommunication Systems 24:2 4, 275 292, 2003 2003 Kluwer Academic Publishers. Manufactured in The Netherlands. Router Scheduling Configuration Based on the Maximization of Benefit and Carried Best Effort
More informationBalasubramanian Ramachandran
Implementation and evaluation of OSPF Optimized Multipath Routing Balasubramanian Ramachandran M.S. Thesis defense Committee: Dr. Joseph B. Evans (chair) Dr. David W. Petr Dr. Susan Gauch Organization
More informationCSE331: Introduction to Networks and Security. Lecture 8 Fall 2006
CSE331: Introduction to Networks and Security Lecture 8 Fall 2006 Announcements Reminders: Project I is due on Monday, Sept. 25th. Homework 1 is due on Friday, Sept. 29th. CSE331 Fall 2004 2 Internet Protocol
More informationAddressing OSPF Load in IP/MPLS Networks
Addressing OSPF Load in IP/MPLS Networks Abstract There is an increasing trend towards deploying IP/MPLS networks that provide value added services such as virtual private networks, guaranteed bandwidth
More informationMPLS - A Choice of Signaling Protocol
www.ijcsi.org 289 MPLS - A Choice of Signaling Protocol Muhammad Asif 1, Zahid Farid 2, Muhammad Lal 3, Junaid Qayyum 4 1 Department of Information Technology and Media (ITM), Mid Sweden University Sundsvall
More information