A probabilistic approach to estimate the mean waiting times in the earliest deadline first polling

Authors:
Mu-Song Chen;Hao-Wei Yen
Affiliations:
Electrical Engineering, Da-Yeh University, No.168, University Rd., Dacun, Changhua 51591, Taiwan, R.O.C.;Electrical Engineering, Da-Yeh University, No.168, University Rd., Dacun, Changhua 51591, Taiwan, R.O.C.
Venue:
Computers and Industrial Engineering
Year:
2013

Citing 8
Cited 0

Efficient network QoS provisioning based on per node traffic shaping

IEEE/ACM Transactions on Networking (TON)
Exact admission control for networks with a bounded delay service

IEEE/ACM Transactions on Networking (TON)
Efficient admission control of piecewise linear traffic envelopes at EDF schedulers

IEEE/ACM Transactions on Networking (TON)
On the Remaining Service Time upon Reaching a Given Level in M/G/1 Queues

Queueing Systems: Theory and Applications
Deterministic end-to-end delay guarantees with rate controlled EDF scheduling

Performance Evaluation
The service curve service discipline for the rate-controlled EDF service discipline in variable-sized packet networks

Computer Communications
Statistical admission control for real-time services under earliest deadline first scheduling

Computer Networks: The International Journal of Computer and Telecommunications Networking
A framework for end-to-end deterministic-delay service provisioning in multiservice packet networks

IEEE Transactions on Multimedia

Quantified Score

Hi-index	0.00

Visualization

Abstract

In queueing system, the mean waiting times of messages are important measures to characterize the quality of service (QoS) under various requirements. In a time-critical system, message transactions which cannot meet deadline constraints might lead to catastrophic consequences. Currently, the waiting time estimations using the first-come-first-served (FCFS) and priority (PRI) strategies are already well developed. However, in the case of multi-queue dynamic environments, these quantities are more difficult to analyze due to multiple classes of messages are considered. In this paper, we aim to consider a polling system consisting of a number of parallel infinite-capacity single-server queues. We propose a probabilistic approach to derive the waiting times for different classes of messages by using non-preemptive earliest deadline first (EDF) polling policy. The resulting formula can also lead to the FCFS polling and PRI polling by altering the relative deadlines. Moreover, the bounds of waiting times are discussed. The accuracy of the proposed algorithm is established by comparisons with simulation results. The runtime results are in very good convergence with the theoretical predictions made by our formulas, in terms of prediction accuracies of waiting times and untimely service ratios of messages under various scenarios and timing constraints.