• Multicommodity flow problems w...

Treffer: Multicommodity flow problems with a bounded number of paths : A flow deviation approach

Title:
Multicommodity flow problems with a bounded number of paths : A flow deviation approach
Authors:
DUHAMEL, Christophe, MAHEY, Philippe
Source:
Multicommodity flows and network designNetworks (New York, NY). 49(1):80-89
Publisher Information:
New York, NY: John Wiley & Sons, 2007.
Publication Year:
2007
Physical Description:
print, 22 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Systèmes informatiques et systèmes répartis. Interface utilisateur, Computer systems and distributed systems. User interface, Fonction convexe, Convex function, Función convexa, Fonction objectif, Objective function, Función objetivo, Fonction potentiel, Potential function, Función potencial, Modèle mixte, Mixed model, Modelo mixto, Modèle non linéaire, Non linear model, Modelo no lineal, Multiprotocole, Multiprotocol, Multiprotocolo, Méthode heuristique, Heuristic method, Método heurístico, Méthode minimax, Minimax method, Método minimax, Nettoyage, Cleaning, Limpieza, Problème multiflot, Multicommodity flow problem, Problema multiflujo, Programmation partiellement en nombres entiers, Mixed integer programming, Programación mixta entera, Protocole réseau, Network protocol, Protocolo red, Protocole transmission, Transmission protocol, Protocolo transmisión, Routage, Routing, Enrutamiento, Réseau communication, Communication network, Red de comunicación, Réseau large bande, Broadband networks, flow deviation, multicommodity flow, routing
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes, UMR 6158 CNRS, Université Biaise Pascal, Campus des Cézeaux, Aubière, France
ISSN:
0028-3045
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=18405628
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.18405628
Database:
PASCAL Archive

Weitere Informationen

We 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).