The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Most of previous research on survivable networks has been focused on protecting the unicast traffic against random failures. In this paper we propose a new approach, called RA (resistant-to-attack), to provide protection of anycast and unicast communications against attacks on irregular (e.g. scale-free) networks. We use the single backup path approach to provide protection against a single node failure...
Most of previous research on survivable networks has been related to unicast communications. In this paper we propose a new approach to network survivability of anycast communications. To the best of our knowledge, anycast defined as one-to-one-of-many technique has not received much attention recently. To provide network survivability, we use the single backup path approach, i.e. each demand has...
In this paper we evaluate the influence of the network topological characteristics on the extent of losses after attacks. For that purpose, we use the ATRF (attack-to-random failure) multiplier. Modeling results show that when using a standard metrics of distance in path computations, the number of connections broken due to attacks on irregular networks is significantly greater, compared to random...
In this paper we investigate the issue of preplanned end-to-end protection against multiple failures. In recent communications networks, such protection is provided by finding a set of k-disjoint paths for each demand. In particular, we analyze here the problem of calculating the set of k-disjoint paths of a demand in multi-cost networks, where each network arc an may be assigned k different costs...
In this paper we propose a class-based protection algorithm providing fast service recovery in WDM networks in case of a simultaneous failure of two network elements. We focus on providing various levels of service survivability in order to correspond to differentiated requirements of end-users. We show that assuring the service survivability in case of a double failure requires up to 40% more total...
The powerpoint presentation discussed the issue of backup lightpath capacity sharing in optical WDM networks with limited wavelength conversion capability, the problem of the introduced a posteriori backup path sharing approach, the ILP model and the efficient heuristic algorithm, and the advantage of CPLEX modeling over FSR-SP-LWC algorithm that would achieved up to 50% values of recovery time compared...
In this paper we propose the class-based protection algorithm providing fast service recovery in optical networks using the new concept of fast protection cycles (f-cycles). We focus on service restoration time values and we show, that it is possible to decrease them, by reducing the size of active path protected area. We prove that it is also possible to reduce the ratio of link capacity utilization...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.