Performance bonds for flow control protocols
IEEE/ACM Transactions on Networking (TON)
Proportional differentiated services: delay differentiation and packet scheduling
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
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
IEEE/ACM Transactions on Networking (TON)
"Pay bursts only once" does not hold for non-FIFO guaranteed rate nodes
Performance Evaluation - Performance 2005
Tight end-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks
Performance Evaluation
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Worst case burstiness increase due to arbitrary aggregate multiplexing
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
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
Guaranteed real-time communication in packet-switched networks with FCFS queuing
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
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
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
DEBORAH: a tool for worst-case analysis of FIFO tandems
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
A dual approach to network calculus applying the legendre transform
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
Non preemptive static priority with network calculus: enhancement
MMB'12/DFT'12 Proceedings of the 16th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Hi-index | 0.24 |
In a DiffServ architecture, packets with the same marking are treated as an aggregate at core routers, independently of the flow they belong to. Nevertheless, for the purpose of QoS provisioning, derivation of upper bounds on the delay of individual flows is of great importance. In this paper, we consider a case study network, composed by a tandem of rate-latency servers that is traversed by a tagged flow. At each different node, the tagged flow is multiplexed into a FIFO buffer with a different interfering flow. The tagged flow and the interfering flows are all leaky-bucket constrained at the network entry. We introduce a novel methodology based on well-known results on FIFO multiplexing from Network Calculus, by means of which we derive an end-to-end delay bound for tagged flow traffic. The delay bound assesses the contribution to the delay due to the interference of other flows precisely, and to the best of our knowledge, it is better than any other applicable result available from the literature. Furthermore, we utilize the delay bound formula to quantify the level of overprovisioning required in order to achieve delay bounds comparable to those of a flow-aware architecture.