Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Aerospace Control》 2005-04
Add to Favorite Get Latest Update

Stability Analysis of Fast Max-Min Fair Bandwidth Allocation Algorithm

Yang Xiaoliang1 Xu Jian2 Hu Jiuchuan1 Zhang Hongke1 Zhang Sidong1 1.Electronics and Telecommunication Engineering of Beijing JiaoTong University, Beijing 100044 2.Teachers’ College of Beijing Union University, Beijing 100011  
Transmission with high QoS in networks depends on a stable connection, which requires an excellent dynamic stability in the resource allocation algorithm. However, the stability of the fair allocation algorithm is always understated or even ignored. Whereas the gradual filling algorithm in Max-Min fair bandwidth allocation is slow converged, and a fast Max-Min fair allocation algorithm, in this paper, is designed. In this algorithm, an iterative average value is used to quickly approach to the fair resource value. In this way, the conflict between the step-length of the gradual filling algorithm and the speed of convergence is avoided. The result is that it converges much more quickly. Perturbation analysis proves the stability of this algorithm.
【Fund】: 国家自然科学基金资助项目(602720121)
【CateGory Index】: TN915;
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved