By Topic

A Stable Stateless Fair Bandwidth Allocation Algorithm Using Stochastic Control

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

4 Author(s)
Gui Ning ; College of Information Science.& Engineering, Central South University, Changsha ,410083 , P.R China. ; Wu Chaoxin ; Chen Songqiao ; Wang Jianxin

Because of their simplicity and low expense, the study of stateless fair bandwidth allocation algorithm became a hot spot among various AQM algorithms. However, among current stateless fair bandwidth allocation algorithms, the UDP flow's bandwidth is still far from the theoretic fair bandwidth, the protection for TCP flows and the throughput stability are insufficient. A stateless fair bandwidth allocation algorithm using stochastic control -P-CHOKe algorithm was proposed. This scheme selects multiple packets from the queue, the more packets have the same flow ID with the incoming packet means the larger sending speed these flows have. Packet is dropped with probability according to the packet proportion. Simulation results show that compared to M-CHOKe and rubbish bin algorithm, this algorithm can achieve fairer bandwidth allocation, and have better ability to identify UDP flow. It can effectively reduce TCP packet dropping rate. In the mean time, this algorithm has high throughput stability and it can achieve smooth throughput of the flows

Published in:

2006 International Conference on Communications, Circuits and Systems  (Volume:3 )

Date of Conference:

25-28 June 2006