Many communication networks such as wireless networks only provide stochastic service guarantees. For analyzing stochastic service guarantees, research effort has been made in the past few years to develop stochastic network calculus, a probabilistic version of (min, +) deterministic network calculus. However, many challenges have made the development difficult. Some of them are closely related...

(ii) F is a family of subsets of Ω which has the structure of a σ-field: a) ∅ ∈ F b) If A ∈ F , then its complement A also belongs to F c) A1, A2, . . . ∈ F =⇒ ∪i=1Ai ∈ F (iii) P is a function which associates a number P (A) to each set A ∈ F with the following properties: a) 0 ≤ P (A) ≤ 1, b) P (Ω) = 1 c) For any sequence A1, A2, . . . of disjoints sets in F (that is, Ai∩Aj = ∅ if i 6= j), P (...

This research is to develop a new form of stochastic network calculus for queuing system performance guarantees by making use of the Legendre transform at the sample-path level. A symmetrical formulation is resulted in through separate modeling of traffic flows and service capacities. Performance measures at single nodes and the service capacities of tandem systems are explicitly bounded at the...

Mobile Ambients (MA) have acquired a fundamental role in modelling mobility in systems with mobile code and mobile devices, and in computation over administrative domains. We present the stochastic version of Mobile Ambients, called Stochastic Mobile Ambients (SMA), where we extend MA with time and probabilities. Inspired by previous models, PEPA and Sπ, we enhance the prefix of the capabilitie...