Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5309
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.creator | Bertsimas, Dimitris J. | - |
dc.creator | Mourtzinou, Georgia | - |
dc.date | 2004-05-28T19:32:57Z | - |
dc.date | 2004-05-28T19:32:57Z | - |
dc.date | 1993-10 | - |
dc.date.accessioned | 2013-10-09T02:38:59Z | - |
dc.date.available | 2013-10-09T02:38:59Z | - |
dc.date.issued | 2013-10-09 | - |
dc.identifier | http://hdl.handle.net/1721.1/5309 | - |
dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
dc.description | We propose a new approach to analyze multiclass queueing systems in heavy traffic based on what we consider as fundamental laws in queueing systems, namely distributional and conservation laws. Methodologically, we extend the distributional laws from single class queueing systems to multiple classes and combine them with conservation laws to find the heavy traffic behavior of the following systems: a)EGI/G/1 queue under FIFO, b) EGI/G/1 queue with priorities, c) Polling systems with general arrival distributions. Compared with traditional heavy traffic analysis via Brownian processes, our approach gives more insight to the asymptotics used, solves systems that traditional heavy traffic theory has not fully addressed, and more importantly leads to closed form answers, which compared to simulation are very accurate even for moderate traffic. | - |
dc.format | 2000458 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 281-93 | - |
dc.title | Multiclass queueing systems in heavy traffic: an asymptotic approach based on distributional and conservation laws | - |
dc.type | Working Paper | - |
Appears in Collections: | MIT Items |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.