dc.contributor.author |
Anagnostou, ME |
en |
dc.contributor.author |
Protonotarios, EN |
en |
dc.date.accessioned |
2014-03-01T02:47:38Z |
|
dc.date.available |
2014-03-01T02:47:38Z |
|
dc.date.issued |
1985 |
en |
dc.identifier.uri |
https://dspace.lib.ntua.gr/xmlui/handle/123456789/33304 |
|
dc.relation.uri |
http://www.scopus.com/inward/record.url?eid=2-s2.0-0022314746&partnerID=40&md5=d21c001f4eb1f1c3219231046bd06a35 |
en |
dc.subject.other |
PROBABILITY - Queueing Theory |
en |
dc.subject.other |
GI/D/1 DISCRETE TIME QUEUEING SYSTEM |
en |
dc.subject.other |
PERFORMANCE EVALUATION |
en |
dc.subject.other |
DATA TRANSMISSION |
en |
dc.title |
PERFORMANCE EVALUATION OF A GI/D/1 PRIORITY QUEUE. |
en |
heal.type |
conferenceItem |
en |
heal.publicationDate |
1985 |
en |
heal.abstract |
The performance of a GI/D/1 discrete time queueing system is studied. Arriving customers belong to one of a set of P different priority classes. Customers of the same class have equal service times, and follow an FCFS discipline. The queueing system is a preemptive priority system. The preemptive resume case is considered. |
en |
heal.publisher |
North-Holland, Amsterdam, Neth |
en |
heal.journalName |
[No source information available] |
en |
dc.identifier.spage |
279 |
en |
dc.identifier.epage |
283 |
en |