Notice
Spatial network calculus and performance guarantees in wireless networks
- document 1 document 2 document 3
- niveau 1 niveau 2 niveau 3
Descriptif
In this talk, we introduce spatial regulation properties for stationary spatial point processes and develop the first steps of a calculus for this regulation, which can be seen as an extension to space of the classical network calculus. Specifically, two classes of regulations are defined: one includes ball regulation and shot-noise regulation, which are shown equivalent; the other one includes void regulation. These regulations are defined both in the strong and weak sense: the former requires the regulations to hold everywhere in space, whereas the latter is built upon Palm calculus and only requires the regulations to hold as observed by a jointly stationary point process.
Based on spatial network calculus, we derive performance guarantees in various wirless network models satisfying the regulation properties. We give universal bounds on the SINR for all links, which lead to link service curves based on information-theoretic achievability. They are combined with classical network calculus to provide end-to-end latency guarantees for all packets in wireless queuing networks. Such guarantees do not exist in networks that are not spatially regulated, e.g., Poisson-type networks.
Thème
Dans la même collection
-
Combinatorial maps in high genus
LOUF Baptiste
Combinatorial maps are a model of discrete geometry: they are surfaces made by gluing polygons along their sides, or equivalently, graphs drawn on surfaces. In this talk, I'll focus on the study of
-
Do there exist expanders with non-negative curvature ?
SALEZ Justin
In this talk I will briefly recall the framework of local weak limits of finite graphs introduced by I. Benjamini and O. Schramm
-
Tail bounds for detection times in mobile hyperbolic graphs
MITSCHE Dieter
Motivated by Krioukov et al.'s model of random hyperbolic graphs for real-world networks, and inspired by the analysis of a dynamic model of graphs in Euclidean space by Peres et al., we introduce a
-
Online matching for the multiclass Stochastic Block Model
SOPRANO LOTO Nahuel
A matching in a graph is a set of edges that do not share endpoints. Developing algorithms that find large matchings is an important problem. An algorithm is said to be online if it has to construct
-
Critical cluster cascades
KIRCHNER Matthias
We consider a sequence of Poisson cluster point processes...
-
Point processes on higher rank symmetric spaces and their cost
MELLICK Samuel
Cost is a natural invariant associated to group actions and invariant point processes on symmetric spaces (such as Euclidean space and hyperbolic space). Informally, it measures how difficult it is to
-
Parallel server systems in extended heavy traffic
CASTIEL Eyal
The standard setting for studying parallel server systems (PSS) at the diffusion scale is based on the heavy traffic condition (HTC)...
-
The Maximal Agreement Subtree problem for random trees
BUDZINSKI Thomas
Consider two binary trees whose leaves are labelled from 1 to n.
-
An Improved Lower Bound on the Largest Common Subtree of Random Leaf-Labeled Binary Trees
KHEZELI Ali
It is known that the size of the largest common subtree...
-
Reversible Markov decision processes
ANANTHARAM Venkat
A Markov decision process is called reversible if for every stationary Markov control strategy the resulting Markov chain is reversible.
-
The question of connectedness in the Free Uniform Spanning Forest
TIMáR Ádám Dávid
The uniform measure on the set of all spanning trees of a finite graph is a classical object in probability.
-
Optimal Convex and Nonconvex Regularizers for a Data Source
O'REILLY Eliza
Regularization is a widespread technique used in statistical estimation problems that helps to capture low dimensional structure in the data and improve signal recovery.
Sur le même thème
-
Bruit, erreur, anomalie et incertitude dans les données-PUDD
ROSSI Fabrice
Les données collectées sont systématiquement soumises à des perturbations de diverses natures, depuis le bruit de mesure de capteurs jusqu’aux erreurs de saisie.
-
Combinatorial maps in high genus
LOUF Baptiste
Combinatorial maps are a model of discrete geometry: they are surfaces made by gluing polygons along their sides, or equivalently, graphs drawn on surfaces. In this talk, I'll focus on the study of
-
Do there exist expanders with non-negative curvature ?
SALEZ Justin
In this talk I will briefly recall the framework of local weak limits of finite graphs introduced by I. Benjamini and O. Schramm
-
Tail bounds for detection times in mobile hyperbolic graphs
MITSCHE Dieter
Motivated by Krioukov et al.'s model of random hyperbolic graphs for real-world networks, and inspired by the analysis of a dynamic model of graphs in Euclidean space by Peres et al., we introduce a
-
Sofic entropy of processes on infinite random trees
BORDENAVE Charles
This is a joint work with Agnes Backhausz et Balasz Szegedy. We define a natural notion of micro-state entropy...
-
Online matching for the multiclass Stochastic Block Model
SOPRANO LOTO Nahuel
A matching in a graph is a set of edges that do not share endpoints. Developing algorithms that find large matchings is an important problem. An algorithm is said to be online if it has to construct
-
Critical cluster cascades
KIRCHNER Matthias
We consider a sequence of Poisson cluster point processes...
-
Point processes on higher rank symmetric spaces and their cost
MELLICK Samuel
Cost is a natural invariant associated to group actions and invariant point processes on symmetric spaces (such as Euclidean space and hyperbolic space). Informally, it measures how difficult it is to
-
Parallel server systems in extended heavy traffic
CASTIEL Eyal
The standard setting for studying parallel server systems (PSS) at the diffusion scale is based on the heavy traffic condition (HTC)...
-
The Maximal Agreement Subtree problem for random trees
BUDZINSKI Thomas
Consider two binary trees whose leaves are labelled from 1 to n.
-
An Improved Lower Bound on the Largest Common Subtree of Random Leaf-Labeled Binary Trees
KHEZELI Ali
It is known that the size of the largest common subtree...
-
Reversible Markov decision processes
ANANTHARAM Venkat
A Markov decision process is called reversible if for every stationary Markov control strategy the resulting Markov chain is reversible.