Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Simple Proof of Linear Scaling of End-to-End Probabilistic Bounds
  using Network Calculus   Statistical network calculus is the probabilistic extension of network
calculus, which uses a simple envelope approach to describe arrival traffic and
service available for the arrival traffic in a node. One of the key features of
network calculus is the possibility to describe the service available in a
network using a network service envelope constructed from the service envelopes
of the individual nodes constituting the network. It have been shown that the
end-to-end worst case performance measures computed using the network service
envelope is bounded by $ {\cal O} (H) $, where $H$ is the number of nodes
traversed by a flow. There have been many attempts to achieve a similar linear
scaling for end-to-end probabilistic performance measures but with limited
success. In this paper, we present a simple general proof of computing
end-to-end probabilistic performance measures using network calculus that grow
linearly in the number of nodes ($H$).

23
The categories of this paper are: solv-int
2
The categories of this paper are: math
25
The categories of this paper are: patt-sol
8
The categories of this paper are: hep-ex
14
The categories of this paper are: math-ph
0
The categories of this paper are: hep-ph
4
The categories of this paper are: cond-mat
36
The categories of this paper are: cmp-lg
7
The categories of this paper are: hep-th
22
The categories of this paper are: chao-dyn
24
The categories of this paper are: dg-ga
28
The categories of this paper are: alg-geom
16
The categories of this paper are: stat
6
The categories of this paper are: astro-ph
17
The categories of this paper are: q-fin
32
The categories of this paper are: atom-ph