Exact admission control for networks with a bounded delay service
IEEE/ACM Transactions on Networking (TON)
Efficient admission control of piecewise linear traffic envelopes at EDF schedulers
IEEE/ACM Transactions on Networking (TON)
Network support for applications requiring quality of service in heterogeneous environments
Network support for applications requiring quality of service in heterogeneous environments
Efficient network QoS provisioning based on per node traffic shaping
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Optimal multiplexing on a single link: delay and buffer requirements
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
This paper deals with the admission of flows with bounded delay and bounded arrivals in a rate-controlled network (more precisely, a network with nodes using ratecontrolled service disciplines with the Earliest Deadline First as the scheduling algorithm). It focuses on an important function of flow admission that has a straight impact on flow admissibility, more precisely, choosing the traffic envelope functions of the rate-controllers traversed by a flow. We present in this paper a method for choosing these envelopes which compared to previous work improves flow admissibility. Then, we show its efficiency through an example.