The University of Southampton
University of Southampton Institutional Repository

A note on the convergence of asynchronous greedy algorithm withrelaxation in a multiclass queueing environment

A note on the convergence of asynchronous greedy algorithm withrelaxation in a multiclass queueing environment
A note on the convergence of asynchronous greedy algorithm withrelaxation in a multiclass queueing environment
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.
34-36
Ching, Wai Ki
cfee9d26-97e3-42ce-a4e9-b91e6d8aeef7
Ching, Wai Ki
cfee9d26-97e3-42ce-a4e9-b91e6d8aeef7

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

Record type: Article

Abstract

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.

Full text not available from this repository.

More information

Published date: 1999
Organisations: Operational Research

Identifiers

Local EPrints ID: 29746
URI: http://eprints.soton.ac.uk/id/eprint/29746
PURE UUID: fd889467-d7e6-4013-9efb-5b84cc69a731

Catalogue record

Date deposited: 01 May 2007
Last modified: 15 Jul 2019 19:08

Export record

Altmetrics

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×