SLA Establishment with Guaranteed QoS in the Interdomain Network: A Stock Model

The new model that we present in this paper is introduced in the context of guaranteed QoS and resources management in the inter-domain routing framework. This model, called the stock model, is based on a reverse cascade approach and is applied in a distributed context. So transit providers have to learn the right capacities to buy and to stock and, therefore learning theory is applied through an iterative process. We show that transit providers manage to learn how to strategically choose their capacities on each route in order to maximize their benefits, despite the very incomplete information. Finally, we provide and analyse some simulation results given by the application of the model in a simple case where the model quickly converges to a stable state.Comment: 19 pages, 19 figures, IJCNC, http://airccse.org/journal/cnc/0711cnc13.pd

Methode Tabou massivement parallele pour le probleme d'affectation quadratique

Projet PARADISRésumé disponible dans le fichier PD

Bin Packing with Fragmentable Items: Presentation and Approximations

15 pagesWe consider a variant of the Bin Packing Problem dealing with fragmentable items. Given a fixed number of bins, the objective is to put all the items into the bins by splitting them in a minimum number of fragments. This problem is useful for modeling splittable resource allocation. In this paper we introduce the problem and its complexity then we present a 6/5 approximation algorithm for a special case in which all bins have the same capacities

Optimisation des ressources utilisées pour une diffusion

Colloque avec actes et comité de lecture. nationale.National audienceLe problème considéré intervient dans le cadre de la diffusion à un groupe de gros volumes de données. L'objectif de ce travail est de trouver un schéma de communication qui minimise le coût total

Comparison of fixed size and variable size packet models in an optical ring network: Algorithms and performances

Colloque avec actes et comité de lecture. internationale.International audienceIn this paper, we compare the use of two packets models in slotted optical ring networks: a model where each message has to be routed in consecutive slots, and a model where the slots can be routed independently. We first focus on the algorithmic complexity of the related problems. Then, we give the results we obtain with an OMNET simulator in terms of messages delay and jitter and of communication resources really used at each step

Arcs-States Model for the VRPC and Additional Cuts

International audienc