Heterogeneous delay tomography based on graph fourier transform in mobile networks

Hideaki, Kinsho; Tagyo, Rie; Ikegami, Daisuke; Matsuda, Takahiro; Takahashi, Akihiro; Takine, Tetsuya

doi:10.1109/cqr.2017.8289444

Cited by 3 publications

(5 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [48], a different approach on link delay inference at mobile networks is proposed. In order to apply compressed sensing, the authors ensure sparsity of vector X by applying Graph Fourier Transform (GFT) at base stations' delays that are assumed to be spatially dependent (the GFT f will be sparse if X is spatially dependent), while servers' delays are assumed to be sparse and delays at core routers are assumed to be negligibly small.…”

Section: Delay Estimationmentioning

confidence: 99%

“…A Graph Fourier Transform (GFT) based tomography approach for the estimation of packet loss rates at nodes in wireless multihop networks with spatially dependent channels is presented in [56]. The basic idea is similar to the previously described delay tomography method of [48] (see Section 4.1). Namely instead of estimating the node state vector (i.e., the vector whose components are the packet loss rates at the respective nodes) directly, the proposed scheme employs CS to first estimate the GFT of the node state vector (which has a few dominant components due to the spatially dependent channels) and then examines the network internal characteristics in the transformed domain.…”

Section: Loss Estimationmentioning

confidence: 99%

“…Fragouli et al [27] binary trees Sattari et al [28] m-ary trees, M-by-N DAGs Jithin et al [30] M-by-N DAGs, asynchronous sources Yao et al [31] RLNC, NRSC, passive tomography Mohammad et al [33] RLNC, congested link location Gui et al [34] mesh DAG topologies Gui et al [35] mesh DAG topologies, minimum probe size Shah-Mansouri et al [36] WSN, RLNC, subspace property, virtual sources Sattari et al [37] trees and general topologies Sattari et al [38] trees with multiple sources Fan et al [52] weighted 1 minimization, expander graphs Chen et al [53] link congestion probabilities, greedy iterative algorithm Takemoto et al [54] measurement paths construction, low-quality link detection Morita et al [56] wireless multihop networks, GFT, spatially dependent channels Bandara et al [57] scalable, adaptive fault localization Firooz et al [41] k-identifiability, expander graphs Fattaholmanan et al [43] collaborative distributed framework, individual matrix for every node Wang et al [44] expander graphs, 1 minimization Fan et al [45] synchronization errors, constrained 1 − 2 optimization Nakanishi et al [46] no clock synchronization, reflective NT Nakanishi et al [47] synchronization errors, differential routing matrix Kinsho et al [48] mobile networks, GFT & passive measurements Wei et al [49] dynamic networks, line graph model Table 2. Overview of key points, advantages, and performance of selected tomographic methods.…”

Section: Network Compressed Loss Delay Topology Comments Coding Sensingmentioning

confidence: 99%

See 2 more Smart Citations

A Review of Advanced Algebraic Approaches Enabling Network Tomography for Future Network Infrastructures

et al. 2020

View full text Add to dashboard Cite

Network tomography has emerged as one of the lean approaches for efficient network monitoring, especially aiming at addressing the ever-increasing requirements for scaling and efficiency in modern network architectures and infrastructures. In this paper, we explore network coding and compressed sensing as enabling technologies in the context of network tomography. Both approaches capitalize on algebraic tools for achieving accuracy while allowing scaling of operation as the size of the monitored network increases. Initially, a brief overview of the tomographic problems and the related classification of methods is provided to better comprehend the problems encountered and solutions provided to date. Subsequently, we present representative approaches that employ either one of the aforementioned technologies and we comparatively describe their fundamental operation. Eventually, we provide a qualitative comparison of features and approaches that can be used for further research and technology development for network monitoring in future Internet infrastructures.

show abstract

Section: Delay Estimationmentioning

confidence: 99%

Section: Loss Estimationmentioning

confidence: 99%

Section: Network Compressed Loss Delay Topology Comments Coding Sensingmentioning

confidence: 99%

See 1 more Smart Citation

A Review of Advanced Algebraic Approaches Enabling Network Tomography for Future Network Infrastructures

et al. 2020

View full text Add to dashboard Cite

show abstract

“…The performance of HDT, however, may be degraded due to the user heterogeneity problem. In [17], HDT without considering the user heterogeneity is proposed, which is referred to as HDT with unweighted estimation in this paper. In order to improve robustness against the user heterogeneity, we extend HDT with unweighted estimation to HDT with weighted estimation, where the number of voluntary mobile users in each path is taken into account.…”

Section: Assupmptionmentioning

confidence: 99%

“…As mentioned in Sect. 1, (7) has the rank deficiency problem [17]. To see this, we consider an ideal situation that ν = 0, i.e.,…”

Section: E(xmentioning

confidence: 99%

Heterogeneous Delay Tomography for Wide-Area Mobile Networks

Hideaki

Tagyo

Ikegami

et al. 2019

IEICE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

In this paper, we consider network monitoring techniques to estimate communication qualities in wide-area mobile networks, where an enormous number of heterogeneous components such as base stations, routers, and servers are deployed. We assume that average delays of neighboring base stations are comparable, most of servers have small delays, and delays at core routers are negligible. Under these assumptions, we propose Heterogeneous Delay Tomography (HDT) to estimate the average delay at each network component from end-to-end round trip times (RTTs) between mobile terminals and servers. HDT employs a crowdsourcing approach to collecting RTTs, where voluntary mobile users report their empirical RTTs to a data collection center. From the collected RTTs, HDT estimates average delays at base stations in the Graph Fourier Transform (GFT) domain and average delays at servers, by means of Compressed Sensing (CS). In the crowdsourcing approach, the performance of HDT may be degraded when the voluntary mobile users are unevenly distributed. To resolve this problem, we further extend HDT by considering the number of voluntary mobile users. With simulation experiments, we evaluate the performance of HDT.

show abstract

3. Tomography Techniques Using Compressed Sensing in Communications Systems

Matsuda

Hara

2019

Eizo Joho Media Gakkaishi

View full text Add to dashboard Cite

Heterogeneous delay tomography based on graph fourier transform in mobile networks

Cited by 3 publications

References 15 publications

A Review of Advanced Algebraic Approaches Enabling Network Tomography for Future Network Infrastructures

A Review of Advanced Algebraic Approaches Enabling Network Tomography for Future Network Infrastructures

Heterogeneous Delay Tomography for Wide-Area Mobile Networks

3. Tomography Techniques Using Compressed Sensing in Communications Systems

Contact Info

Product

Resources

About