Queues with Equally Heavy Sojourn Time and Service Requirement Distributions

• 1 January 2002
• journal article
• Published by Springer Nature in Annals of Operations Research
• Vol. 113  (1/4) , 101-117
• https://doi.org/10.1023/a:1020905810996

Abstract

Keywords

• PROCESSOR SHARING
• FOREGROUND–BACKGROUND PROCESSOR SHARING
• SHORTEST REMAINING PROCESSING TIME
• QUEUES WITH HEAVY TAILS
• (INTERMEDIATE) REGULAR VARIATION
• TELECOMMUNICATIONS