IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
An integrated congestion management architecture for Internet hosts
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Some properties of variable length packet shapers
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
Worst case burstiness increase due to FIFO multiplexing
Performance Evaluation
A parameter based admission control for differentiated services networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - QoS in multiservice IP networks
Evaluation of a differentiated services based implementation of a premium and an olympic service
QofIS'02/ICQT'02 Proceedings of the 3rd international conference on quality of future internet services and internet charging and QoS technologies 2nd international conference on From QoS provisioning to QoS charging
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
A calculus for network delay. I. Network elements in isolation
IEEE Transactions on Information Theory
A calculus for network delay. II. Network analysis
IEEE Transactions on Information Theory
MPEG-4 and H.263 video traces for network performance evaluation
IEEE Network: The Magazine of Global Internetworking
Worst case burstiness increase due to arbitrary aggregate multiplexing
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Traffic and quality characterization of the H.264/AVC scalable video coding extension
Advances in Multimedia
A dual approach to network calculus applying the legendre transform
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
| Hi-index | 0.24 |
The Differentiated Services architecture allows providing scalable Quality of Service by means of aggregating flows to a small number of traffic classes. Among these classes a Premium Service is defined, for which end-to-end delay guarantees are of particular interest. However, in aggregate scheduling networks such delay bounds suffer significantly from effects that are due to multiplexing of flows to aggregates. A way to minimize the impacts of interfering flows is to shape incoming traffic, so that bursts are smoothed. Doing so reduces the queuing delay within the core of a domain, whereas an additional shaping delay at the edge is introduced. This paper addresses the issue of traffic shaping analytically by extending known Network Calculus. An equation that allows computing tight per-flow output bounds in aggregate scheduling networks is derived and a solution for shaped interfering flows is provided. We then give an overview on the shaping capabilities of current legacy routers, showing deviations of actual implementations compared to the idealized view. Finally, the evolved analytical framework is applied to an example scenario and the results are compared to corresponding measurements.