Journal of the ACM (JACM)
Introduction to queueing theory (2nd ed)
Introduction to queueing theory (2nd ed)
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
On the M(n)/M(n)/s queue with impatient calls
Performance Evaluation
On queueing with customer impatience until the beginning of service
Queueing Systems: Theory and Applications
Asymptotic Results and a Markovian Approximation for the M(n)/M(n)/s+GI System
Queueing Systems: Theory and Applications
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Real-time queueing network theory
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performance Study
MASCOTS '05 Proceedings of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
A Method for Performance Analysis of Earliest-Deadline-First Scheduling Policy
The Journal of Supercomputing
EWSN'11 Proceedings of the 8th European conference on Wireless sensor networks
IEEE Transactions on Information Theory
Hi-index | 0.00 |
We provide an analytical study of the impact of packet skipping and opportunistic network coding on the timely communication of messages through a single network element. In a first step, we consider a single-server queueing system with Poisson arrivals, exponential service times, and a single buffer position. Packets arriving at a network node have a fixed deadline before which they should reach the destination. To preserve server capacity, we introduce a thresholding policy, based on remaining time until deadline expiration, to decide whether to serve a packet or skip its service. The obtained goodput improvement of the system is derived, as well as the operating conditions under which thresholding can enhance the performance. Subsequently, we focus our analysis on a system that supports network coding instead of thresholding. We characterize the impact of network coding at a router node on the delivery of packets associated with deadlines. We model the router node as a queueing system in which packets arrive from two independent Poisson flows and undergo opportunistic coding operations. We obtain an exact expression for the goodput of the system and study the achievable gain. Finally, we provide an analytical model that considers both network coding and packet skipping, capturing their joint performance. A comparative analysis between the aforementioned approaches is provided.