Approximate Time-Parallel Simulation of Queueing Systems with Losses

Simple item page
dc.contributor.authorWang, Jain J.en
dc.contributor.authorAbrams, Marcen
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:35:53Zen
dc.date.available2013-06-19T14:35:53Zen
dc.date.issued1992en
dc.description.abstractThis paper presents a guideline of a partial state matching approach for time-parallel simulation. Two algorithms using this approach to simulate FCFS G/G/1/K and G/D/1/K queues in which arriving customers that find the queue full are lost are proposed. Experiments with M/M/1/K and M/D/1/K models show that the performance of the algorithms in terms of convergence speed and accuracy is good in general cases. The worst performance of the algorithms occurs when traffic intensity approaches one. An argument is made to explain this phenomenon.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000288/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000288/01/TR-92-08.pdfen
dc.identifier.trnumberTR-92-08en
dc.identifier.urihttp://hdl.handle.net/10919/19739en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleApproximate Time-Parallel Simulation of Queueing Systems with Lossesen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR-92-08.pdf
Size:
1.06 MB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports