Survey of deterministic and stochastic service curve models in the network calculus

M Fidler - IEEE Communications surveys & tutorials, 2010 - ieeexplore.ieee.org
In recent years service curves have proven a powerful and versatile model for performance
analysis of network elements, such as schedulers, links, and traffic shapers, up to entire …

[หนังสือ][B] Network calculus: a theory of deterministic queuing systems for the internet

JY Le Boudec, P Thiran - 2001 - Springer
In this chapter we introduce the basic network calculus concepts of arrival, service curves
and shapers. The application given in this chapter concerns primarily networks with …

Fair queuing memory systems

KJ Nesbit, N Aggarwal, J Laudon… - 2006 39th Annual IEEE …, 2006 - ieeexplore.ieee.org
We propose and evaluate a multi-thread memory scheduler that targets high performance
CMPs. The proposed memory scheduler is based on concepts originally developed for …

Application of network calculus to guaranteed service networks

JY Le Boudec - IEEE Transactions on Information theory, 1998 - ieeexplore.ieee.org
We use previous network calculus results to study some properties of lossless multiplexing
as it may be used in guaranteed service networks. We call network calculus a set of results …

[PDF][PDF] {mClock}: Handling throughput variability for hypervisor {IO} scheduling

A Gulati, A Merchant, PJ Varman - 9th USENIX Symposium on …, 2010 - usenix.org
Virtualized servers run a diverse set of virtual machines (VMs), ranging from interactive
desktops to test and development environments and even batch workloads. Hypervisors are …

[PDF][PDF] PARDA: Proportional Allocation of Resources for Distributed Storage Access.

A Gulati, I Ahmad, CA Waldspurger - FAST, 2009 - usenix.org
PARDA: Proportional Allocation of Resources for Distributed Storage Access Page 1 Copyright
© 2009 VMware, Inc. All rights reserved. PARDA: Proportional Allocation of Resources for …

An end-to-end probabilistic network calculus with moment generating functions

M Fidler - 200614th IEEE International Workshop on Quality of …, 2006 - ieeexplore.ieee.org
Network calculus is a min-plus system theory for performance evaluation of queuing
networks. Its elegance steins from intuitive convolution formulas for concatenation of …

Methods for bounding end-to-end delays on an AFDX network

H Charara, JL Scharbarg, J Ermont… - … Conference on Real …, 2006 - ieeexplore.ieee.org
Architectures of avionics networks, such as that of the Airbus A380, currently know important
evolutions. This is principally due to the increase in the complexity of the embedded …

Theories and models for internet quality of service

V Firoiu, JY Le Boudec, D Towsley… - Proceedings of the …, 2002 - ieeexplore.ieee.org
We survey advances in theories and models for Internet quality of service (QoS). We start
with the theory of network calculus, which lays the foundation for support of deterministic …

A hierarchical fair service curve algorithm for link-sharing, real-time and priority services

I Stoica, H Zhang, TSE Ng - ACM SIGCOMM Computer Communication …, 1997 - dl.acm.org
In this paper, we study hierarchical resource management models and algorithms that
support both link-sharing and guaranteed real-time services with decoupled delay (priority) …