Performance bonds for flow control protocols
IEEE/ACM Transactions on Networking (TON)
Preserving quality of service guarantees in spite of flow aggregation
IEEE/ACM Transactions on Networking (TON)
Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
Delay jitter bounds and packet scale rate guarantee for expedited forwarding
IEEE/ACM Transactions on Networking (TON)
Delay bounds for a network of guaranteed rate servers with FIFO aggregation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Extending the Network Calculus Pay Bursts Only Once Principle to Aggregate Scheduling
QoS-IP 2003 Proceedings of the Second International Workshop on Quality of Service in Multiservice IP Networks
Fundamental Trade-offs in Aggregate Packet Scheduling
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
A parameter based admission control for differentiated services networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - QoS in multiservice IP networks
Tight end-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks
Performance Evaluation
The DISCO network calculator: a toolbox for worst case analysis
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Delay bounds for FIFO aggregates: a case study
Computer Communications
Traffic engineering in a multipoint-to-point network
IEEE Journal on Selected Areas in Communications
A methodology for computing end-to-end delay bounds in FIFO-multiplexing tandems
Performance Evaluation
Optimal routing for end-to-end guarantees using Network Calculus
Performance Evaluation
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
NC-maude: a rewriting tool to play with network calculus
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Hi-index | 0.00 |
In this paper we address the problem of finding good end-to-end delay bounds for single leaky-bucket shaped flows subject to FIFO multiplexing in tandems of rate-latency nodes. More specifically, we focus on a methodology, called the Least Upper Delay Bound (LUDB) method, which is based on Network Calculus. The latter has already been used for computing delay bounds in tandems in which the path of the various flows are subject to particular restrictions. In this paper we generalize it to tandems traversed by flows following arbitrary paths. We show that such methodology yields better bounds than those obtained through both per-node analysis and comparable methods proposed in the literature.