期刊文献+

基于IP网络的动态部分缓冲共享方案

Dynamic Partial Buffer Sharing Scheme for IP Networks
下载PDF
导出
摘要 本文基于IP网络提出了一种分组丢弃控制方案———动态部分缓冲共享 .和已有的静态部分缓冲共享方案相比 ,新方案根据分组丢弃行为对控制阈值进行动态调整 ,从而对网络流量的变化具有更优的适应性 .同时新方案也避免了复杂的阈值设置问题 ,任意设定的初始阈值都不会影响系统稳态性能 .实验结果显示 ,新方案可以保证稳定的相对丢失率性能 。 We present a packet loss control scheme for IP networks-Dynamic Partial Buffer Sharing (DPBS). Compared with Static Partial Buffer Sharing (SPBS), the new scheme adjusts control thresholds dynamically according to packets loss behavior, which is endowed with better adaptability to changing network traffic. Also, DPBS avoids complicated threshold-setting problem: arbitrary initial value will never degrade system steady-state performance. Simulation results show that, DPBS can assure nearly fixed relative loss ratio, and its loss jitter performance is also better than SPBS under same traffic condition.
出处 《电子学报》 EI CAS CSCD 北大核心 2004年第2期214-218,共5页 Acta Electronica Sinica
基金 国家重点基础研究发展规划 (973计划 )项目 (No.G1 9990 32 70 7) 国家高技术研究发展计划 (863计划 )课题 (No .2 0 0 1AA1 1 2 0 80 ) 国家自然科学基金 (No.90 1 0 4 0 0 2 No .60 1 730 1 2 ) Intel公司IXA大学研究项目 (No .90 77)
关键词 缓冲管理 优先级分组丢弃 部分缓冲共享 Buffer storage Computer simulation Mathematical models Network protocols Telecommunication traffic Threshold logic
  • 相关文献

参考文献12

  • 1[1]H Kroner,G Hebuterne,P Boyer,A Gravey.Priority management in ATM switching nodes [J].IEEE Journal on Selected Areas in Communications,1991,9(3),418-427.
  • 2[2]Jeffery W Causey,Hyong S Kim.Comparison of buffer allocation schemes in ATM switches:complete sharing,partial sharing,and dedicated allocation [A].International Conference on Communications [C].New Orleans,LA,USA,1994.2.1164-1168.
  • 3[3]Chung G Kang,Harry H Tan.Queuing analysis of explicit priority assignment partial buffer sharing schemes for ATM networks [A].IEEE INFOCOM [C].San Francisco,CA,USA,1993.2.810-819.
  • 4[4]Chung G Kang,Harry H Tan.Queuing analysis of explicit priority assignment push-out buffer sharing schemes for ATM networks [A].IEEE INFOCOM [C].Toronto,Canada,1994.2.500-509.
  • 5[5]D Mitra,I Ziedins.Virtual partitioning by dynamic priorities:fair and efficient resource-sharing by several services [A].International Zurich Seminar on Digital Communications [C].Zurich,Switzerland,1996.1044.173-185.
  • 6[6]Santosh Krishnan,Abhijit K Choudhury,Fabio M Chiussi.Dynamic partitioning:A mechanism for shared memory management [A].IEEE INFOCOM [C].New York,NY,USA,1999.1.144-152.
  • 7[7]Abhijit K Choudhury,Ellen L Hahne.Dynamic queue length thresholds for shared-memory packet switches [J].IEEE/ACM Transactions onNetworking,1998,6(2):130-140.
  • 8[8]Ellen L Hahne,Abhijit K Choudhury.Dynamic queue length thresholds for multiple loss priorities [J].IEEE/ACM Transactions on Networking,2002,10(3):368-380.
  • 9[9]David W Petr,Victor S Frost.Nested threshold cell discarding for ATM overload control:optimization under cell loss constraints [A].IEEE INFOCOM [C].Bal Harboar,Florida,1991.3.1403-1412.
  • 10[10]Ho Woo Lee,Boo Yong Ahn.Queuing model for optimal control of partial buffer sharing in ATM [J].Computers & Operations Research,1998,25(2):113-126.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部