期刊文献+

基于异构的网络安全策略自适应发布 被引量:3

Self-distribution of Network Security Policy Based on Structure-dissimilarity
下载PDF
导出
摘要 随着网络实体数量的急剧增长,网络安全策略的请求、更新和执行等操作对策略的发布提出了更高的要求。为了解决网络安全策略发布效率的问题,引入发布影响因子和安全域等概念,提出了基于异构的网络安全策略自适应发布数学模型和结构模型,着重分析了面向属性状态和操作的异构策略表示和生成方法,给出了安全策略快速搜索算法、策略比较及异构策略生成算法、基于安全域的地址分配及数据转发算法。与传统的全策略发布模型相比,大大提高了策略处理效率,并占用较少的网络信道资源。 The operations of security policy's request, update, and execute have put forward higher requirements of the policy distribution. For purpose of resolving the distribution efficiency of the network security policy, the security policy self- distribution mathematic model and structural model were proposed based on structure-dissimilarity, which introduced the concepts of distribution factor, security domain, etc. Expression and making ways of the structure-dissimilarity policy faced on attribute characters and operation were analyzed emphatically. The security policy searching algorithm, comparing algorithm, structure-dissimilarity policy building algorithm, address assigning and data transmitting algorithm based on security domain were presented. Compared with the classical entire distribution model, the proposed methods are superior to enhance the system security policy disposal efficiency, and occupy the lesser resources of network channel.
出处 《计算机科学》 CSCD 北大核心 2009年第9期74-78,138,共6页 Computer Science
基金 国家高技术研究发展计划(863)项目(2007AA01Z449) 国家自然科学基金-广东联合基金重点项目(U0735002) 中国博士后科学基金项目(20070420793)资助
关键词 安全策略 自适应发布 异构 安全域 Security policy, Self-distribution, Structure-dissimilarity, Security domain
  • 相关文献

参考文献10

  • 1Boukerche A,Dzermajko C,Kaiyuan L.An enhancement towards dynamic grid-based DDM protocol for distributed simulation using multiple levels of data filtering[J].Parallel Computing,2006,32(11/12):902-919.
  • 2Zhang Yachong,Sun Guoji,Zhang Yajun,et al.A new algorithm of data distribution management for distributed interactive simulation[C]//Proc.of the 5th Intelligent Control and Automation.Hangzhou,China,2004.
  • 3Ondi A,Menezes R,Ford R.Network Distribution of Security Policies via Ant-like Foraging Behavior[C]//Proc.of the 2th International Conference on Interent and Web Applications and Services.Morne,Mauritius,2007.
  • 4Tang Chenghua,Yao Shuping,Cui Zhongjie,et al.A Network Security Policy Model and Its Realization Mechanism[C]//Proc.of Information Security and Cryptology.Beijing,China,LNCS 4318,2006.
  • 5Adnan M,Alhajj R,Barker K.Performance analysis of incremental update of association rules mining approaches[M].Intelligent Engineering Systems.Mediterranean Sea,2005.
  • 6朱玉全,孙志挥,季小俊.基于频繁模式树的关联规则增量式更新算法[J].计算机学报,2003,26(1):91-96. 被引量:80
  • 7Lin Ming-Yen,Lee Suh-Yin.Incremental update on sequential patterns in large databases by implicit merging and efficient counting[,J].Information Systems,2004,29 (5):385-404.
  • 8易彤,徐宝文,吴方君.一种基于FP树的挖掘关联规则的增量更新算法[J].计算机学报,2004,27(5):703-710. 被引量:32
  • 9Seong-Ryong K,Loguinov D.Modeling Best-Effort and FEC Streaming of Scalable Video in Lossy Network Channels[J].IEEE/ACM Transactions,2007,15 (1):187-200.
  • 10Law K L E,Saxena A.Scalable Design of a Policy-Based Management System and its Performance[,J].IEEE Communications,2003,41(6):72-79.

二级参考文献31

  • 1[1]Agrawal R, Imielinski T, Swami A. Mining association rules between sets of items in large databases. In: Proceedings of ACM SIGMOD International Conference on Management of Date, Washington DC, 1993.207~216
  • 2[2]Agrawal R, Srikant R. Fast algorithm for mining association rules. In: Proceedings of the 20th International Conference on VLDB, Santiago, Chile, 1994. 487~499
  • 3[3]Han J, Kamber M. Data Mining: Concepts and Techniques. Beijing: Higher Education Press, 2001
  • 4[5]Agrawal R, Shafer J C. Parallel mining of association rules:Design, implementation, and experience. IBM Research Report RJ 10004,1996
  • 5[6]Savasere A, Omiecinski E, Navathe S. An efficient algorithm for mining association rules. In: Proceedings of the 21th International Conference on VLDB, Zurich, Switzerland, 1995. 432~444
  • 6[7]Hah J, Jian P et al. Mining frequent patterns without candidate generation. In: Proceedings of ACM SIGMOD International Conference on Management of Data, Dallas, TX, 2000.1~12
  • 7[8]Cheung D W, Lee S D, Kao B. A general incremental technique for maintaining discovered association rules. In: Proceedings of databases systems for advanced applications, Melbourne, Australia, 1997. 185~194
  • 8[10]Han J, Jian P. Mining access patterns efficiently from web logs. In: Proceedings of Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD'00), Kyoto, Japan,2000. 396~407
  • 9[11]Agrawal R, Srikant R. Mining sequential pattern. In: Proceedings of the 11th International Conference on Data Engineering, Taipei, 1995. 3~14
  • 10Ramaswamy S. et al.. On the discovery of interesting patterns in association rules. In: Proceedings of the 24th International Conference on Very Large Data Bases (VLDB), New York, 1998, 368~379

共引文献105

同被引文献16

引证文献3

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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