Research Article
On the Accurate Identification of Network Paths Having a Common Bottleneck
Algorithm 1
Detection of paths that share a bottleneck.
| Input: {A covariance matrix of successive delay measurements for network paths} | | Output: Where is set of paths that share the bottleneck | | | | for to do | | | | end for | | {A set of projection values corresponding to each path} | | | for to do | | | | end for | | {A set of rate of change of projection values corresponding to each path} | | | | {Threshold to identify group of paths that share a bottleneck} | | | {jth group of paths that share a bottleneck} | | for to do | | if then | | | | | | | | end if | | is path corresponding to | | end for | | return P |
|
