Article Preview
Top1. Introduction
Business portals (Dias, 2001; Collins, 2001) are the main concern of today’s fast growing online business for almost all the sectors. These business portals are sometime suffer from the congestion due to their heavy access by the customers. To solve such a problem alternate portals are to be provided by the concern business organization/company i.e. www.irctc.com which is already hacked and prone to malicious attack by some means (Anti-Phishing Working Group, 2004; Drake, Oliver, & Koontz, 2004) of attackers as shown in Figure 1.
Figure 1. Intentionally diversion of original traffic by flooding towards the alternate site
Such types of situation occur when an organization is not able to handle its business transaction on a single business portal. In this condition they create different other alternate business portals and hence it leads to the above mentioned situation. To detect the maximum possibility of a portal to be malicious attack prone is the main assignment of this manuscript which is handled by using graph theory (Wang & Daniels, 2008; Harju, 2007). At first the interconnected business portals are represented in the form of a graph and its corresponding adjacency matrix. Later the Centrality and eigenvectors has been calculated to find the degree of a business portal to propagate the malicious information. Computation of the degree of a business portal to propagate the malicious information helps to cure the business portal by taking available security measures to avoid the further infection.
TopLet there are k business portals and at an instance t N customers are ready to use for their transactions as shown in following Figure 2. x1, x2, …, xk are the corresponding fractions which opts business portal-1, business portal-2, …, business portal-k correspondingly. Hence x1 + x2 + … + xk = N.
Figure 2. N customers ready for transaction at k alternate sites