| 摘要 |
<P>PROBLEM TO BE SOLVED: To provide a traffic estimation method which reduces processing resources and a processing time, reduces a sample size and reduces memory requirements. <P>SOLUTION: A method of estimating per-flow traffic in a network of nodes interconnected by links splits the incoming traffic stream to a node into a number of parallel sub-streams by flow assignment using a hash function. Since each flow in the incoming traffic stream constitutes a larger fraction of the traffic in its sub-stream, the probability of obtaining two-runs increases. The number of two-runs per flow is then employed to generate an estimate of the traffic of the flow. <P>COPYRIGHT: (C)2006,JPO&NCIPI |
