共查询到20条相似文献,搜索用时 15 毫秒
1.
Yuchun Guo Fernando Kuipers Piet Van Mieghem 《International Journal of Communication Systems》2003,16(9):779-798
The problem of finding link/node‐disjoint paths between a pair of nodes in a network has received much attention in the past. This problem is fairly well understood when the links in a network are only specified by a single link weight. However, in the context of quality of service routing, links are specified by multiple link weights and restricted by multiple constraints. Unfortunately, the problem of finding link/node disjoint paths in multiple dimensions faces different conceptual problems. This paper presents a first step to understanding these conceptual problems in link‐disjoint quality of service routing and proposes a heuristic link‐disjoint QoS algorithm that circumvents these problems. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献
2.
Quality of service (QoS) routing plays an important role in QoS provisioning for mobile ad hoc networks. This work studies the issue of route selection subject to QoS constraint(s). Our method searches for alternate routes with satisfied QoS requirement(s) to accommodate each communication request when the shortest path connecting the source–destination pair of the request is not qualified. In order to effectively reduce protocol overhead, a directed search mechanism is designed to limit the breadth of the searching scope, which aims at achieving a graceful tradeoff between the success probability in QoS route acquisition and communication overhead. Efficient hop‐by‐hop routing protocols are designed for route selection subject to delay and bandwidth constraint, respectively. Simulation results show that the designed protocols can achieve high performance in acquiring QoS paths and in efficient resource utilization with low control overhead. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
3.
4.
This paper presents a novel framework for quality‐of‐service (QoS) multicast routing with resource allocation that represents QoS parameters, jitter delay, and reliability, as functions of adjustable network resources, bandwidth, and buffer, rather than static metrics. The particular functional form of QoS parameters depends on rate‐based service disciplines used in the routers. This allows intelligent tuning of QoS parameters as functions of allocated resources during the multicast tree search process, rather than decoupling the tree search from resource allocation. The proposed framework minimizes the network resource utilization while keeping jitter delay, reliability, and bandwidth bounded. This definition makes the proposed QoS multicast routing with resource allocation problem more general than the classical minimum Steiner tree problem. As an application of our general framework, we formulate the QoS multicast routing with resource allocation problem for a network consisting of generalized processor sharing nodes as a mixed‐integer quadratic program and find the optimal multicast tree with allocated resources to satisfy the QoS constraints. We then present a polynomial‐time greedy heuristic for the QoS multicast routing with resource allocation problem and compare its performance with the optimal solution of the mixed‐integer quadratic program. The simulation results reveal that the proposed heuristic finds near‐optimal QoS multicast trees along with important insights into the interdependency of QoS parameters and resources. 相似文献
5.
基于免疫--蚂蚁算法的多约束QoS路由选择 总被引:5,自引:0,他引:5
针对多约束QoS路由选择问题,将其转化为一个多约束赋权图最短路径问题,选择费用、带宽、时延、丢失率为QoS参数。借鉴人体免疫系统的适应能力和蚂蚁算法的全局寻优能力提出了一种新的融合算法即免疫——蚂蚁算法。免疫算法把目标函数和制约条件作为抗原,目标函数的优化解对应为抗体,使得求解过程的收敛方向得以控制;利用蚂蚁算法产生和更新抗体,抗体交叉、变异操作以及对与抗原亲和力高的抗体进行记忆,均能促进快速求解。实验结果表明:免疫——蚂蚁算法表现出了超越免疫算法和蚂蚁算法的优点,大幅度提高了路由选择的效率。 相似文献
6.
Huayi Wu Xiaohua Jia Yanxiang He Chuanhe Huang 《International Journal of Communication Systems》2005,18(9):803-816
This paper investigates the issues of QoS routing in CDMA/TDMA ad hoc networks. Since the available bandwidth is very limited in ad hoc networks, a QoS request between two nodes will be blocked if there does not exist a path that can meet the QoS requirements, even though there is enough free bandwidth in the whole system. In this paper, we propose a new scheme of using multiple paths between two nodes as the route for a QoS call. The aggregate bandwidth of the multiple paths can meet the bandwidth requirement of the call and the delays of these paths are within the required bound of the call. We also propose three strategies by which to choose a set of paths as the route, namely, shortest path first (SPF), largest bandwidth first (LBF), and largest hop‐bandwidth first (LHBF). Extensive simulations have been conducted to evaluate the performance of the three strategies in comparison with a traditional single path routing algorithm. The simulation results show that the proposed multiple paths routing scheme significantly reduces the system blocking rates in various network environments, especially when the network load is heavy. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
7.
In this paper, we investigate the issues of QoS multicast routing in wireless ad hoc networks. Due to limited bandwidth of a wireless node, a QoS multicast call could often be blocked if there does not exist a single multicast tree that has the requested bandwidth, even though there is enough bandwidth in the system to support the call. In this paper, we propose a new multicast routing scheme by using multiple paths or multiple trees to meet the bandwidth requirement of a call. Three multicast routing strategies are studied, SPT (shortest path tree) based multiple-paths (SPTM), least cost tree based multiple-paths (LCTM) and multiple least cost trees (MLCT). The final routing tree(s) can meet the user’s QoS requirements such that the delay from the source to any destination node shall not exceed the required bound and the aggregate bandwidth of the paths or trees shall meet the bandwidth requirement of the call. Extensive simulations have been conducted to evaluate the performance of our three multicast routing strategies. The simulation results show that the new scheme improves the call success ratio and makes a better use of network resources. 相似文献
8.
9.
Internet网络规模的迅速增长和网络技术的不断完善,使得如何在满足QoS(quality of service)要求下进行路由选择成为路由算法研究的重要方向。提出了一种多约束条件下的自适应蚁群算法,该算法基于目标函数的信息素分配策略来自适应地调整蚂蚁的搜索行为,使多约束QoS路由优化问题得到了很好的解决。 相似文献
10.
Mijeong Yang Taeil Kim Haewon Jung Myoung‐Hee Jung Seung‐Hyuk Choi Min Young Chung Jaehyung Park 《ETRI Journal》2006,28(6):815-818
In the global Internet, a constraint‐based routing algorithm performs the function of selecting a routing path while satisfying some given constraints rather than selecting the shortest path based on physical topology. It is necessary for constraint‐based routing to disseminate and update link state information. The triggering policy of link state updates significantly affects the volume of update traffic and the quality of services (QoS). In this letter, we propose an adaptive triggering policy based on link‐usage statistics in order to reduce the volume of link state update traffic without deterioration of QoS. Also, we evaluate the performance of the proposed policy via simulations. 相似文献
11.
12.
WDM网络中支持QoS的路由与波长分配算法 总被引:1,自引:1,他引:1
针对波分复用(wDM)网络中的路由与波长分配问题。提出了一种支持服务质量(QoS)的约束搜索算法。基于多目标规划模型,这种搜索算法可为网络各节点创建路由表,根据路由表信息求出非支配路径集合,从而一次性完成寻找路由和分配波长两项任务。仿真实例证明了该算法的有效性。 相似文献
13.
14.
Gang Feng 《International Journal of Communication Systems》2007,20(1):9-22
The development of efficient quality of service (QoS) routing algorithms in a high‐speed networking or the next generation IP networking environment is a very important and at the same time very difficult task due to the need to provide divergent services with multiple QoS requirements. Recently, a heuristic algorithm H_MCOP, which is based on a non‐linear Lagrange relaxation (NLR) technique, has been proposed to resolve the contradiction between the time complexity and the quality of solution. Even though H_MCOP has demonstrated outstanding capability of finding feasible solutions to the multi‐path constrained (MCP) problem, it has not exploited the full capability that an NLR‐based technique could offer. In this paper, we propose a new NLR‐based heuristic called NLR_MCP, in which the search process is interpreted from a probability's perspective. Simulation results indicate that NLR_MCP can achieve a higher probability of finding feasible solutions than H_MCOP. We also verify that the performance improvement of a MCP heuristic has a tremendous impact on the performance of a higher level heuristic that uses a MCP heuristic as the basic step. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
15.
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. 相似文献
16.
提出了一种综合考虑链路安全、链路冲突、链路可靠度与链路可用带宽的路由判据SIEB。SIEB包括链路安全和链路性能2个方面,在SIEB的链路安全权值计算中,为了抵御各种洞攻击,提出了基于两跳邻居反馈的链路信任值计算方法。在此基础上,提出了链路安全权值计算算法LSWC和链路性能权值计算算法LSPC,提出了分布式满足QoS约束的路由协议SIEBP,SIEBP的目标是:构造安全的路由路径,并且最大化网络吞吐量。仿真结果表明,SIEBP能达到预定目标,构造的路径能抵御黑洞、灰洞、虫洞等攻击,并且获得了较高的网络吞吐量。 相似文献
17.
Noureddine Kettaf Hafid Abouaissa Thang Vu duong Pascal Lorenz 《Telecommunication Systems》2006,33(1-3):255-267
Providing guaranteed quality of service (QoS) in wireless networks is a key issue for deploying multimedia applications. To
support such a QoS, an arduous problem concerning how to find a feasible end to end path to satisfy multiple QoS constraints
should be studied. In general, multi-constrained path selection, with or without optimization, is an NP-complete problem that
cannot be exactly solved in polynomial time. Approximation algorithms and heuristics with polynomial and pseudo-polynomial
time complexities are often used to deal with this problem. However, existing solutions suffer either from excessive computational
complexities that cannot be used for multimedia applications in ad hoc networks characterized by mobility and performance
constraints (e.g., limited energy, wireless medium, etc.). Recently a promising heuristic algorithm H_MCOP using a non linear
Lagrange relaxation path functions has demonstrated an improvement in its success rate and in finding feasible paths. However,
the H_MCOP is not suitable for ad hoc networks and has not exploited the full capability that a Lagrange relaxation could
offer. In this paper, we propose an efficient multi-constrained path heuristic called E_MCP, which exploits efficiently the
Lagrange relaxation and enhances the path search process to be adequate to mobile ad hoc networks. Using extensive simulations
on random mobile network with correlated and uncorrelated link weights, we show that the same level of computational complexity,
E_MCP can achieve a higher success ratio of finding feasible paths. 相似文献
18.
19.
20.
大容量内存、高速CPU及接口的IPv6路由器支撑下的QoS路由是解决IPv6 QoS问题的一项关键技术.针对适应于IPv6网络环境的QoS路由成果为数不多的现状,本文分析了IPv6在实现QoS路由的过程中可能会遇到的障碍,挖掘了IPv6如何利用其简化报头、流概念、流量类型和流标签域支持QoS路由的潜能,提出借助IPv4 QoS路由研究的基础,兼容BE(best effort)路由和对现有路由体制改动小的、逐步演进的IPv6 QoS路由实现策略和扩展IPv6及其主流OSPFv3路由协议,改进算法的整体思路.最后指出为推动IPv6 QoS路由从理论研究走向实际应用还需加强的研究方向. 相似文献