By Topic

Congestion Control for Highly Loaded DiffServ/MPLS Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Krile, S. ; Dept. of Electr. Eng. & Comput., Univ. of Dubrovnik, Dubrovnik

In optimal QoS provisioning all traffic flows are distributed among LSPs (label switching path) related to service classes. The congestion of concurrent flows (traversing the network simultaneously) can appear. For LSP creation the IGP (interior getaway protocol) uses simple on-line routing algorithms (e.g. OSPFS, IS-IS) based on shortest path methodology. In highly loaded networks it becomes insufficient technique. On other hand, constraint based explicit routing (CR) ensures traffic engineering (TE) capabilities. It may find a longer but lightly loaded path, taking care of congestion possibility. In this approach LSP can be pre-computed much earlier, possibly during SLA (service level agreement) negotiation process. An effective algorithm for congestion control is developed. It could be a very good solution for congestion avoidance and for better load-balancing purpose where links are running close to capacity. Significant improvements are possible through heuristic approach based on restrictions for capacity state value. Comparisons of results are discussed.

Published in:

Convergence and Hybrid Information Technology, 2008. ICCIT '08. Third International Conference on  (Volume:2 )

Date of Conference:

11-13 Nov. 2008