US 8,151,019 B1Granted

Adaptive network traffic shaper

AssigneeLockheed Martin Corporation

InventorsTuong Le, Brian F. Rossa

Life of this patent

Estimating the term…

Loading patent…

Abstract

A network traffic shaper adjusts the rate of data flowing from a packet source to a packet sink responsive to priority assigned to the packets pursuant to their ability to match a series of filters. Each packet is applied to a queue depending on its classification. The packets are read from each queue in accordance with a queue reading policy. Singular spectrum analysis of the traffic load produces a set of vectors that capture the spectral bases of the traffic state. These vectors are associated with the bandwidth demanded by the traffic, a relationship that is recorded in a queue/time/eigenvector/bandwidth/control table. Samples of the current network load are compared with previously recorded vector bases to reveal how similar the current traffic state is to previous traffic states, which in turn predicts the traffic's bandwidth needs for the immediate future. The queue reading regime is updated in response to this prediction.

Claims18

Dependent claims

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 Xj[N] for each queue j={0, . . . , M} that captures a state of the traffic entering that queue;
performing an eigen analysis of the matrix Rj[N]=(Xj[N])T(XJ[N]) to produce a set of vectors Uj[N] that capture a spectral basis of the traffic state;
comparing a current traffic state to the traffic state at time k by projection Xj[N] onto the spectral bases Uj[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;
Xi are the columns of X;
making a bandwidth bj[k] a new queue reading policy for queue j if a previously recorded Uj[k] can be found to satisfy the inequality Dj[N,k]≦D* where Dj[N,k]=D(Xj[N][Uj[k]);
otherwise
recording a current spectral basis Uj[N] and current bandwidth requirement bj[N].

54 more elements

Dependencies are inferred from the claim text.

Facts

Application: 12/107,428Filed 22 Apr 2008
Granted: 3 Apr 2012
Term ends: Not estimatedThe source records don’t support an estimate.

Classification8 codes

G06F 5/065
For changing the speed of data flow, i.e. speed regularising or timing, e.g. delay lines, FIFO buffers; over- or underrun control therefor:…
H04L 47/2441
Traffic characterised by specific attributes, e.g. priority or QoS: relying on flow classification, e.g. using integrated services [IntServ]
H04L 47/20
Flow control; Congestion control: traffic policing
H04L 47/22
Flow control; Congestion control: traffic shaping

Family

No related US applications are recorded in the indexed filing history.

Timeline

Citations

Open elsewhere

Building an agent or pulling many patents? Use the API or MCP server instead of scraping pages. Get an API key