|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
| ASCII Text | x | ||
| B. Walke, W. Rosenbohm, "Deadline-Oriented Servicing: Waiting-Time Distributions," IEEE Transactions on Software Engineering, vol. 6, no. 3, pp. 304-312, May, 1980. | |||
| BibTex | x | ||
| @article{ 10.1109/TSE.1980.230477, author = {B. Walke and W. Rosenbohm}, title = {Deadline-Oriented Servicing: Waiting-Time Distributions}, journal ={IEEE Transactions on Software Engineering}, volume = {6}, number = {3}, issn = {0098-5589}, year = {1980}, pages = {304-312}, doi = {http://doi.ieeecomputersociety.org/10.1109/TSE.1980.230477}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Software Engineering TI - Deadline-Oriented Servicing: Waiting-Time Distributions IS - 3 SN - 0098-5589 SP304 EP312 EPD - 304-312 A1 - B. Walke, A1 - W. Rosenbohm, PY - 1980 KW - queuing analysis KW - Computer performance evaluation VL - 6 JA - IEEE Transactions on Software Engineering ER - | |||
An infinite queue single server model is considered where requests arrive from independent Poisson streams and demand service according to arbitrary distribution functions which may be different for different requests. Associated with each request is an urgency number which, together with request's time of arrival, defines a deadline for beginning its service. This relative urgency discipline has at its two limiting case the fint-come first-serve and head of the line discipline. In [1] the mean waiting time is computed approximately and dose bounds are derived there. Here we present simulation results, derive close approximations for the tails of the waiting-time distribution functions and compare them to those of the two limiting cases.
Index Terms:
queuing analysis, Computer performance evaluation
Citation:
B. Walke, W. Rosenbohm, "Deadline-Oriented Servicing: Waiting-Time Distributions," IEEE Transactions on Software Engineering, vol. 6, no. 3, pp. 304-312, May 1980, doi:10.1109/TSE.1980.230477
Usage of this product signifies your acceptance of the Terms of Use.

