A network service curve approach for the stochastic analysis of networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Approximate VCCs: a new characterization of multimedia workloads for system-level MpSoC design
Proceedings of the 42nd annual Design Automation Conference
Scaling properties of statistical end-to-end bounds in the network calculus
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
A network calculus with effective bandwidth
IEEE/ACM Transactions on Networking (TON)
On superlinear scaling of network delays
IEEE/ACM Transactions on Networking (TON)
FIFO Service with Differentiated Queueing
Proceedings of the 2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems
| Hi-index | 0.00 |
We propose a new service model based on service curves, which has a loss aspect. In this model, instead of Forcing all the packets to meet their deadlines assigned via a service curve, we allow some packets to be dropped. Specifically, the new model is based on guaranteeing at least a certain fraction of the all packets to meet their deadlines assigned via a service curve. The proposed model is composable. We find a necessary and sufficient condition to employ for an efficient Connection Admission Control at a multiplexer to deliver the services according to the new model, via a graph-theoretic approach. A scheduling algorithm to deliver the services as specified by the new service model, at a multiplexer, also exists.