In this paper is shown, how delay properties of the edges of a network with stochastic properties can be estimated cooperatively by individual nodes that retain the delay profiles of the entire network. The proposed algorithm adopts null-space projection-based consensus among agents to find individual entries from a set of arbitrary sumcumulative entities associated with graph edges (e.g., delays associated with edges) based on sums over the network paths. The local estimates of delay profile are estimated using Least Squares (LS). A modified, tailored, iterative consensus algorithm is then employed to distribute information among the neighbors. The distributed network tomography is compared to the conventional centralized solution and also to iterative solvers based on Cimmino, CAV, and Landweber methods applied in a distributed manner.
Distributed network tomography applied to stochastic delay profile estimation
Spagnolini U.
2020-01-01
Abstract
In this paper is shown, how delay properties of the edges of a network with stochastic properties can be estimated cooperatively by individual nodes that retain the delay profiles of the entire network. The proposed algorithm adopts null-space projection-based consensus among agents to find individual entries from a set of arbitrary sumcumulative entities associated with graph edges (e.g., delays associated with edges) based on sums over the network paths. The local estimates of delay profile are estimated using Least Squares (LS). A modified, tailored, iterative consensus algorithm is then employed to distribute information among the neighbors. The distributed network tomography is compared to the conventional centralized solution and also to iterative solvers based on Cimmino, CAV, and Landweber methods applied in a distributed manner.| File | Dimensione | Formato | |
|---|---|---|---|
|
11311-1143101_Spagnolini.pdf
accesso aperto
:
Publisher’s version
Dimensione
438.54 kB
Formato
Adobe PDF
|
438.54 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


