By Topic

Path-level congestion avoidance mechanisms in end-to-end QoS-routing

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)
S. Krile ; Dept. of Electr. Eng. & Comput., Polytech. of Dubrovnik, Croatia

Service providers need very effective traffic engineering tools to obtain quantitative end-to-end QoS guarantees in DiffServ networks. For example, ISP has to check if the new SLA (service-level agreement) can be accepted because of limited capacity resources on the path. The basic condition is that predicted traffic demands must be satisfied at any moment. The problem is seen as an expansion problem of link capacity in given limits from the common source. For N quality of service levels, an efficient heuristic algorithm for end-to-end congestion control is being developed. Algorithm of BFH (backward-forward heuristic) type is applied to achieve QoS guarantees in the network with M links and M-1 interior routers. The heuristic algorithm is compared with an algorithm based on an exact approach, to show that the complexity of the optimization process can be reduced. In all numerical test-examples, the best possible result is achieved, but with significant computation savings.

Published in:

Information Technology Interfaces, 2003. ITI 2003. Proceedings of the 25th International Conference on

Date of Conference:

16-19 June 2003