IEEE/ACM Transactions on Networking (TON)
Efficient network QoS provisioning based on per node traffic shaping
IEEE/ACM Transactions on Networking (TON)
A deterministic approach to the end-to-end analysis of packet flows in connection-oriented networks
IEEE/ACM Transactions on Networking (TON)
Performance bonds for flow control protocols
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
Determining End-to-End Delay Bounds in Heterogeneous Networks
NOSSDAV '95 Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video
Application of network calculus to guaranteed service networks
IEEE Transactions on Information Theory
On deterministic traffic regulation and service guarantees: a systematic approach by filtering
IEEE Transactions on Information Theory
Quality of service guarantees in virtual circuit switched networks
IEEE Journal on Selected Areas in Communications
Conformance deterioration in QoS networks: phenomenon, analysis and elimination
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Network modelling and simulation
Application-specific workload shaping in multimedia-enabled personal mobile devices
CODES+ISSS '06 Proceedings of the 4th international conference on Hardware/software codesign and system synthesis
Application-specific workload shaping in multimedia-enabled personal mobile devices
ACM Transactions on Embedded Computing Systems (TECS)
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Network calculus delay bounds in queueing networks with exact solutions
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
A design of adaptive double leaky bucket in traffic shaping over VDSL network
DNCOCO'06 Proceedings of the 5th WSEAS international conference on Data networks, communications and computers
Hi-index | 0.00 |
The min-plus theory of greedy shapers has been developed after Cruz's results on the calculus of network delays. An example of a greedy shaper is the buffered leaky bucket controller. The theory of greedy shapers establishes a number of properties such as the series decomposition of shapers or the conservation of arrival constraints by reshaping. It applies in all rigor either to fluid systems or to packets of constant size such as ATM. For variable length packets, the distortion introduced by packetization affects the theory, which is no longer valid. In this paper, we elucidate the relationship between shaping and packetization effects. We show a central result, namely, the min-plus representation of a packetized greedy shaper. We find a sufficient condition under which series decomposition of shapers and conservation of arrival constraints still holds in the presence of packetization effects. This allows us to demonstrate the equivalence of implementing a buffered leaky bucket controller based on either virtual finish times or on bucket replenishment. However, we show in some examples that if the condition is not satisfied, then the property may no longer hold. This indicates that, for variable size packets, unlike for fluid systems, there is a fundamental difference between constraints based on leaky buckets and constraints based on general arrival curves, such as spacing constraints. The latter are used in the context of ATM to obtain tight end-to-end delay bounds. In this paper, we use a min-plus theory, and obtain results on greedy shapers for variable length packets which are not readily explained with the max-plus theory of Chang.