Thumbnail
Access Restriction
Subscribed

Author Makey, P. ♦ Truffot, J.
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©2006
Language English
Subject Domain (in DDC) Technology ♦ Engineering & allied operations ♦ Applied physics
Subject Keyword Robustness ♦ Routing ♦ Approximation algorithms ♦ Multiprotocol label switching ♦ Algorithm design and analysis
Abstract Summary form only given. We consider a routing problem where we want to minimize the maximal relative congestion on the arcs of the network with a bounded number of paths. This problem is relevant in the context of MPLS core networks where one looks for a compromise between higher QoS and fewer splitting of the point-to-point connections. We consider modelling that problem by mixed-integer non linear programs and analyze different solution approaches, focusing on Approximation algorithms based on the flow deviation algorithm on the one hand, and on exact procedures based on the branch-and-price method on the other hand
Description Author affiliation: LIMOS, Clermont-Ferrand Univ. (Makey, P.; Truffot, J.)
ISBN 1424402352
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2006-06-18
Publisher Place UK
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 82.33 kB
Page Count 1
Starting Page 18
Ending Page 18


Source: IEEE Xplore Digital Library