Processor-shared buffers with reneging
Performance Evaluation - Special issue on bandwidth management and congestion control of high-speed networks
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Quality of service and flow level admission control in the internet
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Towards a new internet architecture
A Diffusion Approximation for a Markovian Queue with Reneging
Queueing Systems: Theory and Applications
A Multiserver Queueing System with Impatient Customers
Management Science
Insensitive Bandwidth Sharing in Data Networks
Queueing Systems: Theory and Applications
Congestion at flow level and the impact of user behaviour
Computer Networks: The International Journal of Computer and Telecommunications Networking
Commissioned Paper: Telephone Call Centers: Tutorial, Review, and Research Prospects
Manufacturing & Service Operations Management
On Stochastic Bounds for Monotonic Processor Sharing Networks
Queueing Systems: Theory and Applications
Stability of size-based scheduling disciplines in resource-sharing networks
Performance Evaluation - Performance 2005
Modeling of an online TV recording service
ACM SIGMETRICS Performance Evaluation Review
Exact Sojourn Time Distribution in an Online IPTV Recording System
ASMTA '08 Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications
Equilibrium analysis through separation of user and network behavior
Computer Networks: The International Journal of Computer and Telecommunications Networking
Diffusion approximations for open Jackson networks with reneging
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
We investigate an overloaded processor sharing queue with renewal arrivals and generally distributed service times. Impatient customers may abandon the queue, or renege, before completing service. The random time representing a customer's patience has a general distribution and may be dependent on his initial service time requirement.We propose a scaling procedure that gives rise to a fluid model, with nontrivial yet tractable steady state behavior. This fluid model captures many essential features of the underlying stochastic model, and we use it to analyze the impact of impatience in processor sharing queues. We show that this impact can be substantial compared with FCFS, and we propose a simple admission control policy to overcome these negative impacts.