IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Any work-conserving policy stabilizes the ring with spatial re-use
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)
Instability of FIFO in session-oriented networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
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
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
On deterministic traffic regulation and service guarantees: a systematic approach by filtering
IEEE Transactions on Information Theory
Statistical service assurances for traffic scheduling algorithms
IEEE Journal on Selected Areas in Communications
Quality of service guarantees in virtual circuit switched networks
IEEE Journal on Selected Areas in Communications
Packet scale rate guarantee for non-FIFO nodes
IEEE/ACM Transactions on Networking (TON)
Relationship between guaranteed rate server and latency rate server
Computer Networks: The International Journal of Computer and Telecommunications Networking
A New Scheduler for AF and EF in a DS Node
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Enhancing router QoS through job scheduling with weighted shortest processing time-adjusted
Computers and Operations Research
Switching between Fixed and Call-Adaptive Playout: A Per-Call Playout Algorithm
IEEE Internet Computing
Delay bound and packet scale rate guarantee for some expedited forwarding networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Per-domain packet scale rate guarantee for expedited forwarding
IEEE/ACM Transactions on Networking (TON)
Tight end-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks
Performance Evaluation
End-to-end QoS guarantees for a network based on Latency-Rate Max-Min service curve
Computer Communications
End-to-end delay bounds in FIFO-multiplexing tandems
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
A methodology for computing end-to-end delay bounds in FIFO-multiplexing tandems
Performance Evaluation
Efficient and stateless deployment of VoIP services
Computer Networks: The International Journal of Computer and Telecommunications Networking
Estimating the worst-case delay in FIFO tandems using network calculus
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Computation of a (min,+) multi-dimensional convolution for end-to-end performance analysis
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Delay bounds for FIFO aggregates: a case study
Computer Communications
Delay bound and packet scale rate guarantee for some expedited forwarding networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Providing deterministic end-to-end fairness guarantees in core-stateless networks
IWQoS'03 Proceedings of the 11th international conference on Quality of service
Per-domain packet scale rate guarantee for expedited forwarding
IWQoS'03 Proceedings of the 11th international conference on Quality of service
Approximation of generalized processor sharing with interleaved stratified timer wheels
IEEE/ACM Transactions on Networking (TON)
FIFO Service with Differentiated Queueing
Proceedings of the 2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems
| Hi-index | 0.00 |
We consider the definition of the expedited forwarding per-hop behavior (EF PHB) as given in RFC 2598 and its impact on worst case end-to-end delay jitter. On the one hand, the definition in RFC 2598 can be used to predict extremely low end-to-end delay jitter, independent of the network scale. On the other hand, we find that the worst case delay jitter can be made arbitrarily large, while each flow traverses at most a specified number of hops, if we allow networks to become arbitrarily large; this is in contradiction with the previous statement. We analyze where the contradiction originates and find the explanation. It resides in the fact that the definition in RFC 2598 is not easily implementable in schedulers we know of, mainly because it is not formal enough, and also because it does not contain an error term. We propose a new definition for the EF PHB, called "packet scale rate guarantee" (PSRG) that preserves the spirit of RFC 2598 while allowing a number of reasonable implementations and has very useful properties for per-node and end-to-end network engineering. We show that this definition implies a rate-latency service curve property. We also show that it is equivalent, in some sense, to the stronger concept of "adaptive service guarantee." Then we propose some proven bounds on delay jitter for networks implementing this new definition, both in cases without loss and with loss.