Processor-sharing queues: some progress in analysis
Queueing Systems: Theory and Applications
Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Virtual clock: a new traffic control algorithm for packet switching networks
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
On a preemptive Markovian queue with multiple servers and two priority classes
Mathematics of Operations Research
Performance of discrete-time queueing systems
Computers and Operations Research
IEEE/ACM Transactions on Networking (TON)
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Proportional differentiated services: delay differentiation and packet scheduling
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Discrete-Time Models for Communication Systems Including ATM
Discrete-Time Models for Communication Systems Including ATM
WITASI '02 Proceedings of the IFIP TC6/WG6.4 Workshop on Internet Technologies, Applications and Social Impact
Performance analysis of a single-server ATM queue with a priority scheduling
Computers and Operations Research
Design and analysis of a bandwidth management framework for ATM-based broadband ISDN
IEEE Communications Magazine
Packet scheduling with delay and loss differentiation
Computer Communications
Numerical inversion of probability generating functions
Operations Research Letters
Congestion control mechanisms and the best effort service model
IEEE Network: The Magazine of Global Internetworking
Controlling the delay trade-off between packet flows using multiple reserved places
Performance Evaluation
Performance Analysis of a Priority Queue with Place Reservation and General Transmission Times
EPEW '08 Proceedings of the 5th European Performance Engineering Workshop on Computer Performance Engineering
Transform-domain analysis of packet delay in network nodes with QoS-aware scheduling
Network performance engineering
| Hi-index | 0.01 |
We study the delay performance of a queue with a place reservation mechanism. The objective of this discipline is to provide a better quality of service to arriving packets that are delay sensitive at the cost of allowing higher delays for the best effort packets and was first proposed by Burakowski and Tarasiuk. In our model, we consider a discrete-time queue with arrivals of type 1 (delay sensitive) and type 2 (best-effort). Whenever a packet of type 1 enters the queue, it takes the position of the reservation that was created there by a previous arrival of type 1 and creates a new reservation at the end of the queue. Type 2 arrivals always take place at the end of the queue in the usual way. We present the analysis of this model based on the use of generating functions and provide results for the mean value, variance and tail behaviour of the delay experienced by both the delay-sensitive and the best-effort traffic. For a specific example, we compare the delay performance of this reservation discipline to the performance of an absolute priority discipline on the one hand, and to the reference discipline first-in first-out on the other.