期刊文献+

复杂网络隐蔽信道资源快速调度方法 被引量:3

Complex Network Covert Channel Resources Fast Scheduling Method
下载PDF
导出
摘要 对复杂网络隐蔽信道资源进行合理调度,可提高复杂网络的资源利用率。进行资源调度时,需要在获取蔽信道状态和等待资源数据量动态关系的前提下进行调度,但是传统的队列调度算法利用复杂网络隐蔽信道和队列状态信息进行资源调度,但不能对蔽信道状态和等待资源数据量进行实时更新,无法获取二者的动态关系,降低了资源调度的准确性。提出一种改进优先级公平调度的复杂网络隐蔽信道资源快速调度方法,先得出复杂网络资源调度优先级与隐蔽信道状态和等待数据量的关系,依据给定的资源调度优先级函数获取复杂网络中各队列在每个信道资源单元的调度优先级,利用马尔可夫链通过当前时隙的隐蔽信道状态预测下一个时隙的隐蔽信道状态,并将隐蔽信道资源调度的问题描述成求解效用函数最大的优化问题,获取了复杂网络隐蔽信道资源快速调度策略。仿真结果表明,上述方法提高了网络隐蔽信道资源利用率与效率。 A fast scheduling method of covert channel resource in complex network based on fair scheduling with modified priority is proposed. Firstly,the relationship between scheduling priority and covert channel state and data quantity of awaiting resource is obtained. Then the scheduling priority of each queue in each channel resource unit is obtained according to the given function of resource scheduling priority. The Markov chain is used to predict the covert channel state of next time slot through the current one. Finally,the scheduling problem is described as the optimization problem of solving maximum utility function to obtain the fast scheduling strategy of covert channel resource in complex network. The simulation results show that the proposed method improves the utilization and efficiency of network covert channel resource.
作者 安子强
出处 《计算机仿真》 CSCD 北大核心 2016年第8期272-275,共4页 Computer Simulation
基金 河南省科技厅软科学研究(132400410394)
关键词 复杂网络 隐蔽信道 资源调度 Complex network Covert channel Resource scheduling
  • 相关文献

参考文献10

二级参考文献112

  • 1卿斯汉,朱继锋.安胜安全操作系统的隐蔽通道分析[J].软件学报,2004,15(9):1385-1392. 被引量:19
  • 2张光辉,李建东,周雷,庞继勇.多跳Ad hoc网络中支持MIMO的拓扑未知预约时分多址接入协议[J].电子与信息学报,2006,28(5):785-788. 被引量:4
  • 3吴敬征,丁丽萍,王永吉.云计算环境下隐蔽信道关键问题研究[J].通信学报,2011,32(9A):184-203.
  • 4Daniel N,Rich W,Chris G c. The eucalyptus open source clou-d computing system[J]. Washington IEEE Computer Society, 2009:1-8.
  • 5CI-[LAMTAC I, FARAGO A. Making transmission schedules immune to topology changes in multi-hop packet radio networks[J]. 1EEE/ACM Transactions on Networking, 1994, 2(1): 23-29.
  • 6JU J H, LI V O K. An optimal topology transparent scheduling method in multihop packet radio networks[J]. 1EEE/ACM Transactions on Networking, 1998, 6(3): 298-306.
  • 7CAI Z, LU M, GEORGHIADES C N. Topology-transparent time division multiple access broadcast scheduling in multihop packet radio networks[J]. IEEE Transactions on Vehicular Technology, 2003, 52(4): 970-984.
  • 8BOZTAS S. A robust multi-priority topology-independent transmission schedule for packet radio networks[J]. Information Processing Letters, 1995, 55(5): 291-295.
  • 9LIU Y, ZHANG L, LI V O K, et al. Topology-transparent scheduling in mobile ad hoc networks supporting heterogeneous quality of service guarantees[A]. 2012 46th Annual Conference on Information Sciences and Systems (CISS)[C]. Princeton, NJ, 2012. 1-6.
  • 10JU J H, LI V O K. TDMA scheduling design of multihop packet radio networks based on latin squares[J]. IEEE Journal on Selected Areas in Communications, 1999, 17(8): 1345-1352.

共引文献34

同被引文献26

引证文献3

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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