The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Jun. 21, 2011

Filed:

May. 18, 2010
Applicants:

Kirk K. Chang, Morganville, NJ (US);

John M. Sucec, Piscataway, NJ (US);

Harshad Tanna, Princeton, NJ (US);

John Lee, Howell, NJ (US);

Sunil Samtani, Piscataway, NJ (US);

Inventors:

Kirk K. Chang, Morganville, NJ (US);

John M. Sucec, Piscataway, NJ (US);

Harshad Tanna, Princeton, NJ (US);

John Lee, Howell, NJ (US);

Sunil Samtani, Piscataway, NJ (US);

Assignee:

Other;

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
H04J 3/14 (2006.01);
U.S. Cl.
CPC ...
Abstract

Without using additional probing packets, estimates of the narrow link bandwidth and available bandwidth of a network path are computed based on existing traffic. The network can be of different types such as a wireless battlefield network context or a wired or wireless commercial network environment. 'Fast packets', i.e. those packets which do not experience any queuing delay in the network, are identified. Fast packets are identified to resolve end-to-end packet delay into its constituent components (deterministic, transmission and queuing delays), estimate path utilization and eliminate the uncertainty (false alarms) that causes the prior art method to lose its effectiveness. An estimation algorithm computes end-to-end transmission delay and end-to-end deterministic delay of fast packets traveling along a path in a network. Examples of deterministic delay include satellite propagation delays and clock effects. Then, based on the results of the fast packet identifying algorithm, two logic branches are followed. A first branch calculates utilization and a second branch calculates narrow link bandwidth. The narrow link bandwidth is determined from the packet pair dispersion. The available bandwidth is obtained from the narrow link bandwidth and the utilization. Estimation of available bandwidth for an end-to-end network path allows traffic sources to judiciously regulate the volume of application traffic injected into the network.


Find Patent Forward Citations

Loading…