期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一种支持多业务的调度算法的研究与仿真 被引量：1

Study and Simulation on a Multi-service Scheduling
下载PDF
导出
摘要 针对适合多媒体业务的概率优先调度算法,主要分析了它的调度模型、延时性能,同时通过在公平服务性能上与其它调度算法比较,得出了它的特点.并进一步通过opnet仿真分析了它的工作过程及其性能结果. The ariticle mostly introduced the scheduling model and the delay performance of a muhi-service scheduling, and the paper got the charaetristic through eomaring to other sehedulings on fair service, it also analyzed the working process and performance in opnet.
作者 王燕 伍博 杨豪强 吴雪冰
机构地区 河南师范大学物理与信息工程学院
出处 《河南师范大学学报（自然科学版）》 CAS CSCD 北大核心 2006年第4期195-197,共3页 Journal of Henan Normal University(Natural Science Edition)
关键词 调度算法 概率优先 公平服务 OPNET仿真 scheduling probabilistic priority fair service OPNET simulation
分类号 TN92 [电子电信—通信与信息系统]
  • 相关文献

参考文献6

  • 1王志平,熊光泽.实时调度算法研究[J].电子科技大学学报,2000,29(2):205-208. 被引量：36
  • 2宋舰,李乐民.无线网络中的分组调度算法[J].通信学报,2003,24(3):42-48. 被引量：11
  • 3Yuming Jiang,Chen-Khong Tham,Chi-Chung Ko.A Probabilistic Priority Scheduling Discipline for High Speed Networks[J].IEEE 2001,1:1-5.
  • 4Chen-Khong Than,Qi Yao.A multi-class probabilistic priority scheduling discipline for differentiated services networks[J].Computer Communications.2002,25:1 487-1 496.
  • 5Yuming Jiang,Chen-Khong Tham.Delay analysis of a probabilistic priority discipline for multi-service networks on Transactions[J].Telecommunications.2002,21:1 038-1 048.
  • 6Dovrolis C,Stiliadis D.Proportional differentiated services:delay differentiation and packet scheduling[J].IEEE/ACM,2002,10(1):12-26.

二级参考文献24

  • 1[1]DEMERS A, KESHAV S, SHENKER S. Analysis and simulation of a fair queueing algorithm[A]. ACM SIGCOMN 1989[C]. Austin, TX, 1989.1-13.
  • 2[2]PAREKH A, GALLAGER R. A generalized processor sharing approach to flow control in integrated services networks: the single-node case[J]. IEEE Trans on Networking, 1993, 1(6): 344-357.
  • 3[3]PAREKH A, GALLAGER R. A generalized processor sharing approach to flow control in integrated services networks: the multiple-node case[A]. IEEE INFORCOM 1993[C]. San Francisco, CA, 1993. 521-530.
  • 4[4]BENETT J, ZHANG H. WF2Q:worst-case fair weighted fair queueing[A]. IEEE INFORCOM 1996[C]. San Francisco, CA, 1996.120-128.
  • 5[5]BHARGHAVAN V, LU S, NANDAGOPAL T. Fair queueing in wireless networks: issues and approaches[J]. IEEE Personal Communications Magazine, 1999,6(1): 44-53.
  • 6[6]NANDAGOPAL T, LU S, BHARGHAVAN V. A unified architecture for the design and evaluation of wireless fair queueing algorithms[A]. ACM MOBICOM 1999[C]. Seattle WA, 1999. 132-142.
  • 7[7]BUCHELI S. Technical report: compensation modeling for QoS support on a wireless network[EB/OL]. http://ipoint.vlsi.uiuc. edu/ wireless/papers/stefan_thesis.pdf, 2000.
  • 8[8]BHAGWAT P, BHATTACHARYA P, KRISHNA A, TRIPATHI S. Enhancing throughput over wireless LANs using channel state dependent packet scheduling[A]. IEEE INFORCOM 1996[C]. San Francisco,CA, 1996.1133-1140.
  • 9[9]LU S, BHARGHAVAN V, SRIKANT R. Fair scheduling in wireless packet networks[J]. IEEE Trans on Networking, 1999,7(4): 473-489.
  • 10[10]NG T, STOICA I, ZHANG H. Packet fair queueing algorithms for wireless networks with location-dependent errors[A]. IEEE INFORCOM 1998[C]. San Francisco, CA, 1998.1103-1198.

共引文献45

同被引文献4

引证文献1

河南师范大学学报（自然科学版）
2006年 第4期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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