Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

A New Method for Measuring Packet Loss Probability Using a Kalman Filter

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Dongli Zhang ; Univ. of Ottawa, Ottawa, ON ; Ionescu, D.

In this paper, a new packet loss probability (PLP) estimation method is developed based on the Kalman estimation procedure. The Kalman filter is used for the optimal and recursive estimation of the network traffic mean and standard deviation. The estimation is obtained from past measurements to calculate the one-step prediction and is then applied to calculate the PLP parameter with the large-buffer-based estimation formula based on the large deviation theory. The algorithm recursively runs and is applied for the online packet loss control loop, which keeps the PLP parameter under the limit negotiated in the service level agreement with the customer by the Internet service provider. A series of experiments were conducted to evaluate its performance on the live NCIT*net2 network under different traffic arrival models, for two different aggregated traffic rates and different buffer sizes. The numeric results presented in this paper demonstrate the accuracy and effectiveness of the algorithms introduced.

Published in:

Instrumentation and Measurement, IEEE Transactions on  (Volume:58 ,  Issue: 2 )