Performance bonds for flow control protocols
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
RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications
Endpoint Admission Control: Network Based Approach
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
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
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
The DISCO network calculator: a toolbox for worst case analysis
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
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
Optimal routing for end-to-end guarantees using Network Calculus
Performance Evaluation
Guaranteed real-time communication in packet-switched networks with FCFS queuing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Analysis of communication delay bounds for network on chips
Proceedings of the 2009 Asia and South Pacific Design Automation Conference
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
Analysis of worst-case delay bounds for best-effort communication in wormhole networks on chip
NOCS '09 Proceedings of the 2009 3rd ACM/IEEE International Symposium on Networks-on-Chip
From 2D to 3D NoCs: a case study on worst-case communication performance
Proceedings of the 2009 International Conference on Computer-Aided Design
Analysis of worst-case delay bounds for on-chip packet-switching networks
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Dimensioning and worst-case analysis of cluster-tree sensor networks
ACM Transactions on Sensor Networks (TOSN)
Building a potential field to provide real-time transmission in wireless sensor network
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
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
Towards resource-optimal routing plans for real-time traffic
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Worst-case delay bounds with fixed priorities using network calculus
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Searching for tight performance bounds in feed-forward networks
MMB&DFT'10 Proceedings of the 15th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Worst-case performance analysis of 2-D mesh NoCs using multi-path minimal routing
Proceedings of the eighth IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Worst-case delay analysis of master-slave switched ethernet networks
Proceeings of the 2nd International Workshop on Worst-Case Traversal Time
Real-time routing in wireless sensor networks: A potential field approach
ACM Transactions on Sensor Networks (TOSN)
Worst-case delay analysis of variable bit-rate flows in network-on-chip with aggregate scheduling
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
Continuity for network calculus
Proceedings of the 21st International conference on Real-Time Networks and Systems
Container of (min, +)-linear systems
Discrete Event Dynamic Systems
| Hi-index | 0.00 |
Aggregate scheduling has been proposed as a solution for achieving scalability in large-size networks. However, in order to enable the provisioning of real-time services, such as video delivery or voice conversations, in aggregate scheduling networks, end-to-end delay bounds for single flows are required. In this paper, we derive per-flow end-to-end delay bounds in aggregate scheduling networks in which per-egress (or sink-tree) aggregation is in place, and flows traffic is aggregated according to a FIFO policy. The derivation process is based on Network Calculus, which is suitably extended to this purpose. We show that the bound is tight by deriving the scenario in which it is attained. A tight delay bound can be employed for a variety of purposes: for example, devising optimal aggregation criteria and rate provisioning policies based on pre-specified flow delay bounds.