IEEE/ACM Transactions on Networking (TON)
Generalized guaranteed rate scheduling algorithms: a framework
IEEE/ACM Transactions on Networking (TON)
Performance bonds for flow control protocols
IEEE/ACM Transactions on Networking (TON)
Fair queuing for aggregated multiple links
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Delay jitter bounds and packet scale rate guarantee for expedited forwarding
IEEE/ACM Transactions on Networking (TON)
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
On the speedup required for work-conserving crossbar switches
IEEE Journal on Selected Areas in Communications
"Pay bursts only once" does not hold for non-FIFO guaranteed rate nodes
Performance Evaluation - Performance 2005
Per-domain packet scale rate guarantee for expedited forwarding
IEEE/ACM Transactions on Networking (TON)
End-to-end QoS guarantees for a network based on Latency-Rate Max-Min service curve
Computer Communications
Hi-index | 0.00 |
Packet Scale Rate Guarantee (PSRG) is a generic node model which underlies the definition of Expedited Forwarding (EF) proposed in the context of Internet Differentiated Services. For the case of first-in-first-out (FIFO) nodes, PSRG is equivalent to the well-understood concept of adaptive service curve. However, in practice, many devices do not necessarily preserve the FIFO property, and therefore, known FIFO results do not hold. This paper analyzes the properties of PSRG in the absence of FIFO assumption. Our analysis is based on a novel characterization of PSRG which avoids the use of virtual finish times and is obtained by min-max algebra. We use it to show that delay bounds previously obtained for the FIFO case are still valid; in contrast, we find that this is not true for the characterization of the concatenation of two nodes.