By Topic

Performance guarantee and stability analysis of a rate-based flow control algorithm

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 $31
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

4 Author(s)
Xinping, Guan ; Institute of Electrical Engineering, Yanshan University, Qinhuangdao 066004, P. R. China ; Bo, Yang ; Chengnian, Long ; Dahai, Zhang

The bursty events of available bit rate (ABR) traffic challenge the research on flow control algorithm. This bursty nature makes the network difficult to guarantee some performance such as decreasing cell loss especially when congestion appears. In addition the robust stability analysis in the presence of virtual connections (VCs) variation is another inherent problem of the current rate-based algorithm. An explicit rate-based scheme is concerned. Some mathematical methods are adopted to minimize overshoot in the buffer to eliminate the growing congestion quickly. Then in linear matrix inequality (LMI) forms via Lyapunov stability argument relating to robustness issues in the presence of time-varying VCs is purposed in linear matrix inequality. A set of numerical examples guarantees this choice of algorithm parameters is robust stability. The simulations further back up our results.

Published in:

Systems Engineering and Electronics, Journal of  (Volume:16 ,  Issue: 2 )