%0 Journal Article
%T The Problems in QoS Routing<br>QoS中的路由问题
%A 彭孜
%A 曾家智
%J 计算机科学
%D 2000
%I 
%X The next-greneration high-speed networks are expected to suppot a wide range of delay-sensitive multimedia applications. They need a different routing algorithm from the conventional one. The goal of the new algorithm is twofold: (1)satisfying the QoS requirements for every admitted connections,and(2)achieving global efficiency in resource utilization. Thus,most of problems in QoS routing area have multiple constraints which make them NP-Hard. Until now,the generally effcient algorithm has not been found. In this paper,we pose two algorithms for PCPO problems common in QoS communication,and analyze respective characteristics and uses.
%K QoS
%K Routing algorithm
%K NP-Hard<br>QoS
%K 路由问题
%K 路由器
%K 启发式算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=13885268EE226987&yid=9806D0D4EAA9BED3&vid=DB817633AA4F79B9&iid=F3090AE9B60B7ED1&sid=5C3443B19473A746&eid=68D88C2FCF9C3098&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=7