We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
We consider stochastic guarantees for networks with aggregate scheduling, in particular, Expedited Forwarding (EF). Our approach is based on the assumption that a node can be abstracted by a service curve, and the input flows are regulated individually at the network ingress. Both of these assumptions are inline with the current definition of EF \cite{charny-00-b,davie-01-a}. We derive bounds to the complementary distributions of the backlog, delay through a single node, and the end-to-end delay. We also give a bound on the loss-ratio. Our analysis is exact under the given assumptions. Our results should help us to understand the performance of networks with aggregate scheduling, and provide the basis for dimensioning such networks
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.