(IJCSIS) International Journal of Computer Science and Information Security,Vol. 8, No. 7, October 2010
II.
B
ACKGROUND
This section demonstrates the computer networksresilience and social network analysis concepts.
A.
Computer Networks Resilience
As a matter of fact, everything in our life relies oncommunications and computer networks represent a large portion of it. Currently our computer networks are notresilient or secure enough to face the strategic vulnerabilitiesof the nation [5]. Generally, the computers, servers, etcwhich are connected to the network are attacked for severalreasons. However, using certain techniques such as usingvirtual privet network (VPN), encryption, firewalls, and other techniques can eliminate many of those attacks. Yet hackers,natural disasters can target other network elements such arerouters, in many cases hackers amid to shutdown routers todevelop discontinuity holes or developing maliciousactivities affect network performance and security [6].A major step in building resilient network is identifyingthe critical elements which would need extra attention andsecure them using the appropriate techniques. Network managers, designer and planners tend to use redundancy toavoid network failures. The following figure (Fig. 2)illustrates how redundancy can enhance network resilience.
Figure 2. Network Example
As Fig. 2 shows, there are six nodes connected throughseven links. At any time one of the links or the nodes can bedown, the best way to ensure resilience is to redundant all theserver and create a full connect network (Mesh).Unfortunately, that would be a very expensive solution notmany can afford. The second approach is to determine themost important critical elements which need to be redundantand develop policies and algorithms for speedy activation for the backup devices.
B.
Social Network Analysis
Social network analysis is an emerging set of techniquesand schemes for data analysis, many researchers andscientists introduced several definitions based on their domain of interest. For example
Hannemann
proposed: “
Asocial network is a set of actors that may have relationshipswith one another. Networks can have few or many actors(nodes), and one or more kinds of relations (edges) between pairs of actors.
” [7]The major deviation for social network analysis over theother traditional approaches is its focus is to analyzeinformation based on the relation between data entities.Social network can be represented as matrices or graphs; the plus of using graph is the ability to represent different typesof relations between the nods. One of the important conceptsof social networks analysis is the hierarchical analysis, asthe analysis can be proceed on different levels: Node,Dyadic, Triadic, Subset, and Network level [8]. However,the focus of the majority of research work is narrowed to thenode and network level.At network level, network density can be obtained bydividing the number of relations by the number all possiblerelations, the result various between 0 and 1and the higher ratio the denser network [8]. Another level would be thenode level where it more concern about how important is thenode? How popular is the node? Is it a central node?Within the context of social networks the term power/centrality refers to the impact of this node on othersnods, and what would be the consequence in case of removing this node. Social network analysis offers threemeasurements for centrality: Degree centrality, Closenesscentrality and Betweenness centrality [9] [10]
.
Degree Centrality
: the degree centrality of a node A (DC
a
)is number of connections/relations the node has. Thenode/actor with higher number of relations or ties maintainsa higher traffic (in/out).
n jiji
a N DC
1
)(
Where:
DC (N
i
): Degree Centrality of node N
i
,
A
:
an adjacent matrix of relations network,
n:
number of nodes.
Centrality closeness
:
indicates how a node N
i
close to theother nodes, depending on the application closeness wouldhave different ways to be calculated. In computer networksscenario, our target will be physical distance.
n j jii
N N d N CC
1
),(/1)(
Where:
CC (N
i
): Closeness of N
i
,
d(N
i
, N
j
)
:
absolute distance between node N
i
and node N
j
,
n:
number of nodes.
Centrality Betweenness
: it measure characterizes of nodesas having a powerful positional i.e. a node is frequentlyshown in communication paths between any other nodes.
k jk jik ji
P N P N CB
,,,
)()(
Where:
CB (N
i
): Betweeness of N
i
,
P
j,k
(N
i
)
:
shortest path between N
j
, N
k
and has N
i
on it
P
j,k
: shortest path between N
j
, N
k
The following section will illustrate the network resilience problem and the proposed approach to enhance it.
209http://sites.google.com/site/ijcsis/ISSN 1947-5500