Traffic models and admission control for variable bit rate continuous media transmission with deterministic service

In this paper we address the problem of call admission based on general des criptions of stored continuous media (CM) flows. We show that such an appro ach to call admission can result in a very high resource utilization that c an be significantly higher than that produced when using time-invariant flo w descriptions. We present the admissibility conditions for flows, where pa ckets are scheduled according to the earliest-deadline-first (EDF) scheduli ng policy. We further present an algorithm for testing for admissibility of a new flow whose computational complexity is Linear in the number of flows and in the linear segments used for flow description. Last, we present an algorithm for producing a parsimonious flow description which produces most of the benefit of the best general description while requiring a small num ber of linear segments. Simulation shows that this improves the network res ource utilization as much as 200-250% over the best possible utilization ac hieved using any time-invariant workload function. A significant improvemen t results even when the workload is smoothed. (C)2000 Elsevier Science B.V. All rights reserved.