A note on the convergence of asynchronous greedy algorithm withrelaxation in a multiclass queueing environment
Ching, Wai Ki (1999) A note on the convergence of asynchronous greedy algorithm withrelaxation in a multiclass queueing environment. IEEE Communications Letters, 3, (2), 34-36. (doi:10.1109/4234.749354).
Full text not available from this repository.
In this letter, we consider the convergence of an asynchronous greedy algorithm with relaxation for Nash equilibrium in a noncooperative multiclass queueing environment. The process of an asynchronous greedy algorithm is equivalent to the iteration of the Jacobi method in solving a linear system. However, it has been proved that the algorithm converges only for some particular range of queueing parameters. Here we propose the asynchronous greedy algorithm with relaxation, which is in principle equivalent to solving a linear system by the Jacobi method with relaxation. We propose also some relaxation parameters such that our algorithm converges very fast.
|Subjects:||Q Science > QA Mathematics|
|Divisions:||University Structure - Pre August 2011 > School of Mathematics > Operational Research
|Date Deposited:||01 May 2007|
|Last Modified:||02 Mar 2012 13:06|
|Contributors:||Ching, Wai Ki (Author)
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)