A distributed Poisson approximation for preempt-resume clockedschedules

Many telecommunication systems with time-critical requirements use a preempt-resume clocked schedule. An approximation to the ergodic distribution of the time to completion of a low-priority task is obtained by treating the priority service time distribution as the limit of compound Poisson distributions. Explicit formulas for the mean and variance that are highly accurate are given. For random clocked loads, a stochastic bound is provided for the discrepancy between the exact and approximate distributions. For deterministic clocked loads, sample path bounds are found. Simulation results are given to demonstrate the accuracy of the model