ndt-dev - [ndt-dev] [ndt] r616 committed - Added an information about how the heuristics were created.
Subject: NDT-DEV email list created
List archive
[ndt-dev] [ndt] r616 committed - Added an information about how the heuristics were created.
Chronological Thread
- From:
- To:
- Subject: [ndt-dev] [ndt] r616 committed - Added an information about how the heuristics were created.
- Date: Tue, 13 Sep 2011 12:38:28 +0000
Revision: 616
Author:
Date: Tue Sep 13 05:37:43 2011
Log: Added an information about how the heuristics were created.
http://code.google.com/p/ndt/source/detail?r=616
Modified:
/wiki/NDTTestMethodology.wiki
=======================================
--- /wiki/NDTTestMethodology.wiki Thu Sep 8 08:37:12 2011
+++ /wiki/NDTTestMethodology.wiki Tue Sep 13 05:37:43 2011
@@ -132,6 +132,8 @@
All of the following detection algorithms are run during the [NDTTestMethodology#S2C_Throughput_Test S2C throughput test]. This means, that the NDT server is the sender and the client is the receiver during all these heuristics. The only exception is the [NDTTestMethodology#Bottleneck_Link_Detection Bottleneck Link Detection] algorithm, which observes all test traffic during both the C2S and the S2C throughput tests.
+The detection algorithms were created based on the specially developed analytical model of the TCP connection. The specific heuristics were then tuned during the tests performed in the laboratory and the real LAN, MAN and WAN environments.
+
=== Bottleneck Link Detection ===
The NDT tries to find the answer to the question "What is the slowest link in the end-2-end path?" by doing the following:
- [ndt-dev] [ndt] r616 committed - Added an information about how the heuristics were created., ndt, 09/13/2011
Archive powered by MHonArc 2.6.16.