Hong TANG
ChongQing University of Posts and Telecommunications

Published : 3 Documents
Articles

Found 3 Documents
Search

A NEW GRAPH TO REPRESENT COMPLEX PLAN RESOLUTION DOMAIN LIU, Ping; YU, HaiFeng; XU, BoYi; LI, Jin; JIN, Qi; TANG, Hong
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 1: January 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Taking the botnet incident response plan decision-making as an example, we construct a new graph model to represent complex plan resolution domain by using action decomposition. In this model we introduced action layer, relation between subactions and decompose the complex incident response plan into many layers. This graphic model provides a powerful representing framework on the complex plan domain. By analyzing the decomposing method and the action node structure, we prove that the store space size of this graphic representation is not increased exponentially when the action node added. We present a quantitatively analyzing algorithm on the plan resolution domain. DOI: http://dx.doi.org/10.11591/telkomnika.v11i1.1869
NETWORK INVULNERABILITY ASSESSMENT TECHNOLOGY BASED ON THE ENI Liu, Yuanni; Tang, Hong; Zhao, Guofeng; Xiao, Yunpeng; Xu, Chuan
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 9: September 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

In this paper, we have proposed a network invulnerability assessment technique based on the entropy of node importance (ENI) determined by the node betweenness combined with node degree, which can measure the network invulnerability dynamically. Simulation results show that the ENI network entropy can accurately change its values as the network nodes removed deliberately or randomly from the network, and ENI can estimate the network invulnerability accurately, as well as can reflect the damage degree of the network according to network entropy. DOI: http://dx.doi.org/10.11591/telkomnika.v11i9.2966
EFFICIENCY ANALYSIS OF SCALE-FREE NETWORK CASCADING FAILURES UNDER DIFFERENT TYPES OF ATTACKS Liu, Yuanni; Tang, Hong; Zhao, Guofeng; Xiao, Yunpeng; Xu, Chuan
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 10: October 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Cascading failures are common in most of the networks, which can result in a congestion regime with degradation in the network performance. In order to investigate how a small shock can trigger avalanches mechanisms affecting a considerable fraction of the network, lots of failure models have been constructed. In this paper, Based on our AHP network cascading model, we have estimated how the efficiency will be affected when coefficients of K, S, T changed, we  find the fact  that the network efficiency of BA network is determined by its attacked types, and  the efficiency  is largely influenced by the attacked types of K and S, and under the same number of failure node, the efficiency under attacks of types T and I are relatively higher than that of the efficiency under attacks of types S and K , and the importance I is largely determined by the proportion of T, when the node failure number is equal, the higher proportion of T, the  higher efficiency it is  under I type attacks. We also tabled some proposals for reducing the damage that the networks suffered from the cascading failures. DOI: http://dx.doi.org/10.11591/telkomnika.v11i10.2968