期刊文献+

iRGRR算法分组调度中带宽利用率分析及改进策略

Bandwidth utilization analysis and its enhancement on packet scheduling of iRGRR
下载PDF
导出
摘要 为消除变长长度分组和信元长度对算法性能的影响,提高带宽利用率,以iRGRR算法为例,分析了在分组调度中带宽利用率等性能,并提出了一种简单、硬件易实现的改进策略。仿真结果表明,iRGRR算法使用该策略后,不仅提高了带宽利用率,而且消除了分组变长长度对算法性能的影响。给出了该策略的实现方案。 To achieve simplicity and fine performance,the input-queuing crossbar and its scheduling algorithms always adopt fixed-size switching technology,in which the data unit is called "cell".Incoming IP packets were fragmented into cells and then processed.When the variable size of the packets were not integer times of the cell size,this assembly scheme would lead to the loss of bandwidth and decrease the performance of the scheduling algorithms.Based on iRGRR algorithm,the performance of bandwidth utilization under IP packets traffic was analyzed,and an improved scheme was presented which was simply and easily implemented according to the analysis results.The simulation results show that the negative effect of the variable size packets was removed while the performance of the bandwidth utilization was greatly increased by the improved scheme of iRGRR.Finally,an implementation method in hardware for the advanced scheme was proposed.
出处 《解放军理工大学学报(自然科学版)》 EI 北大核心 2010年第6期617-622,共6页 Journal of PLA University of Science and Technology(Natural Science Edition)
基金 江苏省自然科学基金资助项目(BK200701)
关键词 输入排队crossbar 分组调度 封装 带宽利用率 iRGRR input-queuing crossbar packet scheduling assembly bandwidth utilization iterative request-grant-based round-robin
  • 相关文献

参考文献10

  • 1熊庆旭.输入排队结构交换机分组调度研究[J].通信学报,2005,26(6):118-129. 被引量:17
  • 2MCKEOWN N.The iSLIP scheduling algorithm for input-queued switches[J].IEEE/ACM Trans on Networking,1999,7(2):188-200.
  • 3彭来献,田畅,赵文栋.一种具有O(logN)信息复杂度的高速crossbar调度算法[J].电子学报,2006,34(11):2024-2029. 被引量:3
  • 4彭来献,路欣,田畅.iRGRR/PM:一种新的高速crossbar分组调度策略[J].电子与信息学报,2007,29(7):1612-1616. 被引量:1
  • 5GANJALI Y,KESHAVARZIAN L,SHAH D.Input queued switches:cell switchingvs.packet switching[C].New York:IEEE Societies,IEEE INFOCOM 2003.
  • 6KAR K,LAKSHMAN T V,STILIADIS D,et al.Reduced complexity input buffered switches[C].Palo Alto:Proceedings of Hot Interconnects VIII,2000.
  • 7CHRISTENSEN K,YOSHIGOE K,ROGINSKY A,et al.Performance of packet-to-cellsegmentation schemes in input buffered packet switches[C].New York:IEEE International Conference on Communications,2004.
  • 8CRUZ R L,AL-HARTHI S.A service-curve framework for packet schedulingwithswitch configuration delays[J].IEEE/ACM Trans on Networking,2008,16(1):196-204.
  • 9Cooperative association for internet data analysis.packet size reports[EB/OL].http://www.caida.org,2007.
  • 10Stanford University,SIM manual[EB/OL].http://klanmath.stanford/edu/toolsSIM,2007.

二级参考文献91

  • 1NDERSON T, et al. High speed switch scheduling for local area networks[J]. ACM Trans Comput Syst, 1993, 11(4): 319- 352.
  • 2MCKEOWN N. Scheduling Cells in an Input-Queued Switch[D].University of California at Berkeley, 1995.
  • 3MCKEOWN N. The iSLIP scheduling algorithm for input-queued switches[J]. IEEE/ACM Trans on Networking, 1999, 7(2): 188-201.
  • 4SERPANOS D N, et al. FIRM: A class of distributed scheduling algorithms for high-speed ATM switches with multiple input queues[A]. IEEE INFOCOM'00[C]. Tel Avlv, Israel, 2000.548-555.
  • 5ANDREWS M, ZHANG L. Achieving stability in networks of input-queued switches[A]. IEEE INFOCOM'01[C]. Anchorage,Alaska USA, 2001. 1673-1679.
  • 6MARSAN M A, et al. On the throughput achievable by isolated and interconnected input-queued switches under multicasts traffic[A].IEEE INFOCOM'02[C]. New York, 2002. 1605-1614.
  • 7MARSAN M A, et al. Local scheduling policies in networks of packet switches with input queues[A]. IEEE INFOCOM'03[C].San Francisco, CA, USA, 2003. 1395-1405.
  • 8JIANG Y, et al. A fully desynchronized round-robin matching scheduler for a VOQ packet switch architecture[A]. IEEE HPSR'01[C]. Dallas, TX, USA, 2001. 407-411.
  • 9JIANG Y, HAMDI M. A 2-stage matching scheduler for a VOQ packet switch architecture[A]. IEEE ICC'02[C]. New York, NY,USA, 2002. 2105-2110.
  • 10MCKEOWN N, et al. Achieving 100% throughput in an input-queued switch[A]. IEEE INFOCOM '96[C]. San Francisco,CA, USA, 1996. 296-302.

共引文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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