By Topic

A probabilistic analysis of admission control policies for deadline-driven service disciplines

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Simon, R. ; Dept. of Comput. Sci., George Mason Univ., Fairfax, VA, USA ; Znati, T.

In a communication network, deadline-driven packet scheduling policies provide real-time performance guarantees by associating a deadline with each packet and then transmitting packets according to increasing orders of deadlines. New connections must undergo an admission control test before they are accepted for service. The paper develops a probabilistic model to analyze admission control methods for the general class of non-preemptive deadline-oriented packet scheduling policies. The authors present a general-purpose schedulability theorem for non-preemptive earliest deadline first packet scheduling. They then show how to use a stochastic knapsack to compute acceptance probabilities. A large-scale simulation study demonstrates that the method provides highly accurate predictions of acceptance rates for multiple types of traffic requests

Published in:

Simulation Symposium, 1998. Proceedings. 31st Annual

Date of Conference:

5-9 Apr 1998