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.
Fast recovery from failures and efficient allocation of link capacities in a network for guaranteeing seamless communication services are two primary goals of network survivability design. Shared backup path protection (SBPP) technique has been shown to be a promising solution to tackle these problems, due to sharing capacity among protection paths. The level of capacity sharing that can be achieved...
In network survivability design, it is important to be able to differentiate network topologies by means of a quantitative measure that would indicate different levels of robustness of these topologies to failures of their nodes and links. Ideally, such a measure should be sensitive to the existence of nodes or links which are more critical than others, for example, if their failures can disconnect...
In studies of survivable networks, it is important to be able to differentiate network topologies by means of a robust numerical measure that indicates the levels of immunity of these topologies to failures of their nodes and links. Ideally, such a measure should be sensitive to the existence of nodes or links which are more important than others, for example, if their failures cause the network's...
Fast recovery from failures and overall high utilization of network capacity are two primary goals of network survivability design. Shared backup path protection (SBPP) has been shown to be efficient in terms of capacity utilization, due to the sharing capability among protection paths. The amount of bandwidth sharing that can be achieved depends on how detailed is the bandwidth usage information...
In this paper, instead of using the average nodal degree metric, we suggest to use the Fiedler value metric, adopted from the spectral graph theory, namely the 2nd smallest eigenvalue of the Laplacian matrix of a given network topology, to quantify network connectivity in studies of spare capacity allocation problem. Ideally, such a robustness measure should be sensitive to the existence of nodes...
Fast recovery from failures and overall high utilization of network capacity are two primary goals of network survivability design. Shared backup path protection has been shown to be efficient in terms of capacity utilization, due to the sharing capability among protection paths. However, the resulting integer linear programming (ILP) formulation of the problem is known to be NP-hard. This paper tackles...
This paper proposes a novel framework to solve the survivable routing problem with shared path protection in a distributed control environment. The work mainly concerns how to dynamically determine a protection cycle (i.e., two link-disjoint paths between a source-destination node pair) and allocate spare capacity for a connection establishment request so as to minimize total bandwidth consumption...
The authors review briefly the procedure relating to the convergence analysis of a learning algorithm for adaptive feature extraction. They then address the issue of identification of a nontrivial domain of attraction for the learning system. The problem is important because such an identification is not only powerful for choosing initial settings of the system, but also holds one of the keys to the...
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.