期刊文献+

基于QoS的优先级队列调度算法 被引量:12

Research on the Priority Queue Scheduling Algorithm Based on QoS
下载PDF
导出
摘要 针对无线网络QoS的需求,讨论了3种典型的优先级队列调度算法,即:轮询式的调度算法、保证优先级的调度算法以及比例公平的调度算法。分别对它们各自的工作原理和优缺点进行了研究比较。最后通过计算机仿真验证选取了适合实际使用的算法。 ling algorithms Fairness (PF). practical one is To satisfy the requirements of the QoS in the wireless network, three classical priority queue schedu-are discussed in this paper, namely Round Robin (RR), Priority Queuing (PQ), and Proportional The principles, advantages and disadvantages of the three algorithms are studied, and finally a chosen through computer simulation.
出处 《电子科技》 2013年第5期122-124,共3页 Electronic Science and Technology
关键词 QOS 优先级队列 调度算法 QoS priority queue scheduling algorithm
  • 相关文献

参考文献6

  • 1黄建辉,钱德沛,王胜灵,刘轶.用于无线传感器网络的比例公平队列调度算法[J].西安交通大学学报,2008,42(2):129-132. 被引量:3
  • 2江勇,吴建平.基于多服务类比例公平的分组调度算法[J].中国科学(E辑),2003,33(10):865-875. 被引量:7
  • 3SHIMONISHI H, YOSHIDA M. An improvement of weighted round robin cell scheduling in atm networks [ C ]. Phoenix, USA : IEEE Globecom, 1997 : 1119 - 1123.
  • 4JAMESFK,KEITHWR.计算机网络自顶向下方法与Intemet特色[M].4版.陈鸣,译.北京:机械工业出版社,2005.
  • 5HOLTZMAN J M. Cdma forward link waterfilling power con- trol [ C]. Vehicular Technology Conference (VTC), 2000: 1663 - 1667.
  • 6JALALI A, PADOVANI R, PANKAJ R. Data throughput of CDMA- HDR a high efficiency- high data rate personal communication wireless system [ C]. Tokyo : VTC 2000 - Spring,2000,3 : 1854 - 1858.

二级参考文献29

  • 1史浩山,侯蓉晖,杨少军.无线传感器网络QoS机制研究[J].信息与控制,2006,35(2):246-251. 被引量:8
  • 2Jiang Y, Lin C, Wu J. Integrated performance evaluating criteria for network Ixaffic conlxol. In: Proceedings of IEEE Symposium on Computers and Communications 2001. Tunisia: IEEE Communications Society Press, 2001.
  • 3Cruz R L. A calculus for network delay, Part I: Network elements in isolation. IEEE Trans on Information Theory, 1991, 37(1):ll4-131.
  • 4Cruz R L. A calculus for network delay, Part II: Network analysis. IEEE Trans on Information Theory, 1991, 37(1): 132-141.
  • 5Kurose J. On computing per-session performance bounds in high-speed multi-hop computer networks. In: Proc of ACM Sigmetrics and Performance '92. New York: ACM Press, 1992. 128-134.
  • 6Yaron O, Sidi M. Performance and stability of communication networks via robust exponential bounds. IEEE/ACM Trans on Networking, 1993,1(3): 372-385.
  • 7Chang C S. Stability, queue length, and delay of deterministic and stochastic queueing networks. IEEE Trans on Automatic Control. 1994, 39(5): 913,-,931.
  • 8Hurley P, Boudec J L. A Proposal for an asymmetric best-effort service. In: Proceedings of IWQOS'99. London, 1999.129-132.
  • 9Pitsillides A, Stylianou G, Pattichis C, et al. Bandwidth allocation for virtual paths (BAVP): Investigation of performance of classical constrained and genetic algorithm based optimisation techniques. In: Proceedings of INFOCOM'2000, Tel Aviv,2000. 1379-1387.
  • 10Lin C, Shah Z, Yang Y. Integrated schemes of request dispatching and selecting in web server clusters. In: Proceedings of WCC2000. Beijing: Publishing House of Electronics Industry, 2000, 922-930.

共引文献8

同被引文献103

引证文献12

二级引证文献24

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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