Abstract
We introduce and analyse the M∕G∕1 resampling queue with non-preemptive LIFO policy, then we use it to provide bounds on the performance characteristics of an M∕G∕1 processor sharing queue with inaccurate service time information.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
