Elements of Queueing Theory: Palm Martingale Calculus and Stochastic Recurrences

240 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Heavy traffic approximation for the stationary distribution of a generalized Jackson network: The BAR approach (2015, background): “n 6, and relies on both Propositions 4.1 and 5.1. We now motivate the proposition and introduce some notation needed to state it. Let C be the class of functions fthat satisfy (a) f: {θ≤ 0 : θ∈ Rd} → [0,1] (b) fis continuous on {θ<0 : θ∈ Rd} (c) θ 1 ≤ θ 2 ⇒ f(θ 1) ≤ f(θ 2), (d) f(0) = 1. Clearly,”
Stochastic geometry and random graphs for the analysis and design of wireless networks (2009, methodology): “In this section we apply some of the techniques introduced above to study the interference in large ad hoc networks and the outage probability of any given link.”
Analytical Model for Connectivity in Vehicular Ad Hoc Networks (2008, background): “7–16 , speed distribution is denoted as N ( μ, σ ) , where μ and σ are the mean and standard deviation values, respectively.”