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
Delay jitter bounds and packet scale rate guarantee for expedited forwarding
IEEE/ACM Transactions on Networking (TON)
Worst case burstiness increase due to FIFO multiplexing
Performance Evaluation
Delay bounds for a network of guaranteed rate servers with FIFO aggregation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Integrating network-calculus-based simulation with packet-level simulation for TCP-operated networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Network modelling and simulation
Worst case burstiness increase due to arbitrary aggregate multiplexing
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Enabling network calculus-based simulation for TCP congestion control
Computer Networks: The International Journal of Computer and Telecommunications Networking
Multimedia data transmission and control using active networks
Computer Communications
Traffic shaping in aggregate-based networks: implementation and analysis
Computer Communications
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
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 greedy shaper is the buffered leaky bucket controller. The theory of greedy shapers establishes a number of properties; for example, re-shaping keeps original arrival constraints. The existing theory 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. Chang has introduced the concept of packetizer, which models the effect of variable length packets, and has also developed a max-plus theory of shapers. In this paper, we start with the 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. We show a fundamental result, namely, the min-plus representation of a packetized greedy shaper. This allows us to prove that, under some assumptions, re-shaping a flow of variable length packets does keep original arrival constraints. However, we show on some examples that if the assumptions are not satisfied, then the property may not hold any more. We also demonstrate the equivalence of implementing a buffered leaky bucket controller based on either virtual finish times or on bucket replenishment.