Reliable anycast and unicast routing: protection against attacks

Abstract

Recent communication networks are commonly protected against random failures, i.e. being the results of forces of nature, human errors, or hardware faults. In simulation experiments, network topologies are often assumed to be more or less regular. Known mechanisms typically refer to the case of unicast traffic protection. However, owing to the observed convergence of technologies/services, the importance of other transmission techniques (e.g. anycast, or multicast) has been increasing. Moreover, it turns out that neither failures of network elements are only the results of random faults, nor topologies of real networks are purely regular.In this paper we introduce a novel technique, called RA (the abbreviation for "resistant-to-attacks") of protecting the anycast and unicast flows against attacks on irregular networks. In particular, we propose a new metric of link costs to be used in working path computations with the objective to avoid traversing the nodes of high degree (i.e. vulnerable to attacks). The extent of losses after attacks is further decreased by locating the anycast replica servers at low-degree nodes.The ILP model for joint optimization of anycast and unicast flows has been formulated and followed by the time-efficient heuristic algorithm. Path protection scheme for the case of protection against a single node failure is assumed. For each anycast demand, working and backup Simulation results confirm that our approach provides a remarkable decrease (up to 7.47 times) in terms of the total number of connections broken due to attacks, compared to the results for the common case of locating the replica servers at high-degree nodes, and utilizing the metric of distance to find both working and backup paths.

A new approach to design of weather disruption-tolerant wireless mesh networks

“…In the considered example, the updated topology from Fig. 3c does not include links located within heavy rain storm areas (e.g., links (3,4), (10,11), (14,15), and (15, 16)).…”

“…They were originally proposed for wired networks, and typically utilize the idea of backup (alternate) paths [10] forwarding the traffic after failures of links/nodes affecting the respective primary paths of transmission. In general, in order to provide protection against failures of links/nodes, every alternate path should be link-(node-)disjoint with the respective primary path [11,12].…”

Modeling and optimization of maximum flow survivable overlay multicast with predefined routing trees

“…[8,33,34,42]) we are rather interested in pure overlays and multicast communication. Nevertheless, most of previous research on survivable overlay multicasting concentrates on the issues related to either special coding or providing many disjoint parents for each receiver.…”

“…After removing random flows from multicast trees, T * requires updating which is performed in lines 28-33. In the next loop (34)(35)(36)(37)(38)(39)(40)(41)(42)(43)(44)(45)(46)(47)(48)(49), new flows are assigned to the neighbor solution. Basically, it is performed as same as Random Search works, however consecutive trees selected from set T * are subject to having a maximum value of remaining throughput r max t (line 35).…”

Future research directions in design of reliable communication systems

“…Also, apart from failures that are random by nature, there is a large group of accidents being result of malicious human activities, referred to as attacks. The respective proposals of resistantto-attack routing approaches can be found e.g., in [1,117].…”