Algorithms and Requirements for Measuring Network Bandwidth
- LBNL Library
This report unveils new algorithms for actively measuring (not estimating) available bandwidths with very low intrusion, computing cross traffic, thus estimating the physical bandwidth, provides mathematical proof that the algorithms are accurate, and addresses conditions, requirements, and limitations for new and existing algorithms for measuring network bandwidths. The paper also discusses a number of important terminologies and issues for network bandwidth measurement, and introduces a fundamental parameter -Maximum Burst Size that is critical for implementing algorithms based on multiple packets.
- Research Organization:
- Ernest Orlando Lawrence Berkeley National Laboratory, Berkeley, CA (US)
- Sponsoring Organization:
- U.S. DOE. Director, Office of Science. Computational and Technology Research (US)
- DOE Contract Number:
- AC03-76SF00098
- OSTI ID:
- 813373
- Report Number(s):
- LBNL--48330
- Country of Publication:
- United States
- Language:
- English
Similar Records
Measuring End-To-End Bandwidth with Iperf Using Web100
Packet Drop Avoidance for High-speed network transmission protocol
Real-time Intrusion Detection for High-bandwidth Research Networks using Unsupervised Deep Learning
Technical Report
·
Wed Apr 30 00:00:00 EDT 2003
·
OSTI ID:813039
Packet Drop Avoidance for High-speed network transmission protocol
Conference
·
Sat May 01 00:00:00 EDT 2004
·
OSTI ID:831104
Real-time Intrusion Detection for High-bandwidth Research Networks using Unsupervised Deep Learning
Conference
·
Tue Dec 31 23:00:00 EST 2019
·
OSTI ID:1769386