End-to-end service survivability under attacks on networks

• Autorzy: Molisz W. , Rak J.
• Języki publikacji: EN

Abstrakty

EN

Network survivability is a capability of a networked system to provide its services despite failures or attacks. Attacks, e.g., due to acts of war, being potentially damaging events, were basically considered in the historical definitions of a survivability phenomenon. The meaning of the term: "network survivability" evolved in the last decade. Recently, attacks replayed the important role again. Their nature, however, including intrusions, probes, denials of service, differs from the old one. Survivability is strongly related to other fields of study. In particular, quality of service depends on network survivability. We investigate these dependencies in scale-free networks. Many networks are scale-free, i.e., their node degree distribution follows the power law. Nodes of the highest degrees, called centers, are highly vulnerable to attacks. Elimination of these nodes seriously degrades the overall performance of network services. In this paper we propose a model, which, based on traffic parameters of a demand, like delay or bit rate, allows to establish the survivable and attack proof end-to-end connections. The key idea of this model is that for the significant traffic, it establishes paths, which omit centers. The important connections become more resistant to attacks. We show that in the best case, obtained for the highest class of service, the number of broken connections is reduced even by factor 3. Example results are compared to those for the standard distance metrics. Our model is applicable to many network architectures and many classes of service.

Słowa kluczowe

EN

survivable data networks; attacks on networks; scale-free networks; routing; resource allocation

• Wydawca: Instytut Łączności - Państwowy Instytut Badawczy
• Czasopismo: Journal of Telecommunications and Information Technology
• Rocznik: 2006
• Tom: nr 3
• Strony: 19--26
• Opis fizyczny: Bibliogr.12 poz., rys., tab.

Twórcy

autor

Molisz W.

autor

Rak J.

• Faculty of Electronics, Telecommunications and Informatics, Gdańsk University of Technology, Narutowicza st 11/12, 80-952 Gdańsk, Poland,

Bibliografia

• [1] R. Albert and A.-L. Barabasi, “Statistical mechanics of complex networks”, Rev. Mod. Phys., vol. 74, pp. 47–97, 2002.
• [2] A. Barabasi and R. Albert, “Emergence of scaling in random networks”, Science, vol. 286, pp. 509–511, 1999.
• [3] R. Bhandari, Survivable Networks – Algorithms for Diverse Routing. Boston [etc.]: Kluwer, 1999.
• [4] Q. Chen and D. R. Shi, “The modeling of scale-free networks”, Phys. A, vol. 335, Elsev. Sci. B, pp. 240–248, 2003.
• [5] T. Gierszewski and J. Rak, “Scale-free networks”, Scientific Report, Gdańsk University of Technology, 2004.
• [6] K.-I. Goh, E. Oh, B. Khang, and D. Kim, “Classification of scale-free networks”, Proc. Natl. Acad. Sci., vol. 99, pp. 12 583–12 588, 2002.
• [7] R. Kawamura, “Architectures for ATM network survivability”, IEEE Commun. Surv. Fourth Quart., vol. 1, no. 1, 1998.
• [8] Z. Liu, Y-Ch. Lai, N. Ye, and P. Dasgupta, “Connectivity distribution and attack tolerance of general networks with both preferential and random attachments”, Phys. A, vol. 303, Elsev. Sci. B., pp. 337–344, 2002.
• [9] M. Pioro and D. Medhi, Routing, Flow and Capacity Design in Communication and Computer Networks. Amsterdam [etc.]: Morgan Kaufmann, 2004.
• [10] S. Ramamurthy and B. Mukherjee, “Survivable WDM mesh networks”, Part I – “Protection”, in Proc. IEEE INFOCOM, New York, USA, 1999, pp. 744–751.
• [11] S. Ramamurthy and B. Mukherjee, “Survivable WDM mesh networks”, Part II – “Restoration”, in Proc. IEEE Integr. Circ. Conf. ICC, Vancouver, Canada, 1999, pp. 2023–2030.
• [12] J. W. Suurballe, “Disjoint paths in a network”, Networks, vol. 4, pp. 125–145, 1974.