%0 Journal Article
%T A Fast Heuristic Algorithm for Minimizing Congestion in the MPLS Networks
%A Chengwen Jiao
%A Suixiang Gao
%A Wenguo Yang
%A Yinben Xia
%A Mingming Zhu
%J Int'l J. of Communications, Network and System Sciences
%P 294-302
%@ 1913-3723
%D 2014
%I Scientific Research Publishing
%R 10.4236/ijcns.2014.78032
%X <p>
	<span style=\"font-family:&quot;\"><span style=\"line-height:2;font-size:12px;font-family:Verdana;\">In the multiple
protocol label-switched (MPLS) networks, the commodities are transmitted by the
label-switched paths (LSPs). For the sake of reducing the total cost and
strengthening the central management, the MPLS networks restrict the number of
paths that a commodity can use, for maintaining the quality of service (QoS) of
the users, the demand of each commodity must be satisfied. Under the above
conditions, some links in the network may be too much loaded, affecting the
performance of the whole network drastically. For this problem, in</span><span style=\"color:#31849B;\"> </span></span><span style=\"line-height:2;font-size:12px;font-family:Verdana;\"><span style=\"font-family:Verdana;line-height:2;font-size:12px;\">[1]</span></span><span style=\"font-family:Verdana;line-height:2;font-size:12px;\">, we proposed two mathematical
models to describe it and a heuristic algorithm which quickly finds
transmitting paths for each commodity are also presented. In this paper, we
propose a new heuristic algorithm which finds a feasible path set for each
commodity, and then select some paths from the path set through a mixed integer
linear programming to transmit the demand of each commodity. This strategy
reduces the scale of the original problem to a large extent. We test 50
instances and the results show the effectiveness of the new heuristic
algorithm.</span>
</p>
%K MPLS-Network
%K &lt
%K i&gt
%K k&lt
%K /i&gt
%K -Splittable Flow
%K Minimum Congestion
%K Heuristic Algorithm
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=48573