Heavy and Light Traffic Approximations for Queues with Synchronization Constraints

dc.contributor.advisorMakowski, A.M.en_US
dc.contributor.authorVarma, S.en_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T09:46:39Z
dc.date.available2007-05-23T09:46:39Z
dc.date.issued1990en_US
dc.description.abstractThe aim of this dissertation is to develop approximations to performance measures for queues with synchronization constraints with the help of limit theorems. In particular we shall consider queues exhibiting the fork-join and resequencing constraints. These queues invariably exhibit non-product form behavior, and their analysis by any other method is extremely difficult. The limit theorems that we shall use come in two flavors, i.e. heavy traffic limit theorems and light traffic limit theorems. Heavy traffic limit theorems give estimates of the performance measures when the system is operating near its full capacity, while light traffic limit theorems give estimates of the performance measures when the system is very lightly loaded. By interpolating between these two limits it is possible to obtain estimates of the performance measure when the system operates at moderate loads.en_US
dc.format.extent6837996 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/5028
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; PhD 1990-2en_US
dc.subjectqueueing networksen_US
dc.subjectparallel architecturesen_US
dc.subjectCommunication en_US
dc.subjectSignal Processing Systemsen_US
dc.titleHeavy and Light Traffic Approximations for Queues with Synchronization Constraintsen_US
dc.typeDissertationen_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
PhD_90-2.pdf
Size:
6.52 MB
Format:
Adobe Portable Document Format