检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]南京邮电大学计算机学院,江苏南京210003
出 处:《计算机技术与发展》2011年第12期52-54,58,共4页Computer Technology and Development
基 金:国家"863"计划资助项目(2009AA01Z202)
摘 要:QoS路由是实现IP网络服务质量的重要手段。针对一般的QoS路由算法时间复杂度高或者只局限于特定约束的缺点,提出了一种基于模糊QoS满意度的启发式多约束路由算法。首先给出了多约束路由的问题模型和数学描述,然后通过模糊处理各QoS参数的方法构造链路的QoS满意度,在此基础上将QoS满意度与传统最短路径优先相结合,通过启发式搜索快速有效地寻找满足所有约束的路由。仿真结果表明,所提出的路由算法拥有较好的性能。QoS routing is an important means to achieve quality of service in IP network. As the general QoS routing algorithms are either high in time-complexity or limited to specific constraints, present a heuristic multi-path routing algorithm based on fuzzy QoS satisfac- tion. First, give the problem model and mathematical description of multiple constraints routing. By using fuzzy method to handle every QoS parameter, the link' s QoS satisfaction is constructed. On this basis, combine QoS satisfaction with the traditional concept of shortest path fLrst and find a route satisfying all constraints quickly and effectively through heuristic searching. The result of simulation shows that the proposed routing algorithm has good performance.
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.188.246.41