Inferring link characteristics from end-to-end path measurements

Tsuru, Masato; Takine, Tetsuya; Oie, Yuji

doi:10.1109/icc.2001.937177

Cited by 13 publications

(10 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…So far, many network tomography schemes have been proposed for link loss rates (Cáceres et al [7], Tsuru et al [121]), link delays (Lo Presti et al [88], Tsang et al [120]), and topology (Coates et al [20], Ratnasamy and McCanne [104]). …”

Section: Network Tomographymentioning

confidence: 99%

Survey of Network Coding and Its Applications

Matsuda

Noguchi

Takine

2011

IEICE Trans. Commun.

View full text Add to dashboard Cite

SUMMARYThis survey summarizes the state-of-the-art research on network coding, mainly focusing on its applications to computer networking. Network coding generalizes traditional store-and-forward routing techniques by allowing intermediate nodes in networks to encode several received packets into a single coded packet before forwarding. Network coding was proposed in 2000, and since then, it has been studied extensively in the field of computer networking. In this survey, we first summarize linear network coding and provide a taxonomy of network coding research, i.e., the network coding design problem and network coding applications. Moreover, the latter is subdivided into throughput/capacity enhancement, robustness enhancement, network tomography, and security. We then discuss the fundamental characteristics of network coding and diverse applications of network coding in details, following the above taxonomy.

show abstract

Section: Network Tomographymentioning

confidence: 99%

Survey of Network Coding and Its Applications

Matsuda

Noguchi

Takine

2011

IEICE Trans. Commun.

View full text Add to dashboard Cite

show abstract

“…In fact, if we assume temporal and spatial independency of network characteristics, the relationship between end-to-end measurements and link states will be represented to be an ill-posed linear system [6]. In order to solve such an identifiability problem, several schemes have been proposed, taking account of correlation in measured network characteristics [2], [3], [20]. In [3], a single-source multicast transmission is applied to networks with tree topologies.…”

Section: Introductionmentioning

confidence: 99%

“…In [3], a single-source multicast transmission is applied to networks with tree topologies. As for networks with general topologies, multiple single-source multicast trees are applied in [2] and the performance correlation among unicast flows is used in [20].…”

Section: Introductionmentioning

confidence: 99%

Bitwise Operation-Based In-Network Processing for Loss Tomography

Matsuda

Takine

2013

IEICE Trans. Commun.

View full text Add to dashboard Cite

SUMMARYNetwork tomography is an inference technique for internal network characteristics such as link loss rate and link delay from end-toend measurements. In this paper, we consider network tomography for link loss rates, which is referred to as loss tomography. We propose a loss tomography scheme with bitwise operation-based in-network processing. Intermediate nodes generate coded packets by performing bitwise-operations on received packets so as to embed information about paths along which those packets have been transmitted. The coded packets are then forwarded to downstream nodes. In this way, receiver nodes obtain information about paths along which packets are transmitted successfully. Moreover, we show a recursion to compute the likelihood function of path loss rates, which can be utilized in estimating link loss rates from path loss information. key words: network tomography, link loss rates, in-network processing, likelihood function

show abstract

“…Note that condition 3. is expected to be satisfied approximately because of diversity of traffic in actual networks. Several estimators can be derived by a framework in [6]. For the examples in the next section, since the MIP number of each flow is ¾ or ¼ (in term of [6]), we can employ a basic estimator based on the relation among the shared-part and two independent-parts.…”

Section: General Descriptionmentioning

confidence: 99%

“…It is based on the same principle as a general framework we previously proposed for inferring network-internal (i.e., link) characteristics from given end-to-end path characteristics ( [6]), which can be regarded as a generalization and extension of [4]. We infer some characteristics (occurrence probabilities of some discrete states) of each flow from correlation among characteristics of aggregated-flows at different links with an arbitrary network (routing) topology.…”

Section: Introductionmentioning

confidence: 99%