Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing – Least weight routing
Reexamination Certificate
2008-04-22
2008-04-22
Salad, Abdullahi (Department: 2157)
Electrical computers and digital processing systems: multicomput
Computer-to-computer data routing
Least weight routing
C370S238000
Reexamination Certificate
active
10702699
ABSTRACT:
The present invention comprises methods for increasing the rank of the routing matrix of an IP network by systematically altering link weights in the IP network. A full rank routing matrix may be used with further methods in accordance with the present invention to estimate the mean traffic of the IP network based upon the full rank routing matrix and measured link utilization values. The mean traffic and the covariance of the traffic may be iteratively estimated until the estimates coverage. Example methods in accordance with the present invention for estimating mean traffic and covariance of traffic are described for both stationary and non-stationary link utilization data.
REFERENCES:
patent: 6574669 (2003-06-01), Weaver
patent: 6721270 (2004-04-01), Mitra et al.
patent: 7185104 (2007-02-01), Thorup et al.
patent: 2003/0142627 (2003-07-01), Chiu et al.
patent: 2003/0185153 (2003-10-01), Kohler et al.
patent: 2003/0214938 (2003-11-01), Jindal et al.
patent: 2004/0170125 (2004-09-01), O'Neill
Nucci Antonio
Taft Nina
Salad Abdullahi
Sprint Communications Company L.P.
LandOfFree
Method for estimating a traffic matrix in a communication... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for estimating a traffic matrix in a communication..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for estimating a traffic matrix in a communication... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3954104