共查询到19条相似文献,搜索用时 125 毫秒
1.
2.
3.
在解决QoS(quality of service)单播路由问题上,针对蚁群算法缺点,提出了一种融合量子粒子群算法(QP-SO)思想的多行为蚁群算法.该算法采用QPSO作为前期搜索,根据各粒子历史最优值来初始化路径信息素浓度,后期利用多行为蚁群算法来优化路径.仿真结果表明:该算法寻优能力强,可靠性高,是解决QoS路由问题的有效方法. 相似文献
4.
5.
针对运用单目标优化算法求解基于 QoS 的 Web 服务选择问题的不足,设计了一种新的 QoS 全局最优Web 服务选择算法.该算法同时优化组合服务的多维 QoS 属性的多个目标函数,并产生 QoS 全局最优的 Pareto 最优解集.首先建立服务选择问题的多目标优化数学模型,然后采用归档式多目标模拟退火设计该算法以优选 Web服务.实验结果表明了该算法是可行的,实现了全局 QoS 最优化的组合服务. 相似文献
6.
Ad Hoc网络中基于双向收敛蚁群算法的QoS路由算法 总被引:1,自引:0,他引:1
蚂蚁算法是一种新型随机优化算法,能有效解决Ad Hoc网络多约束的QoS路由问题,但存在收敛速度慢和易陷入局部最优等缺点.针对于此,在借鉴精英策略的基础上提出了一种基于双向收敛蚁群算法,并将该算法应用于Ad Hoc网络的QoS路由问题中.仿真结果表明,算法可明显提高数据包的投递率,降低端到端的传输时延. 相似文献
7.
随着Internet网络的不断发展,它将成为未来网络服务的平台,而未来网络服务的种类又是多种多样的,既有传统的尽量服务(Best-Effort Service)应用,又有对网络服务质量 [1](QoS:Quality of Service)有着特殊需求的应用.本文探讨了如何在网络层路由这一层面进行QoS组播路由支持的问题.目前,已有许多组播QoS路由算法提出,在QoS路由性能、网络资源使用效率以及路由吞吐率等方面取得了许多好的成果.针对这些QoS路由算法中存在的一些问题,提出了一种组播QoS路由算法.实验结果表明:该算法在适应网络拓扑结构、网络规模、对称/非对称链路负载等方面,与其它QoS路由算法相比,在算法性能上有了一定的改进. 相似文献
8.
Internet网络规模的迅速增长和网络技术的不断完善,使得如何在满足QoS(quality of service)要求下进行路由选择成为路由算法研究的重要方向。提出了一种多约束条件下的自适应蚁群算法,该算法基于目标函数的信息素分配策略来自适应地调整蚂蚁的搜索行为,使多约束QoS路由优化问题得到了很好的解决。 相似文献
9.
Internet网络规模的迅速增长和网络技术的不断完善,使得如何在满足QoS(quality of service)要求下进行路由选择,已成为路由算法研究的重要方向。本文提出了一种多约束条件下的自适应蚁群算法,该算法基于目标函数的信息素分配策略来自适应的调整蚂蚁的搜索行为,使多约束QoS路由优化问题得到了很好的解决。 相似文献
10.
基于遗传与蚁群算法融合的选播QoS路由算法 总被引:1,自引:0,他引:1
为有效解决选播通信中的QoS路由问题,提出一种基于遗传算法与蚁群算法融合的选播QoS路由算法.算法初期使用遗传算法在链路上分布信息素,对蚁群算法的控制参数进行编码和优化;然后通过判断函数来判断遗传算法与蚁群算法融合的时机,初始化信息素,并启动混合算法后期的蚁群算法;引入变异算子,对由变异操作得出新路径进行局部信息素更新,更快地引导蚁群算法找到全局最优解.NS2仿真实验结果表明,该算法很好的解决多QoS选播路由问题,性能优于其它算法. 相似文献
11.
Quality of service (QoS) routing technology, which can find the available route, is an important way to realize the end-to-end QoS provisioning for networks. Intelligent routing discovery, establishment and maintenance, which take use of ant colony algorithm, have been widely researched in the past years. But the ant colony algorithm has two obvious shortcomings, which are low convergence rate and algorithm stagnation in local optimum. As the topology of mobile ad hoc network (MANET) is always changing, the information of network status is hard to collect in time. So the enhancement of the convergence rate of the QoS routing algorithm is quite important in MANETs. Based on the AntHocNet algorithm previously designed for ad hoc networks, this paper proposes a position-based intelligent QoS routing algorithm. The position constraints are added in the procedures of tabu list forming and pheromone updating. Compared with AntHocNet, the proposed mechanism can greatly reduce the convergence rate in the premises of searching an available path with QoS guarantee according to the simulation results. 相似文献
12.
ZHANG Xu CHENG Sheng FENG Mei-yu DING Wei The Broadband Communication Network Laboratory Beijing University of Posts Telecommunications Beijing P.R.China 《中国邮电高校学报(英文版)》2004,11(4)
Considering the characters of dynamic topology and the imprecise state information in mobile ad hoc network,we propose a Fuzzy Logic QoS Dynamic Source Routing(FLQDSR)algorithm based on Dynamic Source Routing(DSR)protocol while adopting fuzzy logic to select the appropriate QoS routing in multiple paths which are searched in parallel.This scheme considers not only the bandwidth and end-to-end delay of routing,but also the cost of the path.On the otherhand the merit of using fuzzy logic is that it can be implemented by hardware.This makes the realization of the schemeeasier and faster.However our algorithm is based on DSR,the maximal hop count should be less than 10,i.e.,the scaleof mobile ad hoc network should not be very large.Simulation results show that FLQDSR can tolerate a high degree of in-formation imprecision by adding the fuzzy logic module which integrates the QoS requirements of application and the rout-ing QoS parameters to determine the most qualified one in every node. 相似文献
13.
WDM网络中支持QoS的路由与波长分配算法 总被引:2,自引:1,他引:1
针对波分复用(wDM)网络中的路由与波长分配问题。提出了一种支持服务质量(QoS)的约束搜索算法。基于多目标规划模型,这种搜索算法可为网络各节点创建路由表,根据路由表信息求出非支配路径集合,从而一次性完成寻找路由和分配波长两项任务。仿真实例证明了该算法的有效性。 相似文献
14.
Chenn-Jung Huang Wei Kuang Lai Yi-Ta Chuang Sheng-Yu Hsiao 《International Journal of Wireless Information Networks》2007,14(1):1-16
A mobile ad hoc network (MANET) is a collection of self-organized mobile nodes that are capable of communicating with each
other without the aid of any established infrastructure or centralized administration. Routing algorithm has been a challenge
task in the wireless ad hoc network for a long time due to the dynamic nature of network topology. A recent trend in ad hoc
network routing is the reactive on-demand philosophy where routes are established only when required. The on-demand routing
protocol for ad hoc network is appealing because of its low routing overhead and its effectiveness when the frequency of route
re-establishment and the demand of route queries are not high. However, considering the increasing demand of Quality-of-Service
(QoS) requirements in many applications, the current on-demand routing protocols used for ad-hoc network should be adapted
appropriately to effectively meet the stringent QoS requirements of specific multimedia traffic. We thus propose a routing
protocol which tries its best to satisfy QoS requirements of specific multimedia traffic in the volatile environments of a
MANET. The results of a series of simulations exhibit the practicability and feasibility of our approaches.
This research was partially supported by National Science Council under grant NSC 93-2213-E-026-001 相似文献
15.
16.
CEDAR: a core-extraction distributed ad hoc routing algorithm 总被引:9,自引:0,他引:9
Sivakumar R. Sinha P. Bharghavan V. 《Selected Areas in Communications, IEEE Journal on》1999,17(8):1454-1465
We present CEDAR, a core-extraction distributed ad hoc routing algorithm for quality-of-service (QoS) routing in ad hoc network environments, CEDAR has three key components: (a) the establishment and maintenance of a self-organizing routing infrastructure called the core for performing route computations; (b) the propagation of the link-state of high bandwidth and stable links in the core through increase/decrease waves; and (c) a QoS-route computation algorithm that is executed at the core nodes using only locally available state. The performance evaluations show that CEDAR is a robust and adaptive QoS routing algorithm that reacts quickly and effectively to the dynamics of the network while still approximating the performance of link-state routing for stable networks 相似文献
17.
Liming Xie Xiaohua Jia Kunxiao Zhou 《International Journal of Communication Systems》2012,25(1):30-46
In this paper, we discussed the issues of QoS multicast routing in cognitive radio ad hoc networks. The problem of our concern was: given a cognitive radio ad hoc network and a QoS multicast request, how to find a multicast tree so that the total bandwidth consumption of the multicast is minimized while the QoS requirements are met. We proposed two methods to solve it. One is a two‐phase method. In this method, we first employed a minimal spanning tree‐based algorithm to construct a multicast tree and then proposed a slot assignment algorithm to assign timeslots to the tree links such that the bandwidth consumption of the tree is minimized. The other is an integrated method that considers the multicast routing together with the slot assignment. Extensive simulations were conducted to show the performance of our proposed methods. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
18.
19.
Network quality-of-service and network security have been considered as separate entities and research in these areas have largely proceeded independently. However, security impacts overall QoS and it is therefore essential to consider both security and QoS together when designing protocols for ad hoc environments as one impacts the other. In this paper we propose a mechanism for a distributed dynamic management system which aims to maximize QoS and/or security while maintaining a minimum user acceptable level of QoS and/or security even as network resource availability change. In order to achieve this objective, we propose three basic frameworks: a policy based plug-in security framework, multi-layer QoS guided routing and a proportional integral derivative (PID) controller. Simulation results indicate the proposed PID optimized security and QoS algorithm produce similar performance as non-secure QoS routing protocols under various traffic loads. 相似文献