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

@article{Fidler2010SurveyOD,
  title={Survey of deterministic and stochastic service curve models in the network calculus},
  author={Markus Fidler},
  journal={IEEE Communications Surveys \& Tutorials},
  year={2010},
  volume={12}
}
  • M. Fidler
  • Published 17 June 2009
  • Computer Science
  • IEEE Communications Surveys & Tutorials
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 computer networks, like the Internet. The elegance of the concept of service curve is due to intuitive convolution formulas that determine the data departures of a system from its arrivals and its service curve. This fundamental relation constitutes the basis of the network calculus and relates it to systems theory… 
A temporal network calculus approach to service guarantee analysis of stochastic networks
TLDR
The time-domain SNC traffic and service models are concretized by linking some well-known stochastic processes to them by investigating the delay performance of a Gilbert-Elliott channel and it is shown that the delay bound can be improved under the independence condition.
Advances in Theory and Applicability of Stochastic Network Calculus
TLDR
This thesis presents a way to integrate possible modeling errors into the bounds of SNC, by adapting the theory of extreme values by adapting the notion of network operations.
A Temporal Network Calculus for Performance Analysis of Computer Networks
TLDR
On the basis of the proposed models, the five basic properties of stochastic network calculus are proved, which implies broad applicability ofThe proposed time-domain approach.
A Temporal Approach to Stochastic Network Calculus
TLDR
A temporal approach to stochastic network calculus is presented, to develop models and derive results from the time perspective and prove the basic properties of the proposed models, such as delay bound and backlog bound, output characterization, concatenation property and superposition property.
Applying Stochastic Network Calculus In Scenarios With Incomplete Knowledge
TLDR
A first approach for arrival estimation is proposed and interleaved with the traditional performance bounds and a more dynamic view on systems is introduced and compared to the classical point of view.
A Guide to the Stochastic Network Calculus
TLDR
An intuitive approach to the stochastic network calculus is contributed, where the method uses moment generating functions, known from the theory of effective bandwidths, to characterize traffic arrivals and network service.
Duality of the Max-Plus and Min-Plus Network Calculus
TLDR
It is shown that there exists a one-to-one correspondence between the min-plus and max-plus network calculus, as long as traffic and service are described by functions with real-valued domains and ranges.
On applying stochastic network calculus
TLDR
The aim of this paper is to provide a tutorial on the new theoretical tool SNC, for which, four critical steps are formalized and discussed and a list of SNC application topics/areas, where there may exist huge research potential, is presented.
Modeling and Performance Analysis of Networks with Flow Transformations
TLDR
This thesis addresses an extension of the network calculus to deal with the random flow transformations and provides the performance evaluation.
On deriving stable backlog bounds by stochastic network calculus
  • Yue Wang
  • Computer Science, Mathematics
    Proceedings of the 2013 25th International Teletraffic Congress (ITC)
  • 2013
TLDR
This work model an network element as a single server with impairment service based on two best-known models in stochastic network calculus and finds that they actually derive equivalent Stochastic service curves and backlog bounds.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 222 REFERENCES
A network service curve approach for the stochastic analysis of networks
TLDR
The presented network service curve permits the calculation of statistical end-to-end delay and backlog bounds for broad classes of arrival and service distributions and is shown to be bounded by O(Hlog H), where H is the number of nodes traversed by a flow.
An Algebra for Queueing Networks with Time-Varying Service and Its Application to the Analysis of Integrated Service Networks
TLDR
A network model that allows to capture the time-varying service delivered to a traffic stream due to the presence of random perturbations is introduced and contains several earlier discrete event models pertaining to stochastic Petri nets, service curves, and fork-join networks and shows how the present model unifies them in a single algebraic structure.
A basic stochastic network calculus
TLDR
Stochastic strict server is defined, which uses an ideal service process and an impairment process to characterize a server to perform independent case analysis and provides a convenient way to find the stochastic service curve of a serve.
Scaling properties in the stochastic network calculus
TLDR
This thesis argues that the stochastic network calculus can provide new analytical insight into the scaling properties of network performance metrics and enables the proof of the O (H log H) scaling of end-to-end delays, and lends itself to explicit numerical evaluations for a wide class of arrivals.
Scaling properties of statistical end-to-end bounds in the network calculus
TLDR
The presented network service curve permits the calculation of statistical end-to-end delay and backlog bounds for broad classes of arrival and service distributions and is shown to be bounded by /spl Oscr/(H log H), where H is the number of nodes traversed by a flow.
An End-to-End Probabilistic Network Calculus with Moment Generating Functions
  • M. Fidler
  • Computer Science
    200614th IEEE International Workshop on Quality of Service
  • 2006
TLDR
A concise, probabilistic network calculus with moment generating functions that achieve the objective of scaling linearly in the number of servers in series is established.
The DISCO Network Calculator
TLDR
Network calculus aims to be a system theory for deterministic queuing, allowing to derive deterministic guarantees on throughput and delay, as well as find bounds on buffer sizes and thereby allow for loss-free transfer.
A Min-Plus Calculus for End-to-End Statistical Service Guarantees
TLDR
The network calculus is extended to a probabilistic framework with statistical service guarantees and it is argued that many practically relevant service curves may be compliant to this description.
Network Calculus Made Easy
TLDR
A deenition of service curve is introduced, the extended service curve, which is the same for isolated queues and for networks of queues, and makes it possible to model nodes that otherwise do not t in the calculus of Cruz.
Stochastic Network Calculus
TLDR
A stochastic network calculus is proposed to systematically analyze the end-to-end Stochastic QoS performance of a system with stochastically bounded input traffic over a series of deterministic and stochastics servers.
...
1
2
3
4
5
...