期刊文献+

基于启发式调度的OpenFlow网络规则一致更新方案 被引量:4

Consistent Rule Update Scheme Based on Heuristic Scheduling for OpenFlow Networks
下载PDF
导出
摘要 针对OpenFlow网络在状态转换过程中会暂时性出现转发回路、路由黑洞和违反访问控制策略等问题,提出了一种基于启发式调度的规则一致更新方案.首先,设计基于谓词的更新分解算法,利用并行网络属性验证技术得到子更新依赖图;其次,采用任务图生成算法对子更新依赖图进行分割,降低更新调度的复杂度;之后,设计启发式更新调度算法,采用规则增删操作交替执行策略,减少交换机的规则存储开销,并通过建立更新实施和监听并发执行机制,提升更新效率.仿真实验从更新时间开销和更新过程中交换机规则存储开销两方面验证了方案的有效性. In viewof such problems as temporary loops,blackholes,violations of access control policy and so on during state transitions in Open Flownetworks,we proposed a consistent rule update scheme based on heuristic scheduling. First,we divided operations of an update into some sub-updates and used parallel network property verification technique to construct a dependency graph for each sub-update. Second,we aggregated several update operations of the same sub-update to reduce complexity of scheduling. Then,we designed heuristic update scheduling algorithm. By adopting an alternative strategy for additions and deletions of rules,it could reduce storage cost in switches. Furthermore,by establishing a mechanism to update and monitor concurrently,it could improve efficiency of rule update. Simulation experiments on the updating time cost and the rule storage cost of switches during updating process are conducted,which verify the effectiveness of our scheme.
出处 《电子学报》 EI CAS CSCD 北大核心 2017年第7期1637-1645,共9页 Acta Electronica Sinica
基金 国家863高技术研究发展计划(No.2012AA012704) 郑州市科技领军人才(No.131PLJRC644)
关键词 OpenFlow网络 规则一致更新 启发式调度 OpenFlow networks consistent rule update heuristic scheduling
  • 相关文献

参考文献3

二级参考文献78

  • 1Qiao WG,Zeng GS,Hua A,Zhang F.Scheduling and executing heterogeneous task graph in grid computing environment.In:Zhuge Hai,Fox G,eds.Proc.of the 4th Int'l Workshop on Grid and Cooperative Computing (GCC 2005).LNCS 3795,Beijing:Springer-Verlag,2005.474-479.
  • 2Sih GC,Lee EA.A compile-time scheduling heuristic for interconnection constrained heterogeneous processor architectures.IEEE Trans.on Parallel and Distributed Systems,1993,4(2):75-87.
  • 3Hou ESH,Ansari N,Ren H.A genetic algorithm for multiprocessor scheduling.IEEE Trans.on Parallel and Distributed Systems,1994,5(2):113-120.
  • 4Iverson M,Ozguner F,Follen G.Parallelizing existing applications in a distributed heterogeneous environment.In:Proc.of the Heterogeneous Computing Workshop.Santa Barbara:IEEE Computer Society Press,1995.93-100.
  • 5Maheswaran M,Siegel HJ.A dynamic matching and scheduling algorithm for heterogeneous computing systems.In:Antonio JK,ed.Proc.of the Heterogeneous Computing Workshop.Orlando:IEEE Computer Society Press,1998.57-69.
  • 6Kwok YK,Ahmad I.Dynamic critical-path scheduling:An effective technique for allocating task graphs onto multiprocessors.IEEE Trans.on Parallel and Distributed Systems,1996,7(5):506-521.
  • 7Adam TL,Chandy KM,Dickson J.A comparison of list scheduling for parallel processing systems.Communications of the ACM,1974,17(12):685-690.
  • 8Wu M,Gajski D.Hypertool:A programming aid for message passing systems.IEEE Trans.on Parallel and Distributed Systems,1990,1(3):330-343.
  • 9Chung YC,Ranka S.Application and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors.In:Werner R,ed.Proc.of the Supercomputing'92.Minneapolis:IEEE Computer Society Press,1992.512-521.
  • 10Ahmad I,Kwok YK.On exploiting task duplication in parallel programs scheduling.IEEE Trans.on Parallel and Distributed Systems,1998,9(9):872-892.

共引文献470

同被引文献23

引证文献4

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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