Stability of Recursive Stochastic Tracking Algorithms
SIAM Journal on Control and Optimization
A control-theoretic approach to flow control
ACM SIGCOMM Computer Communication Review - Special twenty-fifth anniversary issue. Highlights from 25 years of the Computer Communication Review
Measuring bottleneck link speed in packet-switched networks
Performance Evaluation
End-to-end internet packet dynamics
IEEE/ACM Transactions on Networking (TON)
Decoupling Computation and Data Scheduling in Distributed Data-Intensive Applications
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Predicting Sporadic Grid Data Transfers
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Dynamic Server Selection using Bandwidth Probing in Wide-Area Networks
Dynamic Server Selection using Bandwidth Probing in Wide-Area Networks
End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput
IEEE/ACM Transactions on Networking (TON)
A measurement study of available bandwidth estimation tools
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
CapProbe: a simple and accurate capacity estimation technique
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Packet-dispersion techniques and a capacity-estimation methodology
IEEE/ACM Transactions on Networking (TON)
A taxonomy of Data Grids for distributed data sharing, management, and processing
ACM Computing Surveys (CSUR)
Nettimer: a tool for measuring bottleneck link, bandwidth
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
SPAND: shared passive network performance discovery
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
Evaluation and characterization of available bandwidth probing techniques
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Four methods to estimate available channel bandwidth in Data Grid are described. To compare methods Data Grid was emulated and the special data transfer scenarios were designed. For every scenario the estimates of the performance and bandwidth parameters are constructed using linear filtering techniques based on the Kalman filter, least-squares, recursive least-squares and linear stochastic approximation with randomized inputs. The parameters such as step-size were the same during all the experiments to show how well can the algorithms adapt to different data transfer scenarios without any manual adjustment. The results demonstrating the estimation errors of the considered methods are given and disscussed.