首页 | 本学科首页   官方微博 | 高级检索  
     

"部分缓存共享"机制的分组丢失率分析
引用本文:程东年,刘增基. "部分缓存共享"机制的分组丢失率分析[J]. 东南大学学报(自然科学版), 2000, 30(5): 25-29
作者姓名:程东年  刘增基
作者单位:[1]西安电子科技大学综合业务网国家重点实验室,西安710071 [2]西安电子科技大学综合业务网国家重点实验室,西安71
基金项目:电子科学研究电子预研基金资助项目! (DJ4.2 .2 .3)
摘    要:提出了“部分缓存共享”机制对应排队模型的一种修正模型:M/M/1/K(T),导出了该新模型的稳态概率分布,分析了共享缓存队列门限T和低优先级分组流业务强度对高优先级分组流丢失概率的影响。结果表明,相对于普通的M/M/1/K而言,M/M/1/K(T)是一种更为一般的形式;选用较大的T既可明显减小低级分组流的丢失概率又能使高级分组流的丢失概率较小。

关 键 词:异步转移模式 ATM 排队模型 缓存管理 空间优先级 分组丢弃 部分缓存共享

An Alternative Analysis on Packet Loss Probabilities of the Partial Buffer Sharing Scheme
Cheng Dongnian Liu Zengji. An Alternative Analysis on Packet Loss Probabilities of the Partial Buffer Sharing Scheme[J]. Journal of Southeast University(Natural Science Edition), 2000, 30(5): 25-29
Authors:Cheng Dongnian Liu Zengji
Abstract:This paper proposes an amended model, M/M/1/K(T) , of a space priority control scheme using the partial buffer sharing policy. Upon the derivation of steady state probabilities related to this new queuing model, we analyze the impact of the shared buffer threshold T and the lower LP traffic load on the higher LP packet loss probability. The analytical results show that the proposed M/M/1/K(T) model is a more generalized form compared with the ordinary one, M/M/1/K . Based on a numerical analysis we conclude that the lower LP packet loss probability can be considerably reduced and the lower LP packet loss probability can be maintained at a small level by employing larger T .
Keywords:asynchronous transfer mode(ATM)  queuing model  buffer management  space priority  packet discarding
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号