基于改进蚁群算法的拥塞规避QoS路由算法

服务质量(QoS)路由算法缺少拥塞规避机制,会影响业务QoS。为此,提出一种基于Ant-Pub&Enco的信息素模型,根据蚂蚁行进方向,利用相反的信息素引导模式以及不同的信息素更新策略进行路由搜索。基于改进蚁群算法设计一种规避拥塞算法求解QoS单播路 由问题。仿真结果表明,该算法能够有效规避网络中的拥塞链路,均衡网络负载。     

基于UWB技术的无线移动多媒体QoS路由协议

随着UWB技术的出现,无线移动多媒体业务在自组网中的应用成为可能。为了满足无线移动多媒体传输的需要,设计了一种新的针对多媒体业务的QoS路由协议,给出了协议的详细描述。由于该协议充分利用了UWB技术的速率和距离互换特性,考虑了传输速率、时延和链路拥塞程度3个QoS参数,并借鉴无线移动自组网基本路由协议DSR和AODV,因此不仅能够获得满足业务要求的路由,且能提前预测链路的中断,以便及时切换替代路由。与目前已提出的基于UWB技术的路由协议相比,该协议更适合于无线移动多媒体业务的传输。     

基于Wave模型的QoS路由选择

MPLS和DiffServ等新的组网技术的实现，为未来的Internet骨干网引入了强大的功能，这有助于全面提供端到端的QoS。提出了一种新颖而有力的路由选择方案，使用移动代理支持QoS路由选择，特别是在满足一组业务流的QoS需求的同时，该方案使用移动代理有效地实现了基于Wave模型的多点到点的路由选择树。     

Hadoop平台下一种改进蚂蚁算法的QoS路由研究

随着未来云计算的发展,各种云服务的应用将需要更高的网络性能。链路拥塞导致的数据包传输时延或数据包丢弃使得网络无法保障业务的QoS。目前普遍使用的链路状态路由算法不具有拥塞响应机制。本文通过在拥塞节点间发送连接蚂蚁寻找新路由来解决拥塞问题。NS2仿真结果表明,该算法能加快新的路由搜索,满足QoS的需求,并有效控制丢包率,时延等性能。     

软件定义网络中基于网络切片和ILP模型的路由方案

针对软件定义网络(SDN)中数据层的路由优化问题,提出一种基于网络切片和 整数线性规划(ILP) 多约束优化的路由方案。首先,根据多租户业务的链路需求,基于Kruskal算法对数据层中的链路资源进行网络切片,尽可能形成相互隔离的租户子网络。然后,在考虑链路约束和租户业务的服务质量(QoS)约束下, 以最小化传输延迟为目标, 构建一个ILP整数线性规划(ILP)路由优化模型,并获得最佳的路由方案。仿真结果表明,所获得的路由方案具有较少的共享链路,有效降低了链路拥塞和传输延迟。     

基于动态路由与蚁群优化的移动无线自组织网络算法

移动无线自组织网络(MANET)的移动性与动态性导致网络的服务质量较差,基于此,提出一种基于动态路由与蚁群优化的移动无线自组织网络算法。利用非线性节点拥塞度来增强拥塞度的差异,提出一种基于预测的链接断裂预防方案,基于动态路由设计了有效的路由搜索方案,基于蚁群的信息素参数有效的选择最优路由并实现路由维护。最终,详细的分析本算法的能量效率,计算出本算法的能耗较低。仿真试验结果表明本算法的吞吐量、传输延迟、传输可靠性以及能量效率均具有较好的性能,优于其他基于智能优化或同类型路由算法。     

一种业务驱动的多媒体传感器网络路由算法

针对多媒体传感器网络承载业务（视频图像业务、音频业务以及数据业务）的差异性和不同业务对QoS的差异性,基于蚁群算法和混沌理论,抽象业务驱动的QoS路由模型,提出了一种业务驱动的路由算法SDR（Service-Driver Routing）。依据各类业务对QoS的差异性选择相应路由策略,达到充分利用网络资源、提高网络承载业务性能的目标。采用NS2对该算法进行实验仿真,实验结果表明,与其他路由算法相比,该算法可提供区分业务的QoS保障。     

策略路由技术

1.引言互联网流量工程是避免由于网络资源的非均衡使用而造成网络拥塞、更好地向用户提供QoS服务的机构。策略路由是互联网流量工程的重要内容之一,它是根据用户需要向用户提供不同QoS服务、满足用户策略要求的重要前提之一。策略路由需要对现有互联网的路由选择协议进行扩充,在选择路由的过程中考虑更多的约束参数(如带宽、延迟等),根据链路(hop)的资源可用性、服务质量要求及企业/ISP的策略选择通路,在源与目的节点之间提供多条满足不同服务质量要求与特定策略的路由。2.技术及应用背景目前,互联网正在以爆炸的速度向前发展,预示着市场对数据通信产品的强大需求。同时由于IP phone、多媒体会议、电子商务等业务的出现对互联网/企业网提出了更高的要求,即它们必须提供QoS业务/分类业务以满足IP phone等对带     

基于业务安全策略需求的路由模型研究

首先对业务进行分类,不同的业务对网络不同的要求使其具有不同的QoS参数约束.然后研究并提出了基于智能业务识别的QoS路由模型和路由结构,根据动态配置的安全/QoS策略,在业务识别的基础上,标志数据包,根据DiffServ代码点DSCP值选择合适的路由算法.并针对带宽-时延-时延抖动-丢包率限制路由提出了一种改进的启发式路由算法,将丢包率转化为可加性条件,并把带宽限制作为剪枝条件,最后通过实验证明了其可行性.     

基于移动通信网的物联网拥塞控制方案研究

介绍了物联网的基本概念、业务特征,并对物联网的拥塞控制需求、核心网侧和无线侧拥塞控制方案进行了详细的研究,对不同方案进行分析比较,提出了基于移动通信网的物联网拥塞控制方案建议。     

Ad Hoc移动网络多路径研究

在Ad Hoc移动网络中,由于结点的移动性,网络拓扑结构的易变性,路由成为研究的热点和难点。当前AdHoc路由协议一般都是单路径协议。然而由于多路径路由方式可以大大减少路由开销,提高数据传输率,减少网络拥塞,越来越多的研究表明,它将是未来Ad Hoc网络路由的主要方式。本文介绍了几种典型的多路径路由协议,并对这些多路径协议进行评价,对其性能进行比较,然后介绍多路径协议在QoS、能源和安全方面的应用,最后指出未来多路径研究的关键问题。     

Multi constrained network feature approximation based secure routing for improved quality of service in mobile ad-hoc network

The mobile ad-hoc network is well studied on the routing issues, and the security constraints around achieving higher quality of service (QoS) values are well analyzed. The main task is to establish the path to the target with reliable intermediate nodes based on quality parameters because of the lack of node mobility and central management. In a multi-constrained QoS issuance, more than the QoS requirements must be satisfied at the end of the application. There are several secure routing protocols available to improve the QoS of Manet by routing packets securely. However, they do not meet the performance requirements. To solve this problem, and efficient Multi-Constrained Network Feature Approximation (MCNFA) technique is proposed based on safe routing. The method first determines the list of paths between source and destination. According to that, the method approximates the congestion, latency, and hop count values for each route. According to the value obtained in approximation of various parameters, the legitimate weight is computed for all the routes towards the destination. According to the value of the legitimate weight, a single route is selected to perform data transmission. The MCNFA approach improves the routing performance and increases the throughput ratio and other QoS factors. The performance of the proposed method will be assessed using NS2 simulation. The results show that the proposed scheme can maintain a longer network lifecycle in tight scenarios suitable for delay-tolerant networking. The performance is compared with energy recognition and MCNFA technique-based energy-saving routing protocols in various QoS scenarios.     

信息分发管理仿真系统的设计与实现

针对无线通信网络的服务质量(QoS)和网络拥塞问题,设计基于虚拟覆盖网技术的信息分发管理仿真系统。分析机动环境下无线通信的需求,通过在应用层建立虚拟覆盖网络,实现网络状态感知、QoS路由计算、业务传输优化等关键功能,并在OMNeT++仿真环境下进行系统实现。评测结果表明,该系统能提高无线通信网络的业务传输性能。     

基于移动代理具有拥塞控制的AODV路由协议

提出一种基于移动代理的AODV路由协议,来解决Ad Hoc网络的拥塞问题.在网络中引入一定数量的携带拥塞状态的移动代理,移动代理在网络中漫游时选择轻负载的节点为下一跳,并根据节点拥塞状态更新路由表,用较少的信息流量使每个节点及时了解当前网络的拓扑状况.实验结果表明这种路由算法可以有效地平衡网络负载,大大增强了链路的稳定性,降低了端到端的数据传输时延.     

Performance evaluation of an intelligent CAC and routing framework for multimedia applications in broadband networks

In order to support multimedia communication, it is necessary to develop routing algorithms which use for routing more than one QoS parameters. This is because new services such as video on demand and remote meeting systems require better QoS. Also, for the Call Admission Control (CAC) of multimedia applications different QoS parameters should be considered. In our previous work, we proposed an intelligent routing and CAC strategy using cooperative agents. However, we only considered the time delay for the routing. The QoS and Congestion Control (CC) parameters were considered as indicators of QoS satisfication and congestion. In this work, we extend our previous work by proposing and implementing new algorithms based on Fuzzy Logic (FL) and Genetic Algorithm (GA) which use for CAC and routing many QoS parameters. The simulation results show that proposed framework has a good performance and is a promising method for QoS routing and CAC decision.     

大规模移动自主网络中基于簇的QoS多路径路由

在移动自主网络中,提供服务质量支持是一个核心研究问题.大量研究表明,在移动自主网络中提供服务质量保障具有很大的挑战性.提出一个基于簇的QoS多路径路由协议(CQMRP),通过一种可扩展、灵活的方式为移动自主网络提供服务质量保证.在这个策略中,每个节点只维持局部路由信息而不是整个网络的全局状态信息.它支持多个服务质量约束.采用OPNET模拟器对协议性能进行了评估,结果表明,这个协议能够为移动自主网络提供一个可靠的多路径服务质量保证.     

移动自组网QoS路由的DNA计算模型

QoS路由问题是移动自组网应用面临的一个重要问题,其中如何根据移动自组网动态拓扑结构和单向链路的特点来设计路由算法是关键。DNA计算是一种基于生化反应的新型计算方法,高度的并行性和海量存储能力是其最大的特点。文章首先给出了QoS路由问题模型,然后介绍了DNA的分子结构和DNA计算的基本原理,最后依据Adleman进行DNA计算的编码方法,给出了移动自组网QoS路由问题的DNA计算模型,为解决多约束QoS路由问题提供了一种新的思路。     

基于量子遗传算法的QoS路由算法

多约束的QoS路由问题是NP完全问题.量子遗传算法是基于量子计算理论的新遗传算法,具有种群多样性、收敛速度快和全局寻优的特点.将量子遗传算法引入多约束QoS路由计算,提出了一种基于量子遗传算法的QoS路由算法,给出了算法实现的方法和具体流程.实验结果表明,通过该算法得到的QoS路由不但能满足QoS约束要求,同时可以均衡链路负载,减少路由拥塞.     

Providing QoS in OSPF based best effort network using load sensitive routing

In an open shortest path first (OSPF) based best effort network, when a packet experiences congestion, the routing subsystem cannot send it through an alternate path. Thus, it fails to provide desired quality of service (QoS) during congestion. In order to provide QoS we have reported three different load sensitive routing (LSR) protocols in [A. Sahoo, An OSPF based load-sensitive QoS routing algorithm using alternate paths, in: IEEE International Conference on Computer Communication Networks, October 2002; A. Tiwari, A. Sahoo, Providing QoS support in OSPF based best effort network, in: IEEE International Conference on Networks, November 2005; A. Tiwari, A. Sahoo, A local coefficient based load sensitive routing protocol for providing QoS, in: IEEE International Conference on Parallel and Distributed Systems, July 2006]. The LSR protocol forwards packets through alternate paths in case of congestion. The number of alternate paths at any node depends on the value of operating parameter or coefficient used for alternate path calculation. Though the basic protocol in these cases was the same, the methods of choosing operating parameter were different. We referred to these three methods as LSR [A. Sahoo, An OSPF based load-sensitive QoS routing algorithm using alternate paths, in: IEEE International Conference on Computer Communication Networks, October 2002], E-LSR [A. Tiwari, A. Sahoo, Providing QoS support in OSPF based best effort network, in: IEEE International Conference on Networks, November 2005] and L-LSR [A. Tiwari, A. Sahoo, A local coefficient based load sensitive routing protocol for providing QoS, in: IEEE International Conference on Parallel and Distributed Systems, July 2006] coefficient methods. In this paper, we present the LSR protocol along with the three coefficient calculation methods pointing out the reason for going from one method to the next. The main strength of our LSR protocol is that it provides loop free alternate paths in the event of congestion and can interwork with routers running vanilla OSPF protocol. We show through simulation that the LSR protocol based on any of the three different coefficient calculation methods performs much better than OSPF and that out of the three methods proposed by us, L-LSR performs the best.