中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Title:
Resistance and Security Index of Networks: Structural Information Perspective of Network Security
Author: Li, AS ; Hu, QF ; Liu, J ; Pan, YP
Source: SCIENTIFIC REPORTS
Issued Date: 2016
Volume: 6
Indexed Type: SCI
Department: Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing, Peoples R China. Univ Chinese Acad Sci, Beijing, Peoples R China.
Abstract: Recently, Li and Pan defined the metric of the K-dimensional structure entropy of a structured noisy dataset G to be the information that controls the formation of the K-dimensional structure T of G that is evolved by the rules, order and laws of G, excluding the random variations that occur in G. Here, we propose the notion of resistance of networks based on the one-and two-dimensional structural information of graphs. Given a graph G, we define the resistance of G, written. (G), as the greatest overall number of bits required to determine the code of the module that is accessible via random walks with stationary distribution in G, from which the random walks cannot escape. We show that the resistance of networks follows the resistance law of networks, that is, for a network G, the resistance of G is R(G)= H-1(G) - H-2(G), where H-1(G) and H-2(G) are the one-and two-dimensional structure entropies of G, respectively. Based on the resistance law, we define the security index of a network G to be the normalised resistance of G, that is, rho(G)= 1 - H-2(G)/H-1(G). We show that the resistance and security index are both well-defined measures for the security of the networks.
English Abstract: Recently, Li and Pan defined the metric of the K-dimensional structure entropy of a structured noisy dataset G to be the information that controls the formation of the K-dimensional structure T of G that is evolved by the rules, order and laws of G, excluding the random variations that occur in G. Here, we propose the notion of resistance of networks based on the one-and two-dimensional structural information of graphs. Given a graph G, we define the resistance of G, written. (G), as the greatest overall number of bits required to determine the code of the module that is accessible via random walks with stationary distribution in G, from which the random walks cannot escape. We show that the resistance of networks follows the resistance law of networks, that is, for a network G, the resistance of G is R(G)= H-1(G) - H-2(G), where H-1(G) and H-2(G) are the one-and two-dimensional structure entropies of G, respectively. Based on the resistance law, we define the security index of a network G to be the normalised resistance of G, that is, rho(G)= 1 - H-2(G)/H-1(G). We show that the resistance and security index are both well-defined measures for the security of the networks.
Language: 英语
WOS ID: WOS:000376984700001
Citation statistics:
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/17324
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:
File Name/ File Size Content Type Version Access License
srep26810.pdf(2338KB)----限制开放 联系获取全文

Recommended Citation:
Li, AS,Hu, QF,Liu, J,et al. Resistance and Security Index of Networks: Structural Information Perspective of Network Security[J]. SCIENTIFIC REPORTS,2016-01-01,6.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Li, AS]'s Articles
[Hu, QF]'s Articles
[Liu, J]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Li, AS]‘s Articles
[Hu, QF]‘s Articles
[Liu, J]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace