NEPRI: available bandwidth measurement in IP networks

Adachi, M.; Kikuchi, S.; Katsuyama, T.

doi:10.1109/icc.2000.853371

Search citation statements

Order By: Relevance

Paper Sections

Select...

System Model1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2001

2010

Publication Types

Select...

Other4

Article1

Book1

Relationship

Self Cite0

Independent6

Authors

Journals

Cited by 7 publications

(2 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We assume that the sender of a data item can estimate the available network bandwidth in real time by using an existing bandwidth estimation approach such as [3].…”

Section: System Modelmentioning

confidence: 99%

Cooperative caching by clients constructing a peer-to-peer network for push-based broadcast

Hara

Maeda

Ishi

et al. 2010

Data & Knowledge Engineering

View full text Add to dashboard Cite

“…We assume that the sender of a data item can estimate the available network bandwidth in real time by using an existing bandwidth estimation approach such as [3].…”

Section: System Modelmentioning

confidence: 99%

Cooperative caching by clients constructing a peer-to-peer network for push-based broadcast

Hara

Maeda

Ishi

et al. 2010

Data & Knowledge Engineering

View full text Add to dashboard Cite

“…The difference can be attributed to congestion when the packets are transmitted at high speed. NEPRI [1] is a bandwidth measurement tool based on this theory in which a phase plot is drawn after each round of probing to detect the pattern that corresponds to network congestion. Based on the current phase plot, a new probing speed is determined for the next round.…”

mentioning

confidence: 99%

On available bandwidth measurement implementation and experiment

29th Annual IEEE International Conference on Local Computer Networks

View full text Add to dashboard Cite

-We describe the algorithm and the implementation and experiment for available bandwidth measurement based on variable speed probing and zoom-in/zoom-out [7]. We show that, compared with other techniques, our algorithm yields better performance with low overhead and fast convergence because it detects the change of traffic trends (through variable speed probing) rather than specific patterns of probing samples. It can also self-adapt to any bandwidth (through zoom-out) and respond to resolution requirement (through zoom-in). Therefore, no prior knowledge about bottleneck bandwidth is required and measurement resolution can be specified to meet application requirements. We focus on the implementation and experiment and present some results and statistics. We are currently conducting more experiment over live networks to gain more experience and to further improve the algorithm.

show abstract

An Algorithm for Available Bandwidth Measurement

Chow

Jihui

et al. 2001

Networking — ICN 2001

View full text Add to dashboard Cite

NEPRI: available bandwidth measurement in IP networks

Cited by 7 publications

References 2 publications

Cooperative caching by clients constructing a peer-to-peer network for push-based broadcast

Cooperative caching by clients constructing a peer-to-peer network for push-based broadcast

On available bandwidth measurement implementation and experiment

An Algorithm for Available Bandwidth Measurement

Contact Info

Product

Resources

About