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
Matrix analysis and applied linear algebra
Matrix analysis and applied linear algebra
Discrete-Time Models for Communication Systems Including ATM
Discrete-Time Models for Communication Systems Including ATM
Performance analysis of a single-server ATM queue with a priority scheduling
Computers and Operations Research
The discrete-time preemptive repeat identical priority queue
Queueing Systems: Theory and Applications
Priority queueing systems: from probability generating functions to tail probabilities
Queueing Systems: Theory and Applications
On priority queues with priority jumps
Performance Evaluation
Place reservation: Delay analysis of a novel scheduling mechanism
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
A note on the discretization of Little's result
Operations Research Letters
Congestion control mechanisms and the best effort service model
IEEE Network: The Magazine of Global Internetworking
ABE: providing a low-delay service within best effort
IEEE Network: The Magazine of Global Internetworking
Transform-domain analysis of packet delay in network nodes with QoS-aware scheduling
Network performance engineering
| Hi-index | 0.00 |
We analyse a discrete-time queueing model with packet arrivals that are either delay-sensitive (type 1) or delay-tolerant (type 2). The prominent feature of this model is its reservation-based queueing discipline, which reduces the queueing delay perceived by the 1-packets at the cost of allowing higher delays for the 2-packets. A total of N reserved places are introduced in the queue. Whenever a 1-packet enters the queue, it takes the position of the most advanced reservation and creates a new one at the end of the queue. The amount of delay differentiation between 1- and 2-packets can thus be controlled smoothly by the parameter N. We obtain the probability-generating function, the mean value and the tail distribution of the delay experienced by 1- and 2-packets.