摘要
针对传统共享缓存管理设计复杂 ,时延大的问题 ,提出了一种基于信息的平均等待时间的ATM缓存区队列的轮询控制机制·数值分析结果和仿真实验表明 ,该方法能够综合考虑各种信息对时延和丢失率的要求 ,通过改变优先级系数 ,在保证高优先级信息优先输出的同时 ,也避免了低优先级信息由于过长时间等待而丢失 ,满足各类信息业务质量的需求·
In order to overcome the complexity and long-delay of the traditional shared buffer management,a polling queue management method based on the average information delay time was proposed on the study of buffer control in ATM networks. This method can consider all kinds of services′ need for time delay and loss probability together, it also can satisfy the quality of service by guaranteeing the throughput of high priority cell without serious cell loss of low priority cell for too long time delay.
出处
《东北大学学报(自然科学版)》
EI
CAS
CSCD
北大核心
2001年第5期485-488,共4页
Journal of Northeastern University(Natural Science)
基金
国家自然科学基金资助项目 ( 6 95 830 0 1)