A Paradox in a Queueing Network with State-Dependent Routing and Loss

Ziedins, I.

dc.contributor.author	Ziedins, I.	en
dc.date.accessioned	2009-06-12T00:11:29Z	en
dc.date.available	2009-06-12T00:11:29Z	en
dc.date.issued	2007	en
dc.identifier.citation	Journal of Applied Mathematics and Decision Sciences 2007 (68280), 10 pages. 2007	en
dc.identifier.issn	1173-9126	en
dc.identifier.uri	http://hdl.handle.net/2292/4331	en
dc.description	An open access copy of this article is available and complies with the copyright holder/publisher conditions.	en
dc.description.abstract	Consider a network of parallel finite tandem queues with two stages, where each arrival attempts to minimize its own cost due to loss. It is known that the user optimal and asymptotic system optimal policies may differ—we give examples showing that they may differ for finite systems and that as the service rate is increased at the second stage the user optimal policy may change in such a way that the total expected cost due to loss increases.	en
dc.publisher	Hindawi Publishing Corporation	en
dc.relation.ispartofseries	Journal of Applied Mathematics and Decision Sciences	en
dc.rights	Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. Details obtained from http://www.sherpa.ac.uk/romeo/issn/1173-9126/	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.rights.uri	http://creativecommons.org/licenses/by/3.0/	en
dc.source.uri	http://dx.doi.org/10.1155/2007/68280	en
dc.title	A Paradox in a Queueing Network with State-Dependent Routing and Loss	en
dc.type	Journal Article	en
dc.subject.marsden	Fields of Research::230000 Mathematical Sciences::230100 Mathematics	en
dc.identifier.doi	10.1155/2007/68280	en
pubs.issue	68280	en
pubs.begin-page	10 pages	en
pubs.volume	2007	en
dc.description.version	VoR - Version of Record	en
dc.rights.holder	Copyright: Hindawi Publishing Corporation	en
dc.rights.accessrights	http://purl.org/eprint/accessRights/OpenAccess	en