检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]电子科技大学宽带光纤传输与通信网技术重点实验室,成都610054
出 处:《电子与信息学报》2006年第6期1129-1134,共6页Journal of Electronics & Information Technology
基 金:国家自然科学基金委员会与香港研究资助局联合科研基金(60218002)资助课题
摘 要:随机早期检测(RED)算法是目前Internet中广泛使用的一种缓存管理算法,对RED算法进行改进以提高公平性以及对网络动态变化的适应性一直是主动队列管理的研究重点之一。该文引入新的变量——分享指数,取代单个业务流缓存占用量来表征不同业务流对网络资源的占用情况,以克服缓存占用量表征公平性的缺陷。同时, 在无线网络中对分享指数的定义进行推广,使其同时兼顾公平性和系统性能(信道条件)。通过对分享指数和队列长度共同制定规则,提出了一种基于模糊逻辑控制的缓存管理算法。算法在根据缓存队列长度计算丢弃概率时,根据不同流对网络资源的占用情况(即分享指数)进一步决定增加或减小相应的丢弃概率,从而可利用不同流之间的差异以加速缓解拥塞,具有更好的自适应性和公平性。仿真表明,采用该算法后,系统性能得到改善。Random Early Detection (RED) is a kind of buffer management algorithms which is widely used in the current Internet. To improve the adaptability and fairness of RED is one of the main tasks of the active queue management. In this paper, the buffer occupancy of individual flow is replaced by a new introduced variable - Sharing Index to indicate the network resource share among different flows, so as to overcome the limitation of buffer occupancy. The definition of Sharing Index in wireless networks is also extended to make it consider both fairness and system performance (channel condition). Through defining rules of both Sharing Index and queue length, a fuzzy logic based buffer management algorithm named FF-RED is proposed. When calculating packet dropping probability in FF-RED algorithm, the probability will further increase or decrease based on the sharing of network resource (by means of Sharing Index), so it can use the difference between flows to make congestion relief more quickly, and it has better adaptability and fairness. Simulation results show that the system performance is improved through using the proposed algorithm.
关 键 词:缓存管理 分组丢弃 随机早期检测 模糊逻辑控制 公平性
分 类 号:TN915.07[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.44