Abstract
AbstractWe propose a modified version of the Flow Deviation method of Fratta, Gerla, and Kleinrock to solve multicommodity problems with minimal congestion and a bounded number of active paths. We discuss the approximation of the min–max objective function by a separable convex potential function and give a mixed‐integer nonlinear model for the constrained routing problem. Heuristic control of the path generation is then embedded in the original algorithm based on the concepts of cleaning the quasi inactive paths and reducing the flow width for each commodity. Numerical experiments show the validity of the approach for realistic medium‐sized networks associated with routing problems in broadband communication networks with multiple protocols and label‐switched paths (MPLS). © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 49(1), 80–89 2007
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
