IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round robin
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A deterministic approach to the end-to-end analysis of packet flows in connection-oriented networks
IEEE/ACM Transactions on Networking (TON)
Delay Bounds in a Network with Aggregate Scheduling
QofIS '00 Proceedings of the First COST 263 International Workshop on Quality of Future Internet Services
WF2Q: worst-case fair weighted fair queueing
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
Application of network calculus to guaranteed service networks
IEEE Transactions on Information Theory
Quality of service guarantees in virtual circuit switched networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
The design of traffic management schemes for multimedia applications is a challenge for the future Internet. The main problem is the high burstiness of the multimedia traffic. Most of the traffic management schemes try to minimize the total bandwidth required to serve multimedia applications. However, these schemes typically suffer from a poor scalability. Rather than minimizing the burstiness of the multimedia sessions, we present an approach that tries to benefit from high variability of multimedia sessions to maximize the bandwidth offered to the besteffort traffic. The proposed scheme, called DSS, is based on shaping of the flows and on the use of the GPS scheduling policy in the routers. We show that DSS is highly scalable and that its bandwidth requirement for multimedia sessions remains reasonable, in particular smaller than the bandwidth requirement of RPPS.