期刊文献+

基于TCP/IP的ForCES传输映射层带宽分配机制研究

Research on Bandwidth Allocation Mechanism for Transport Mapping Layer of ForCES Based on TCP/IP
下载PDF
导出
摘要 提出了能够适应ForCES传输映射层特性的带宽分配机制的RQ-DPP算法。该算法将不同消息放入不同消息队列中,根据概率优先算法对消息队列进行调度,计算消息流占用的带宽权值,根据消息流传输速率和消息队列长度动态调整消息被拒绝入队的概率,并根据消息种类和拒绝概率动态改变消息调度队列的调度概率。通过ns-2.30仿真实验证明,RQ-DPP算法能满足ForCES传输映射层的带宽分配要求。 In this paper, the author proposes a bandwidth allocation mechanism called Rate and Queue controlled Dynamic Probabilistie Priority (RQ-DPP) based on Transport Mapping Layer of ForCES (ForCES TML). It uses Probabilistic Priority (PP) scheduling to schedule message-queues which keep different messages, and calculate bandwidth. RQ-DPP calculates refusing probability of an incoming packet based on per-flow's estimated rate and buffer occupancy, and then dynamically adjusts scheduling probability of queues based on message's kind and dropping probability. Simula- tion using ns-2.30 shows the effectiveness of the new bandwidth allocation mechanism.
出处 《信息工程大学学报》 2009年第2期258-261,共4页 Journal of Information Engineering University
基金 国家自然科学基金(60573116 60603072) 国家资助863计划资助项目(2007AA01Z201 2008AA01A323) 浙江省基金资助项目(Z106829 Y106747 Y1080078) 浙江省科技计划资助项目(2006C11215 2008C21093)
关键词 FORCES 传输映射层 带宽分配 RQ-DPP ForCES transport mapping layer bandwidth allocation RQ-DPP
  • 相关文献

参考文献8

  • 1Wang W M , Salim J Hadi, Alex Audu. ForCES Transport Mapping Layer (TML) ServicePrimitives [ EB/ OL ]. [ 2007 - 08 - 01 ] . http ://www. ietf. org/internetdrafts/ draft-ietf-forces-tmlsp-01, txt.
  • 2Wang W M, Dong L G, Zhuge B. ForTER-An Open Programmable Router Based on Forwarding and Control Element Separation [ C ]//Distributed Computing and Applications to Business, Engineering and Science. 2006, (2) : 1069 - 1077.
  • 3Jiang Y, Tham CK, Ko CC. A probabilistic priority scheduling discipline for multi-service networks [ J ]. Computer Communication, 2002, 25 ( 13 ) : 1243 - 1254.
  • 4Parekh A K, Gallager R G. A generalized processor sharing approach to flow control in integrated services networks: the single-node case[ J]. IEEE/ACM Trans. Network, 1993, ( 1 ) :344 - 357.
  • 5Katevenis M, Sidiropoulos C, Courcoubetis C. Weighted round-robin cell multiplexing in a general purpose ATM switch chip[ J]. IEEE Journal on Selected Areas in Communications, 1991:1265 - 1279.
  • 6Shreedhar M, George Varghese. Efficient Fair Queuing using Deficit Round Robin [ J]. IEEE/ACM Transaction on Networking, 1996, 4(3) : 375 -385.
  • 7Stoica, Schenker S, Zhang H. Core-stateless fair queuing: Achieving approximately bandwidth allocations in high speed networks [ C ]//Proc. ACM SIGCOMM. 1998:118 - 130.
  • 8Jae Chung, Mark Claypool. NS by Example [ EB/OL]. [ 2004 - 05 - 05 ]. http ://nile. wpi. edu/NS/.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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