%0 Journal Article
%T Research on the Bottleneck Area of Optimal BGP Route Selection<br>BGP最优路径选择中的瓶颈区域的研究
%A LIU Ya-Ping
%A GONG Zheng-Hu
%A ZHU Pei-Dong
%A <br>刘亚萍
%A 龚正虎
%A 朱培栋
%J 软件学报
%D 2005
%I 
%X Optimal BGP route selection on traffic demand is one of the problems in interdomain traffic engineering. Determining bottleneck area will give important heuristic information to the problem. As the problem of determining bottleneck area is NP-hard, a bottleneck area predicting algorithm on traffic demand in polynomial time is proposed, which deals with interdomain peering links and intradomian links simultaneously. Moreover, this paper also analysis the relationships between the traffic and the bottleneck area, as well as the relationships between the topology and the bottleneck area. Simulation results show the accuracy of the algorithm is more than 90%. In addition, a conclusion is drawn from the simulation that the topology is a very important factor in determining the bottleneck area.
%K interdomain traffic engineering
%K BGP route selection
%K linear programming
%K load balance
%K bottleneck<br>域间流量工程
%K BGP路径选择
%K 线性规划
%K 负载平衡
%K 瓶颈
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=53B834FA035C1A87&yid=2DD7160C83D0ACED&vid=7801E6FC5AE9020C&iid=94C357A881DFC066&sid=7C8C2BAFC9BA0571&eid=4986C0B14AED27B4&journal_id=1000-9825&journal_name=软件学报&referenced_num=2&reference_num=15