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.
Let G = (V,E) be a simple graph with |V| = n nodes and |E| = m links, a subset K ⊆ V of terminals, a vector p = (p1, …, pm) ∈ [0, 1]m and a positive integer d, called diameter. We assume nodes are perfect but links fail stochastically and independently, with probabilities qi = 1 − pi. The diameter-constrained reliability (DCR for short), is the probability that the terminals of the resulting subgraph...
Virtual data center (VDC) embedding along with designing for fault tolerance is a key problem that needs to be addressed while designing a data center. In this work we propose a new reliability-aware VDC embedding algorithm RAVDC that embeds VDC onto the physical servers while guaranteeing the reliability requirement of the VDC. The basic idea of this algorithm is to restrict the number of VMs which...
The wireless access to any service in different contexts is nowadays taken for granted. However, the dependability requirements are different for various services and contexts. Critical services put high requirement on the service reliability, i.e., the probability of no service interruption should be close to one. Dual homing may be used to increase the service reliability in a multi technology,...
Improving resilience against failures and targeted attacks is an important aspect of network design. The resilience and cost of networks are two opposing objectives in which a designer should consider when building networks. We develop a heuristic algorithm that balances the centrality of networks by adding a set of links that minimizes the variance of graph centrality measures in a least costly fashion...
Communication networks are prone to failures due to targeted attacks or large-scale disasters. Networks can be improved to withstand challenges using mechanisms such as diversity, which can simply be improved by adding links, however achieving maximum resilience is not feasible due to limited budget. Therefore, algorithms that improve the diversity of networks cost-efficiently are necessary. In this...
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.