Telecommunication networks: protocols, modeling and analysis
Telecommunication networks: protocols, modeling and analysis
Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
Time constrained and multiaccess communications (packet-switched networks, scheduling, queues impatience, contention, resolution, algorithms)
A Performance Analysis of Minimum Laxity and Earliest Deadline Scheduling in a Real-Time System
IEEE Transactions on Computers
A Window Protocol for Transmission of Time-Constrained Messages
IEEE Transactions on Computers
IEEE Transactions on Computers
An approximate analysis of waiting time in multi-class M/G/1/./EDF queues
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Using real-time queueing theory to control lateness in real-time systems
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Delivering diverse delay/dropping QoS requirements in a TDMA environment
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Delivering QoS requirements to traffic with diverse delay tolerances in a TDMA environment
IEEE/ACM Transactions on Networking (TON)
Scheduling real-time traffic with deadlines over a wireless channel
WOWMOM '99 Proceedings of the 2nd ACM international workshop on Wireless mobile multimedia
Approximate sorting of packet-scheduling in high-speed networks
Journal of Computer Science and Technology
Scheduling real-time traffic with deadlines over a wireless channel
Wireless Networks
Real-time queueing theory: A tutorial presentation with an admission control application
Queueing Systems: Theory and Applications
A Variable Slot Length TDMA Protocol for Personal Communication Systems
Wireless Personal Communications: An International Journal
Best-Effort Scheduling of (m, k)-Firm Real-Time Streams in Multihop Networks
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Generalized Longest Queue First: An Adaptive Scheduling Discipline for ATM Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Dynamic Window-Constrained Scheduling of Real-Time Streams in Media Servers
IEEE Transactions on Computers
Optimal scheduling in a queue with differentiated impatient users
Performance Evaluation
Optimal control of parallel queues with impatient customers
Performance Evaluation - Performance modelling and evaluation of high-performance parallel and distributed systems
A Method for Performance Analysis of Earliest-Deadline-First Scheduling Policy
The Journal of Supercomputing
Probability in the Engineering and Informational Sciences
An RL-based scheduling algorithm for video traffic in high-rate wireless personal area networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Deadline-based connection setup in wavelength-routed WDM networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
ATM traffic management with diversified loss and delay requirements
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Convex comparison of service disciplines in real time queues
Operations Research Letters
Proceedings of the 2nd International Conference on Energy-Efficient Computing and Networking
Packet skipping and network coding for delay-sensitive network communication
Performance Evaluation
On queues with impatience: stability, and the optimality of Earliest Deadline First
Queueing Systems: Theory and Applications
Hi-index | 0.02 |
Many problems can be modeled as single-server queues with impatient customers. An example is that of the transmission of voice packets over a packet-switched network. If the voice packets do not reach their destination within a certain time interval of their transmission, they are useless to the receiver and considered lost. It is therefore desirable to schedule the customers such that the fraction of customers served within their respective deadlines is maximized. For this measure of performance, it is shown that the shortest time to extinction (STE) policy is optimal for a class of continuous and discrete time nonpreemptive M/G/1 queues that do not allow unforced idle times. When unforced idle times are allowed, the best policies belong to the class of shortest time to extinction with inserted idle time (STEI) policies. An STEI policy requires that the customer closest to his or her deadline be scheduled whenever it schedules a customer. It also has the choice of inserting idle times while the queue is nonempty. It is also shown that the STE policy is optimal for the discrete time G/D/1 queue where all customers receive one unit of service. The paper concludes with a comparison of the expected customer loss using an STE policy with that of the first-come, first-served (FCFS) scheduling policy for one specific queue.