Multicast routing algorithm of multiple QoS based on widest-bandwidth

1 .INTRODUCTIONA mobile Ad hoc network refers to a temporal multi-hop autonomy system,whichis constituted by a groupof mobile nodes containing wireless send-receive equip-ments[1].It possesses manycharacteristics-fast-deploy-able,self-organized,acentric , movable and of multi-hop.It can be wildly applied to many fields ,such asnational defense,emergency and disaster ,scientificin-vestigation and exploration etc .,and uponthat ,it hasgreat prospects[1 ,3 6]. With the wide spread of mo-bile…     

Optimizing on multiple constrained QoS multicast routing algorithms based on GA

With the rapid development of Internet, mobile networks and high-performance networking technology,multiple constrained QoS multicast routing optimization in networks with uncertain parameters has become a very important research issue in the areas of networks and distributed systems. It is also a challenging and hard problem to the next generation Internet and high-performance networks, and has attracted the interests of many people. This paper discusses the multiple constrained QoS multicast routing problem, which may deal with the delay, delay jitter,bandwidth and packet loss metrics, and describes a network model for researching the routing problem. The paper mainly presents multiple constrained QoS multicast routing algorithm (MCQMRA), a QoS multicast routing policy for Internet,mobile network or other high-performance networks, which is based on the genetic algorithm (GA) and can provide QoS-sensitive paths in a scalable and flexible wayin the network environment with uncertain parameters. The MCQMRA can also optimize the network resources such as bandwidth, delay, packet loss metrics and can converge to the optimal or near-optimal solution within few iterations, even for the network environment with uncertain parameters. Simulation results show that MCQMRA is an available approach to QoS multicast routing decision.     

质量水平涨落函数与动态质量路由算法

实数区间适于表示用户质量需求和网络资源的动态变化。提出质量涨落函数这一新概念,揭示了质量因素的变化与质量水平涨落之间的内在联系。在约束质量水平涨落的前提下,推广了源路由算法、基于距离向量协议和链接状态协议的质量路由算法,使之成为与用户需求和网络变化特性相适应的、体现网络服务供需平衡与适度优化思想的动态质量路由算法。最后,给出判定路由路径质量水平涨落幅度的定理及其证明。     

Distributed QoS multicast routing protocol in ad hoc networks

1 .INTRODUCTIONMobile ad hoc networks ( MANET) , also calledthe infrastructureless mobile network or self-or-ganized network,consists of a collection of mobilenodes sharing a wireless channel without any cen-tralized control or established communication back-bone .ad hoc networks have no fixed routers ;allnodes are capable of movement and can be connect-ed dynamically in an arbitrary manner . Usually ,these nodes act as both end systems and routers atthe same ti me . Nodes of these netwo…     

Multiple constraints-based QoS multicast routing: model and algorithms

1.INTRODUCTION Multicastserviceshavebeenusedbyvariouscontinu ousmediaapplications.Forexample,themulticast backbone(Mbone)oftheInternethasbeenusedto transportrealtimeaudio/videofornews,entertain ment,videoconferencing,anddistancelearning.The provisionofQoSguaranteesisofutmostimportance forthedevelopmentofthemulticastservices.Multi castroutinghascontinuedtobeaveryimportantre searchissueintheareasofnetworksanddistributed systems[1～4].Itattractstheinterestsofmanypeo ple. Afrequently…     

基于MPLS流量工程的QoS性能分析

多媒体业务和实时业务的出现要求网络能够提供QoS保证,MPLS为解决这一问题提供了基本的网络框架,而流量工程则是实现这一问题的有力工具。MPLS网络的显式路由机制是流量工程实施的保障,不但可以满足业务流的QoS约束条件,同时还可以优化网络的性能。研究了基于MPLS流量工程的QoS保证机制,并以传输控制协议(TCP)和报文协议(UDP)为业务模型,以吞吐量为性能指标,采用仿真的方法对使用MPLS流量工程情况下的QoS性能进行了分析。实验结果表明,通过在MPLS网络中实施流量工程技术,无论是面向业务流的性能还是面向资源的性能都会得到很好的保证,较传统的IP网络有了明显的提高。     

Providing QoS guarantees for self-similar traffic flows

1.INTRODUCTION Recentanalysesofvariouspacket basednetworking showthatnetworktraffichasvariabilityovermany timescales.Itsperformancedifferswithresultsof queuetheorythatisbasedonthePoissondistribu tion.Statisticalanalysesoflargetrafficdatasetshave revealedthatthestatisticalcharacteristicsofrealtraf ficmaybebestdescribedbyself similarity.Self simi larityimpliesthepresenceoflong rangedependence (LRD)inthetraffic.Thatis,thereexistnon negli giblepositivecorrelationintheburstbehaviorofthe …     

QoS multicast routing algorithm based on GA

1 .INTRODUCTIONTheprovisionofquality of service (QoS) guaranteesisofutmostimportanceforthedevelopmentofthemulticastservices .Multicastroutinghascontinuedtobeaveryimportantresearchissueintheareasofnet worksanddistributedsystems.Ithasattractedtheinterestsof…     

Self-configuring scheduling scheme for IPv6 traffic with multiple QoS classes

This paper proposes a new queuing model and adaptive scheduling scheme which realizes multi-class QoS mechanism under DiffServ architecture. The queuing model is composed of two parallel output subqueues, each output sub-queue adopts random drop algorithm by setting different buffer threshold for different class traffic, so it can provide multi-class QoS. The new proposed scheduling scheme which adaptively changes the parameter A can guarantee the performance target of high class traffic, in the mean time, improve the QoS of low classes traffic.     

A Heuristic Algorithm for QoS Multicast Routing

In recent years, QoS multicast routing has continued to be a very important research topic in the areas of networks. This paper presents a heuristic algorithm for the QoS multicast routing (HAQMR). This heuristic algorithm deals with delay and bandwidth constraints and has low cost. The HAQMR attempts to significantly reduce the overhead for constructing a multicast tree, the proof for correctness of the HAQMR is given, and the performance of the HAQMR is evaluated by simulations. The study shows that HAQMR provides an available approach to QoS multicast routing.     

求QoS路由的整数线性规划方法

QoS路由的任务是在网络中寻找一条满足多个约束条件的路径使网络资源的利用达到最优. 该问题是一个NP-完全问题. 提出了一种新的基于整数线性规划模型选择路由的方法. 思路是将复杂约束引入到目标函数作为罚项, 得到一个松弛整数线性规划问题. 因为约束系数矩阵是全幺模矩阵, 松弛问题可以通过线性规划很快地求解. 拉格朗日乘子的调整用罚函数的方法很容易计算. 数值实验表明提出的方法是有效的.     

基于实时交通信息的城市动态网络车辆路径优化问题

将动态城市交通路网与车辆路径问题相结合, 考虑一类实时交通信息下的城市动态网络车辆路径优化问题. 在问题中考虑常发性交通拥堵和偶发性交通拥堵两种情形. 提出一类将初始路径安排与实时路线调整相结合的求解策略. 初始路径安排通过采用遗传算法求解常发性交通拥堵情形对应的时变网络车辆调度问题得到. 在车辆行驶过程中, 针对偶发性交通拥堵环境下的突发事故情形, 引入一种在关键点更新路线的新机制. 数值算例验证了新实时路线更新机制比目前文献中已有的更新机制更有效, 且随着网络动态性增加其优越性更加明显.     

Distributed QoS multicast routing in networks with imprecise state information

1.INTRODUCTION WiththerapiddevelopmentofInternet,mobilenet worksandhigh performancenetworkingtechnology,itbringsoutextensiveinterestsofpeopleinproviding multimediaandreal timeservicessuchasvideoconfer ence,distanceeducation,entertainmentandsoon.Theseservicesrequirecertainquality of service(QoS)fromthenetworks.Thatis,thereshouldbe guaranteesastobandwidth,delay,delay jitter,ratio ofpacket lossandlowcostduringthedatatransmis sion.Meanwhile,multicastserviceshavebeenused invariousmultimediaap…     

QoS-aware multicast routing protocol for Ad hoc networks

1 .INTRODUCTIONA mobile ad hoc network ( MANET) is a multi-hopwireless network formed by a collection of mobilenodes without the intervention of fixedinfrastructure.Because an Ad hoc network is infrastructure-less andself-organized,it is used to provide i mpromptu com-munication facilities in harsh environments . Typicalapplication areas of mobile ad hoc networkinclude bat-tlefields ,emergency search,rescue sites and data ac-quisitionin remote areas . A mobile Ad hoc networkisalso usef…     

基于改进蚁群算法的QoS单播路由优化

对现代通信网中具有时延和带宽约束的QoS单播路由问题提出了一种基于改进蚁群算法的路由优化.该算法结合蚁群系统的特点对基本蚁群算法进行了三方面的改进:在信息素初始化中考虑食物源(目的节点)向周围散发气味的过程;将时廷和带宽信息加入启发式函数;引入"弱淘汰"法则全局更新信息素.仿真实验表明该算法可以更快地找到满足时延和带宽请求的最小费用路由.     

服务质量路由问题的一个新进化算法

针对服务质量路由问题,设计了一种新颖的进化算法QoS_EA.该算法具有以下特点:(1)通过采用一种前向自然教编码方法,使路径不包含圈,节省了进化算法在求解该问题时的圈检查过程;(2)设计了一种散接交叉算子,以防止出现不可行的路径,确保交又操作的有效性和种群的多样性;(3)与交叉算子相对应设计了一种基于局部链路选择性修改的选择性变异算子,以确保路径由任意初始状态进化到满足约束的路径.理论分析证明该算法具有明显的优越性,并以概率1收敛于所求路径.计算机仿真结果表明该算法性能优于其他同类算法.     

Multi-constraint quality of service routing algorithm for dynamic topology networks

An adaptive multi-QoS routing algorithm called AMQRA is proposed for dynamic topology networks, such as satellite networks and Ad-hoc networks. The AMQRA is a distributed and mobile-agents-based routing algorithm, which combines ant quantity system （AQS） with ant colony optimization （ACO） that is used in AntNet routing algorithm. In dynamic topology networks, the AMQRA achieves timely optimization for concave metric QoS constraint and fast convergence. The proposed routing algorithm is simulated in Iridium satellite constellation on OPNET. The results show that AMQRA not only outperforms the AntNet in convergence rate in dynamic topology networks but also can optimize concave metric QoS constraint and reasonably allot bandwidth to the load to avoid networks congestion.     

Integrated dynamic shared protection algorithm for GMPLS networks

The path protection approach is widely investigated as a survivability solution for GMPLS networks, which has the advantage of efficient capacity utilization. However, there is a problem of the path protection approach that searching a disjoint backup path for a primary path is often unsuccessful. In order to resolve this problem, an integrated dynamic shared protection （IDSP） algorithm is proposed. The main idea of the proposed algorithm is that the path protection approach is first used to establish a backup path for the primary path; if the establishment is unsuccessful, then the primary path is dynamically divided into segments whose hop count are not fixed but not more than the limitation calculated by the equations introduced. In this proposal, backup bandwidth sharing is allowed to improve the capacity utilization ratio, which makes the link cost function quite different from previous ones. Simulation experiments are presented to demonstrate the efficiency of the proposed method compared with previous methods. Numerical results show that IDSP can not only achieve low protection failure probability but can also gain a better tradeoff between the protection overbuild and the average recovery time.     

基于城市道路限行的多能源多车型车辆路径优化

针对日益严峻的城市汽车尾气污染问题和日趋严格的城市限行措施,本文首次将城市分区域、分车型等限行因素引入到车辆路径问题,并以碳排放、运输等费用总成本最小为目标,构建了基于城市道路限行的多能源多车型混合车辆路径优化模型.针对模型的NP难特性,本文提出了一种变邻域搜索算法(VNS-TR)求解该模型.最后,通过算例和基准测试集验证了模型及算法的有效性.     

一种新的最小干扰选路算法及仿真研究

提出了一种新的最小干扰选路算法 JMIRA,该算法由离线网络优化和在线动态路由选路两部分组成.其中在线路由部分算法采用接纳控制机制,利用最短最窄选路方法定位多条关键链路,根据链路上各业务类型的已用与可用带宽比值来计算链路权重,旨在实现最小干扰目的的同时降低算法的复杂度.经仿真研究表明,该算法在网络可用带宽和请求拒绝率等方面明显优于传统路由选路算法.