Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

A heuristic approach for path provisioning in Diff-Serv 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.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Krile, S. ; Dept. of Electr. Eng. & Comput., Polytech. of Dubrovnik, Croatia ; Kos, M.

To achieve QoS guarantees for predicted traffic with N quality levels in differentiated services (Diff-Serv) networks with M interior routers, an efficient heuristic algorithm for end-to-end congestion control is being developed. It can be applied as an effective tool for traffic engineering (TE) in MPLS-based networks or it can be used for network dimensioning in optimal sizing of transmission trunks, minimizing the total expansion cost. The heuristic algorithm is compared with an algorithm based on an exact approach. In all numerical test-examples the best possible result is achieved. It is obvious that heuristic option is very effective and for all cases it is possible to find the best result but with significant savings. It means that such a heuristic approach can be successfully applied for MPLS-based traffic engineering in Diff-Serv networks.

Published in:

Spread Spectrum Techniques and Applications, 2002 IEEE Seventh International Symposium on  (Volume:3 )

Date of Conference:

2002