EVALUATION OF DIMENSIONALITY REDUCTION ON NETWORK TRAFFIC PATTERN RECOGNITION

The traffic flow on a network at time t is defined by a vector v-t of dimensionality l comprising the l link volumes on the network. This paper examines four techniques for reducing the dimensionality of v-t and evaluates these techniques in terms of the resulting effectiveness of a network traffic pattern matching scheme. The results indicate that a significant reduction in dimensionality can be attained with little sacrifice in reliability. (Author/TRRL)