A bundle-type algorithm for routing in telecommunication data networks

A bundle-type algorithm for routing in telecommunication data networks

0.00 Avg rating0 Votes
Article ID: iaor200973454
Volume: 44
Issue: 3
Start Page Number: 385
End Page Number: 409
Publication Date: Dec 2009
Journal: Computational Optimization and Applications
Authors: , ,
Keywords: networks: flow
Abstract:

To optimize the quality of service through a telecommunication network, we propose an algorithm based on Lagrangian relaxation. The bundle-type dual algorithm is adapted to the present situation, where the dual function is the sum of a polyhedral function (coming from shortest path problems) and of a smooth function (coming from the congestion function).

Reviews

Required fields are marked *. Your email address will not be published.