简介:MPLS(Multi-ProtocolLabelSwitching)VPN(VirtualPrivateNetwork)traffichasbeendeployedwidely,butcurrentlyonlysupportsunicast.ThispaperbrieflyintroducesseveralavailableMPLSVPNmulticastapproaches,andthenanalyzestheirdisadvantages.Anovelmechanismthatusestwo-layerlabelstacktosupportMPLSVPNexplicitmulticastisproposedandtheprocessisdiscussedindetail.Thescalabilityandperformanceoftheproposedmechanismarestudiedanalytically.Theresultshowsthatoursolutionhasgreatadvantageoverthecurrentlyavailableschemeintermsofsavingcorenetworkbandwidthandimprovingthescalability.
简介:Averyinexpensiverecive-onlysatellitereceiverhighbandwidthtrafficfromafeeder.Thereforetheconnectionbetweenthefeederandthereceiverisuni-directional.Theexistingroutingprotocols,suchasLink-StateandDistance-Vector,aredesignedonthepremisethatanylinksarebidirectionalandtheycannothandletheuni-directionallinks.Inthispaper,adynamicmulticastroutingprotocolisproposed,whichcanhandleuni-directionalnetworks,Thisprotocolcanalsoadapttothedynamicchangeofthetopolgoyofthenetworkandhasgoodscalability.AformaldescriptionoftheprotocolbyPetrinetisgiven.Liveness,deadlockfreeandotherpropertiesoftheprotocolarepreoved.
简介:Inthispaper,basedonant-algorithm,weproposeaQoSmulticastroutingschemeinInternet.Wefirstdescribeant-algorithmmodelandgiveant-networkmodel,thenpresentanapproachusingant-algorithmtooptimizethemulticastrouteswithQoSconstaints.Finally,simulationshasbeenmadetoshowtheefficiencyoftheapproachintheenvironmentofOPNETsimulationsoftware,andthesimulationresultsshowthattheproposedapproachcanfindthebestoptimalmulticastrouteswhichcansatisfythedelay-boundedrequirementandavoidcongestednodesassoonaspossible.
简介:在里面无线多点传送,网络编码最近作为实质的改进吸引了注意到包重发计划。然而,发现最小化重发的最佳的网络代码的问题是难的解决或接近。这份报纸论述二个计划减少重发的数字为可靠高效地多点传送。一个人是用网络基于改进Vandermonde矩阵(VRNC)编码的重发,其它是用网络基于适应改进Vandermonde矩阵(AVRNC)编码的重发。用VRNC计划,发送者都选择包接收装置与改进Vandermonde失去了并且编码他们矩阵;当接收装置收到足够编码的重发包时,所有失去的包能被恢复。与AVRNC计划,发送者能在每重发包,然后改进Vandermonde矩阵发送以后从所有接收装置获得恢复信息能被更新,因此减少编码并且译码的复杂性。我们的建议计划能完成假定重发包的理论更低的界限无损失,并且就重发包损失而言接近理论更低的界限。模拟结果证明建议算法能高效地减少重发的数字,因此改善的传播效率。
简介:在大规模上在因特网上由于部署因特网协议(IP)的困难多点传送,覆盖多点传送被看作了一种有希望的选择在最近的年里开发multicast通讯。然而,存在覆盖多点传送解决方案受不了高费用在提交树的multicast维持节点的州的信息。一个无状态的覆盖多点传送计划被建议,在哪个multicast路由信息被一个花蕾过滤器(BF)编码并且没有对维持提交树的multicast的任何需要,包含了进包头。我们的计划利用节点异质,在物理拓扑学并且层次地的最近信息由把几何坐标分到所有覆盖节点构造运输树桩覆盖拓扑学。更重要地,计划使用BF技术识别提交树的multicast的节点和连接,它改进提交的效率并且减少假积极的提交环。分析并且模拟结果证明这个建议能完成高提交效率和好可伸缩性。
简介:ThewavelengthassignmentwithmultiplemulticastrequestsinfixedroutingWDMnetworkisstudied.Anewmulticastdynamicwavelengthassignmentalgorithmispresentedbasedonmatchingdegree.First,thewavelengthmatchingdegreebetweenavailablewavelengthsandmulticastroutingtreesisintroducedintothealgorithm.Then,thewavelengthassignmentistranslatedintothemaximumweightmatchinginbipartitegraph,andthismatchingproblemissolvedbyusinganextendedKuhn-Munkresalgorithm.Thesimulationresultsprovethattheoveralloptimalwavelengthassignmentschemeisobtainedinpolynomialtime.Atthesametime,theproposedalgorithmcanreducetheconnectingblockingprobabilityandimprovethesystemresourceutilization.
简介:Multicastcapability,includingmulticastaddressandmulticastroutingmechanisms,atthenetworklayerisnecessaryinordertoreducethebandwidthrequirementsofmultiparty,multicastapplications.Basedonhierarchicalautonomousstructureinaccordancewiththeself-organizationtopologiesofInternet,thepaperputsforwardamulticastaddressmanagementschemethatisshowntoberobustandscalable.Connectioncontrolhierarchy(CCH)basedonmaster/slaverelationshipandasimpleefficientbuildingalgorithmofmulti-pointconnectionisalsobuilt.Thepaperalsodescribesthenormaloperationsofmulticastaddressmanagementandmulti-pointconnectioncontroller.Throughsimulationexperiment,HAMCMandDDMofMulticastAddressAllocationarecompared.HAMintegratesthemeritsofCMandDDM,whichisefficientasawhole,robustandscalable.CCHraisestheefficiencyofconnectioncontrol,andishighlyrobust,flexibleandscalable.
简介:这篇文章在直角的频率部门multiplexing(OFDM)与min率要求限制处理multicast资源分配问题系统。由于为非线性、组合的优化的禁止地高的复杂性,原来的问题被放松并且形成一个标准优化问题的reformulated。根据Karush-Kuhn-Tucker(KKT)由理论推导调节,二项提议为optimality表现为必要标准。而且,包括副载波赋值和力量分配,一个二拍子的圆舞资源分配计划在实际实现的提议的一个基础上被建议。多点传送,min率基于组顺序,副载波以一种贪婪方式被分配最大化能力。当副载波赋值是坚定的时,建议力量分配能完成最佳的性能因为min率与可接受的复杂性抑制了能力最大化。模拟结果显示建议计划接近到彻底的搜索与可以忽略的能力差距获得的最佳的资源分配,并且更加超过相等的力量分发。同时,多点传送对在OFDM系统的资源利用显著地有益。
简介:Thedissertationstudiesthearchitectureofbroadbandintelligentnetwork(BIN)andimplementationofvideoconferencebasedonATMnetworkandofmulticastroutingproblemonvideoconferenceusingBINundertheaidoftheimportanttask-StudyofINandB-ISDNIntegration(69896244)-sponsoredbyNationalNaturalScienceFund.Alotofpointsofviewandsolutionsarepresent.Themaincontributionsinthedissertationareasfollows:(1)DesignthenewarchitectureofBINandimprovethearchitectureofBINproposedbyITU-T.ItiseasytosetuptheconnectionsofvideoconferenceusingthenewarchitectureofBIN.(2)PresentthedetailedschemethatBINcontrolsandimplementsvideoconferencewithoutspecializedresourcefunction,studytheschemeofallthemediaonvideoconferencetransmittedandswitchedunderthecontrolofBIN,anddiscusshowtoimplementpoint-to-multipointcommunicationsusingBIN.(3)FirstpresenttheschemeofimplementingmulticastroutingalgorithmsonvideoconferenceusingBIN.(4)Explicitlyintroduceaseriesofconceptsincludingneighboringnode,neighboringnodeset,neighboringedge,thenproposeanAdjustableDynamicMulticast(ADM)routingalgorithmwhichissuitableforvideoconference,analyzeitsperformances,andprovethealgorithmisappropriateandfeasible.(5)Developadegree-constraineddynamicmulticast(DADM)routingalgorithmwhichcanfindlesscostmulticastroutingtree.TheresultsofsimulationandexperimentsconfirmthatDADMalgorithmcanfindthelesscostmulticasttree.Finally,analyzetherelationbetweenthesizeofdegree-constrainedandvalueofmulticasttreecost.(6)Presentadelay-constraineddynamicmulticastroutingalgorithmsuitableforvideoconferencecharacteristic,andadviseaseriesofschemesreducingthedelayoftransmittingallthemediaonvideoconference.(7)FirstproposeimplementingthereliablemulticastroutingtransportprotocolusingBIN,therebyACKimplosionproblemcanbesolved.Theprotocolonlyrequiresfin
简介:Thestablemulticastflowaggregation(MFA)problemininternetprotocol(IP)overopticalnetworkunderthedynamicalscenarioisstudied.Givenanopticalnetworktopology,thereisasetofheadendsandaccessroutersattachedtotheopticalnetwork,inwhicheachheadendcanprovideasetofprograms(IPmulticastingflows)andeachaccessrouterrequestsasetofprograms,wefindasetofstablelight-treestoaccommodatetheoptimallyaggregatedmulticastIPflowsiftherequestsofaccessrouterschangeddynamically.Weintroduceaprogramcorrelationmatrixtodescribethepreferenceofendusers'requests.AstheoriginalMFAproblemisNP-complete,aheuristicapproach,namedmostcorrelatedprogramfirst(MCPF),ispresentedandcomparedwiththeextendedleasttreefirst(ELTF)algorithmwhichistopology-aware.SimulationresultsshowthatMCPFcanachievebetterperformancethanELTFintermsofstabilitywithnegligibleincrementofnetworkresourceusage.
简介:AMinimizingIntermediateMulticastRoutingprotocol(MIMR)isproposedfordynamicmulti-hopadhocnetworks.InMIMR,multicastsessionsarecreatedandreleasedonlybysourcenodes.Ineachmulticastsessionprocess,thesourcenodekeepsalistofintermediatenodesanddestinations,whichisencapsulatedintothepacketheaderwhenthesourcenodesendsamulticastpacket.Nodesreceivingmulticastpacketsdecidetoacceptorforwardthepacketaccordingtothelist.Dependingontopologymatrixmaintainedbyunicastrouting,theshortestvirtualhierarchyroutingtreeiscon-structedbyimprovedDijkstraalgorithm.MIMRcanachievetheminimumnumberofintermediatenodes,whicharecomputedthroughthetree.Nocontrolpacketistransmittedintheprocessofmul-ticastsession.Loadofthenetworkislargelydecreased.ExperimentalresultshowsthatMIMRisflexibleandrobustfordynamicadhocnetworks.
简介:介绍了互联网的核心设备路由器的作用、基本原理及其作为网络连结设备的特点和分类,Win2000服务器路由功能的实现步骤.