File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A Note on the convergence of asynchronous greedy algorithm with relaxation in a multiclass queueing environment

TitleA Note on the convergence of asynchronous greedy algorithm with relaxation in a multiclass queueing environment
Authors
Ching, WK
Issue Date1999
Citation
IEEE Communications Letters, 1999, v. 3 n. 2, p. 34-36 How to Cite?
DOI: http://dx.doi.org/10.1109/4234.749354
AbstractIn this letter, we consider the convergence of asynchronous greedy algorithm with relaxation for the Nash equilibrium in a noncooperative multiclass queuing environment. The process of asynchronous greedy algorithm is equivalent to the iteration of Jacobi method in solving a linear system. However, it has been proved that the algorithm converges only for some particular range of queuing parameters. Here we propose the asynchronous greedy algorithm with relaxation, which is in principle equivalent to solving a linear system by Jacobi method with relaxation. We propose also some relaxation parameters such that our algorithm converges very fast.
Persistent Identifierhttp://hdl.handle.net/10722/156077
ISSN
1089-7798
2023 Impact Factor: 3.7
2023 SCImago Journal Rankings: 1.887
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorChing, WKen_US
dc.date.accessioned2012-08-08T08:40:18Z-
dc.date.available2012-08-08T08:40:18Z-
dc.date.issued1999en_US
dc.identifier.citationIEEE Communications Letters, 1999, v. 3 n. 2, p. 34-36en_US
dc.identifier.issn1089-7798en_US
dc.identifier.urihttp://hdl.handle.net/10722/156077-
dc.description.abstractIn this letter, we consider the convergence of asynchronous greedy algorithm with relaxation for the Nash equilibrium in a noncooperative multiclass queuing environment. The process of asynchronous greedy algorithm is equivalent to the iteration of Jacobi method in solving a linear system. However, it has been proved that the algorithm converges only for some particular range of queuing parameters. Here we propose the asynchronous greedy algorithm with relaxation, which is in principle equivalent to solving a linear system by Jacobi method with relaxation. We propose also some relaxation parameters such that our algorithm converges very fast.en_US
dc.languageengen_US
dc.relation.ispartofIEEE Communications Lettersen_US
dc.rights©1999 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.titleA Note on the convergence of asynchronous greedy algorithm with relaxation in a multiclass queueing environmenten_US
dc.typeArticleen_US
dc.identifier.emailChing, WK:wching@hku.hken_US
dc.identifier.authorityChing, WK=rp00679en_US
dc.description.naturepublished_or_final_versionen_US
dc.identifier.doi10.1109/4234.749354en_US
dc.identifier.scopuseid_2-s2.0-0033358119en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0033358119&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume3en_US
dc.identifier.issue2en_US
dc.identifier.spage34en_US
dc.identifier.epage36en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridChing, WK=13310265500en_US
dc.identifier.issnl1089-7798-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats