Patent ID: 8151019

Claim:
A method for transmitting packets of data from a source network to a destination network, said method comprising the steps of: classifying each packet accordingly to its ability to match a series of filters, and marking each packet with the classification; applying each packet to a queue of a set of queues in dependence upon the packet's classification; reading said packets from each queue in accordance with a predetermined queue reading policy; observing a volume of traffic arriving at each queue during N−2n previous time intervals to thereby define traffic load history for each queue, where n is a system parameter and N is a current time step; from said traffic load history, constructing a matrix X j [N] for each queue j={0, . . . , M} that captures a state of the traffic entering that queue; performing an eigen analysis of the matrix R j [N]=(X j [N]) T (X J [N]) to produce a set of vectors U j [N] that capture a spectral basis of the traffic state; comparing a current traffic state to the traffic state at time k by projection X j [N] onto the spectral bases U j [k] according to the relation D ⁡ ( X , U ) = ∑ i = 1 n ⁢ ( X i ) T ⁢ ( X i ) - ( X i ) T ⁢ ( U ) ⁢ ( U ) T ⁢ ( X i ) where X and U are square matrices of size n-by-n; X i are the columns of X; making a bandwidth b j [k] a new queue reading policy for queue j if a previously recorded U j [k] can be found to satisfy the inequality D j [N,k]≦D* where D j [N,k]=D(X j [N][U j [k]); otherwise recording a current spectral basis U j [N] and current bandwidth requirement b j [N].