期刊文献+

无线多跳网的一种端到端的最大最小公平调度算法

Scheduling Algorithm for End-to-end Max-min Fairness in Wireless Multi-hop Networks
下载PDF
导出
摘要 提出一种基于效用函数的分布式最大最小公平性调度算法及其跨层控制模型,算法针对无线多跳网中端到端的流,通过对偶规划以及拉格朗日松弛算法把问题分解成传输层和MAC层两个子问题,在传输层上采用基于最大价格的最大最小公平速率分配方案来交叉控制MAC层的调度,给出了跨层层控制模型.仿真结果表明该算法具有良好的公平性和调度性能. A utility function based distributed scheduling algorithm and cross-layer control model for max-min fairness was proposed. The algorithm was designed for end-to-end flow in wireless multi-hop networks. With dual programming and Lagrange relaxation,max-rain fair rate allocation schedule was decomposed into two subproblems of transport layer and MAC layer. The scheduling policy of MAC layer was built on max-price based max-rain fair rate allocation scheme of transport layer. The crosslayer control model was provided. Simulation result shows that proposed algorithm has good fairness and pretty scheduling performance.
出处 《小型微型计算机系统》 CSCD 北大核心 2008年第9期1664-1668,共5页 Journal of Chinese Computer Systems
关键词 最大最小公平性 调度 MaxNet 对偶规划 拉格朗日松弛 max-min fairness scheduling MaxNet dual programming lagrange relaxation
  • 相关文献

参考文献13

  • 1Xu S,Safadawi T. Does the IEEE 802. 11 MAC protocol work well in multihop wireless ad hoc networks[J]. IEEE Communications Magazine, 2001,39(6):130-137
  • 2Chen L ,Low S H,Doyle J C. Joint congestion control and media access control design for wireless ad hoc networks[C]. Proc. of IEEE Infocom, Miami, 2005,3:2212-2222
  • 3Chen L, Low S H, Chiang M,et al. Cross-layer congestion control, routing and scheduling design in ad hoc wireless networks [C]. Proc. of IEEE Infocom, Barcelona, 2006.
  • 4Tassiulas L, Sarkar S. Maxmin fair scheduling in wireless ad hoc networks[J]. IEEE J. on Selected Area in Communications, 2005,23(1):163-173.
  • 5Hahne E. Round-robin scheduling for max-min fairnessin data networks [J]. IEEE J. on Selected Area in Communications, 1991,9(7) : 1024-1039
  • 6Low S H, Lapsley D E. Optimization flow control I: basic algorithm and convergence [J]. IEEE/ACM Transactions on Networking (TON), 1999,7(6) :861-874 .
  • 7Diestel R, Graph Theory, Springer-verlag, 1997.
  • 8Hajek B, Sasaki G. Link scheduling in polynomial time[J]. IEEE Transactions on Information Theory, 1998,34 (5): 910- 917.
  • 9Bertsekas D,Gallager R. Data netwokrs. 2nd edition[ ]. Prentice Hall, 1992.
  • 10Mo J,Walrand J. Fair end-to-end window-based congestion control[J]. IEEE/ACM Transactions on Networking, 2000,8(5): 556-567.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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