%0 Journal Article
%T Method for Multi-constraint QoS Routing Problem Based on Lagrange Relaxation<br>基于拉格朗日松驰的多约束QoS路由算法
%A ZHA Yi
%A JIANG Hao
%A YAN Pu-liu
%A ZHOU Jian-guo
%A ZHOU Xiao-ping
%A XU Wu-ping
%A <br>查益
%A 江昊
%A 晏蒲柳
%A 周建国
%A 周小平
%A 徐武平
%J 计算机应用研究
%D 2005
%I 
%X With the multi-constraint QoS routing algorithm, least cost QoS routing path satisfying two or more constrained conditions can be found based on Lagrange Relaxation. During this procedure, a method of overlap fit for network structure is proposed, thus the feasible path can be searched rapidly. This algorithm is a pseudo polynomial time algorithm, and comparing with the simulated results, the success rate of searching is not only related with the constraint number but also with the type of topology, and the more closer the network topology is to the real network, the more successful rate of searching reaches.
%K QoS
%K QoS Routing
%K Lagrange Relaxation<br>服务质量
%K 服务质量路由
%K 拉格朗日松弛
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=95B19297C767583D&yid=2DD7160C83D0ACED&vid=BC12EA701C895178&iid=CA4FD0336C81A37A&sid=F4B561950EE1D31A&eid=2A3781E88AB1776F&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=18