IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
Simulation Modeling and Analysis
Simulation Modeling and Analysis
Delay Bounds in a Network with Aggregate Scheduling
QofIS '00 Proceedings of the First COST 263 International Workshop on Quality of Future Internet Services
Evaluation of a differentiated services based implementation of a premium and an olympic service
QofIS'02/ICQT'02 Proceedings of the 3rd international conference on quality of future internet services and internet charging and QoS technologies 2nd international conference on From QoS provisioning to QoS charging
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
End-to-end quality of service for high-end applications
Computer Communications
Grid resource management
Tight end-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks
Performance Evaluation
End-to-end delay bounds in FIFO-multiplexing tandems
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Optimal routing for end-to-end guarantees: the price of multiplexing
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
Delay bounds for FIFO aggregates: a case study
Computer Communications
| Hi-index | 0.00 |
The Differentiated Services framework allows to provide scalable network Quality of Service by aggregate scheduling. Services, like a Premium class, can be defined to offer a bounded end-to-end delay. For such services, the methodology of Network Calculus has been applied successfully in Integrated Services networks to derive upper bounds on the delay of individual flows. Recent extensions allow an application of Network Calculus even to aggregate scheduling networks. Nevertheless, computations are significantly complicated due to the multiplexing and de-multiplexing of micro-flows to aggregates. Here problems concerning the tightness of delay bounds may be encountered.A phenomenon called Pay Bursts Only Once is known to give a closer upper estimate on the delay, when an end-to-end service curve is derived prior to delay computations. Doing so accounts for bursts of the flow of interest only once end-to-end instead of at each link independently. This principle also holds in aggregate scheduling networks. However, it can be extended in that bursts of interfering flows are paid only once, too. In this paper we show the existence of such a complementing Pay Bursts Only Once phenomenon for interfering flows. We derive the end-to-end service curve for a flow of interest in an arbitrary aggregate scheduling feed forward network for rate-latency service curves, and leaky bucket constraint arrival curves, which conforms to both of the above principles. We give simulation results to show the utility of the derived forms.