Elements of queueing theory

By K. Borovkov. 2003

394 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.

An Aloha protocol for multihop mobile wireless networks (2006, background): “This implies that the sequence of configurations seen by node over time (by configuration seen by mobile at time , we understand the family of points ) is stationary and ergodic (see [22] for these definitions).”
Stochastic geometry and random graphs for the analysis and design of wireless networks (2009, background): “…point processes: The theory of stationary point processes is based on the concept of marks and on the Matthes de ﬁ nition of Palm probability [42], [43] Roughly speaking, a mark of some point of a stationary point process is a quantity that “follows this point” when the collection of points is…”
Steady-state analysis of a multiserver queue in the Halfin-Whitt regime (2007, unknown): “In the first subsection we consider a time-embedded version of {(Q̂nt ,Lnt ), t ∈ R+}.”
A minimum cost heterogeneous sensor network with a lifetime constraint (2005, methodology): “Since type 0 nodes as well as type 1 nodes are deployed using a homogeneous Poisson point process, we can shift the origin to one of the type 1 points and use Campbell's theorem and Slivnyak's theorem [16] to compute the expected number of type 0 nodes in a typical Voronoi cell.”
Stationary distributions of multi-type totally asymmetric exclusion processes (2005, unknown): “Key words and phrases.”