ecms_neu_mini.png

Digital Library

of the European Council for Modelling and Simulation

 

Title:

A New Stochastic Algorithm For The Capacity & Flow Assignment Problem And An Associated Rate Of Convergence

Authors:

Bao U. Nguyen

Published in:

 

(2009).ECMS 2009 Proceedings edited by J. Otamendi, A. Bargiela, J. L. Montes, L. M. Doncel Pedrera. European Council for Modeling and Simulation. doi:10.7148/2009 

 

ISBN: 978-0-9553018-8-9

 

23rd European Conference on Modelling and Simulation,

Madrid, June 9-12, 2009

Citation format:

Nguyen, B. U. (2009). A New Stochastic Algorithm For The Capacity & Flow Assignment Problem And An Associated Rate Of Convergence. ECMS 2009 Proceedings edited by J. Otamendi, A. Bargiela, J. L. Montes, L. M. Doncel Pedrera (pp. 99-107). European Council for Modeling and Simulation. doi:10.7148/2009-0099-0107

DOI:

http://dx.doi.org/10.7148/2009-0099-0107

Abstract:

In this paper we examine the problem of optimizing the average time latency of a network using agents that are able to learn. The network design is constrained by a traffic matrix which dedicates specific flows between specific pairs of nodes. Although this is an analysis of an application, we only present two methodologies here, i.e. an algorithm for optimization and a corresponding conservative rate of convergence based on no learning. The application part will be presented in the near future once data is available. We expect the tools developed in this paper can be used to optimize a wide range of objective functions. They will not be limited to optimizing time latency.

Full text: