A composable service model with loss and a scheduling algorithm
Sami Ayyorgun, R.L. Cruz · 2004
We show the composability of a new service model that we propose, which incorporates packet loss. The new model is based on guaranteeing at least a certain fraction of the all packets of a flow, which is to be served through a network element, to meet their deadlines assigned, via a service curve. We also propose a scheduling algorithm to deliver the services as specified by the new service model at a multiplexer. The correctness of the proposed algorithm is also shown