On the Convergence of Multiclass Queueing Networks in Heavy Traffic

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5410

Full metadata record

DC Field	Value	Language
dc.creator	Dai, I. G.	-
dc.creator	Nguyen, Viên	-
dc.date	2004-06-01T16:43:14Z	-
dc.date	2004-06-01T16:43:14Z	-
dc.date	1992-10	-
dc.date.accessioned	2013-10-09T02:39:42Z	-
dc.date.available	2013-10-09T02:39:42Z	-
dc.date.issued	2013-10-09	-
dc.identifier	http://hdl.handle.net/1721.1/5410	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	The subject of this paper is the heavy traffic behavior of a general class of queueing networks with first-in-first-out (FIFO) service discipline. For special cases which require various assumptions on the network structure, several authors have proved heavy traffic limit theorems to justify the approximation of queueing networks by reflected Brownian motions (RBM's). Based on these theorems, some have conjectured that the Brownian approximation may in fact be valid for a more general class of queueing networks. In this paper, we prove that the Brownian approximation does not hold for such a general class of networks. Our findings suggest that studying Brownian models of non-FIFO queueing networks may perhaps be more fruitful.	-
dc.format	1077456 bytes	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.publisher	Massachusetts Institute of Technology, Operations Research Center	-
dc.relation	Operations Research Center Working Paper;OR 270-92	-
dc.title	On the Convergence of Multiclass Queueing Networks in Heavy Traffic	-
dc.type	Working Paper	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI